Author of the publication

Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality.

, , and . Electron. Notes Discret. Math., (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

Interval Completion Is Fixed Parameter Tractable., , , and . SIAM J. Comput., 38 (5): 2007-2020 (2009)Generalized H-Coloring of Graphs., and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 456-466. Springer, (2000)Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs., , and . CoRR, (2019)Maximum matching width: New characterizations and a fast algorithm for dominating set., , and . Discret. Appl. Math., (2018)Tree-decompositions of small pathwidth.. Electron. Notes Discret. Math., (2001)The teaching size: computable teachers and learners for universal languages., , and . Mach. Learn., 108 (8-9): 1653-1675 (2019)Typical Sequences Revisited - Computing Width Parameters of Graphs., , and . STACS, volume 154 of LIPIcs, page 57:1-57:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width., , , and . IPEC, volume 115 of LIPIcs, page 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Independent Sets with Domination Constraints., , and . Discret. Appl. Math., 99 (1-3): 39-54 (2000)Multicoloring trees., , , , , and . Inf. Comput., 180 (2): 113-129 (2003)