Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, and Dorothea Wagner. Towards Realistic Pedestrian Route Planning. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{andreev_et_al:OASIcs.ATMOS.2015.1, author = {Andreev, Simeon and Dibbelt, Julian and N\"{o}llenburg, Martin and Pajor, Thomas and Wagner, Dorothea}, title = {{Towards Realistic Pedestrian Route Planning}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {1--15}, 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-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.1}, URN = {urn:nbn:de:0030-drops-54592}, doi = {10.4230/OASIcs.ATMOS.2015.1}, annote = {Keywords: pedestrian routing, realistic model, shortest paths, speed-up technique} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Moritz Baum, Julian Dibbelt, Lorenz Hübschle-Schneider, Thomas Pajor, and Dorothea Wagner. Speed-Consumption Tradeoff for Electric Vehicle Route Planning. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 138-151, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{baum_et_al:OASIcs.ATMOS.2014.138, author = {Baum, Moritz and Dibbelt, Julian and H\"{u}bschle-Schneider, Lorenz and Pajor, Thomas and Wagner, Dorothea}, title = {{Speed-Consumption Tradeoff for Electric Vehicle Route Planning}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {138--151}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.138}, URN = {urn:nbn:de:0030-drops-47583}, doi = {10.4230/OASIcs.ATMOS.2014.138}, annote = {Keywords: electric vehicles, shortest paths, route planning, bicriteria optimization, algorithm engineering} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Bireswar Das, Jacobo Torán, and Fabian Wagner. Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 227-238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{das_et_al:LIPIcs.STACS.2010.2457, author = {Das, Bireswar and Tor\'{a}n, Jacobo and Wagner, Fabian}, title = {{Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {227--238}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2457}, URN = {urn:nbn:de:0030-drops-24570}, doi = {10.4230/LIPIcs.STACS.2010.2457}, annote = {Keywords: Complexity, Algorithms, Graph Isomorphism Problem, Treewidth, LogCFL} }
Published in: Dagstuhl Seminar Proceedings, Volume 9421, Algebraic Methods in Computational Complexity (2010)
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner. Planar Graph Isomorphism is in Log-Space. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 9421, pp. 1-32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{datta_et_al:DagSemProc.09421.6, author = {Datta, Samir and Limaye, Nutan and Nimbhorkar, Prajakta and Thierauf, Thomas and Wagner, Fabian}, title = {{Planar Graph Isomorphism is in Log-Space}}, booktitle = {Algebraic Methods in Computational Complexity}, pages = {1--32}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9421}, editor = {Manindra Agrawal and Lance Fortnow and Thomas Thierauf and Christopher Umans}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09421.6}, URN = {urn:nbn:de:0030-drops-24169}, doi = {10.4230/DagSemProc.09421.6}, annote = {Keywords: Planar Graphs, Graph Isomorphism, Logspace} }
Published in: LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)
Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner. Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 145-156, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{datta_et_al:LIPIcs.FSTTCS.2009.2314, author = {Datta, Samir and Nimbhorkar, Prajakta and Thierauf, Thomas and Wagner, Fabian}, title = {{Graph Isomorphism for K\underline\{3,3\}-free and K\underline5-free graphs is in Log-space}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {145--156}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2314}, URN = {urn:nbn:de:0030-drops-23144}, doi = {10.4230/LIPIcs.FSTTCS.2009.2314}, annote = {Keywords: Graph isomorphism, K\underline\{3,3\}-free graphs, K\underline5-free graphs, log-space} }
Published in: OASIcs, Volume 12, 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (2009)
Daniel Delling, Thomas Pajor, Dorothea Wagner, and Christos Zaroliagis. Efficient Route Planning in Flight Networks. In 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09). Open Access Series in Informatics (OASIcs), Volume 12, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{delling_et_al:OASIcs.ATMOS.2009.2145, author = {Delling, Daniel and Pajor, Thomas and Wagner, Dorothea and Zaroliagis, Christos}, title = {{Efficient Route Planning in Flight Networks}}, booktitle = {9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}, pages = {1--17}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-11-8}, ISSN = {2190-6807}, year = {2009}, volume = {12}, editor = {Clausen, Jens and Di Stefano, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2145}, URN = {urn:nbn:de:0030-drops-21450}, doi = {10.4230/OASIcs.ATMOS.2009.2145}, annote = {Keywords: Timetable information, flight modeling, shortest paths, multi criteria, table lookups Timetable information, flight modeling, shortest paths, multi criteria, table lookups} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Peter Hertling, Victor Selivanov, Wolfgang Thomas, William W. Wadge, and Klaus Wagner. 08271 Abstracts Collection – Topological and Game-Theoretic Aspects of Infinite Computations. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{hertling_et_al:DagSemProc.08271.1, author = {Hertling, Peter and Selivanov, Victor and Thomas, Wolfgang and Wadge, William W. and Wagner, Klaus}, title = {{08271 Abstracts Collection – Topological and Game-Theoretic Aspects of Infinite Computations}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.1}, URN = {urn:nbn:de:0030-drops-16555}, doi = {10.4230/DagSemProc.08271.1}, annote = {Keywords: Automata theory, computability in analysis, dataflow computation, hierarchies, infinite computations, infinite games, reactive systems, specification and verification, topological complexity, Wadge reducibility} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Peter Hertling, Victor Selivanov, Wolfgang Thomas, William W. Wadge, and Klaus Wagner. 08271 Executive Summary – Topological and Game-Theoretic Aspects of Infinite Computations. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{hertling_et_al:DagSemProc.08271.2, author = {Hertling, Peter and Selivanov, Victor and Thomas, Wolfgang and Wadge, William W. and Wagner, Klaus}, title = {{08271 Executive Summary – Topological and Game-Theoretic Aspects of Infinite Computations}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.2}, URN = {urn:nbn:de:0030-drops-16499}, doi = {10.4230/DagSemProc.08271.2}, annote = {Keywords: Automata theory, computability in analysis, dataflow computation, hierarchies, infinite computations, infinite games, reactive systems, specification} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
John Plaice and Blanca Mancilla. Cartesian Programming: The TransLucid Programming Language. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{plaice_et_al:DagSemProc.08271.3, author = {Plaice, John and Mancilla, Blanca}, title = {{Cartesian Programming: The TransLucid Programming Language}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.3}, URN = {urn:nbn:de:0030-drops-16546}, doi = {10.4230/DagSemProc.08271.3}, annote = {Keywords: Cartesian programming, Lucid language, declarative programming, multidimensional programming, context-aware programming, semantics.} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Blanca Mancilla and John Plaice. Declarative Synchronous Multithreaded Programming. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{mancilla_et_al:DagSemProc.08271.4, author = {Mancilla, Blanca and Plaice, John}, title = {{Declarative Synchronous Multithreaded Programming}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--6}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.4}, URN = {urn:nbn:de:0030-drops-16536}, doi = {10.4230/DagSemProc.08271.4}, annote = {Keywords: Synchronous programming, distributed computing, declarative programming, Cartesian programming, multidimensional programming.} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Chrysida Galanaki, Panos Rondogiannis, and William W. Wadge. General Logic Programs as Infinite Games. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{galanaki_et_al:DagSemProc.08271.5, author = {Galanaki, Chrysida and Rondogiannis, Panos and Wadge, William W.}, title = {{General Logic Programs as Infinite Games}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.5}, URN = {urn:nbn:de:0030-drops-16519}, doi = {10.4230/DagSemProc.08271.5}, annote = {Keywords: Infinite Games, Negation in Logic Programming, Well-Founded Semantics} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Vassilis Kountouriotis, Christos Nomikos, and Panos Rondogiannis. On the Semantic Approaches to Boolean Grammars. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{kountouriotis_et_al:DagSemProc.08271.6, author = {Kountouriotis, Vassilis and Nomikos, Christos and Rondogiannis, Panos}, title = {{On the Semantic Approaches to Boolean Grammars}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.6}, URN = {urn:nbn:de:0030-drops-16527}, doi = {10.4230/DagSemProc.08271.6}, annote = {Keywords: Boolean Grammars, Negation in Formal Grammars, Well-Founded Semantics} }
Published in: Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Olivier Finkel and Dominique Lecomte. Topological Complexity of omega-Powers: Extended Abstract. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{finkel_et_al:DagSemProc.08271.7, author = {Finkel, Olivier and Lecomte, Dominique}, title = {{Topological Complexity of omega-Powers: Extended Abstract}}, booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8271}, editor = {Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.7}, URN = {urn:nbn:de:0030-drops-16505}, doi = {10.4230/DagSemProc.08271.7}, annote = {Keywords: Infinite words, omega-languages, omega-powers, Cantor topology, topological complexity, Borel sets, Borel ranks, complete sets, Wadge hierarchy, Wadge} }
Published in: Dagstuhl Seminar Proceedings, Volume 8091, Logic and Probability for Scene Interpretation (2008)
Carsten Elfers, Otthein Herzog, Andrea Miene, and Thomas Wagner. Qualitative Abstraction and Inherent Uncertainty in Scene Recognition. In Logic and Probability for Scene Interpretation. Dagstuhl Seminar Proceedings, Volume 8091, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{elfers_et_al:DagSemProc.08091.11, author = {Elfers, Carsten and Herzog, Otthein and Miene, Andrea and Wagner, Thomas}, title = {{Qualitative Abstraction and Inherent Uncertainty in Scene Recognition}}, booktitle = {Logic and Probability for Scene Interpretation}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8091}, editor = {Anthony G. Cohn and David C. Hogg and Ralf M\"{o}ller and Bernd Neumann}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08091.11}, URN = {urn:nbn:de:0030-drops-16141}, doi = {10.4230/DagSemProc.08091.11}, annote = {Keywords: Scene interpretation, intentional agents, uncertainty, qualitative abstraction, coherence-based perception, abduction, RHMM} }
Published in: OASIcs, Volume 9, 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08) (2008)
Daniel Delling, Thomas Pajor, and Dorothea Wagner. Engineering Time-Expanded Graphs for Faster Timetable Information. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08). Open Access Series in Informatics (OASIcs), Volume 9, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{delling_et_al:OASIcs.ATMOS.2008.1582, author = {Delling, Daniel and Pajor, Thomas and Wagner, Dorothea}, title = {{Engineering Time-Expanded Graphs for Faster Timetable Information}}, booktitle = {8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)}, pages = {1--20}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-07-1}, ISSN = {2190-6807}, year = {2008}, volume = {9}, editor = {Fischetti, Matteo and Widmayer, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2008.1582}, URN = {urn:nbn:de:0030-drops-15826}, doi = {10.4230/OASIcs.ATMOS.2008.1582}, annote = {Keywords: Timetable information, shortest path, modeling} }
Feedback for Dagstuhl Publishing