default search action
Sabine Storandt
Person information
- affiliation: University of Konstanz, Germany
- affiliation (former): Universität Würzburg, Germany
- affiliation (former): Universität Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c91]Justine Cauvi, Ruoying Li, Sabine Storandt:
Landmark Hub Labeling: Improved Bounds and Faster Query Answering. ATMOS 2024: 1:1-1:17 - [c90]Sabine Storandt:
Scalable Landmark Hub Labeling for Optimal and Bounded Suboptimal Pathfinding. IJCAI 2024: 6788-6795 - [c89]Stefan Funke, Sabine Storandt:
Parameterized Upper Bounds for Path-Consistent Hub Labeling. IWOCA 2024: 446-459 - [c88]Nikolas Alexander Schwarz
, Sabine Storandt:
Efficient Computation of Crossing Components and Shortcut Hulls. IWOCA 2024: 509-522 - [c87]Lukas Berner, Johannes Erwerle, Stefan Funke, Claudius Proissl, Florian Rieg, Sabine Storandt:
Improved Lightweight Rendering of Road Networks based on Contraction Hierarchies. PacificVis 2024: 202-211 - [c86]Stefan Funke, Sabine Storandt:
Smooth Building Footprint Aggregation with Alpha Shapes. W2GIS 2024: 117-129 - [c85]Ruoying Li
Exact and Approximate Hierarchical Hub Labeling. WALCOM 2024: 194-211 - [c84]Nick Krumbholz, Stefan Funke, Peter Schäfer, Sabine Storandt:
Algorithms for Gradual Polyline Simplification. SEA 2024: 19:1-19:18 - [i6]Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel:
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms. CoRR abs/2409.10232 (2024) - 2023
- [j11]Patrick Paetzold
RectEuler: Visualizing Intersecting Sets using Rectangles. Comput. Graph. Forum 42(3): 87-98 (2023) - [j10]Moritz Beck, Kam-Yiu Lam, Joseph Kee-Yin Ng, Sabine Storandt, Chun Jiang Zhu
Concatenated k-path covers. Int. J. Comput. Math. Comput. Syst. Theory 8(1): 32-56 (2023) - [j9]Peter Schäfer, Nils Rodrigues, Daniel Weiskopf
Group Diagrams for simplified representation of scanpaths. J. Vis. 26(5): 1173-1187 (2023) - [c83]Johannes Blum, Ruoying Li
Convexity Hierarchies in Grid Networks. ICAPS 2023: 52-60 - [c82]Timon Behr, Sabine Storandt:
Lossy Reduction Rules for the Directed Feedback Vertex Set Problem. ALENEX 2023: 53-64 - [c81]Moritz Beck, Joachim Spoerhase, Sabine Storandt:
Mind the Gap: Edge Facility Location Problems in Theory and Practice. CALDAM 2023: 321-334 - [c80]Peter Schäfer, Sabine Storandt, Johannes Zink:
Optimal Polyline Simplification under the Local Fréchet Distance in 2D in (Near-)Quadratic Time. CCCG 2023: 225-238 - [c79]Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel
Pareto Sums of Pareto Sets. ESA 2023: 60:1-60:17 - 2022
- [j8]Johannes Blum
Fission: Practical algorithms for computing minimum balanced node separators. Discret. Math. Algorithms Appl. 14(8): 2250048:1-2250048:26 (2022) - [j7]Ying Zhang, Karsten Klein, Oliver Deussen, Theodor Gutschlag, Sabine Storandt:
Robust visualization of trajectory data. it Inf. Technol. 64(4-5): 181-191 (2022) - [c78]Sabine Storandt:
Bounds and Algorithms for Geodetic Hulls. CALDAM 2022: 181-194 - [c77]Johannes Blum
Customizable Hub Labeling: Properties and Algorithms. COCOON 2022: 345-356 - [c76]Theodor Gutschlag, Sabine Storandt:
On the generalized fréchet distance and its applications. SIGSPATIAL/GIS 2022: 35:1-35:10 - [c75]Lukas Baur
Gradual road network simplification with shape and topology preservation. SIGSPATIAL/GIS 2022: 52:1-52:4 - [c74]Sabine Storandt:
Algorithms for Landmark Hub Labeling. ISAAC 2022: 5:1-5:17 - [c73]Peter Schäfer, Nils Rodrigues, Daniel Weiskopf
Group Diagrams for Simplified Representation of Scanpaths. VINCI 2022: 7:1-7:8 - [e6]Farid Karimipour
Web and Wireless Geographical Information Systems - 19th International Symposium, W2GIS 2022, Constance, Germany, April 28-29, 2022, Proceedings. Lecture Notes in Computer Science 13238, Springer 2022, ISBN 978-3-031-06244-5 [contents] - [i5]Sabine Storandt, Johannes Zink:
Polyline Simplification under the Local Fréchet Distance has Subcubic Complexity in 2D. CoRR abs/2201.01344 (2022) - [i4]Johannes Blum, Sabine Storandt:
Customizable Hub Labeling: Properties and Algorithms. CoRR abs/2208.08709 (2022) - 2021
- [j6]Johannes Blum
Sublinear search spaces for shortest path planning in grid and road networks. J. Comb. Optim. 42(2): 231-257 (2021) - [c72]Yannick Bosch
Consistent Simplification of Polyline Tree Bundles. COCOON 2021: 231-243 - [c71]Ruoying Li
Barrier-Free Pedestrian Routing with Contraction Hierarchies. SIGSPATIAL/GIS 2021: 668-669 - [c70]Timon Behr, Thomas C. van Dijk, Axel Forsch, Jan-Henrik Haunert
Map Matching for Semi-Restricted Trajectories. GIScience (II) 2021: 12:1-12:16 - [c69]Tenindra Abeywickrama
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract). IJCAI 2021: 4730-4734 - [c68]Hannah Bast, Patrick Brosi, Sabine Storandt:
Metro Maps on Flexible Base Grids. SSTD 2021: 12-22 - [e5]Martin Farach-Colton, Sabine Storandt:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021. SIAM 2021, ISBN 978-1-61197-647-2 [contents] - [i3]Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Consistent Simplification of Polyline Tree Bundles. CoRR abs/2108.10790 (2021) - 2020
- [j5]Hannah Bast, Patrick Brosi, Sabine Storandt:
Metro Maps on Octilinear Grid Graphs. Comput. Graph. Forum 39(3): 357-367 (2020) - [c67]Tenindra Abeywickrama, Muhammad Aamir Cheema, Sabine Storandt:
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks. ICAPS 2020: 2-10 - [c66]Moritz Beck, Sabine Storandt:
Puzzling Grid Embeddings. ALENEX 2020: 94-105 - [c65]Mike Timm, Sabine Storandt:
On the Multi-Kind BahnCard Problem. ATMOS 2020: 2:1-2:13 - [c64]Johannes Blum
FISSION: A Practical Algorithm for Computing Minimum Balanced Node Separators. COCOA 2020: 817-832 - [c63]Johannes Blum
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies. ESA 2020: 20:1-20:14 - [c62]Joachim Spoerhase
Simplification of Polyline Bundles. SWAT 2020: 35:1-35:20 - [c61]Toni Stankov, Sabine Storandt:
Maximum Gap Minimization in Polylines. W2GIS 2020: 181-196
2010 – 2019
- 2019
- [j4]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient Generation of Geographically Accurate Transit Maps. ACM Trans. Spatial Algorithms Syst. 5(4): 25:1-25:36 (2019) - [c60]Sabine Storandt, Stefan Funke:
Algorithms for Average Regret Minimization. AAAI 2019: 1600-1607 - [c59]Fabian Feitsch, Sabine Storandt:
The Clustered Dial-a-Ride Problem. ICAPS 2019: 510-518 - [c58]Florian Barth
Alternative Multicriteria Routes. ALENEX 2019: 66-80 - [c57]Moritz Beck, Kam-yiu Lam, Joseph Kee-Yin Ng, Sabine Storandt, Chun Jiang Zhu
Concatenated k-Path Covers. ALENEX 2019: 81-91 - [c56]Stefan Funke, Sabine Storandt:
Parametrized Runtimes for Label Tournaments. COCOA 2019: 181-196 - [c55]Stefan Funke, Sabine Storandt:
A Repository of Network-Constrained Trajectory Data (Position Paper). MOVE++@SIGSPATIAL 2019: 5:1-5:4 - [c54]Chun Jiang Zhu, Sabine Storandt, Kam-yiu Lam, Song Han, Jinbo Bi:
Improved Dynamic Graph Learning through Fault-Tolerant Sparsification. ICML 2019: 7624-7633 - [c53]Sabine Storandt, Stefan Funke:
Algorithms for Average Regret Minimization. SOCS 2019: 198-199 - [c52]Stefan Funke, Tobias Rupp, André Nusser, Sabine Storandt:
PATHFINDER: Storage and Indexing of Massive Trajectory Sets. SSTD 2019: 90-99 - [e4]Yukiko Kawai, Sabine Storandt, Kazutoshi Sumiya:
Web and Wireless Geographical Information Systems - 17th International Symposium, W2GIS 2019, Kyoto, Japan, May 16-17, 2019, Proceedings. Lecture Notes in Computer Science 11474, Springer 2019, ISBN 978-3-030-17245-9 [contents] - [i2]Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Simplification of Polyline Bundles. CoRR abs/1907.05296 (2019) - 2018
- [c51]Johannes Blum, Stefan Funke, Sabine Storandt:
Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks. AAAI 2018: 6119-6126 - [c50]Johannes Blum, Sabine Storandt:
Scalability of Route Planning Techniques. ICAPS 2018: 20-28 - [c49]Johannes Blum, Sabine Storandt:
Computation and Growth of Road Network Dimensions. COCOON 2018: 230-241 - [c48]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient generation of geographically accurate transit maps. SIGSPATIAL/GIS 2018: 13-22 - [c47]Sabine Storandt:
Sensible edge weight rounding for realistic path planning. SIGSPATIAL/GIS 2018: 89-98 - [c46]Florian Barth
CYCLOPS: CYCLe route options planning service. SIGSPATIAL/GIS 2018: 576-579 - [c45]Moritz Beck, Sabine Storandt:
Minimum Polygons for Fixed Visibility VC-Dimension. IWOCA 2018: 65-77 - [c44]Sabine Storandt:
Region-Aware Route Planning. W2GIS 2018: 101-117 - [e3]Ralf Borndörfer, Sabine Storandt:
18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2018, August 23-24, 2018, Helsinki, Finland. OASIcs 65, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-096-5 [contents] - [e2]Gautam S. Thakur, Sabine Storandt:
Proceedings of the 11th ACM SIGSPATIAL International Workshop on Computational Transportation Science, IWCTS@SIGSPATIAL 2018, Seattle, WA, USA, November 6, 2018. ACM 2018, ISBN 978-1-4503-6037-1 [contents] - [e1]Vadim Bulitko, Sabine Storandt:
Proceedings of the Eleventh International Symposium on Combinatorial Search, SOCS 2018, Stockholm, Sweden - 14-15 July 2018. AAAI Press 2018, ISBN 978-1-57735-802-2 [contents] - 2017
- [c43]Stefan Funke, André Nusser, Sabine Storandt:
The Simultaneous Maze Solving Problem. AAAI 2017: 808-814 - [c42]Stefan Funke, Thomas Mendel, Alexander Miller, Sabine Storandt, Maria Wiebe:
Map Simplification with Topology Constraints: Exactly and in Practice. ALENEX 2017: 185-196 - [c41]Daniel Bahrdt, Michael Becher, Stefan Funke, Filip Krumpe, André Nusser, Martin Seybold
Growing Balls in ℝd. ALENEX 2017: 247-258 - [c40]Daniel Bahrdt, Stefan Funke, Rick Gelhausen, Sabine Storandt:
Searching OSM Planet with Context-Aware Spatial Relations. SIGSPATIAL/GIS 2017: 70:1-70:4 - [c39]Stefan Funke, Christoph Haag, Sabine Storandt:
Generating Concise and Robust Driving Directions. SIGSPATIAL/GIS 2017: 91:1-91:4 - [c38]Stefan Funke, Sabine Storandt:
Automatic Tag Enrichment for Points-of-Interest in Open Street Map. W2GIS 2017: 3-18 - [c37]Stefan Funke, Niklas Schnelle, Sabine Storandt:
URAN: A Unified Data Structure for Rendering and Navigation. W2GIS 2017: 66-82 - [c36]Stefan Funke, Sören Laue, Sabine Storandt:
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees. SEA 2017: 18:1-18:13 - [i1]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient Generation of Geographically Accurate Transit Maps. CoRR abs/1710.02226 (2017) - 2016
- [j3]Stefan Funke, André Nusser, Sabine Storandt:
On k-Path Covers and their applications. VLDB J. 25(1): 103-123 (2016) - [c35]Stefan Funke, André Nusser, Sabine Storandt:
Placement of Loading Stations for Electric Vehicles: Allowing Small Detours. ICAPS 2016: 131-139 - [c34]Hannah Bast, Matthias Hertel
Scalable Transfer Patterns. ALENEX 2016: 15-29 - [c33]Stefan Funke, Sören Laue, Sabine Storandt:
Deducing individual driving preferences for user-aware navigation. SIGSPATIAL/GIS 2016: 14:1-14:9 - [c32]Stefan Funke, Filip Krumpe, Sabine Storandt:
Crushing Disks Efficiently. IWOCA 2016: 43-54 - [c31]Stefan Funke, Sabine Storandt:
Consistent Rounding of Edge Weights in Graphs. SOCS 2016: 28-35 - 2015
- [j2]Stefan Funke, André Nusser, Sabine Storandt:
Placement of Loading Stations for Electric Vehicles: No Detours Necessary! J. Artif. Intell. Res. 53: 633-658 (2015) - [c30]Sabine Storandt:
Route Planning for Electric Vehicles: Taking Energy Efficiency, Distance, and Reloading Opportunities into Account. GI-Jahrestagung 2015: 45 - [c29]Hannah Bast, Sabine Storandt, Simon Weidner:
Fine-grained population estimation. SIGSPATIAL/GIS 2015: 17:1-17:10 - [c28]Stefan Funke, Sabine Storandt:
Personalized route planning in road networks. SIGSPATIAL/GIS 2015: 45:1-45:10 - [c27]Stefan Funke, Robin Schirrmeister, Sabine Storandt:
Automatic Extrapolation of Missing Road Network Data in OpenStreetMap. MUD@ICML 2015: 27-35 - [c26]Thomas Liebig, Sabine Storandt, Peter Sanders, Walied Othman, Stefan Funke:
Report from Dagstuhl: SocioPaths - Multimodal Door-to-Door Route Planning via Social Paths. MUD@ICML 2015: 90-94 - [c25]Sabine Storandt:
Approximation Algorithms in the Successive Hitting Set Model. ISAAC 2015: 453-464 - [c24]Stefan Funke, Sabine Storandt:
Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing. ISAAC 2015: 479-490 - [c23]Stefan Funke, Robin Schirrmeister, Simon Skilevic, Sabine Storandt:
Compass-Based Navigation in Street Networks. W2GIS 2015: 71-88 - 2014
- [j1]Stefan Funke, André Nusser, Sabine Storandt:
On k-Path Covers and their Applications. Proc. VLDB Endow. 7(10): 893-902 (2014) - [c22]Stefan Funke, André Nusser, Sabine Storandt:
Placement of Loading Stations for Electric Vehicles: No Detours Necessary! AAAI 2014: 417-423 - [c21]Hannah Bast, Sabine Storandt:
Flow-Based Guidebook Routing. ALENEX 2014: 155-165 - [c20]Hannah Bast, Sabine Storandt:
Frequency-based search for public transit. SIGSPATIAL/GIS 2014: 13-22 - [c19]Hannah Bast, Patrick Brosi, Sabine Storandt:
Real-time movement visualization of public transit data. SIGSPATIAL/GIS 2014: 331-340 - [c18]Hannah Bast, Patrick Brosi, Sabine Storandt:
TRAVIC: a visualization client for public transit data. SIGSPATIAL/GIS 2014: 561-564 - [c17]Hannah Bast, Jonas Sternisko, Sabine Storandt:
ForestMaps: A Computational Model and Visualization for Forest Utilization. W2GIS 2014: 115-133 - 2013
- [b1]Sabine Storandt:
Algorithms for vehicle navigation. University of Stuttgart, 2013 - [c16]Sabine Storandt, Stefan Funke:
Enabling E-Mobility: Facility Location for Battery Loading Stations. AAAI 2013: 1341-1347 - [c15]Stefan Funke, Sabine Storandt:
Polynomial-time construction of contraction hierarchies for multi-criteria objectives. ALENEX 2013: 41-54 - [c14]Hannah Bast, Jonas Sternisko, Sabine Storandt:
Delay-Robustness of Transfer Patterns in Public Transportation Route Planning. ATMOS 2013: 42-54 - [c13]Hannah Bast, Mirko Brodesser, Sabine Storandt:
Result Diversity for Multi-Modal Route Planning. ATMOS 2013: 123-136 - [c12]Sabine Storandt:
Contraction Hierarchies on Grid Graphs. KI 2013: 236-247 - [c11]Niklas Schnelle, Stefan Funke, Sabine Storandt:
DORC: Distributed online route computation - Higher throughput, more privacy. PerCom Workshops 2013: 344-347 - [c10]Hannah Bast, Sabine Storandt:
Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract). SOCS 2013: 205-206 - [c9]Sabine Storandt:
The Hierarchy in Grid Graphs (Extended Abstract). SOCS 2013: 210-211 - [c8]Stefan Funke, Sabine Storandt:
Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives. SOCS 2013: 214-215 - 2012
- [c7]Sabine Storandt, Stefan Funke:
Cruising with a Battery-Powered Vehicle and Not Getting Stranded. AAAI 2012: 1628-1634 - [c6]Sabine Storandt:
Route Planning for Bicycles - Exact Constrained Shortest Paths Made Practical via Contraction Hierarchy. ICAPS 2012 - [c5]Katharina T. Huber, Vincent Moulton, Andreas Spillner, Sabine Storandt, Radoslaw Suchecki
Computing a Consensus of Multilabeled Trees. ALENEX 2012: 84-92 - [c4]Sabine Storandt:
Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles. CTS@SIGSPATIAL 2012: 20-25 - 2011
- [c3]Jochen Eisner, Stefan Funke, Sabine Storandt:
Optimal Route Planning for Electric Vehicles in Large Networks. AAAI 2011: 1108-1113 - [c2]Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, Sabine Storandt:
Algorithms for Matching and Predicting Trajectories. ALENEX 2011: 84-95 - [c1]Stefan Funke, Sabine Storandt:
Path shapes: an alternative method for map matching and fully autonomous self-localization. GIS 2011: 319-328
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: