Petr Kolman

From MaRDI portal
Person:372973

Available identifiers

zbMath Open kolman.petrWikidataQ115957140 ScholiaQ115957140MaRDI QIDQ372973

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60843972023-10-31Paper
https://portal.mardi4nfdi.de/entity/Q33866302021-01-05Paper
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow2020-09-04Paper
On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow2020-01-16Paper
https://portal.mardi4nfdi.de/entity/Q57434372019-05-10Paper
On Algorithms Employing Treewidth for $L$-bounded Cut Problems2018-04-25Paper
Extension Complexity, MSO Logic, and Treewidth2017-10-17Paper
Extended formulation for CSP that is compact for instances of bounded treewidth2016-01-25Paper
The greedy algorithm for the minimum common string partition problem2015-09-02Paper
https://portal.mardi4nfdi.de/entity/Q29346742014-12-18Paper
Length-bounded cuts and flows2014-09-09Paper
Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing2013-10-21Paper
Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing2012-01-23Paper
Single source multiroute flows and cuts on uniform capacity networks2011-05-24Paper
On the complexity of paths avoiding forbidden pairs2010-04-28Paper
A note on the greedy algorithm for the unsplittable flow problem2009-07-09Paper
Reversal distance for strings with duplicates: linear time approximation using hitting set2009-04-07Paper
Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks2008-03-28Paper
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set2008-02-21Paper
Approximating reversal distance for strings with bounded number of duplicates2007-03-02Paper
Improved bounds for the unsplittable flow problem2006-12-07Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Algorithms and Computation2005-12-22Paper
Minimum common string partition problem: hardness and approximations2005-11-01Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Short length Menger's theorem and reliable optical routing2005-06-30Paper
Simple on-line algorithms for the maximum disjoint paths problem2004-12-13Paper
https://portal.mardi4nfdi.de/entity/Q48289312004-11-29Paper
Crossing number, pair-crossing number, and expansion2004-10-01Paper
Optimal broadcast on parallel locality models2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q42520332002-04-21Paper

Research outcomes over time

This page was built for person: Petr Kolman