Published in: OASIcs, Volume 65, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
René van Bevern, Till Fluschnik, and Oxana Yu. Tsidulko. Parameterized Algorithms and Data Reduction for Safe Convoy Routing. In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018). Open Access Series in Informatics (OASIcs), Volume 65, pp. 10:1-10:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{vanbevern_et_al:OASIcs.ATMOS.2018.10, author = {van Bevern, Ren\'{e} and Fluschnik, Till and Tsidulko, Oxana Yu.}, title = {{Parameterized Algorithms and Data Reduction for Safe Convoy Routing}}, booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)}, pages = {10:1--10:19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-096-5}, ISSN = {2190-6807}, year = {2018}, volume = {65}, editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.10}, URN = {urn:nbn:de:0030-drops-97157}, doi = {10.4230/OASIcs.ATMOS.2018.10}, annote = {Keywords: NP-hard problem, fixed-parameter tractability, problem kernelization, shortest path, secluded solution} }
Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, and Ondrej Suchý. Finding Secluded Places of Special Interest in Graphs. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 5:1-5:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{vanbevern_et_al:LIPIcs.IPEC.2016.5, author = {van Bevern, Ren\'{e} and Fluschnik, Till and Mertzios, George B. and Molter, Hendrik and Sorge, Manuel and Such\'{y}, Ondrej}, title = {{Finding Secluded Places of Special Interest in Graphs}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-023-1}, ISSN = {1868-8969}, year = {2017}, volume = {63}, editor = {Guo, Jiong and Hermelin, Danny}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.5}, URN = {urn:nbn:de:0030-drops-69380}, doi = {10.4230/LIPIcs.IPEC.2016.5}, annote = {Keywords: Neighborhood, Feedback Vertex Set, Vertex Deletion, Separator, Dominating Set} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
René van Bevern, Christian Komusiewicz, and Manuel Sorge. Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 130-143, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{vanbevern_et_al:OASIcs.ATMOS.2015.130, author = {van Bevern, Ren\'{e} and Komusiewicz, Christian and Sorge, Manuel}, title = {{Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {130--143}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.130}, URN = {urn:nbn:de:0030-drops-54575}, doi = {10.4230/OASIcs.ATMOS.2015.130}, annote = {Keywords: vehicle routing, transportation, Rural Postman, Chinese Postman, NP- hard problem, parameterized algorithm, combinatorial optimization} }
Feedback for Dagstuhl Publishing