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

Optimizing Reachability Sets in Temporal Graphs by Delaying., and . AAAI, page 9810-9817. AAAI Press, (2020)Heterogeneous Facility Location Games., and . AAMAS, page 623-631. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Minimizing Reachability Times on Temporal Graphs via Shifting Labels., , and . IJCAI, page 5333-5340. ijcai.org, (2023)Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games.. University of Liverpool, UK, (2016)British Library, EThOS.Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem., , , and . ICALP, volume 132 of LIPIcs, page 138:1-138:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Directed Graph Minors and Serial-Parallel Width., and . MFCS, volume 117 of LIPIcs, page 44:1-44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents., , and . CoRR, (2020)Pizza Sharing Is PPA-Hard., , and . AAAI, page 4957-4965. AAAI Press, (2022)Tight Inapproximability for Graphical Games., , , and . AAAI, page 5600-5607. AAAI Press, (2023)Constant inapproximability for PPA., , , and . STOC, page 1010-1023. ACM, (2022)