| Publication | Date of Publication | Type |
|---|
| Packing odd walks and trails in multiterminal networks | 2024-10-08 | Paper |
Faster algorithm for finding maximum 1-restricted simple 2-matchings
Algorithmica | 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
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Cascade heap: towards time-optimal extractions
Theory of Computing Systems | 2019-07-04 | Paper |
Algorithms for hub label optimization
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Wavelet trees meet suffix trees
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Cascade heap: towards time-optimal extractions
Computer Science – Theory and Applications | 2017-08-22 | Paper |
Computing minimal and maximal suffixes of a substring
Theoretical Computer Science | 2016-06-16 | Paper |
A fast scaling algorithm for the weighted triangle-free 2-matching problem
Lecture Notes in Computer Science | 2016-04-04 | Paper |
A combinatorial algorithm for the planar multiflow problem with demands located on three holes
Lecture Notes in Computer Science | 2015-10-20 | Paper |
On the complexity of hub labeling (extended abstract)
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Flow decompositions in external memory
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Computing minimal and maximal suffixes of a substring revisited
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Algorithms for hub label optimization
Automata, Languages, and Programming | 2013-08-06 | Paper |
On minimal and maximal suffixes of a substring
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Improved algorithms for even factors and square-free simple \(b\)-matchings
Algorithmica | 2013-01-28 | Paper |
Min-cost multiflows in node-capacitated undirected networks
Journal of Combinatorial Optimization | 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
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Resilient quicksort and selection
Computer Science – Theory and Applications | 2012-09-10 | Paper |
On flows in simple bidirected and skew-symmetric networks
Problems of Information Transmission | 2012-05-09 | Paper |
Computing the longest common substring with one mismatch
Problems of Information Transmission | 2012-03-13 | Paper |
Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
Problems of Information Transmission | 2012-03-13 | Paper |
| scientific article; zbMATH DE number 5999574 (Why is no real title available?) | 2012-01-23 | Paper |
An efficient scaling algorithm for the minimum weight bibranching problem
Algorithmica | 2011-12-14 | Paper |
Triangle-free 2-matchings revisited
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
A faster algorithm for the maximum even factor problem
Algorithms and Computation | 2010-12-09 | Paper |
Triangle-free 2-matchings revisited
Lecture Notes in Computer Science | 2010-07-20 | Paper |
A fast algorithm for the path 2-packing problem
Theory of Computing Systems | 2010-03-05 | Paper |
A linear time algorithm for finding three edge-disjoint paths in Eulerian networks
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Minimum mean cycle problem in bidirected and skew-symmetric graphs
Discrete Optimization | 2009-04-17 | Paper |
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
Algorithms and Computation | 2009-01-29 | Paper |
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
Algorithms - ESA 2008 | 2008-11-25 | Paper |
| An application of the structural theory of acyclic skew-symmetric graphs | 2008-11-25 | Paper |
Computing Longest Common Substrings Via Suffix Arrays
Computer Science – Theory and Applications | 2008-06-05 | Paper |
A Fast Algorithm for Path 2-Packing Problem
Computer Science – Theory and Applications | 2008-06-03 | Paper |
Free multiflows in bidirected and skew-symmetric graphs
Discrete Applied Mathematics | 2007-09-18 | Paper |
| A fast algorithm of constructing decomposition of multipole flows | 2007-07-24 | Paper |
Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
Computer Science – Theory and Applications | 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 |
