Author of the publication

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

Recognizing Hyperelliptic Graphs in Polynomial Time., , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 52-64. Springer, (2018)New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors., and . STACS, volume 210 of Lecture Notes in Computer Science, page 119-129. Springer, (1986)Robust Recoverable Path Using Backup Nodes., , , , and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 95-106. Springer, (2016)On exploring always-connected temporal graphs of small pathwidth., and . Inf. Process. Lett., (2019)New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors.. GI Jahrestagung, volume 156 of Informatik-Fachberichte, page 82-88. Springer, (1987)Subgraph Isomorphism on Graph Classes that Exclude a Substructure., , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 87-98. Springer, (2019)Definability Equals Recognizability for k-Outerplanar Graphs., and . IPEC, volume 43 of LIPIcs, page 175-186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The algorithmic theory of treewidth.. Electron. Notes Discret. Math., (2000)Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality., , and . Electron. Notes Discret. Math., (2015)The Classification of Coverings of Processor Networks.. J. Parallel Distributed Comput., 6 (1): 166-182 (1989)