Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Shimon Kogan and Merav Parter. Towards Bypassing Lower Bounds for Graph Shortcuts. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 73:1-73:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{kogan_et_al:LIPIcs.ESA.2023.73, author = {Kogan, Shimon and Parter, Merav}, title = {{Towards Bypassing Lower Bounds for Graph Shortcuts}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {73:1--73:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.73}, URN = {urn:nbn:de:0030-drops-187264}, doi = {10.4230/LIPIcs.ESA.2023.73}, annote = {Keywords: Directed Shortcuts, Hopsets, Emulators} }
Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Giorgos Kritikakis and Ioannis G. Tollis. Fast Reachability Using DAG Decomposition. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 2:1-2:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{kritikakis_et_al:LIPIcs.SEA.2023.2, author = {Kritikakis, Giorgos and Tollis, Ioannis G.}, title = {{Fast Reachability Using DAG Decomposition}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.2}, URN = {urn:nbn:de:0030-drops-183526}, doi = {10.4230/LIPIcs.SEA.2023.2}, annote = {Keywords: graph algorithms, hierarchy, directed acyclic graphs (DAG), path/chain decomposition, transitive closure, transitive reduction, reachability, reachability indexing scheme} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Shimon Kogan and Merav Parter. New Additive Emulators. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 85:1-85:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{kogan_et_al:LIPIcs.ICALP.2023.85, author = {Kogan, Shimon and Parter, Merav}, title = {{New Additive Emulators}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {85:1--85:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.85}, URN = {urn:nbn:de:0030-drops-181377}, doi = {10.4230/LIPIcs.ICALP.2023.85}, annote = {Keywords: Spanners, Emulators, Distance Preservers} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Shimon Kogan and Merav Parter. Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 82:1-82:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kogan_et_al:LIPIcs.ICALP.2022.82, author = {Kogan, Shimon and Parter, Merav}, title = {{Beating Matrix Multiplication for n^\{1/3\}-Directed Shortcuts}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {82:1--82:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.82}, URN = {urn:nbn:de:0030-drops-164230}, doi = {10.4230/LIPIcs.ICALP.2022.82}, annote = {Keywords: Directed Shortcuts, Transitive Closure, Width} }
Feedback for Dagstuhl Publishing