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

Parameterizing Cut Sets in a Graph by the Number of Their Components., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 605-615. Springer, (2009)Minimum-Cost b-Edge Dominating Sets on Trees., , , , and . Algorithmica, 81 (1): 343-366 (2019)Shortest Reconfiguration of Perfect Matchings via Alternating Cycles., , , , and . ESA, volume 144 of LIPIcs, page 61:1-61:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Incremental Optimization of Independent Sets under Reachability Constraints., , , and . CoRR, (2018)Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams., , , , , , , , and . ACM Trans. Algorithms, 19 (1): 6:1-6:22 (January 2023)Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 105-A (9): 1211-1222 (September 2022)Swapping labeled tokens on graphs., , , , , , , , , and . Theor. Comput. Sci., (2015)Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints., , , , , , and . Algorithmica, 85 (9): 2779-2816 (September 2023)Generalized rainbow connectivity of graphs., , , and . Theor. Comput. Sci., (2014)Algorithms for gerrymandering over graphs., , , and . Theor. Comput. Sci., (2021)