Author of the publication

The Ackermann Award 2015.

, , and . CSL, volume 41 of LIPIcs, page xv-xviii. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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

Bounded degree and planar spectra., and . CoRR, (2016)Constructing Hard Examples for Graph Isomorphism., and . J. Graph Algorithms Appl., 23 (2): 293-316 (2019)Logical properties of random graphs from small addable classes., and . Log. Methods Comput. Sci., (2019)Fixed-parameter Tractable Distances to Sparse Graph Classes., and . IPEC, volume 43 of LIPIcs, page 236-247. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The Complexity of Satisfaction on Sparse Graphs.. IPEC, volume 6478 of Lecture Notes in Computer Science, page 1-2. Springer, (2010)Separating Graph Logic from MSO., and . FoSSaCS, volume 5504 of Lecture Notes in Computer Science, page 63-77. Springer, (2009)Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers., and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 67-78. Springer, (2012)Parameterized Complexity Classes under Logical Reductions., and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 258-269. Springer, (2009)On the Bisimulation Invariant Fragment of Monadic S1 in the Finite., and . FSTTCS, volume 3328 of Lecture Notes in Computer Science, page 224-236. Springer, (2004)Symmetric Arithmetic Circuits., and . ICALP, volume 168 of LIPIcs, page 36:1-36:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)