Petr Hliněný

Width Parameters Beyond Tree-width and their Applications

Petr Hliněný, Sang‐il Oum, Detlef Seese et al. · The Computer Journal · 2007 · 164 citations

Computing, Computer Science, Computational Geometry +5

Finding Branch-Decompositions and Rank-Decompositions

Petr Hliněný, Sang‐il Oum · SIAM Journal on Computing · 2008 · 136 citations

Natural Sciences, Computer Science, Mathematics +13

Representing graphs by disks and balls (a survey of recognition-complexity results)

Petr Hliněný, Jan Kratochvı́l · Discrete Mathematics · 2001 · 87 citations

Computing, Computer Science, Computational Geometry +11

On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width

Robert Ganian, Petr Hliněný · Discrete Applied Mathematics · 2009 · 72 citations

Computing, Computer Science, Algorithms +13

Branch-width, parse trees, and monadic second-order logic for matroids

Petr Hliněný · Journal of Combinatorial Theory Series B · 2005 · 69 citations

Natural Sciences, Computer Science, Mathematics +14