Optimal solutions for moving target search. - Carsten Moldenhauer; Nathan R. Sturtevant (AAMAS (2), 2009)

Evaluating Strategies for Running from the Cops. - Carsten Moldenhauer; Nathan R. Sturtevant (IJCAI, 2009)

Single-Frontier Bidirectional Search. - Ariel Felner; Carsten Moldenhauer; Nathan R. Sturtevant; Jonathan Schaeffer 001 (AAAI, 2010)

Balanced Interval Coloring. - Antonios Antoniadis 001; Falk Hüffner; Pascal Lenzner; Carsten Moldenhauer; Alexander Souza (STACS, 2011)

Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs. - Carsten Moldenhauer (Inf. Comput., 2013)

Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number. - Adrian Bock; Yuri Faenza; Carsten Moldenhauer; Andres J. Ruiz-Vargas (FSTTCS, 2014)

On largest volume simplices and sub-determinants. - Marco Di Summa; Friedrich Eisenbrand; Yuri Faenza; Carsten Moldenhauer (SODA, 2015)

Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs. - Jaroslaw Byrka; Mateusz Lewandowski; Carsten Moldenhauer (SWAT, 2016)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport. - Carsten Moldenhauer; Philipp Germann; Cedric Heimhofer; Caroline Spieckermann; Andreas Andresen (CoRR, 2025)