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

2012

• Faster than Courcelle's theorem on shrubs

  HLINĚNÝ Petr GAJARSKÝ Jakub

  Year: 2012, type:

• Generalized Maneuvers in Route Planning

  HLINĚNÝ Petr MORIŠ Ondrej

  Article in Proceedings

  MEMICS 2011 Proceedings, year: 2012

• Generalized Maneuvers in Route Planning

  HLINĚNÝ Petr MORIŠ Ondrej

  Article in Periodical

  Computing and Informatics, year: 2012, volume: 31, edition: 3, DOI

• GraDR 2012 Crossing Number Workshop and Minischool

  HLINĚNÝ Petr

  Workshop

  Year: 2012, type: Workshop

• Lower Bounds on the Complexity of MSO_1 Model-Checking

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

  Article in Proceedings

  29th International Symposium on Theoretical Aspects of Computer Science STACS2012, year: 2012

• Testing Graph MSO Properties: A Fresh View

  HLINĚNÝ Petr GAJARSKÝ Jakub

  Year: 2012, type:

• Vertex insertion approximates the crossing number of apex graphs

  HLINĚNÝ Petr CHIMANI Markus MUTZEL Petra

  Article in Periodical

  European Journal of Combinatorics, year: 2012, volume: 33, edition: 3, DOI

• When Trees Grow Low: Shrubs and Fast MSO1

  GANIAN Robert HLINĚNÝ Petr OBDRŽÁLEK Jan NEŠETŘIL Jaroslav OSSONA DE MENDEZ Patrice RAMADURAI Reshma

  Article in Proceedings

  Math Foundations of Computer Science MFCS 2012, year: 2012

2011

• A Tighter Insertion-based Approximation of the Crossing Number

  CHIMANI Markus HLINĚNÝ Petr

  Article in Proceedings

  Automata, Languages and Programming 38th International Colloquium, ICALP 2011, year: 2011

• A Tighter Insertion-based Approximation of the Graph Crossing Number

  HLINĚNÝ Petr CHIMANI Markus

  Year: 2011, type: