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

Listing All Maximal k-Plexes in Temporal Graphs., , , , , and . ASONAM, page 41-46. IEEE Computer Society, (2018)Tree Containment With Soft Polytomies., and . J. Graph Algorithms Appl., 25 (1): 417-436 (2021)Towards Improving Brandes' Algorithm for Betweenness Centrality., , , , and . CoRR, (2018)Good Things Come to Those Who Swap Objects on Paths., , , and . CoRR, (2019)Parameterized Complexity of Diameter., and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 50-61. Springer, (2019)(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs., , and . CoRR, (2017)Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review., , and . J. Scheduling, 22 (1): 3-20 (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)Parameterized Complexity of Diameter., and . CoRR, (2018)Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks., , , and . ALGOSENSORS, volume 10718 of Lecture Notes in Computer Science, page 26-40. Springer, (2017)