Routing Few Robots in a Crowded Network

Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; Dominik Leko; M. S. Ramanujan

doi:10.4230/LIPIcs.WADS.2025.20

Routing Few Robots in a Crowded Network

Argyrios Deligkas
, Eduard Eiben
, Robert Ganian
, Iyad Kanj
, Dominik Leko
, M. S. Ramanujan

Royal Holloway, University of London
Oesterreichische Nationalbank and Vienna University of Technology
University of Warwick

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	19th International Symposium on Algorithms and Data Structures, WADS 2025
Editors	Pat Morin, Eunjin Oh
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959773980
DOIs	https://doi.org/10.4230/LIPIcs.WADS.2025.20
State	Published - Aug 29 2025
Event	19th International Symposium on Algorithms and Data Structures, WADS 2025 - Toronto, Canada Duration: Aug 11 2025 → Aug 15 2025

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	349
ISSN (Print)	1868-8969

Conference

Conference	19th International Symposium on Algorithms and Data Structures, WADS 2025
Country/Territory	Canada
City	Toronto
Period	8/11/25 → 8/15/25

ASJC Scopus Subject Areas

Software

Keywords

graph coordinated motion planning
parameterized complexity
treedepth

Access to Document

10.4230/LIPIcs.WADS.2025.20

Cite this

Deligkas, A., Eiben, E., Ganian, R., Kanj, I., Leko, D., & Ramanujan, M. S. (2025). Routing Few Robots in a Crowded Network. In P. Morin, & E. Oh (Eds.), 19th International Symposium on Algorithms and Data Structures, WADS 2025 Article 20 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 349). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.WADS.2025.20

Routing Few Robots in a Crowded Network. / Deligkas, Argyrios; Eiben, Eduard; Ganian, Robert et al.
19th International Symposium on Algorithms and Data Structures, WADS 2025. ed. / Pat Morin; Eunjin Oh. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2025. 20 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 349).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Deligkas, A, Eiben, E, Ganian, R, Kanj, I, Leko, D & Ramanujan, MS 2025, Routing Few Robots in a Crowded Network. in P Morin & E Oh (eds), 19th International Symposium on Algorithms and Data Structures, WADS 2025., 20, Leibniz International Proceedings in Informatics, LIPIcs, vol. 349, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19th International Symposium on Algorithms and Data Structures, WADS 2025, Toronto, Canada, 8/11/25. https://doi.org/10.4230/LIPIcs.WADS.2025.20

Deligkas A, Eiben E, Ganian R, Kanj I, Leko D, Ramanujan MS. Routing Few Robots in a Crowded Network. In Morin P, Oh E, editors, 19th International Symposium on Algorithms and Data Structures, WADS 2025. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2025. 20. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.WADS.2025.20

@inproceedings{8f9df040a9d34a9bbb6ec978fe36bae7,

title = "Routing Few Robots in a Crowded Network",

keywords = "graph coordinated motion planning, parameterized complexity, treedepth",

author = "Argyrios Deligkas and Eduard Eiben and Robert Ganian and Iyad Kanj and Dominik Leko and Ramanujan, \{M. S.\}",

note = "Publisher Copyright: {\textcopyright} Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, and M. S. Ramanujan.; 19th International Symposium on Algorithms and Data Structures, WADS 2025 ; Conference date: 11-08-2025 Through 15-08-2025",

year = "2025",

month = aug,

day = "29",

doi = "10.4230/LIPIcs.WADS.2025.20",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Pat Morin and Eunjin Oh",

booktitle = "19th International Symposium on Algorithms and Data Structures, WADS 2025",

}

TY - GEN

T1 - Routing Few Robots in a Crowded Network

AU - Deligkas, Argyrios

AU - Eiben, Eduard

AU - Ganian, Robert

AU - Kanj, Iyad

AU - Leko, Dominik

AU - Ramanujan, M. S.

N1 - Publisher Copyright: © Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, and M. S. Ramanujan.

PY - 2025/8/29

Y1 - 2025/8/29

KW - graph coordinated motion planning

KW - parameterized complexity

KW - treedepth

UR - https://www.scopus.com/pages/publications/105018742204

UR - https://www.scopus.com/pages/publications/105018742204#tab=citedBy

U2 - 10.4230/LIPIcs.WADS.2025.20

DO - 10.4230/LIPIcs.WADS.2025.20

M3 - Conference contribution

AN - SCOPUS:105018742204

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 19th International Symposium on Algorithms and Data Structures, WADS 2025

A2 - Morin, Pat

A2 - Oh, Eunjin

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 19th International Symposium on Algorithms and Data Structures, WADS 2025

Y2 - 11 August 2025 through 15 August 2025

ER -

Routing Few Robots in a Crowded Network

Publication series

Conference

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Cite this