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

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints., , , , , , and . Algorithmica, 85 (9): 2779-2816 (September 2023)Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings., , and . WG, volume 13453 of Lecture Notes in Computer Science, page 342-355. Springer, (2022)Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application., , , and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 347-359. Springer, (2012)Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth., , , , and . IWOCA, volume 10979 of Lecture Notes in Computer Science, page 201-213. Springer, (2018)On Maximal Cliques with Connectivity Constraints in Directed Graphs., , , and . ISAAC, volume 92 of LIPIcs, page 23:1-23:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy., and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 35-45. Springer, (2018)Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph., , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 94-102. Springer, (2014)The Perfect Matching Reconfiguration Problem., , , , , , , and . MFCS, volume 138 of LIPIcs, page 80:1-80:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Reconfiguration of Spanning Trees with Many or Few Leaves., , , , , , and . ESA, volume 173 of LIPIcs, page 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Polynomial-Delay Enumeration of Large Maximal Matchings., , and . CoRR, (2021)