Author of the publication

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.

 

Other publications of authors with the same name

How not to characterize planar-emulable graphs., , , and . Adv. Appl. Math., 50 (1): 46-68 (2013)Classes and Recognition of Curve Contact Graphs, .. J. Comb. Theory, Ser. B, 74 (1): 87-103 (1998)Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width., , and . Fundam. Inform., 123 (1): 59-76 (2013)Balanced Signings and the Chromatic Number of Oriented Matroids., , and . Combinatorics, Probability & Computing, 15 (4): 523-539 (2006)Touching Graphs of Unit Balls.. Graph Drawing, volume 1353 of Lecture Notes in Computer Science, page 350-358. Springer, (1997)Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12., , , , , and . CoRR, (2019)Planar emulators conjecture is nearly true for cubic graphs., and . Eur. J. Comb., (2015)Kernelization using structural parameters on sparse graph classes., , , , , , , and . J. Comput. Syst. Sci., (2017)First order limits of sparse graphs: Plane trees and path-width., , , , , , , and . Random Struct. Algorithms, 50 (4): 612-635 (2017)Are there any good digraph width measures?, , , , , , and . J. Comb. Theory, Ser. B, (2016)