Petr Kolman

Available identifiers

zbMath Open kolman.petrWikidataQ115957140 ScholiaQ115957140MaRDI QIDQ372973

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6084397	2023-10-31	Paper
https://portal.mardi4nfdi.de/entity/Q3386630	2021-01-05	Paper
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow	2020-09-04	Paper
On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow	2020-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q5743437	2019-05-10	Paper
On Algorithms Employing Treewidth for $L$-bounded Cut Problems	2018-04-25	Paper
Extension Complexity, MSO Logic, and Treewidth	2017-10-17	Paper
Extended formulation for CSP that is compact for instances of bounded treewidth	2016-01-25	Paper
The greedy algorithm for the minimum common string partition problem	2015-09-02	Paper
https://portal.mardi4nfdi.de/entity/Q2934674	2014-12-18	Paper
Length-bounded cuts and flows	2014-09-09	Paper
Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing	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	2011-05-24	Paper
On the complexity of paths avoiding forbidden pairs	2010-04-28	Paper
A note on the greedy algorithm for the unsplittable flow problem	2009-07-09	Paper
Reversal distance for strings with duplicates: linear time approximation using hitting set	2009-04-07	Paper
Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks	2008-03-28	Paper
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set	2008-02-21	Paper
Approximating reversal distance for strings with bounded number of duplicates	2007-03-02	Paper
Improved bounds for the unsplittable flow problem	2006-12-07	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
Algorithms and Computation	2005-12-22	Paper
Minimum common string partition problem: hardness and approximations	2005-11-01	Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2005-08-25	Paper
Short length Menger's theorem and reliable optical routing	2005-06-30	Paper
Simple on-line algorithms for the maximum disjoint paths problem	2004-12-13	Paper
https://portal.mardi4nfdi.de/entity/Q4828931	2004-11-29	Paper
Crossing number, pair-crossing number, and expansion	2004-10-01	Paper
Optimal broadcast on parallel locality models	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4252033	2002-04-21	Paper

Research outcomes over time

This page was built for person: Petr Kolman