Searching for authors named "Petr Kolman" – sorted by Relevance.
-
A Note on the Greedy Algorithm for the Unsplittable Flow Problem
- A Note on the Greedy Algorithm for the Unsplittable Flow Problem Petr Kolman Inst. for Theoretical
- Cited by 7 (0 self) – Add To MetaCart
-
Approximating reversal distance for strings with bounded number of duplicates
- Approximating Reversal Distance for Strings with Bounded Number of Duplicates in Linear Time Petr
- Cited by 6 (3 self) – Add To MetaCart
-
On the Complexity of Paths Avoiding Forbidden Pairs
- On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman and Ond^rej Pangr'ac Abstract
- Add To MetaCart
-
On Nonblocking Properties of the Benes Network
- On Nonblocking Properties of the Benes Network Petr Kolman ? Department of Applied Mathematics
- Cited by 3 (1 self) – Add To MetaCart
-
Searching for Edge Disjoint Paths on Hypercube-like Topologies
- on Hypercube-like Topologies Doctoral Thesis Petr Kolman September 1998 Prague Let not the wise man glory
- Cited by 2 (1 self) – Add To MetaCart
-
Short Disjoint Paths on Hypercubic Graphs
- Short Disjoint Paths on Hypercubic Graphs Petr Kolman Heinz Nixdorf Institute, Paderborn, Germany
- Add To MetaCart
-
Crossing Number, Pair-Crossing Number, and Expansion
- Crossing number, pair-crossing number, and expansion Petr Kolman, Ji r Matou sek Department
- Cited by 5 (0 self) – Add To MetaCart
-
Reversal distance for strings with duplicates: Linear time approximation using hitting set
- Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set Petr
- Cited by 2 (0 self) – Add To MetaCart
-
Simple On-line Algorithms for the Maximum Disjoint Paths Problem
- Simple On-line Algorithms for the Maximum Disjoint Paths Problem Petr Kolman Dept. of Applied
- Cited by 12 (1 self) – Add To MetaCart
-
Improved Bounds for the Unsplittable Flow Problem
- Improved Bounds for the Unsplittable Flow Problem Petr Kolman Inst. for Theoretical Computer
- Cited by 43 (5 self) – Add To MetaCart

