Publication | Date of Publication | Type |
---|
Faster algorithm for finding maximum 1-restricted simple 2-matchings | 2024-03-25 | Paper |
Packing Odd Walks and Trails in Multiterminal Networks | 2023-03-01 | Paper |
Faster algorithm for finding maximum 1-restricted simple 2-matchings | 2022-08-30 | Paper |
Faster algorithms for half-integral T -Path packing | 2020-11-25 | Paper |
External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs | 2020-10-21 | Paper |
Cascade heap: towards time-optimal extractions | 2019-07-04 | Paper |
Algorithms for Hub Label Optimization | 2018-11-05 | Paper |
Wavelet Trees Meet Suffix Trees | 2017-10-05 | Paper |
Cascade heap: towards time-optimal extractions | 2017-08-22 | Paper |
Computing minimal and maximal suffixes of a substring | 2016-06-16 | Paper |
A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem | 2016-04-04 | Paper |
A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes | 2015-10-20 | Paper |
On the Complexity of Hub Labeling (Extended Abstract) | 2015-09-16 | Paper |
Flow Decompositions in External Memory | 2014-11-04 | Paper |
Computing Minimal and Maximal Suffixes of a Substring Revisited | 2014-06-30 | Paper |
Algorithms for Hub Label Optimization | 2013-08-06 | Paper |
On Minimal and Maximal Suffixes of a Substring | 2013-06-14 | Paper |
Improved algorithms for even factors and square-free simple \(b\)-matchings | 2013-01-28 | Paper |
Min-cost multiflows in node-capacitated undirected networks | 2013-01-03 | Paper |
On Weighted Multicommodity Flows in Directed Networks | 2012-12-02 | Paper |
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks | 2012-09-25 | Paper |
Resilient Quicksort and Selection | 2012-09-10 | Paper |
On flows in simple bidirected and skew-symmetric networks | 2012-05-09 | Paper |
Computing the longest common substring with one mismatch | 2012-03-13 | Paper |
Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph | 2012-03-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3113716 | 2012-01-23 | Paper |
An efficient scaling algorithm for the minimum weight bibranching problem | 2011-12-14 | Paper |
TRIANGLE-FREE 2-MATCHINGS REVISITED | 2011-03-25 | Paper |
A Faster Algorithm for the Maximum Even Factor Problem | 2010-12-09 | Paper |
Triangle-Free 2-Matchings Revisited | 2010-07-20 | Paper |
A fast algorithm for the path 2-packing problem | 2010-03-05 | Paper |
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks | 2010-01-28 | Paper |
Minimum mean cycle problem in bidirected and skew-symmetric graphs | 2009-04-17 | Paper |
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem | 2009-01-29 | Paper |
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem | 2008-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q3541505 | 2008-11-25 | Paper |
Computing Longest Common Substrings Via Suffix Arrays | 2008-06-05 | Paper |
A Fast Algorithm for Path 2-Packing Problem | 2008-06-03 | Paper |
Free multiflows in bidirected and skew-symmetric graphs | 2007-09-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5294559 | 2007-07-24 | Paper |
Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure | 2007-05-02 | Paper |
Optimum Branching Problem Revisited | 2006-11-15 | Paper |
On Ear Decompositions of Strongly Connected Bidirected Graphs | 2006-09-08 | Paper |
On a Problem Posed by Maurice Nivat | 2006-09-08 | Paper |