Author of the publication

Listing All Maximal k-Plexes in Temporal Graphs.

, , , , , and . ACM Journal of Experimental Algorithmics, 24 (1): 1.13:1-1.13:27 (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

Computing Maximum Matchings in Temporal Graphs., , , , and . STACS, volume 154 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Firefighting as a Strategic Game., , and . Internet Math., 12 (1-2): 101-120 (2016)Assessing the computational complexity of multilayer subgraph detection., , , , , and . Network Science, 7 (2): 215-241 (2019)The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs., , , , , and . Discret. Optim., (2018)The Complexity of Finding Temporal Separators under Waiting Time Constraints.. CoRR, (2021)Equitable scheduling on a single machine., , , , , and . J. Sched., 26 (2): 209-225 (2023)Enumerating Isolated Cliques in Temporal Networks., , and . COMPLEX NETWORKS (2), volume 882 of Studies in Computational Intelligence, page 519-531. Springer, (2019)Temporal Reachability Minimization: Delaying vs. Deleting., , and . MFCS, volume 202 of LIPIcs, page 76:1-76:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Realizing temporal transportation trees., , and . CoRR, (2024)Interference-free walks in time: temporally disjoint paths., , , , and . Auton. Agents Multi Agent Syst., 37 (1): 1 (2023)