Conferences in DBLP
Lars Arge External Memory Data Structures. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:1-29 [Conf ] Susanne Albers Some Algorithmic Problems in Large Networks. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:30-32 [Conf ] Uri Zwick Exact and Approximate Distances in Graphs - A Survey. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:33-48 [Conf ] Alexander Gaysinsky , Alon Itai , Hadas Shachnai Strongly Competitive Algorithms for Caching with Pipelined Prefetching. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:49-61 [Conf ] David A. Hutchinson , Peter Sanders , Jeffrey Scott Vitter Duality between Prefetching and Queued Writing with Parallel Disks. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:62-73 [Conf ] Sven Oliver Krumke , Willem de Paepe , Jörg Rambau , Leen Stougie Online Bin Coloring. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:74-85 [Conf ] Steven S. Seiden A General Decomposition Theorem for the k-Server Problem. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:86-97 [Conf ] János Csirik , Csanád Imreh , John Noga , Steven S. Seiden , Gerhard J. Woeginger Buying a Constant Competitive Ratio for Paging. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:98-108 [Conf ] Martin Dietzfelbinger , Torben Hagerup Simple Minimal Perfect Hashing in Less Space. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:109-120 [Conf ] Rasmus Pagh , Flemming Friche Rodler Cuckoo Hashing. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:121-133 [Conf ] Meinolf Sellmann , Torsten Fahle Coupling Variable Fixing Algorithms for the Automatic Recording Problem. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:134-145 [Conf ] Renaud Lepère , Denis Trystram , Gerhard J. Woeginger Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:146-157 [Conf ] Bjarni V. Halldórsson , Magnús M. Halldórsson , R. Ravi On the Approximability of the Minimum Test Collection Problem. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:158-169 [Conf ] Roman M. Kolpakov , Gregory Kucherov Finding Approximate Repetitions under Hamming Distance. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:170-181 [Conf ] Giuseppe Lancia , Vineet Bafna , Sorin Istrail , Ross Lippert , Russell Schwartz SNPs Problems, Complexity, and Algorithms. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:182-193 [Conf ] Eric Angel , Evripidis Bampis , Alexander Kononov A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:194-205 [Conf ] Aleksei V. Fishkin , Klaus Jansen , Monaldo Mastrolilli Grouping Techniques for Scheduling Problems: Simpler and Faster. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:206-217 [Conf ] Yoshiyuki Karuno , Hiroshi Nagamochi A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:218-229 [Conf ] Andrew V. Goldberg A Simple Shortest Path Algorithm with Linear Average Time. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:230-241 [Conf ] Kurt Mehlhorn , Guido Schäfer A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:242-253 [Conf ] Christoph Burnikel , Stefan Funke , Kurt Mehlhorn , Stefan Schirra , Susanne Schmitt A Separation Bound for Real Algebraic Expressions. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:254-265 [Conf ] Artur Czumaj , Christian Sohler Property Testing with Geometric Queries. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:266-277 [Conf ] Manuel Abellanas , Ferran Hurtado , Christian Icking , Rolf Klein , Elmar Langetepe , Lihong Ma , Belén Palop , Vera Sacristan Smallest Color-Spanning Objects. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:278-289 [Conf ] Jaikumar Radhakrishnan , Venkatesh Raman , S. Srinivasa Rao Explicit Deterministic Constructions for Membership in the Bitprobe Model. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:290-299 [Conf ] Rasmus Pagh , Flemming Friche Rodler Lossy Dictionaries. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:300-311 [Conf ] Bernard Chazelle , Olivier Devillers , Ferran Hurtado , Mercè Mora , Vera Sacristan , Monique Teillaud Splitting a Delaunay Triangulation in Linear Time. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:312-320 [Conf ] Annette Ebbers-Baumann , Rolf Klein , Elmar Langetepe , Andrzej Lingas A Fast Algorithm for Approximating the Detour of a Polygonal Chain. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:321-332 [Conf ] Stephan Eidenbenz , Peter Widmayer An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:333-344 [Conf ] Andrzej Czygrinow , Michal Hanckowiak , Michal Karonski Distributed O(Delta log(n))-Edge-Coloring Algorithm. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:345-355 [Conf ] John R. Douceur , Roger Wattenhofer Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:356-367 [Conf ] Markus Bläser , Bodo Siebert Computing Cycle Covers without Short Cycles. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:368-379 [Conf ] Dimitrios M. Thilikos , Maria J. Serna , Hans L. Bodlaender A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:380-390 [Conf ] Norbert Sensen Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:391-403 [Conf ] Karhan Akcoglu , Ming-Yang Kao , Shuba V. Raghavan Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:404-415 [Conf ] Andrew V. Goldberg , Jason D. Hartline Competitive Auctions for Multiple Digital Goods. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:416-427 [Conf ] Stefan Langerman , Sachin Lodha , Rahul Shah Algorithms for Efficient Filtering in Content-Based Multicast. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:428-439 [Conf ] Pierre Fraigniaud Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:440-451 [Conf ] Andrea E. F. Clementi , Angelo Monti , Riccardo Silvestri Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:452-463 [Conf ] Jirí Fiala , Aleksei V. Fishkin , Fedor V. Fomin Online and Offline Distance Constrained Labeling of Disk Graphs. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:464-475 [Conf ] Cyril Gavoille , Michal Katz , Nir A. Katz , Christophe Paul , David Peleg Approximate Distance Labeling Schemes. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:476-487 [Conf ] Vida Dujmovic , Michael R. Fellows , Michael T. Hallett , Matthew Kitching , Giuseppe Liotta , Catherine McCartin , Naomi Nishimura , Prabhakar Ragde , Frances A. Rosamond , Matthew Suderman , Sue Whitesides , David R. Wood On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:488-499 [Conf ] Colin Cooper , Alan M. Frieze A General Model of Undirected Web Graphs. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:500-511 [Conf ] Alberto Caprara , Alessandro Panconesi , Romeo Rizzi Packing Cycles and Cuts in Undirected Graphs. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:512-523 [Conf ] Michele Zito Greedy Algorithms for Minimisation Problems in Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:524-536 [Conf ]