prof. RNDr. Petr Hliněný, Ph.D.

2006

• Equivalence-free exhaustive generation of matroid representations

  HLINĚNÝ Petr

  Article in Periodical

  Discrete Applied Mathematics, year: 2006, volume: 154, edition: 8

• Escape-width: Measuring "width" of digraphs

  HLINĚNÝ Petr OBDRŽÁLEK Jan

  Conference abstract

  Year: 2006, type: Conference abstract

• MACEK - Real Structural Computations with Representable Matroids.

  HLINĚNÝ Petr

  Year: 2006, type:

• Matroid Tree-Width

  HLINĚNÝ Petr WHITTLE Geoff

  Article in Periodical

  European Journal of Combinatorics, year: 2006, volume: 27, edition: 7

• On decidability of MSO theories of combinatorial structures: Towards general matroids?

  HLINĚNÝ Petr

  Year: 2006, type:

• On Matroid Representability and Minor Problems

  HLINĚNÝ Petr

  Article in Proceedings

  31st International Symposium, MFCS 2006, year: 2006

• On the Crossing Number of Almost Planar Graphs

  HLINĚNÝ Petr SALAZAR Gelasio

  Conference abstract

  Year: 2006, type: Conference abstract

• The Tutte Polynomial for Matroids of Bounded Branch-Width

  HLINĚNÝ Petr

  Article in Periodical

  Combin. Prob. Computing, year: 2006, volume: 15, edition: 3

• Trees, grids, and MSO decidability: From graphs to matroids

  HLINĚNÝ Petr SEESE Detlef

  Article in Periodical

  Theoretical Computer Science, year: 2006, volume: 351, edition: 3

2005

• A Parametrized Algorithm for Matroid Branch-Width

  HLINĚNÝ Petr

  Article in Periodical

  SIAM Journal on Computing, year: 2005, volume: 35, edition: 2