Conferences in DBLP
Monika Rauch Henzinger Web Information Retrieval - an Algorithmic Perspective. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Lengauer Computational Biology - Algorithms and More. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Eyal Flato , Dan Halperin Polygon Decomposition for Efficient Construction of Minkowski Sums. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Ageev , Maxim Sviridenko An Approximation Algorithm for Hypergraph Max k -Cut with Given Sizes of Parts. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Ambühl Offline List Update is NP-Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Ambühl , Samarjit Chakraborty , Bernd Gärtner Computing Largest Common Point Sets under Approximate Congruence. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Kamesh Munagala Online Algorithms for Caching Multimedia Streams. [Citation Graph (0, 0)][DBLP ] Conf ] Lali Barrière , Pierre Fraigniaud , Cyril Gavoille , Bernard Mans , John Michael Robson On Recognizing Cayley Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] András A. Benczúr , Ottilia Fülöp Fast Algorithms for Even/Odd Minimum Cuts and Generalizations. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei Bespamyatnikh , Binay K. Bhattacharya , J. Mark Keil , David G. Kirkpatrick , Michael Segal Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Brass Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Michael T. Goodrich , Jeffery Westbrook Range Searching Over Tree Cross Products. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Carr , Toshihiro Fujito , Goran Konjevod , Ojas Parekh A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea E. F. Clementi , Afonso Ferreira , Paolo Penna , Stephane Perennes , Riccardo Silvestri The Minimum Range Assignment Problem on Linear Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Christian Sohler , Martin Ziegler Property Testing in Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Joachim Gudmundsson , Mikael Hammar , Mark H. Overmars On R-trees with Low Stabbing Number. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Dickerson , Christian A. Duncan , Michael T. Goodrich K-D Trees Are Better when Cut on the Longest Side. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Flammini , Gaia Nicosia On Multicriteria Online Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Fleischer , Michaela Wahl Online Scheduling Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Daya Ram Gaur , Toshihide Ibaraki , Ramesh Krishnamurti Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Sathish Govindarajan , Tamás Lukovszki , Anil Maheshwari , Norbert Zeh I/O-Efficient Well-Separated Pair Decomposition and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Gudmundsson , Mikael Hammar , Marc J. van Kreveld Higher Order Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Madhu Sudan On Representations of Algebraic-Geometric Codes for List Decoding. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit S. Hochbaum , Maurice Queyranne Minimizing a Convex Cost Closure Set. [Citation Graph (0, 0)][DBLP ] Conf ] Han Hoogeveen , Martin Skutella , Gerhard J. Woeginger Preemptive Scheduling with Rejection. [Citation Graph (0, 0)][DBLP ] Conf ] Tsan-sheng Hsu Simpler and Faster Vertex-Connectivity Augmentation Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , Kirk Pruhs , Mahendran Velauthapillai Scheduling Broadcasts in Wireless Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Hisashi Koga Jitter Regulation in an Internet Router with Delay Consideration. [Citation Graph (0, 0)][DBLP ] Conf ] Jae-Ha Lee , Otfried Cheong , Woo-Cheol Kwon , Sung Yong Shin , Kyung-Yong Chwa Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Mark Ziegelmann Resource Constrained Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] J. Ian Munro On the Competitiveness of Linear Search. [Citation Graph (0, 0)][DBLP ] Conf ] Enrico Nardelli , Guido Proietti , Peter Widmayer Maintaining a Minimum Spanning Tree Under Transient Node Failures. [Citation Graph (0, 0)][DBLP ] Conf ] Maurizio Pizzonia , Roberto Tamassia Minimum Depth Graph Embedding. [Citation Graph (0, 0)][DBLP ] Conf ] Zhongping Qin , Alexander Wolff , Yin-Feng Xu , Binhai Zhu New Algorithms for Two-Label Point Labeling. [Citation Graph (0, 0)][DBLP ] Conf ] Naila Rahman , Rajeev Raman Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Sanders , Roberto Solis-Oba How Helpers Hasten h -Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Konstantin Skodinis Computing Optimal Linear Layouts of Trees in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] C. R. Subramanian Coloring Sparse Random Graphs in Polynominal Average Time. [Citation Graph (0, 0)][DBLP ] Conf ] Marjan van den Akker , Han Hoogeveen , Nodari Vakhania Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. [Citation Graph (0, 0)][DBLP ] Conf ] Yunhong Zhou , Subhash Suri Collision Detection Using Bounding Boxes: Convexity Helps. [Citation Graph (0, 0)][DBLP ] Conf ] 