( en | de | ru )

 

Disambiguation of "Hlinený, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
When Trees Grow Low: Shrubs and Fast MSO1.

, , , , , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 419-430. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andreas Petr

Petr Rudenko

Petr Obrdlik

Petr Hyspecký

Petr Bohata

 

Other publications of authors with the same name

Dynamic Scope-Based Dijkstra's Algorithm, and . CoRR, (2012)Simpler Self-reduction Algorithm for Matroid Path-width.. CoRR, (2016)Crossing Number Is Hard for Cubic Graphs.. MFCS, volume 3153 of Lecture Notes in Computer Science, page 772-782. Springer, (2004)When Trees Grow Low: Shrubs and Fast MSO1., , , , , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 419-430. Springer, (2012)FO Model Checking of Interval Graphs, , , , , and . Logical Methods in Computer Science, (2015)Computing the Tutte Polynomial on Graphs of Bounded Clique-Width., , and . WG, volume 3787 of Lecture Notes in Computer Science, page 59-68. Springer, (2005)New Infinite Families of Almost-Planar Crossing-Critical Graphs.. Electr. J. Comb., (2008)Strategy Synthesis in Adversarial Patrolling Games., , , , and . CoRR, (2015)Toroidal grid minors and stretch in embedded graphs., , and . J. Comb. Theory, Ser. B, (2020)Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width., , and . FSTTCS, volume 8 of LIPIcs, page 73-83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)