| Publication | Date of Publication | Type |
|---|
A metaheuristic algorithm for large maximum weight independent set problems
Networks | 2025-01-15 | Paper |
Maximum skew-symmetric flows
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Recent developments in maximum flow algorithms
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
On implementing push-relabel method for the maximum flow problem
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
New instances for maximum weight independent set from a vehicle routing application
SN Operations Research Forum | 2021-11-08 | Paper |
Exact combinatorial branch-and-bound for graph bisection
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
An experimental study of minimum mean cycle algorithms
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Shortest path feasibility algorithms: an experimental evaluation
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Algorithms for hub label optimization
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Highway dimension and provably efficient shortest path algorithms
Journal of the ACM | 2018-08-02 | Paper |
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Minimum-cost flows in unit-capacity networks
Theory of Computing Systems | 2018-02-01 | Paper |
Negative-cycle detection algorithms
Algorithms — ESA '96 | 2017-12-05 | Paper |
Minimum cost flows in graphs with unit capacities
| 2017-01-24 | Paper |
Faster and more dynamic maximum flow by incremental breadth-first search
Algorithms - ESA 2015 | 2015-11-19 | Paper |
An exact combinatorial algorithm for minimum graph bisection
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
On the complexity of hub labeling (extended abstract)
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
scientific article; zbMATH DE number 6472607 (Why is no real title available?)
| 2015-08-14 | Paper |
scientific article; zbMATH DE number 6472581 (Why is no real title available?)
| 2015-08-14 | Paper |
Alternative routes in road networks
ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
Computing the shortest path: \(A^\ast\) search meets graph theory
| 2014-10-13 | Paper |
Collusion-resistant mechanisms for single-parameter agents
| 2014-10-13 | Paper |
Robust distance queries on massive networks
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Highway dimension, shortest paths, and provably efficient algorithms
| 2014-05-22 | Paper |
Shortest-path feasibility algorithms, an experimental evaluation
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Separating Hierarchical and General Hub Labelings
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Algorithms for hub label optimization
Automata, Languages, and Programming | 2013-08-06 | Paper |
Hierarchical hub labelings for shortest paths
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Maximum flows by incremental breadth-first search
Algorithms – ESA 2011 | 2011-09-16 | Paper |
VC-dimension and shortest path algorithms
Automata, Languages and Programming | 2011-07-06 | Paper |
Derandomization of auctions
Games and Economic Behavior | 2011-05-16 | Paper |
Derandomization of auctions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Competitive generalized auctions
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Reach for \(A^*\): shortest path algorithms with preprocessing
| 2010-07-09 | Paper |
The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
Algorithms - ESA 2008 | 2008-11-25 | Paper |
A Practical Shortest Path Algorithm with Linear Expected Time
SIAM Journal on Computing | 2008-10-28 | Paper |
Point-to-Point Shortest Path Algorithms with Preprocessing
Lecture Notes in Computer Science | 2008-03-07 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Maximum skew-symmetric flows and matchings
Mathematical Programming. Series A. Series B | 2004-10-28 | Paper |
scientific article; zbMATH DE number 2081016 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2079342 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2065607 (Why is no real title available?)
| 2004-05-18 | Paper |
scientific article; zbMATH DE number 1947406 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1875433 (Why is no real title available?)
| 2003-03-02 | Paper |
scientific article; zbMATH DE number 1875419 (Why is no real title available?)
| 2003-03-02 | Paper |
Competitive auctions and digital goods
| 2002-07-22 | Paper |
Cut tree algorithms: An experimental study
Journal of Algorithms | 2001-04-17 | Paper |
Negative-cycle detection algorithms
Mathematical Programming. Series A. Series B | 2001-02-09 | Paper |
scientific article; zbMATH DE number 1263274 (Why is no real title available?)
| 1999-11-02 | Paper |
Buckets, Heaps, Lists, and Monotone Priority Queues
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1305515 (Why is no real title available?)
| 1999-09-15 | Paper |
scientific article; zbMATH DE number 1305427 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1086916 (Why is no real title available?)
| 1998-10-12 | Paper |
scientific article; zbMATH DE number 1187163 (Why is no real title available?)
| 1998-08-10 | Paper |
On implementing the push-relabel method for the maximum flow problem
Algorithmica | 1998-05-26 | Paper |
Path problems in skew-symmetric graphs
Combinatorica | 1997-08-03 | Paper |
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
Mathematics of Operations Research | 1997-06-09 | Paper |
scientific article; zbMATH DE number 1003253 (Why is no real title available?)
| 1997-04-23 | Paper |
scientific article; zbMATH DE number 1003284 (Why is no real title available?)
| 1997-04-23 | Paper |
scientific article; zbMATH DE number 1003285 (Why is no real title available?)
| 1997-04-23 | Paper |
Shortest paths algorithms: Theory and experimental evaluation
Mathematical Programming. Series A. Series B | 1996-10-20 | Paper |
Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing | 1995-07-26 | Paper |
scientific article; zbMATH DE number 437547 (Why is no real title available?)
| 1994-12-04 | Paper |
Tight bounds on the number of minimum-mean cycle cancellations and related results
Algorithmica | 1994-09-11 | Paper |
scientific article; zbMATH DE number 515928 (Why is no real title available?)
| 1994-03-10 | Paper |
scientific article; zbMATH DE number 515925 (Why is no real title available?)
| 1994-03-10 | Paper |
scientific article; zbMATH DE number 432811 (Why is no real title available?)
| 1993-10-20 | Paper |
Approximating matchings in parallel
Information Processing Letters | 1993-09-16 | Paper |
A heuristic improvement of the Bellman-Ford algorithm
Applied Mathematics Letters | 1993-08-19 | Paper |
Sublinear-Time Parallel Algorithms for Matching and Related Problems
Journal of Algorithms | 1993-05-16 | Paper |
A natural randomization strategy for multicommodity flow and related algorithms
Information Processing Letters | 1993-01-16 | Paper |
Finding minimum-cost flows by double scaling
Mathematical Programming. Series A. Series B | 1992-06-28 | Paper |
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
SIAM Journal on Computing | 1992-06-28 | Paper |
Processor-efficient implementation of a maximum flow algorithm
Information Processing Letters | 1992-06-26 | Paper |
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
Compression and Ranking
SIAM Journal on Computing | 1992-06-25 | Paper |
Combinatorial Algorithms for the Generalized Circulation Problem
Mathematics of Operations Research | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4204092 (Why is no real title available?)
| 1990-01-01 | Paper |
Finding Minimum-Cost Circulations by Successive Approximation
Mathematics of Operations Research | 1990-01-01 | Paper |
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM | 1989-01-01 | Paper |
A parallel algorithm for finding a blocking flow in an acyclic network
Information Processing Letters | 1989-01-01 | Paper |
A new approach to the maximum-flow problem
Journal of the ACM | 1988-01-01 | Paper |
Parallel Symmetry-Breaking in Sparse Graphs
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Parallel \((\Delta +1)\)-coloring of constant-degree graphs
Information Processing Letters | 1987-01-01 | Paper |
