The following pages link to Petr Kolman (Q372973):
Displaying 36 items.
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Approximating reversal distance for strings with bounded number of duplicates (Q868388) (← links)
- The relationship between \(BS(H)\) and \(BS(G)\) (Q874782) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- On the complexity of paths avoiding forbidden pairs (Q967328) (← links)
- Reversal distance for strings with duplicates: linear time approximation using hitting set (Q1010605) (← links)
- A note on the greedy algorithm for the unsplittable flow problem (Q1028992) (← links)
- Optimal broadcast on parallel locality models (Q1827284) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- Simple on-line algorithms for the maximum disjoint paths problem (Q1889861) (← links)
- A hypergraph Turán problem with no stability (Q2095110) (← links)
- On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow (Q2285079) (← links)
- Sharp bounds for some multicolour Ramsey numbers (Q2494438) (← links)
- Minimum common string partition problem: hardness and approximations (Q2571293) (← links)
- (Q2934674) (← links)
- The greedy algorithm for the minimum common string partition problem (Q2944502) (← links)
- Single source multiroute flows and cuts on uniform capacity networks (Q3002790) (← links)
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q3113678) (← links)
- Length-bounded cuts and flows (Q3188986) (← links)
- (Q3386630) (← links)
- Improved bounds for the unsplittable flow problem (Q3410948) (← links)
- (Q4252033) (← links)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- (Q4828931) (← links)
- On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313049) (← links)
- Extension Complexity, MSO Logic, and Treewidth (Q5369520) (← links)
- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set (Q5443527) (← links)
- Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks (Q5454267) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492891) (← links)
- Algorithms and Computation (Q5712138) (← links)
- (Q5743437) (← links)
- (Q6084397) (← links)
- Weak saturation of multipartite hypergraphs (Q6143930) (← links)
