No. Title Author Year
1 Algorithmic Aspects of Large and Complex Networks (Dagstuhl Seminar 01381) Adler, Micah et al. 2021
2 Algorithmic Aspects of Large and Complex Networks (Dagstuhl Seminar 03361) Adler, Micah et al. 2021
3 Combinatorial Methods for Integrated Circuits Design (Dagstuhl Seminar 9342) Lengauer, Thomas et al. 2021
4 Graph Algorithms and Applications (Dagstuhl Seminar 9620) Nishizeki, Takao et al. 2021
5 Graph Algorithms and Applications (Dagstuhl Seminar 98301) Nishizeki, Takao et al. 2021
6 Link Analysis and Visualization (Dagstuhl Seminar 01271) Brandes, Ulrik et al. 2021
7 Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications Buchhold, Valentin et al. 2021
8 Advanced Flow-Based Multilevel Hypergraph Partitioning Gottesbüren, Lars et al. 2020
9 An Efficient Solution for One-To-Many Multi-Modal Journey Planning Sauer, Jonas et al. 2020
10 Customizable Contraction Hierarchies with Turn Costs Buchhold, Valentin et al. 2020
11 Engineering Exact Quasi-Threshold Editing Gottesbüren, Lars et al. 2020
12 Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA Sauer, Jonas et al. 2020
13 Integrating ULTRA and Trip-Based Routing Sauer, Jonas et al. 2020
14 Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks Strasser, Ben et al. 2020
15 Zipping Segment Trees Barth, Lukas et al. 2020
16 Engineering Negative Cycle Canceling for Wind Farm Cabling Gritzbach, Sascha et al. 2019
17 Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm Gottesbüren, Lars et al. 2019
18 UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution Baum, Moritz et al. 2019
19 Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades Carstens, Corrie Jacobien et al. 2018
20 Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies Buchhold, Valentin et al. 2018
21 Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications Baum, Moritz et al. 2017
22 Efficient Traffic Assignment for Public Transit Networks Briem, Lars et al. 2017
23 Improved Oracles for Time-Dependent Road Networks Kontogiannis, Spyros et al. 2017
24 Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles Baum, Moritz et al. 2017
25 Public Transit Routing with Unrestricted Walking Wagner, Dorothea et al. 2017
26 Algorithmic Methods for Optimization in Public Transport (Dagstuhl Seminar 16171) Kroon, Leo G. et al. 2016
27 Hierarchical Time-Dependent Oracles Kontogiannis, Spyros et al. 2016
28 Towards Realistic Pedestrian Route Planning Andreev, Simeon et al. 2015
29 Algorithm Engineering (Dagstuhl Seminar 13391) Goldberg, Andrew V. et al. 2014
30 Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time Dibbelt, Julian et al. 2014
Current Page :
Number of result pages: 2
Number of documents: 44


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI