Conferences in DBLP
Bernard Chazelle The Discrepancy Method. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Tamassia Implementing Algorithms and Data Structures: An Educational and Research Perspective. [Citation Graph (0, 0)][DBLP ] Conf ] Evanthia Papadopoulou Linfinity Voronoi Diagrams and Applications to VLSI Layout and Manufacturing. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Marc J. van Kreveld , René van Oostrum , Kasturi R. Varadarajan Facility Location on Terrains. [Citation Graph (0, 0)][DBLP ] Conf ] Joonsoo Choi , Chan-Su Shin , Sung Kwon Kim Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroki Arimura , Shinichi Shimozono Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Eiter , Toshihide Ibaraki , Kazuhisa Makino Disjunctions of Horn Theories and Their Cores. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Di Crescenzo , Kouichi Sakurai , Moti Yung Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Mutzel , René Weiskircher Two-Layer Planarization in Graph Drawing. [Citation Graph (0, 0)][DBLP ] Conf ] Walter Didimo , Giuseppe Liotta Computing Orthogonal Drawings in a Variable Embedding Setting. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes , Dorothea Wagner Dynamic Grid Embedding with Few Bends and Changes. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Schulz Two New Families of List Update Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Rethmann , Egon Wanke An Optimal Algorithm for On-Line Palletizing at Delivery Industry. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Bischof , Ernst W. Mayr On-Line Scheduling of Parallel Jobs with Runtime Restrictions. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Pat Morin Testing the Quality of Manufactured Disks and Cylinders. [Citation Graph (0, 0)][DBLP ] Conf ] Hee-Kap Ahn , Siu-Wing Cheng , Otfried Cheong Casting with Skewed Ejection Direction. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Hiro Ito , Souichi Kimura , Shigeaki Shimazu Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. [Citation Graph (0, 0)][DBLP ] Conf ] Toshimasa Ishii , Hiroshi Nagamochi , Toshihide Ibaraki K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Nagamochi , Toshihide Ibaraki Polyhedral Structure of Submodular and Posi-modular Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Erlebach , Klaus Jansen Maximizing the Number of Connections in Optical Tree Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Tak Wah Lam , Hing-Fung Ting Selecting the k Largest Elements with Parity Tests. [Citation Graph (0, 0)][DBLP ] Conf ] Amalia Duch , Vladimir Estivill-Castro , Conrado Martínez Randomized K-Dimensional Binary Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Koji Nakano , Stephan Olariu Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Goerdt Random Regular Graphs with Edge Faults: Expansion through Cores. [Citation Graph (0, 0)][DBLP ] Conf ] Takashi Mihara , Shao Chin Sung A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Nock , Pascal Jappy , Jean Sallantin Generalized Graph Colorability and Compressibility of Boolean Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus-Jörn Lange , Pierre McKenzie On the Complexity of Free Monoid Morphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Sun-Yuan Hsieh , Chin-Wen Ho , Tsan-sheng Hsu , Ming-Tat Ko , Gen-Huey Chen Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Yaw-Ling Lin Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Seok-Hee Hong , Peter Eades , Sang Ho Lee Finding Planar Geometric Automorphisms in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Takeaki Uno A New Approach for Speeding Up Enumeration Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Jung-Heum Park Hamiltonian Decomposition of Recursive Circulants. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Convertibility among Grid Filling Curves. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Franz Aurenhammer , Christian Icking , Rolf Klein , Elmar Langetepe , Günter Rote Generalized Self-Approaching Curves. [Citation Graph (0, 0)][DBLP ] Conf ] Guo-Hui Lin , Guoliang Xue The Steiner Tree Problem in Lambda4 -geometry Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuya Akutsu Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows , Michael T. Hallett , Ulrike Stege On the Multiple Gene Duplication Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Leonidas J. Guibas , Marek Teichmann , Li Zhang Visibility Queries in Simple Polygons and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Kam-Hing Lee Quadtree Decomposition, Steiner Triangulation, and Ray Shooting. [Citation Graph (0, 0)][DBLP ] Conf ] Akira Tajima Optimality and Integer Programming Formulations of Triangulations in General Dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Hsueh-I Lu Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Shin-ya Hamaguchi , Naoki Katoh A Capacitated Vehicle Routing Problem on a Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Bang Ye Wu , Kun-Mao Chao , Chuan Yi Tang Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Zhou , Takao Nishizeki The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Eidenbenz Inapproximability Results for Guarding Polygons without Holes. [Citation Graph (0, 0)][DBLP ] Conf ] Liming Cai , David W. Juedes , Iyad A. Kanj The Inapproximability of Non NP-hard Optimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Nagamochi , Toru Hasunuma An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. [Citation Graph (0, 0)][DBLP ] Conf ] Josep Díaz , Jordi Petit , Panagiotis Psycharis , Maria J. Serna A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Plunkett , Alan Fekete Optimal Approximate Agreement with Omission Faults. [Citation Graph (0, 0)][DBLP ] Conf ] 