Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Approximate Min-max Relations for Odd Cycles in Planar Graphs., , , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 35-50. Springer, (2005)Properly 2-Colouring Linear Hypergraphs., and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 395-408. Springer, (2007)Further Algorithmic Aspects of the Local Lemma., and . STOC, page 524-529. ACM, (1998)Non-Interfering Network Flows., , , and . SWAT, volume 621 of Lecture Notes in Computer Science, page 245-257. Springer, (1992)An Improved Algorithm for Finding Tree Decompositions of Small Width., and . WG, volume 1665 of Lecture Notes in Computer Science, page 148-154. Springer, (1999)How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component., , , and . FOCS, page 695-703. IEEE Computer Society, (2016)A Separator Theorem in Minor-Closed Classes., and . FOCS, page 153-162. IEEE Computer Society, (2010)A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width., , and . FOCS, page 771-780. IEEE Computer Society, (2008)Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time., , and . CoRR, (2015)Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width., , and . J. Algorithms, 48 (2): 333-359 (2003)