PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Hlinený, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
Kernelization Using Structural Parameters on Sparse Graph Classes.

, , , , , , , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 529-540. Springer, (2013)

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.

Dr. rer. nat. Petr Siyushev University of Stuttgart

Dr. rer. pol. Dimitri Petrik University of Stuttgart

Jona Petri University of Stuttgart

Dr. Taras Petrenko University of Stuttgart

Aleko Petrov

 

Other publications of authors with the same name

How not to characterize planar-emulable graphs., , , and . Adv. Appl. Math., 50 (1): 46-68 (2013)Are there any good digraph width measures?, , , , , , and . J. Comb. Theory, Ser. B, (2016)Width Parameters Beyond Tree-width and their Applications., , , and . Comput. J., 51 (3): 326-362 (2008)Faster Existential FO Model Checking on Posets., , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 441-451. Springer, (2014)On Hardness of the Joint Crossing Number., and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 603-613. Springer, (2015)Touching Graphs of Unit Balls.. Graph Drawing, volume 1353 of Lecture Notes in Computer Science, page 350-358. Springer, (1997)Kernelization using structural parameters on sparse graph classes., , , , , , , and . J. Comput. Syst. Sci., (2017)Planar emulators conjecture is nearly true for cubic graphs., and . Eur. J. Comb., (2015)Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12., , , , , and . CoRR, (2019)First order limits of sparse graphs: Plane trees and path-width., , , , , , , and . Random Struct. Algorithms, 50 (4): 612-635 (2017)