| Publication | Date of Publication | Type |
|---|
| Approximating spanning tree congestion on graphs with polylog degree | 2025-02-28 | Paper |
| scientific article; zbMATH DE number 7758343 (Why is no real title available?) | 2023-10-31 | Paper |
| Extension complexity, MSO logic, and treewidth | 2021-01-05 | Paper |
On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
| On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow | 2020-01-16 | Paper |
| Approximate duality of multicommodity multiroute flows and cuts: single source case | 2019-05-10 | Paper |
On algorithms employing treewidth for \(L\)-bounded cut problems
Journal of Graph Algorithms and Applications | 2018-04-25 | Paper |
Extension complexity, MSO logic, and treewidth
(available as arXiv preprint) | 2017-10-17 | Paper |
Extended formulation for CSP that is compact for instances of bounded treewidth
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
Extended formulation for CSP that is compact for instances of bounded treewidth
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
The greedy algorithm for the minimum common string partition problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| Single source multiroute flows and cuts on uniform capacity networks | 2014-12-18 | Paper |
Length-bounded cuts and flows
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
Theory of Computing Systems | 2013-10-21 | Paper |
| Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing | 2012-01-23 | Paper |
Single source multiroute flows and cuts on uniform capacity networks
Theory of Computing | 2011-05-24 | Paper |
On the complexity of paths avoiding forbidden pairs
Discrete Applied Mathematics | 2010-04-28 | Paper |
A note on the greedy algorithm for the unsplittable flow problem
Information Processing Letters | 2009-07-09 | Paper |
Reversal distance for strings with duplicates: linear time approximation using hitting set
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Reversal distance for strings with duplicates: linear time approximation using hitting set
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
Approximation and Online Algorithms | 2008-02-21 | Paper |
Approximating reversal distance for strings with bounded number of duplicates
Discrete Applied Mathematics | 2007-03-02 | Paper |
Improved bounds for the unsplittable flow problem
Journal of Algorithms | 2006-12-07 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Minimum common string partition problem: hardness and approximations
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Minimum common string partition problem: hardness and approximations
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science | 2005-06-30 | Paper |
Simple on-line algorithms for the maximum disjoint paths problem
Algorithmica | 2004-12-13 | Paper |
| scientific article; zbMATH DE number 2119660 (Why is no real title available?) | 2004-11-29 | Paper |
Crossing number, pair-crossing number, and expansion
Journal of Combinatorial Theory. Series B | 2004-10-01 | Paper |
Optimal broadcast on parallel locality models
Journal of Discrete Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1305091 (Why is no real title available?) | 2002-04-21 | Paper |
