default search action
Dennis Schieferdecker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c12]Payas Rajan
, Moritz Baum, Michael Wegner, Tobias Zündorf, Christian J. West, Dennis Schieferdecker, Daniel Delling:
Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles. ATMOS 2021: 11:1-11:18 - 2020
- [c11]Valentin Buchhold, Daniel Delling, Dennis Schieferdecker, Michael Wegner:
Fast and Stable Repartitioning of Road Networks. SEA 2020: 26:1-26:15
2010 – 2019
- 2018
- [c10]Daniel Delling, Dennis Schieferdecker, Christian Sommer:
Traffic-Aware Routing in Road Networks. ICDE 2018: 1543-1548 - 2015
- [j3]Dennis Schieferdecker:
Location-Free Detection of Network Boundaries. ACM Trans. Sens. Networks 11(4): 58:1-58:40 (2015) - 2014
- [b1]Dennis Schieferdecker:
An Algorithmic View on Sensor Networks - Surveillance, Localization, and Communication. Karlsruhe Institute of Technology, 2014 - [j2]Dennis Luxen, Dennis Schieferdecker:
Candidate Sets for Alternative Routes in Road Networks. ACM J. Exp. Algorithmics 19(1) (2014) - [i3]Moritz Kobitzsch, Samitha Samaranayake, Dennis Schieferdecker:
Pruning Techniques for the Stochastic on-time Arrival Problem\texorpdfstring - An Experimental Study. CoRR abs/1407.8295 (2014) - 2013
- [c9]Moritz Kobitzsch, Marcel Radermacher, Dennis Schieferdecker:
Evolution and Evaluation of the Penalty Method for Alternative Graphs. ATMOS 2013: 94-107 - [c8]Dennis Luxen, Dennis Schieferdecker:
Candidate Sets for Alternative Routes in Road Networks (Extended Abstract). SOCS 2013: 218-219 - 2012
- [c7]Dennis Luxen, Dennis Schieferdecker:
Candidate Sets for Alternative Routes in Road Networks. SEA 2012: 260-270 - [i2]Dennis Luxen, Dennis Schieferdecker:
Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing. CoRR abs/1208.2543 (2012) - 2011
- [c6]Dennis Schieferdecker, Markus Völker, Dorothea Wagner:
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks. SEA 2011: 388-399 - [i1]Dennis Schieferdecker, Markus Völker, Dorothea Wagner:
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks. CoRR abs/1103.1771 (2011) - 2010
- [j1]Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner:
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. ACM J. Exp. Algorithmics 15 (2010) - [c5]Peter Sanders, Dennis Schieferdecker:
Lifetime Maximization of Monitoring Sensor Networks. ALGOSENSORS 2010: 134-147 - [c4]Dennis Schieferdecker:
Lifetime Optimization of Wireless Sensor Networks. AlgoSyn 2010: 68 - [c3]Robert Geisberger, Dennis Schieferdecker:
Heuristic Contraction Hierarchies with Approximation Guarantee. SOCS 2010: 31-38
2000 – 2009
- 2009
- [c2]Dennis Schieferdecker, Marco F. Huber:
Gaussian mixture reduction via clustering. FUSION 2009: 1536-1543 - 2008
- [c1]Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner:
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. WEA 2008: 303-318
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-04-24 22:47 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: