@inproceedings{DBLP:conf/ciac/FoersterGHKSW17,
  author    = {Klaus{-}Tycho Foerster and
               Linus Groner and
               Torsten Hoefler and
               Michael K{\"{o}}nig and
               Sascha Schmid and
               Roger Wattenhofer},
  editor    = {Dimitris Fotakis and
               Aris Pagourtzis and
               Vangelis Th. Paschos},
  title     = {Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial
               Classification and Tight Algorithmic Bounds},
  booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
               2017, Athens, Greece, May 24-26, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10236},
  pages     = {247--259},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-57586-5\_21},
  doi       = {10.1007/978-3-319-57586-5\_21},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl    = {https://dblp.org/rec/conf/ciac/FoersterGHKSW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"xgnfBD3skrJBMXoZy","bibbaseid":"foerster-groner-hoefler-knig-schmid-wattenhofer-multiagentpathfindingwithnagentsongraphswithnverticescombinatorialclassificationandtightalgorithmicbounds-2017","authorIDs":[],"author_short":["Foerster, K.","Groner, L.","Hoefler, T.","König, M.","Schmid, S.","Wattenhofer, R."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Klaus-Tycho"],"propositions":[],"lastnames":["Foerster"],"suffixes":[]},{"firstnames":["Linus"],"propositions":[],"lastnames":["Groner"],"suffixes":[]},{"firstnames":["Torsten"],"propositions":[],"lastnames":["Hoefler"],"suffixes":[]},{"firstnames":["Michael"],"propositions":[],"lastnames":["König"],"suffixes":[]},{"firstnames":["Sascha"],"propositions":[],"lastnames":["Schmid"],"suffixes":[]},{"firstnames":["Roger"],"propositions":[],"lastnames":["Wattenhofer"],"suffixes":[]}],"editor":[{"firstnames":["Dimitris"],"propositions":[],"lastnames":["Fotakis"],"suffixes":[]},{"firstnames":["Aris"],"propositions":[],"lastnames":["Pagourtzis"],"suffixes":[]},{"firstnames":["Vangelis","Th."],"propositions":[],"lastnames":["Paschos"],"suffixes":[]}],"title":"Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds","booktitle":"Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings","series":"Lecture Notes in Computer Science","volume":"10236","pages":"247–259","year":"2017","url":"https://doi.org/10.1007/978-3-319-57586-5_21","doi":"10.1007/978-3-319-57586-5_21","timestamp":"Tue, 14 May 2019 10:00:53 +0200","biburl":"https://dblp.org/rec/conf/ciac/FoersterGHKSW17.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/ciac/FoersterGHKSW17,\n author = {Klaus{-}Tycho Foerster and\n Linus Groner and\n Torsten Hoefler and\n Michael K{\\\"{o}}nig and\n Sascha Schmid and\n Roger Wattenhofer},\n editor = {Dimitris Fotakis and\n Aris Pagourtzis and\n Vangelis Th. Paschos},\n title = {Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial\n Classification and Tight Algorithmic Bounds},\n booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}\n 2017, Athens, Greece, May 24-26, 2017, Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {10236},\n pages = {247--259},\n year = {2017},\n url = {https://doi.org/10.1007/978-3-319-57586-5\\_21},\n doi = {10.1007/978-3-319-57586-5\\_21},\n timestamp = {Tue, 14 May 2019 10:00:53 +0200},\n biburl = {https://dblp.org/rec/conf/ciac/FoersterGHKSW17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Foerster, K.","Groner, L.","Hoefler, T.","König, M.","Schmid, S.","Wattenhofer, R."],"editor_short":["Fotakis, D.","Pagourtzis, A.","Paschos, V. T."],"key":"DBLP:conf/ciac/FoersterGHKSW17","id":"DBLP:conf/ciac/FoersterGHKSW17","bibbaseid":"foerster-groner-hoefler-knig-schmid-wattenhofer-multiagentpathfindingwithnagentsongraphswithnverticescombinatorialclassificationandtightalgorithmicbounds-2017","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-319-57586-5_21"},"downloads":0},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/w/RogerWattenhofer.bib","creationDate":"2020-09-29T17:54:13.110Z","downloads":0,"keywords":[],"search_terms":["multi","agent","pathfinding","agents","graphs","vertices","combinatorial","classification","tight","algorithmic","bounds","foerster","groner","hoefler","könig","schmid","wattenhofer"],"title":"Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds","year":2017,"dataSources":["sBqdbkxTbPrBCJtZ9"]}