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

2008

• Approaching tree-width of graphs from matroidal perspective

  HLINĚNÝ Petr

  Year: 2008, type:

• Automata Approach to Graphs of Bounded Rank-width

  HLINĚNÝ Petr GANIAN Robert

  Article in Proceedings

  International Workshop on Combinatorial Algorithms IWOCA 2008, year: 2008

• Automata Approach to Graphs of Bounded Rank-width

  HLINĚNÝ Petr GANIAN Robert

  Article in Proceedings

  Workshop MEMICS 2008, year: 2008

• Automata formalization for graphs of bounded rank-width

  GANIAN Robert HLINĚNÝ Petr

  Conference abstract

  Year: 2008, type: Conference abstract

• Finding branch-decomposition and rank-decomposition

  HLINĚNÝ Petr OUM Sang-il

  Article in Periodical

  SIAM Journal on Computing, year: 2008, volume: 38, edition: 3

• New infinite families of almost-planar crossing-critical graphs

  HLINĚNÝ Petr

  Article in Periodical

  Electronic Journal of Combinatorics, year: 2008, volume: 15, edition: 1

• Stars and Bonds in Crossing-Critical Graphs

  HLINĚNÝ Petr SALAZAR Gelasio

  Article in Periodical

  Electronic Notes in Discrete Mathematics, year: 2008, volume: 31, edition: 1

• The crossing number of a projective graph is quadratic in the face--width

  HLINĚNÝ Petr SALAZAR Gelasio GITLER Isidoro LEANOS Jesus

  Article in Periodical

  Electronic Journal of Combinatorics, year: 2008, volume: 15, edition: 1

2007

• Approximating the Crossing Number for Graphs close to "Planarity"

  HLINĚNÝ Petr

  Article in Proceedings

  Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Abstracts collection, Dagstuhl Seminar 07281, year: 2007

• Approximating the Crossing Number of Toroidal Graphs

  HLINĚNÝ Petr SALAZAR Gelasio

  Article in Proceedings

  International Symposium on Algorithms and Computation (ISAAC 2007), year: 2007