Conferences in DBLP
William Cook Solving Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey Computing Shapes from Point Cloud Data. [Citation Graph (0, 0)][DBLP ] Conf ] Anna R. Karlin Mechanism Design for Fun and Profit. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup On Distance Oracles and Routing in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Jie Gao , Leonidas J. Guibas Kinetic Medians and kd-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Sathish Govindarajan , S. Muthukrishnan Range Searching in Categorical Data: Colored Range Searching on Grid. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Sariel Har-Peled , Nabil H. Mustafa , Yusu Wang Near-Linear Time Approximation Algorithms for Curve Simplification. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Torben Hagerup , Rahul Ray , Micha Sharir , Michiel H. M. Smid , Emo Welzl Translating a Planar Object to Maximize Point Containment. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Cecilia Magdalena Procopiuc , Kasturi R. Varadarajan Approximation Algorithms for k-Line Center. [Citation Graph (0, 0)][DBLP ] Conf ] Dino Ahr , Gerhard Reinelt New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ernst Althaus , Alexander Bockmayr , Matthias Elf , Michael Jünger , Thomas Kasper , Kurt Mehlhorn SCIL - Symbolic Constraints in Integer Linear Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Octavian Procopiuc , Jeffrey Scott Vitter Implementing I/O-efficient Data Structures Using TPIE. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Baier , Ekkehard Köhler , Martin Skutella On the k-Splittable Flow Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Arye Barkan , Haim Kaplan Partial Alphabetic Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher L. Barrett , Keith Bisset , Riko Jacob , Goran Konjevod , Madhav V. Marathe Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Richard Cole , Erik D. Demaine , Martin Farach-Colton Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Richard Cole , Erik D. Demaine , Martin Farach-Colton , Jack Zito Two Simplified Algorithms for Maintaining Order in a List. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Erik D. Demaine , Martin Farach-Colton Efficient Tree Layout in a Multilevel Memory Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Berberich , Arno Eigenwillig , Michael Hemmer , Susan Hert , Kurt Mehlhorn , Elmar Schömer A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Joachim Gudmundsson , Matthew J. Katz , Christos Levcopoulos , Mark H. Overmars , A. Frank van der Stappen TSP with Neighborhoods of Varying Size. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Sridhar Hannenhalli , Marek Karpinski 1.375-Approximation Algorithm for Sorting by Reversals. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Hajo Broersma , Fedor V. Fomin , Artem V. Pyatkin , Gerhard J. Woeginger Radio Labeling with Pre-assigned Frequencies. [Citation Graph (0, 0)][DBLP ] Conf ] Koen M. J. De Bontridder , B. J. Lageweg , Jan Karel Lenstra , James B. Orlin , Leen Stougie Branch-and-Bound Algorithms for the Test Cover Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Joachim Gudmundsson , Michiel H. M. Smid Constructing Plane Spanners of Bounded Degree and Low Weight. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes Eager st-Ordering. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Michael T. Goodrich Three-Dimensional Layers of Maxima. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Xiaobo Hu , Shuang Luan , Xiaodong Wu , Cedric X. Yu Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Michiel H. M. Smid , Bin Xu Geometric Algorithms for Density-Based Data Clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Haim Kaplan Balanced-Replication Algorithms for Distribution Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Mayur Datar Butterflies and Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Mayur Datar , S. Muthukrishnan Estimating Rarity and Similarity over Data Stream Windows. [Citation Graph (0, 0)][DBLP ] Conf ] Annalisa De Bonis , Ugo Vaccaro Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Alejandro López-Ortiz , J. Ian Munro Frequency Estimation of Internet Packet Streams with Limited Space. [Citation Graph (0, 0)][DBLP ] Conf ] Kaustubh Deshmukh , Andrew V. Goldberg , Jason D. Hartline , Anna R. Karlin Truthful and Competitive Double Auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Anders Dessmark , Andrzej Pelc Optimal Graph Exploration without Good Maps. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Wulue Zhao Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr , Henning Schnieder Non-independent Randomized Rounding and an Application to Digital Halftoning. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Stephen G. Kobourov , Anna Lubiw Computing Homotopic Shortest Paths Efficiently. [Citation Graph (0, 0)][DBLP ] Conf ] Khaled M. Elbassioni An Algorithm for Dualization in Products of Lattices and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Angela Enosh , Klara Kedem , Joel Bernstein Determining Similarity of Conformational Polymorphs. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Rob van Stee Minimizing the Maximum Starting Time On-line. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Tamir Tassa Vector Assignment Problems: A General Framework. [Citation Graph (0, 0)][DBLP ] Conf ] Eti Ezra , Dan Halperin , Micha Sharir Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. [Citation Graph (0, 0)][DBLP ] Conf ] Torsten Fahle Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Manor Mendel , Steven S. Seiden Online Companion Caching. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Gasieniec , Aris Pagourtzis , Igor Potapov Deterministic Communication in Radio Networks with Large Labels. [Citation Graph (0, 0)][DBLP ] Conf ] Claudio Gentile , Utz-Uwe Haus , Matthias Köppe , Giovanni Rinaldi , Robert Weismantel A Primal Approach to the Stable Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Penny E. Haxell , April Rasala , Gordon T. Wilfong , Peter Winkler Wide-Sense Nonblocking WDM Cross-Connects. [Citation Graph (0, 0)][DBLP ] Conf ] Pinar Heggernes , Yngve Villanger Efficient Implementation of a Minimal Triangulation Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme. [Citation Graph (0, 0)][DBLP ] Conf ] Alexis C. Kaporis , Lefteris M. Kirousis , Efthimios G. Lalas The Probabilistic Analysis of a Greedy Satisfiability Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Menelaos I. Karavelas , Mariette Yvinec Dynamic Additively Weighted Voronoi Diagrams in 2D. [Citation Graph (0, 0)][DBLP ] Conf ] Ekkehard Köhler , Katharina Langkau , Martin Skutella Time-Expanded Graphs for Flow-Dependent Transit Times. [Citation Graph (0, 0)][DBLP ] Conf ] Stavros G. Kolliopoulos , George Steiner Partially-Ordered Knapsack and Applications to Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Elisavet Konstantinou , Yannis C. Stamatiou , Christos D. Zaroliagis A Software Library for Elliptic Curve Cryptography. [Citation Graph (0, 0)][DBLP ] Conf ] Sven Oliver Krumke , Jörg Rambau , Luis Torres Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows. [Citation Graph (0, 0)][DBLP ] Conf ] Eduardo Sany Laber , Ojas Parekh , R. Ravi Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Langerman , Pat Morin Covering Things with Things. [Citation Graph (0, 0)][DBLP ] Conf ] Maarten Lipmann , Xiwen Lu , Willem de Paepe , René Sitters , Leen Stougie On-Line Dial-a-Ride Problems under a Restricted Information Model. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof Lorys , Grazyna Zwozniak Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Manzini , Paolo Ferragina Engineering a Lightweight Suffix Array Construction Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Jana Maxová , Jaroslav Nesetril Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Ulrich Meyer External-Memory Breadth-First Search with Sublinear I/O. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Molloy , Mohammad R. Salavatipour Frequency Channel Assignment on Planar Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Näher , Oliver Zlotowski Design and Implementation of Efficient Data Types for Static Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Benny K. Nielsen , Pawel Winter , Martin Zachariasen An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kenichiro Ohta , Kunihiko Sadakane , Akiyoshi Shioura , Takeshi Tokuyama A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. [Citation Graph (0, 0)][DBLP ] Conf ] Marcin Peczarski Sorting 13 Elements Requires 34 Comparisons. [Citation Graph (0, 0)][DBLP ] Conf ] Tobias Polzin , Siavash Vahdati Daneshmand Extending Reduction Techniques for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kirk Pruhs , Patchrawat Uthaisombut A Comparison of Multicast Pull Models. [Citation Graph (0, 0)][DBLP ] Conf ] Harald Räcke , Christian Sohler , Matthias Westermann Online Scheduling for Sorting Buffers. [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Schurr , Tibor Szabó Finding the Sink Takes Some Time. [Citation Graph (0, 0)][DBLP ] Conf ] Meinolf Sellmann , Georg Kliewer , Achim Koberstein Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] Hadas Shachnai , Tami Tamir , Gerhard J. Woeginger Minimizing Makespan and Preemption Costs on a System of Uniform Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Rob van Stee , Johannes A. La Poutré Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts. [Citation Graph (0, 0)][DBLP ] Conf ] Ron Wein High-Level Filtering for Arrangements of Conic Arcs. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard J. Woeginger An Approximation Scheme for Cake Division with a Linear Number of Cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Huaming Zhang , Xin He A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] 