Author of the publication

Parameterized Complexity of Diameter.

, and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 50-61. Springer, (2019)

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

Parameterized Complexity of Diameter., and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 50-61. Springer, (2019)Good Things Come to Those Who Swap Objects on Paths., , , and . CoRR, (2019)Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints., , , and . COMPLEX NETWORKS (2), volume 882 of Studies in Computational Intelligence, page 494-506. Springer, (2019)Fair Short Paths in Vertex-Colored Graphs., , and . AAAI, page 12346-12354. AAAI Press, (2023)Leveraging Fixed-Parameter Tractability for Robot Inspection Planning., , , , , , , and . CoRR, (2024)Two-Sets Cut-Uncut on Planar Graphs., , , , and . ICALP, volume 297 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model., , and . IPEC, volume 285 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences., , , and . SAGT, volume 13584 of Lecture Notes in Computer Science, page 436-453. Springer, (2022)The Complexity of Gerrymandering over Graphs: Paths and Trees., , and . WG, volume 12911 of Lecture Notes in Computer Science, page 195-206. Springer, (2021)Parameterized Complexity of Min-Power Asymmetric Connectivity., , , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 85-96. Springer, (2019)