Conferences in DBLP
Irene Finocchi , Fabrizio Grandoni , Giuseppe F. Italiano Designing Reliable Algorithms in Unreliable Memories. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Naor From Balanced Graph Partitioning to Balanced Metric Labeling. [Citation Graph (0, 0)][DBLP ] Conf ] Cristopher Moore Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Fleischer , Gerhard Trippen Exploring an Unknown Graph Efficiently. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Rührup , Christian Schindelhauer Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. [Citation Graph (0, 0)][DBLP ] Conf ] Garima Batra , Naveen Garg , Garima Gupta Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Kliewer , Larissa Timajev Relax-and-Cut for Capacitated Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] George Christodoulou , Elias Koutsoupias On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. [Citation Graph (0, 0)][DBLP ] Conf ] Konstantinos Daskalakis , Christos H. Papadimitriou The Complexity of Games on Highly Regular Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Codenotti , Benton McCune , Rajiv Raman , Kasturi R. Varadarajan Computing Equilibrium Prices: Does Theory Meet Practice?. [Citation Graph (0, 0)][DBLP ] Conf ] Frederic Dorn , Eelko Penninkx , Hans L. Bodlaender , Fedor V. Fomin Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. [Citation Graph (0, 0)][DBLP ] Conf ] Magnus Wahlström An Algorithm for the SAT Problem for Formulae of Linear Length. [Citation Graph (0, 0)][DBLP ] Conf ] Hiro Ito , Kazuo Iwama , Tsuyoshi Osumi Linear-Time Enumeration of Isolated Cliques. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Cabello , Bojan Mohar Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Iris Reinbacher , Marc Benkert , Marc J. van Kreveld , Joseph S. B. Mitchell , Alexander Wolff Delineating Boundaries for Imprecise Regions. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Berberich , Arno Eigenwillig , Michael Hemmer , Susan Hert , Lutz Kettner , Kurt Mehlhorn , Joachim Reichel , Susanne Schmitt , Elmar Schömer , Nicola Wolpert EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Refael Hassin , Einat Or Min Sum Clustering with Penalties. [Citation Graph (0, 0)][DBLP ] Conf ] Zhi-Zhong Chen , Takayuki Nagoya Improved Approximation Algorithms for Metric Max TSP. [Citation Graph (0, 0)][DBLP ] Conf ] Ara Hayrapetyan , David Kempe , Martin Pál , Zoya Svitkina Unbalanced Graph Cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Ludek Kucera Low Degree Connectivity in Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP ] Conf ] J. Díaz , G. Grammatikopoulos , Alexis C. Kaporis , Lefteris M. Kirousis , X. Pérez , Dionisios G. Sotiropoulos 5-Regular Graphs are 3-Colorable with Positive Probability. [Citation Graph (0, 0)][DBLP ] Conf ] T. C. Hu , Lawrence L. Larmore , J. David Morgenthaler Optimal Integer Alphabetic Trees in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski , Yakov Nekrich Predecessor Queries in Constant Time?. [Citation Graph (0, 0)][DBLP ] Conf ] András Frank , Zoltán Király , Balázs Kotnyek An Algorithm for Node-Capacitated Ring Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Kwangil Lee , Mark A. Shayman On Degree Constrained Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Benkoczi , Binay K. Bhattacharya A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time. [Citation Graph (0, 0)][DBLP ] Conf ] Arianna Alfieri , Steef L. van de Velde , Gerhard J. Woeginger Roll Cutting in the Curtain Industry. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Lauther , Tamás Lukovszki Space Efficient Algorithms for the Burrows-Wheeler Backtransformation. [Citation Graph (0, 0)][DBLP ] Conf ] Arash Farzan , Paolo Ferragina , Gianni Franceschini , J. Ian Munro Cache-Oblivious Comparison-Based Algorithms on Multisets. [Citation Graph (0, 0)][DBLP ] Conf ] Geeta Chaudhry , Thomas H. Cormen Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] Anders Gidenstam , Marina Papatriantafilou , Philippas Tsigas Allocating Memory in a Lock-Free Manner. [Citation Graph (0, 0)][DBLP ] Conf ] Thierry de Kok , Marc J. van Kreveld , Maarten Löffler Generating Realistic Terrains with Higher-Order Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Lars Arge , Ke Yi I/O-Efficient Construction of Constrained Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Christophe Delage Convex Hull and Voronoi Diagram of Additively Weighted Points. [Citation Graph (0, 0)][DBLP ] Conf ] Christophe Paul , Jan Arne Telle New Tools and Simpler Algorithms for Branchwidth. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Alexander Grigoriev , Arie M. C. A. Koster Treewidth Lower Bounds with Brambles. [Citation Graph (0, 0)][DBLP ] Conf ] Pinar Heggernes , Karol Suchan , Ioan Todinca , Yngve Villanger Minimal Interval Completions. [Citation Graph (0, 0)][DBLP ] Conf ] Johannes Fischer , Simon W. Ginzinger A 2-Approximation Algorithm for Sorting by Prefix Reversals. [Citation Graph (0, 0)][DBLP ] Conf ] Maxime Crochemore , Danny Hermelin , Gad M. Landau , Stéphane Vialette Approximating the 2-Interval Pattern Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Gurmeet Singh Manku , Joe Sawada A Loopless Gray Code for Minimal Signed-Binary Representations. [Citation Graph (0, 0)][DBLP ] Conf ] Dániel Marx Efficient Approximation Schemes for Geometric Problems?. [Citation Graph (0, 0)][DBLP ] Conf ] Vittorio Bilò , Ioannis Caragiannis , Christos Kaklamanis , Panagiotis Kanellopoulos Geometric Clustering to Minimize the Sum of Cluster Sizes. [Citation Graph (0, 0)][DBLP ] Conf ] André Berger , Artur Czumaj , Michelangelo Grigni , Hairong Zhao Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Rafi Zachut Packet Routing and Information Gathering in Lines, Rings and Trees. [Citation Graph (0, 0)][DBLP ] Conf ] David Hay , Gabriel Scalosub Jitter Regulation for Multiple Streams. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Herman J. Haverkort , Micha Streppel Efficient c-Oriented Range Searching with DOP-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Cabello , Panos Giannopoulos , Christian Knauer , Günter Rote Matching Point Sets with Respect to the Earth Mover's Distance. [Citation Graph (0, 0)][DBLP ] Conf ] Giorgio Ausiello , Paolo Giulio Franciosa , Giuseppe F. Italiano Small Stretch Spanners on Dynamic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Krommidas , Christos D. Zaroliagis An Experimental Study of Algorithms for Fully Dynamic Transitive Closure. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Farshi , Joachim Gudmundsson Experimental Study of Geometric t -Spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Sanders , Dominik Schultes Highway Hierarchies Hasten Exact Shortest Path Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Aleksei V. Fishkin , Klaus Jansen , Sergey V. Sevastyanov , René Sitters Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. [Citation Graph (0, 0)][DBLP ] Conf ] Jiri Sgall , Hadas Shachnai , Tami Tamir Fairness-Free Periodic Scheduling with Vacations. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein Online Bin Packing with Cardinality Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Annamária Kovács Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Holzer , Grigorios Prasinos , Frank Schulz , Dorothea Wagner , Christos D. Zaroliagis Engineering Planar Separator Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Roman Dementiev , Lutz Kettner , Peter Sanders : Standard Template Library for XXL Data Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Him Wong , Yiu-Cheong Tam Negative Cycle Detection Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ferdinando Cicalese , Eduardo Sany Laber An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Kamesh Munagala , Jun Yang , Hai Yu Online View Maintenance Under a Response-Time Constraint. [Citation Graph (0, 0)][DBLP ] Conf ] Niv Buchbinder , Joseph Naor Online Primal-Dual Algorithms for Covering and Packing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Yigal Bejerano , Joseph Naor , Alexander Sprintson Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information. [Citation Graph (0, 0)][DBLP ] Conf ] Reuven Bar-Yehuda , Dror Rawitz Using Fractional Primal-Dual to Schedule Split Intervals with Demands. [Citation Graph (0, 0)][DBLP ] Conf ] Refael Hassin , Asaf Levin An Approximation Algorithm for the Minimum Latency Set Cover Problem. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan , Martin Strauss , X. Zheng Workload-Optimal Histograms on Streams. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Berenbrink , Funda Ergün , Tom Friedetzky Finding Frequent Patterns in a String in Sublinear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Gereon Frahling , Jens Krokowski Online Occlusion Culling. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Sankowski Shortest Paths in Matrix Multiplication Time. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Bergeron , Cedric Chauve , Fabien de Montgolfier , Mathieu Raffinot Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Fraigniaud Greedy Routing in Tree-Decomposed Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Jared Saia , Maxwell Young Making Chord Robust to Byzantine Attacks. [Citation Graph (0, 0)][DBLP ] Conf ] Marcin Bienkowski , Jaroslaw Byrka Bucket Game with Applications to Set Multicover and Dynamic Page Migration. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach-Colton , Rohan J. Fernandes , Miguel A. Mosteiro Bootstrapping a Hop-Optimal Network in the Weak Sensor Model. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Björklund Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Alain Faye , Frédéric Roupin A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Hassene Aissi , Cristina Bazgan , Daniel Vanderpooten Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. [Citation Graph (0, 0)][DBLP ] Conf ] Vikram Sharma , Zilin Du , Chee-Keng Yap Robust Approximate Zeros. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Stefan Langerman Optimizing a 2D Function Satisfying Unimodality Properties. [Citation Graph (0, 0)][DBLP ] Conf ] 