Kolman, Petr - Institute for Theoretical Computer Science & Department of Applied Mathematics, Charles University in Prague

Advanced Search

Kolman, Petr - Institute for Theoretical Computer Science & Department of Applied Mathematics, Charles University in Prague

Metoda vnit#nho bodu Petr Kolman
PRAM Lower Bound for Element Distinctness Petr Kolman
Simple Online Algorithms for the Maximum Disjoint Paths Problem \Lambda
On Nonblocking Properties of the Bene s Petr Kolman ?
An Approximation Algorithm for Bounded Degree Deletion
A Simple Combinatorial Proof of Duality of Multiroute Flows and Cuts
Algorithms for Fault-Tolerant Routing in Circuit Switched Networks
Elipsoidov metoda poznmky k p#ednsce Petr Kolman
Crossing number, pair-crossing number, and expansion Petr Kolman, Ji r Matou sek
Petr Kolman Bernard Lidicky Jean-Sebastien Sereni
On the Complexity of Paths Avoiding Forbidden Pairs
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
Minimum Common String Partition Problem: Hardness and Approximations
Length-Bounded Cuts and Flows GEORG BAIER
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
Faculty of Mathematics and Physics Charles University, Prague
The Greedy Algorithm for the Minimum Common String Partition Problem
2 Chyba v dukazu Lemma 4.3 5 3 Pr'iciny ne'uspechu konstrukce MDCM stroje 9
Short Disjoint Paths on Hypercubic Graphs Petr Kolman
Short Length Menger's Theorem and Reliable Optical Amitabha Bagchi
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
Optimal Broadcast on Parallel Locality Models BEN JUURLINK Computer Engineering Laboratory
Metoda vnitnho bodu Petr Kolman
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing
Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case
Systm pro optimalizaci a zen lidskch zdroj AristoTelos
Polynomiln algoritmy pro linern programovn