Carsten Moldenhauer

According to our database, Carsten Moldenhauer authored at least 8 papers between 2009 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs.

Jaroslaw Byrka, Mateusz Lewandowski, Carsten Moldenhauer

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015

On largest volume simplices and sub-determinants.

Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number.

Adrian Bock, Yuri Faenza, Carsten Moldenhauer, Andres J. Ruiz-Vargas

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs.

Carsten Moldenhauer

Inf. Comput., 2013

2011

Balanced Interval Coloring.

Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

Single-Frontier Bidirectional Search.

Ariel Felner, Carsten Moldenhauer, Nathan R. Sturtevant, Jonathan Schaeffer

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Evaluating Strategies for Running from the Cops.

Carsten Moldenhauer, Nathan R. Sturtevant

Proceedings of the IJCAI 2009, 2009

Optimal solutions for moving target search.

Carsten Moldenhauer, Nathan R. Sturtevant

Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009