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

2009

• 21 years of Negami's planar cover conjecture

  HLINĚNÝ Petr

  Year: 2009, type:

• Addendum to Matroid Tree-Width

  HLINĚNÝ Petr WHITTLE Geoff

  Article in Periodical

  European Journal of Combinatorics, year: 2009, volume: 30, edition: 4

• Approximating the Crossing Number of Apex Graphs

  HLINĚNÝ Petr CHIMANI Markus MUTZEL Petra

  Article in Proceedings

  Symposium Graph Drawing 2008, Lecture Notes in Computer Science, year: 2009

• Better Polynomial Algorithms on Graphs of Bounded Rank-width.

  GANIAN Robert HLINĚNÝ Petr

  Article in Proceedings

  IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874, year: 2009

• Better Polynomial Algorithms on Graphs of~Bounded Rank-width

  GANIAN Robert HLINĚNÝ Petr

  Conference abstract

  Year: 2009, type: Conference abstract

• MEMICS 2009, Fifth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science

  VOJNAR Tomáš HLINĚNÝ Petr MATYÁŠ Václav ANTOŠ David

  Year: 2009, type:

• MEMICS 2009, Fifth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, selected papers

  HLINĚNÝ Petr MATYÁŠ Václav VOJNAR Tomáš

  Year: 2009, type:

• On Digraph Width Measures in Parameterized Algorithmics

  GANIAN Robert HLINĚNÝ Petr OBDRŽÁLEK Jan LANGER Alexander KNEIS Joachim ROSSMANITH Peter

  Article in Proceedings

  IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science, year: 2009

2008

• 20 years of Negami's planar cover conjecture

  HLINĚNÝ Petr

  Article in Proceedings

  20th Workshop on topological graph theory in Yokohama, year: 2008

• 20 years of Negami's planar cover conjecture

  HLINĚNÝ Petr

  Year: 2008, type: