Masarykova univerzita

Výpis publikací

česky | in English

Filtrování publikací

    2009

    1. 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.

    2008

    1. HLINĚNÝ, Petr. Approaching tree-width of graphs from matroidal perspective. In 43. česko-slovenská konference Grafy 2008. 2008.
    2. HLINĚNÝ, Petr a Sang-il OUM. Finding branch-decomposition and rank-decomposition. SIAM Journal on Computing. USA: SIAM, 2008, roč. 38, č. 3, s. 1012-1032. ISSN 0097-5397.

    2007

    1. HLINĚNÝ, Petr a Sang-il OUM. Finding branch-decomposition and rank-decomposition (Extended abstract). In European Symposium on Algorithms (ESA 2007). Berlin: Springer Verlag, 2007, s. 163-174. ISBN 978-3-540-75519-7.
    2. HLINĚNÝ, Petr a Sang il OUM. Finding Branch-decompositions and Rank-decompositions. In Joint Meeting of the AMS - NZMS 2007. 2007.
    3. HLINĚNÝ, Petr. Some Hard Problems on Matroid Spikes. Theory of Computing Systems. New York: Springer, 2007, roč. 41, č. 1, s. 551-562. ISSN 1432-4350.

    2006

    1. HLINĚNÝ, Petr. MACEK - Real Structural Computations with Representable Matroids. In AXIOM workshop, RISC Institute, Linz. 2006.
    2. HLINĚNÝ, Petr a Geoff WHITTLE. Matroid Tree-Width. European Journal of Combinatorics. Elsevier, 2006, roč. 27, č. 7, s. 1117-1128. ISSN 0195-6698.
    3. HLINĚNÝ, Petr. On decidability of MSO theories of combinatorial structures: Towards general matroids? In Logic and Combinatorics (organized by Bruno Courcelle), Workshop at CSL'06. 2006.
    4. HLINĚNÝ, Petr a Detlef SEESE. Trees, grids, and MSO decidability: From graphs to matroids. Theoretical Computer Science. Amsterdam: Elsevier, 2006, roč. 351, č. 3, s. 372-393. ISSN 0304-3975.

    2005

    1. HLINĚNÝ, Petr a Geoff WHITTLE. Matroid Tree-Width and Chordality. In Workshop on Graph Classes, Width Parameters and Optimization. 2005.
    2. HLINĚNÝ, Petr. Width Parameters of Matroids. In Exact Algorithms and Fixed-Parameter Tractability, Dagstuhl Seminar #05301. 2005.

    2004

    1. HLINĚNÝ, Petr. Are Matroids Interesting Combinatorial Structures? 2004.

    2003

    1. 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.
Zobrazit podrobně
Zobrazeno: 19. 11. 2024 04:47