Andrew V. Goldberg

Matthias Müller-Hannemann

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Implementation Challenge for Shortest Paths.

[BibT_eX]

[DOI]

Camil Demetrescu

David S. Johnson

Encyclopedia of Algorithms, 2016

Hub Labeling (2-Hop Labeling).

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Algorithms for Hub Label Optimization.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Highway Dimension and Provably Efficient Shortest Path Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2016

On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

An exact combinatorial algorithm for minimum graph bisection.

[BibT_eX]

[DOI]

Math. Program., 2015

Route Planning in Transportation Networks.

[BibT_eX]

[DOI]

Hannah Bast

Matthias Müller-Hannemann

CoRR, 2015

On the Complexity of Hub Labeling.

[BibT_eX]

[DOI]

CoRR, 2015

Minimum Cost Flows in Graphs with Unit Capacities.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

On the Complexity of Hub Labeling (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Navigation made personal: inferring driving preferences from GPS traces.

[BibT_eX]

[DOI]

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Efficient maximum flow algorithms.

[BibT_eX]

[DOI]

Commun. ACM, 2014

Hub Labels: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Robust Distance Queries on Massive Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

PHAST: Hardware-accelerated shortest path trees.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2013

Alternative routes in road networks.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2013

Algorithm Engineering (Dagstuhl Seminar 13391).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

The Hub Labeling Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Hub Label Compression.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Customizable Route Planning in Road Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Separating Hierarchical and General Hub Labelings.

[BibT_eX]

[DOI]

Ilya P. Razenshteyn

Ruslan Savchenko

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths.

[BibT_eX]

[DOI]

Proceedings of the Conference on Online Social Networks, 2013

2012

HLDB: location-based services in databases.

[BibT_eX]

[DOI]

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Hierarchical Hub Labelings for Shortest Paths.

[BibT_eX]

[DOI]

Ittai Abraham

Proceedings of the Algorithms - ESA 2012, 2012

Exact Combinatorial Branch-and-Bound for Graph Bisection.

[BibT_eX]

[DOI]

Ilya P. Razenshteyn

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011

Shortest Paths in Road Networks: From Practice to Theory and Back.

[BibT_eX]

[DOI]

it Inf. Technol., 2011

Derandomization of auctions.

[BibT_eX]

[DOI]

Games Econ. Behav., 2011

Customizable Route Planning.

[BibT_eX]

[DOI]

Thomas Pajor

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks.

[BibT_eX]

[DOI]

Ittai Abraham

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Graph Partitioning with Natural Cuts.

[BibT_eX]

[DOI]

Ilya P. Razenshteyn

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

VC-Dimension and Shortest Path Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Maximum Flows by Incremental Breadth-First Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

Faster Batched Shortest Paths in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2011, 2011

2010

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms.

[BibT_eX]

[DOI]

Ittai Abraham

Amos Fiat

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Shortest-path feasibility algorithms: An experimental evaluation.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Quincy: fair scheduling for distributed computing clusters.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM Symposium on Operating Systems Principles 2009, 2009

An Experimental Study of Minimum Mean Cycle Algorithms.

[BibT_eX]

[DOI]

Loukas Georgiadis

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

Two-Level Push-Relabel Algorithm for the Maximum Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Implementation Challenge for Shortest Paths.

[BibT_eX]

[DOI]

Camil Demetrescu

David S. Johnson

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A Practical Shortest Path Algorithm with Linear Expected Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

The Partial Augment-Relabel Algorithm for the Maximum Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

Better Landmarks Within Reach.

[BibT_eX]

[DOI]

Haim Kaplan

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Experimental Evaluation of Parametric Max-Flow Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Point-to-Point Shortest Path Algorithms with Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Competitive auctions.

[BibT_eX]

[DOI]

Games Econ. Behav., 2006

Routing in Networks with Low Doubling Dimension.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

Reach for A*: Shortest Path Algorithms with Preprocessing.

[BibT_eX]

[DOI]

Haim Kaplan

Proceedings of the Shortest Path Problem, 2006

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms.

[BibT_eX]

[DOI]

Haim Kaplan

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005

Collusion-resistant mechanisms for single-parameter agents.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Computing the shortest path: <i>A</i> search meets graph theory.

[BibT_eX]

[DOI]

Chris Harrelson

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Computing Point-to-Point Shortest Paths from External Memory.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

Maximum skew-symmetric flows and matchings.

[BibT_eX]

[DOI]

Math. Program., 2004

A Lower Bound on the Competitive Ratio of Truthful Auctions.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

2003

Competitiveness via consensus.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Envy-free auctions for digital goods.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

On Memory-Bound Functions for Fighting Spam.

[BibT_eX]

[DOI]

Cynthia Dwork

Moni Naor

Proceedings of the Advances in Cryptology, 2003

2002

Competitive generalized auctions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Truthful and Competitive Double Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

Cut Tree Algorithms: An Experimental Study.

[BibT_eX]

[DOI]

Kostas Tsioutsiouliklis

J. Algorithms, 2001

Competitive auctions and digital goods.

[BibT_eX]

[DOI]

Andrew Wright

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Shortest Path Algorithms: Engineering Aspects.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Competitive Auctions for Multiple Digital Goods.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

A Simple Shortest Path Algorithm with Linear Average Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

1999

Flows in Undirected Unit Capacity Networks.

[BibT_eX]

[DOI]

Satish Rao

SIAM J. Discret. Math., 1999

Buckets, Heaps, Lists, and Monotone Priority Queues.

[BibT_eX]

[DOI]

Craig Silverstein

SIAM J. Comput., 1999

Negative-cycle detection algorithms.

[BibT_eX]

[DOI]

Math. Program., 1999

Selecting Problems for Algorithm Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 1999

Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research.

[BibT_eX]

[DOI]

Bernard M. E. Moret

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Cut Tree Algorithms.

[BibT_eX]

[DOI]

Kostas Tsioutsiouliklis

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

A Prototype Implementation of Archival Intermemory.

[BibT_eX]

[DOI]

Proceedings of the Fourth ACM conference on Digital Libraries, 1999

Computational evaluation of hot queues.

[BibT_eX]

[DOI]

Craig Silverstein

Proceedings of the Data Structures, 1999

1998

Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms.

[BibT_eX]

[DOI]

Paul Martin

ACM J. Exp. Algorithmics, 1998

Beyond the Flow Decomposition Barrier.

[BibT_eX]

[DOI]

Satish Rao

J. ACM, 1998

Recent Developments in Maximum Flow Algorithms (Invited Lecture).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1998

An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

Towards an Archival Intermemory.

[BibT_eX]

[DOI]

Peter N. Yianilos

Proceedings of the IEEE Forum on Research and Technology Advances in Digital Libraries, 1998

1997

Strategic directions in research in theory of computing.

[BibT_eX]

[DOI]

SIGACT News, 1997

Global Price Updates Help.

[BibT_eX]

[DOI]

Robert Kennedy

SIAM J. Discret. Math., 1997

Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost.

[BibT_eX]

[DOI]

Math. Oper. Res., 1997

An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm.

[BibT_eX]

[DOI]

J. Algorithms, 1997

On Implementing the Push-Relabel Method for the Maximum Flow Problem.

[BibT_eX]

[DOI]

Algorithmica, 1997

Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

Experimental Study of Minimum Cut Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Shortest paths algorithms: Theory and experimental evaluation.

[BibT_eX]

[DOI]

Tomasz Radzik

Math. Program., 1996

Path Problems in Skew-Symmetric Graphs.

[BibT_eX]

[DOI]

Comb., 1996

1995

Scaling Algorithms for the Shortest Paths Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

An efficient cost scaling algorithm for the assignment problem.

[BibT_eX]

[DOI]

Robert Kennedy

Math. Program., 1995

Maximum Skew-Symmetric Flows.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches.

[BibT_eX]

[DOI]

Bruce M. Maggs

IEEE Trans. Computers, 1994

Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results.

[BibT_eX]

[DOI]

Tomasz Radzik

Algorithmica, 1994

Improved Approximation Algorithms for Network Design Problems.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Optimization Algorithms For Large Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Sublinear-Time Parallel Algorithms for Matching and Related Problems.

[BibT_eX]

[DOI]

Pravin M. Vaidya

J. Algorithms, 1993

Approximating Matchings in Parallel.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

1992

Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Finding minimum-cost flows by double scaling.

[BibT_eX]

[DOI]

Math. Program., 1992

A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1991

Потоковые Алгоритмы (Flow Algorithms) (G. M. Adel'son-Vel'ski, E. A. Dinits, and A. V. Karzanov).

[BibT_eX]

[DOI]

Dan Gusfield

SIAM Rev., 1991

Compression and Ranking.

[BibT_eX]

[DOI]

Michael Sipser

SIAM J. Comput., 1991

Use of dynamic trees in a network simplex algorithm for the maximum flow problem.

[BibT_eX]

[DOI]

Michael D. Grigoriadis

Math. Program., 1991

Combinatorial Algorithms for the Generalized Circulation Problem.

[BibT_eX]

[DOI]

Éva Tardos

Math. Oper. Res., 1991

Processor-Efficient Implementation of a Maximum Flow Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem.

[BibT_eX]

[DOI]

Michael Kharitonov

Proceedings of the Network Flows And Matching, 1991

Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine.

[BibT_eX]

[DOI]

Farid Alizadeth

Proceedings of the Network Flows And Matching, 1991

1990

Finding Minimum-Cost Circulations by Successive Approximation.

[BibT_eX]

[DOI]

Robert E. Tarjan

Math. Oper. Res., 1990

1989

Finding minimum-cost circulations by canceling negative cycles.

[BibT_eX]

[DOI]

J. ACM, 1989

A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Lower Bounds for Pseudorandom Number Generators

[BibT_eX]

[DOI]

Michael Kharitonov

Moti Yung

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Interior-Point Methods in Parallel Computation

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Network Decomposition and Locality in Distributed Computation

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Parallel Symmetry-Breaking in Sparse Graphs.

[BibT_eX]

[DOI]

Gregory E. Shannon

SIAM J. Discret. Math., 1988

A new approach to the maximum-flow problem.

[BibT_eX]

[DOI]

Andrew Vladislav Goldberg

J. ACM, 1988

1987

Efficient graph algorithms for sequential and parallel computers.

[BibT_eX]

[DOI]

PhD thesis, 1987

Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Solving Minimum-Cost Flow Problems by Successive Approximation

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1985

Efficient Test Generation Algorithms.

[BibT_eX]

Karl J. Lieberherr

Proceedings of the Proceedings International Test Conference 1985, 1985

1984

On Finding the Exact Solution of a Zero-One Knapsack Problem

[BibT_eX]

[DOI]