Author of the publication

Minimizing Reachability Times on Temporal Graphs via Shifting Labels.

, , and . IJCAI, page 5333-5340. ijcai.org, (2023)

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

Valued Authorization Policy Existence Problem: Theory and Experiments., , , , and . ACM Trans. Priv. Secur., 25 (4): 28:1-28:32 (2022)Complexity of the Steiner Network Problem with Respect to the Number of Terminals., , , and . CoRR, (2018)On the Complexity of Rainbow Coloring Problems., , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 209-220. Springer, (2015)How to Navigate Through Obstacles?., and . ICALP, volume 107 of LIPIcs, page 48:1-48:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Polynomial Kernel for Line Graph Deletion., and . ESA, volume 173 of LIPIcs, page 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Manipulating Districts to Win Elections: Fine-Grained Complexity., , , and . AAAI, page 1902-1909. AAAI Press, (2020)The Complexity of Fair Division of Indivisible Items with Externalities., , , and . AAAI, page 9653-9661. AAAI Press, (2024)Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems., , , , and . IJCAI, page 2642-2650. ijcai.org, (2023)A Polynomial Kernel for Paw-Free Editing., , and . IPEC, volume 180 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Component Order Connectivity in Directed Graphs., , , , and . IPEC, volume 180 of LIPIcs, page 2:1-2:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)