Reference health
Customizable Contraction Hierarchies
9 of 37 checkable references need attention · checked 2026-08-29
At the dated check, the references listed below either did not resolve in Crossref or DataCite, or carried a retraction notice. Each one is shown with the registry record that put it there.
13 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
References needing attention
does not resolve to a known work10.5555/1873601.1873665
does not resolve to a known work10.5555/1760631.1760635
does not resolve to a known work10.5555/2008623.2008657
does not resolve to a known work10.5555/2790265.2790268
does not resolve to a known work10.5555/1788888.1788912
does not resolve to a known work10.5555/305219.305248
does not resolve to a known work10.5555/2791188.2791192
does not resolve to a known work10.5555/857152.857158
does not resolve to a known work10.5555/2387915.2387925
The 28 checked references that resolve
resolves10.1007/s004530010016
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
resolves10.1137/S0097539796303044
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
resolves10.14778/1921071.1921074
Graph indexing of road networks for shortest path queries with label restrictions
resolves10.1109/PROC.1967.6011
Direct solutions of sparse network equations by optimally ordered triangular factorization
The 13 references without a DOI — listed, not checked
no DOI — not checkedHans L. Bodlaender . 1993 . A tourist guide through treewidth . Acta Cybernetica 11 , 1 -- 21 . Hans L. Bodlaender. 1993. A tourist guide through treewidth. Acta Cybernetica 11, 1--21.
no DOI — not checkedDaniel Delling , Andrew V. Goldberg , Thomas Pajor , and Renato F . Werneck . 2014 . Robust distance queries on massive networks. In Algorithms—ESA 2014. Lecture Notes in Computer Science, Vol. 8737 . Springer , 321--333. Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F. Werneck. 2014. Robust distance queries on massive networks. In Algorithms—ESA 2014. Lecture Notes in Computer Science, Vol. 8737. Springer, 321--333.
no DOI — not checkedDaniel Delling , Andrew V. Goldberg , Thomas Pajor , and Renato F . Werneck . 2015 . Customizable route planning in road networks. Transportation Science. Published online May 22, 2015. http://dx.doi.org/10.1287/trsc.2014.0579. 10.1287/trsc.2014.0579 Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F. Werneck. 2015. Customizable route planning in road networks. Transportation Science. Published online May 22, 2015. http://dx.doi.org/10.1287/trsc.2014.0579.
no DOI — not checkedDaniel Delling , Andrew V. Goldberg , and Renato F. Werneck . 2011c. Faster batched shortest paths in road networks . In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11) . 52--63. Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2011c. Faster batched shortest paths in road networks. In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11). 52--63.
no DOI — not checkedDaniel Delling and Renato F . Werneck . 2013 . Faster customization of road networks. In Experimental Algorithms. Lecture Notes in Computer Science, Vol. 7933 . Springer , 30--42. Daniel Delling and Renato F. Werneck. 2013. Faster customization of road networks. In Experimental Algorithms. Lecture Notes in Computer Science, Vol. 7933. Springer, 30--42.
no DOI — not checkedCamil Demetrescu , Andrew V. Goldberg , and David S . Johnson (Eds.). 2009 . The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book , Vol. 74 . American Mathematical Society. Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson (Eds.). 2009. The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, Vol. 74. American Mathematical Society.
no DOI — not checkedRobert Geisberger , Dennis Luxen , Peter Sanders , Sabine Neubauer , and Lars Volker . 2010 . Fast detour computation for ride sharing . In Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10) . 88--99. Robert Geisberger, Dennis Luxen, Peter Sanders, Sabine Neubauer, and Lars Volker. 2010. Fast detour computation for ride sharing. In Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10). 88--99.
no DOI — not checkedAlan George and Joseph W . Liu . 1978 . A quotient graph model for symmetric factorization. In Sparse Matrix Proceedings, I. S. Duff and G. W. Stewart (Eds.). SIAM , Philadelphia, PA, 154--175. Alan George and Joseph W. Liu. 1978. A quotient graph model for symmetric factorization. In Sparse Matrix Proceedings, I. S. Duff and G. W. Stewart (Eds.). SIAM, Philadelphia, PA, 154--175.
no DOI — not checkedMoritz Kobitzsch , Marcel Radermacher , and Dennis Schieferdecker . 2013 . Evolution and evaluation of the penalty method for alternative graphs . In Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'13) . 94--107. http://drops.dagstuhl.de/opus/volltexte/2013/4247. Moritz Kobitzsch, Marcel Radermacher, and Dennis Schieferdecker. 2013. Evolution and evaluation of the penalty method for alternative graphs. In Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'13). 94--107. http://drops.dagstuhl.de/opus/volltexte/2013/4247.
no DOI — not checkedPeter Sanders and Christian Schulz . 2013. Think locally, act globally: Highly balanced graph partitioning . In Experimental Algorithms . Lecture Notes in Computer Science , Vol. 7933 . Springer , 164--175. Peter Sanders and Christian Schulz. 2013. Think locally, act globally: Highly balanced graph partitioning. In Experimental Algorithms. Lecture Notes in Computer Science, Vol. 7933. Springer, 164--175.
no DOI — not checkedSabine Storandt . 2013. Contraction hierarchies on grid graphs . In KI 2013: Advances in Artificial Intelligence . Lecture Notes in Computer Science , Vol. 8077 . Springer , 236--247. Sabine Storandt. 2013. Contraction hierarchies on grid graphs. In KI 2013: Advances in Artificial Intelligence. Lecture Notes in Computer Science, Vol. 8077. Springer, 236--247.
no DOI — not checkedMichael Wegner . 2014. Finding Small Node Separators. Bachelor's Thesis . Karlsruhe Institute of Technology . Michael Wegner. 2014. Finding Small Node Separators. Bachelor's Thesis. Karlsruhe Institute of Technology.
no DOI — not checkedTim Zeitz . 2013. Weak Contraction Hierarchies Work! Bachelor's Thesis . Karlsruhe Institute of Technology . Tim Zeitz. 2013. Weak Contraction Hierarchies Work! Bachelor's Thesis. Karlsruhe Institute of Technology.
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-08-29 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1145/2886843"><img src="https://citestamp.com/citestamped/10.1145/2886843/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1145/2886843)