Carsten Moldenhauer ‒ Disopt ‐ EPFL

PostDoc

EPFL SB MATH AA
MA C1 563
Station 8
CH-1015 Lausanne
Phone: +41 21 693 2568
Fax: +41 21 693 5840
Email: firstname.lastname [at] epfl [dot] ch

Teaching

Fall 2011: Randomized Algorithms and Linear Algebra
Winter 2010/11: Combinatorial Optimization
Summer 2010: Algorithms and Data Structures

Publications

Warning

Please note that the publication lists from Infoscience integrated into the EPFL website, lab or people pages are frozen following the launch of the new version of platform. The owners of these pages are invited to recreate their publication list from Infoscience. For any assistance, please consult the Infoscience help or contact support.

On largest volume simplices and sub-determinants

M. Di Summa; F. Eisenbrand; Y. Faenza; C. Moldenhauer

2015. ACM-SIAM Symposium on Discrete Algorithms, San Diego, California, USA, January 4-6, 2015. p. 315-323. DOI : 10.1137/1.9781611973730.23.

Detailed record

View at publisher

Node-weighted network design and maximum sub-determinants

C. Moldenhauer / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2014.

Detailed record

Full text – View at publisher

Solving the stable set problem in terms of the odd cycle packing number

A. A. Bock; Y. Faenza; C. Moldenhauer; A. J. Ruiz Vargas

2014. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, India International Centre, New Delhi, December 15–17, 2014.

Detailed record

Primal-dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

C. Moldenhauer

2011. 38th International Colloquium on Automata, Languages and Programming (ICALP) / Annual Meeting of the European-Association-for-Theoretical-Computer-Science (EATCS)’, u’38th International Colloquium on Automata, Languages and Programming (ICALP), Zürich, July 2011. p. 293-306. DOI : 10.1016/j.ic.2012.10.017.

Detailed record

View at publisher

Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

C. Moldenhauer

2011. Automata, Languages and Programming – 38th International Colloquium, Zürich, Switzerland, July 4-8, 2011. p. 748-759. DOI : 10.1007/978-3-642-22006-7_63.

Detailed record

View at publisher

Balanced Interval Coloring

A. Antoniadis; F. Hüffner; P. Lenzner; C. Moldenhauer; A. Souza

2011. 28th International Symposium on Theoretical Aspects of Computer Science, Dortmund, Germany, March 10-12, 2011. p. 531-542. DOI : 10.4230/LIPIcs.STACS.2011.531.

Detailed record

View at publisher

Single-Frontier Bidirectional Search

A. Felner; C. Moldenhauer; N. Sturtevant; J. Schaeffer

2010. Twenty-Fourth AAAI Conference on Artificial Intelligence, Atlanta, Georgia, USA, July 11-15, 2010. p. 59-64. DOI : 10.1609/aaai.v24i1.7555.

Detailed record

View at publisher

Evaluating Strategies for Running from the Cops

C. Moldenhauer; N. Sturtevant

2009. 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009.

Detailed record

Full text

Optimal solutions for moving target search

C. Moldenhauer; N. Sturtevant

2009. 8th International Joint Conference on Autonomous Agents and Multiagent Systems, Budapest, Hungary, May 10-15, 2009. p. 1249-1250. DOI : 10.1145/1558109.1558236.

Detailed record

View at publisher