Conferences in DBLP
Lars Arge External Geometric Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Jeong Han Kim The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Kokichi Sugihara Robust Geometric Computation Based on Digital Topology. [Citation Graph (0, 0)][DBLP ] Conf ] Kensuke Onishi Adjacency of Optimal Regions for Huffman Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Philipp Woelfel A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs. [Citation Graph (0, 0)][DBLP ] Conf ] Meena Mahajan , Raghavan Rama , S. Vijayakumar Towards Constructing Optimal Strip Move Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Hanno Lefmann Large Triangles in the d-Dimensional Unit-Cube. [Citation Graph (0, 0)][DBLP ] Conf ] Francis Y. L. Chin , Jianbo Qian , Cao An Wang Progress on Maximum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Udo Adamy , Michael Hoffmann , József Solymosi , Milos Stojakovic Coloring Octrees. [Citation Graph (0, 0)][DBLP ] Conf ] Malgorzata Moczurad , Wlodzimierz Moczurad Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Ferdinando Cicalese , Christian Deppe , Daniele Mundici Q-Ary Ulam-Rényi Game with Weighted Constrained Lies. [Citation Graph (0, 0)][DBLP ] Conf ] Koichi Koizumi , Takaaki Mizuki , Takao Nishizeki Necessary and Sufficient Numbers of Cards for the Transformation Protocol. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Lim , Fan Wang , Zhou Xu On the Selection and Assignment with Minimum Quantity Commitments. [Citation Graph (0, 0)][DBLP ] Conf ] Ying Du , Danny Z. Chen , Xiaodong Wu Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Lim , Zhaowei Miao , Brian Rodrigues , Zhou Xu Transshipment Through Crossdocks with Inventory and Time Windows. [Citation Graph (0, 0)][DBLP ] Conf ] Tomokazu Imamura , Kazuo Iwama , Tatsuie Tsukiji Approximated Vertex Cover for Graphs with Perfect Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Yong Zhang , Hong Zhu An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] L. Sunil Chandran , N. S. Narayanaswamy On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Etsuji Tomita , Akira Tanaka , Haruhisa Takahashi The Worst-Case Time Complexity for Generating All Maximal Cliques. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaminski , Tony Tan Regular Expressions for Languages over Infinite Alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] Masaki Nakanishi On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations. [Citation Graph (0, 0)][DBLP ] Conf ] N. V. Vinodchandran Learning DNFs and Circuits Using Teaching Assistants. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Ratsaby On the Complexity of Samples for Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation. [Citation Graph (0, 0)][DBLP ] Conf ] Fabien Baille , Evripidis Bampis , Christian Laforest Maximization of the Size and the Weight of Schedules of Degradable Intervals. [Citation Graph (0, 0)][DBLP ] Conf ] Shuguang Li , Guojun Li , Shaoqiang Zhang Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Jinhee Chun , Naoki Katoh , Takeshi Tokuyama Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuya Akutsu Algorithms for Point Set Matching with k-Differences. [Citation Graph (0, 0)][DBLP ] Conf ] Hee-Kap Ahn , Peter Braß , Otfried Cheong , Hyeon-Suk Na , Chan-Su Shin , Antoine Vigneron Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir G. Deineko , Michael Hoffmann , Yoshio Okamoto , Gerhard J. Woeginger The Traveling Salesman Problem with Few Inner Points. [Citation Graph (0, 0)][DBLP ] Conf ] Tadao Takaoka A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application. [Citation Graph (0, 0)][DBLP ] Conf ] Giorgio Ausiello , Marc Demange , Luigi Laura , Vangelis Th. Paschos Algorithms for the On-Line Quota Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kumiko Nomura , Satoshi Tayu , Shuichi Ueno On the Orthogonal Drawing of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuyuki Miura , Machiko Azuma , Takao Nishizeki Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Zhi-Zhong Chen New Bounds on the Number of Edges in a k-Map Graph. [Citation Graph (0, 0)][DBLP ] Conf ] N. S. Narayanaswamy Dynamic Storage Allocation and On-Line Colouring Interval Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Shuai Cheng Li , Hon Wai Leong , Steven K. Quek New Approximation Algorithms for Some Dynamic Storage Allocation Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Lim , Brian Rodrigues , Fan Wang , Zhou Xu k-Center Problems with Minimum Coverage. [Citation Graph (0, 0)][DBLP ] Conf ] Xizhong Zheng , Robert Rettinger On the Extensions of Solovay-Reducibility.. [Citation Graph (0, 0)][DBLP ] Conf ] Gustav Nordh , Peter Jonsson The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. [Citation Graph (0, 0)][DBLP ] Conf ] Narayan Vikas Computational Complexity Classification of Partition under Compaction and Retraction. [Citation Graph (0, 0)][DBLP ] Conf ] Jung-Heum Park One-to-Many Disjoint Path Covers in a Graph with Faulty Elements. [Citation Graph (0, 0)][DBLP ] Conf ] Toshinori Yamada Fault-Tolerant Meshes with Constant Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Kyoung-Wook Park , Hyeong-Seok Lim , Jung-Heum Park , Hee-Chul Kim Fault Hamiltonicity of Meshes with Two Wraparound Edges. [Citation Graph (0, 0)][DBLP ] Conf ] Toshio Nakata On the Expected Time for Herman's Probabilistic Self-stabilizing Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Ho-fung Leung , Zeshan Peng , Hing-Fung Ting An Efficient Online Algorithm for Square Detection. [Citation Graph (0, 0)][DBLP ] Conf ] Jin Wook Kim , Kunsoo Park An Efficient Local Alignment Algorithm for Masked Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuie Tsukiji , Zhi-Zhong Chen Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Jesper Jansson , Wing-Kin Sung Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. [Citation Graph (0, 0)][DBLP ] Conf ] 