Výpis publikací

HLINĚNÝ, Petr a Geoff WHITTLE. Addendum to Matroid Tree-Width. European Journal of Combinatorics. Elsevier, 2009, roč. 30, č. 4, s. 1036-1044. ISSN 0195-6698.

HLINĚNÝ, Petr. Approaching tree-width of graphs from matroidal perspective. In 43. česko-slovenská konference Grafy 2008. 2008.

HLINĚNÝ, Petr; Georg GOTTLOB; Detlef SEESE a Sang-il OUM. Width Parameters Beyond Tree-width and Their Applications. Computer Journal. UK: Oxford University Press, 2007, roč. 51, č. 3, s. 326-362. ISSN 0010-4620.

OBDRŽÁLEK, Jan. DAG-width - Connectivity Measure for Directed Graphs. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms. New York/Philadelphia: Association for Computing Machinery/Society for Industrial and Applied Mathematics, 2006, s. 814--821. ISBN 0-89871-605-5.

HLINĚNÝ, Petr a Geoff WHITTLE. Matroid Tree-Width. European Journal of Combinatorics. Elsevier, 2006, roč. 27, č. 7, s. 1117-1128. ISSN 0195-6698.

HLINĚNÝ, Petr a Geoff WHITTLE. Matroid Tree-Width and Chordality. In Workshop on Graph Classes, Width Parameters and Optimization. 2005.

OBDRŽÁLEK, Jan. Fast Mu-calculus Model Checking when Tree-width is Bounded. In CAV 2003. Berlin Heidelberg: Springer-Verlag, 2003, s. 80-92. ISBN 3-540-40524-0.

HLINĚNÝ, Petr a Geoff WHITTLE. Matroid Tree-Width. In Advances in Graph and Matroid Theory, a conference in honour of Neil Robertson’s 65th birthday,. 2003.