Engineering an External Memory Minimum Spanning Tree Algorithm. - Roman Dementiev; Peter Sanders 001; Dominik Schultes; Jop F. Sibeyn (IFIP TCS, 2004)

Highway Hierarchies Hasten Exact Shortest Path Queries. - Peter Sanders 001; Dominik Schultes (ESA, 2005)

Highway Hierarchies Star. - Daniel Delling; Peter Sanders 001; Dominik Schultes; Dorothea Wagner (The Shortest Path Problem, 2006)

Robust, Almost Constant Time Shortest-Path Queries in Road Networks. - Peter Sanders 001; Dominik Schultes (The Shortest Path Problem, 2006)

Rainbow Sort: Sorting at the Speed of Light. - Dominik Schultes (Nat. Comput., 2006)

In Transit to Constant Time Shortest-Path Queries in Road Networks. - Hannah Bast; Stefan Funke; Domagoj Matijevic; Peter Sanders 001; Dominik Schultes (ALENEX, 2007)

Computing Many-to-Many Shortest Paths Using Highway Hierarchies. - Sebastian Knopp; Peter Sanders 001; Dominik Schultes; Frank Schulz 001; Dorothea Wagner (ALENEX, 2007)

Engineering Fast Route Planning Algorithms. - Peter Sanders 001; Dominik Schultes (WEA, 2007)

Dynamic Highway-Node Routing. - Dominik Schultes; Peter Sanders 001 (WEA, 2007)

Better Approximation of Betweenness Centrality. - Robert Geisberger; Peter Sanders 001; Dominik Schultes (ALENEX, 2008)

Bidirectional A* on Time-dependent Graphs. - Giacomo Nannicini; Daniel Delling; Leo Liberti; Dominik Schultes (CTW, 2008)

Mobile Route Planning. - Peter Sanders 001; Dominik Schultes; Christian Vetter (ESA, 2008)

Routenplanung in Straßennetzen [Route Planning in Road Networks]. - Dominik Schultes (Ausgezeichnete Informatikdissertationen, 2008)

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. - Robert Geisberger; Peter Sanders 001; Dominik Schultes; Daniel Delling (WEA, 2008)

Bidirectional A* Search for Time-Dependent Fast Paths. - Giacomo Nannicini; Daniel Delling; Leo Liberti; Dominik Schultes (WEA, 2008)

Routing in Road Networks with Transit Nodes. - Dominik Schultes (Encyclopedia of Algorithms, 2008)

Engineering Route Planning Algorithms. - Daniel Delling; Peter Sanders 001; Dominik Schultes; Dorothea Wagner (Algorithmics of Large and Complex Networks, 2009)

Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. - Reinhard Bauer; Daniel Delling; Peter Sanders 001; Dennis Schieferdecker; Dominik Schultes; Dorothea Wagner (ACM J. Exp. Algorithmics, 2010)

Engineering highway hierarchies. - Peter Sanders 001; Dominik Schultes (ACM J. Exp. Algorithmics, 2012)

Bidirectional A* search on time-dependent road networks. - Giacomo Nannicini; Daniel Delling; Dominik Schultes; Leo Liberti (Networks, 2012)

Exact Routing in Large Road Networks Using Contraction Hierarchies. - Robert Geisberger; Peter Sanders 001; Dominik Schultes; Christian Vetter (Transp. Sci., 2012)

Teaching at a university of applied sciences. - Dominik Schultes (it Inf. Technol., 2015)

Routing in Road Networks with Transit Nodes. - Dominik Schultes (Encyclopedia of Algorithms, 2016)

Optimizing energy consumption and user experience in a mobile video streaming scenario. - Thomas Breitbach; Peter Sanders 001; Dominik Schultes (CCNC, 2018)

SequalsK - A Bidirectional Swift-Kotlin-Transpiler. - Dominik Schultes (MOBILESoft@ICSE, 2021)

Evaluating Swift-to-Kotlin and Kotlin-to-Swift Transpilers. - Larissa Schneider; Dominik Schultes (MOBILESoft, 2022)

Native cross-platform app development using the SequalsK transpiler. - Dominik Schultes; Larissa Schneider; Tobias Heymann; Franziska Wild (Inf. Softw. Technol., 2025)