Homepage

Markus Behle

Markus Behle;
On threshold BDDs and the optimal variable ordering problem
In Andreas Dress et al. (Eds.), Journal of Combinatorial Optimization, Vol. 16 (2), Springer, p. 107-118, August 2008.

Markus Behle;
Binary Decision Diagrams and Integer Programming [pdf]
PhD thesis, Saarbrücken, Germany, 2007.

Markus Behle;
On Threshold BDDs and the Optimal Variable Ordering Problem [pdf]
In Andreas Dress et al. (Eds.), Proceedings of the 1st International Conference on Combinatorial Optimization and Applications (COCOA'07), Xi'an, China, LNCS 4616, Springer, p. 124-135, August 2007.

Markus Behle, Michael Jünger and Frauke Liers;
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem [pdf]
In Camil Demetrescu (Ed.), Proceedings of the 6th Workshop on Efficient and Experimental Algorithms (WEA'07), Rome, Italy, LNCS 4525, Springer, p. 379-392, June 2007.

Markus Behle and Friedrich Eisenbrand;
0/1 vertex and facet enumeration with BDDs [pdf]
In David Applegate et al. (Eds.), Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), New Orleans, U.S.A., SIAM, p. 158-165, January 2007.

Bernd Becker, Markus Behle, Friedrich Eisenbrand and Ralf Wimmer;
BDDs in a Branch and Cut Framework [pdf]
In Sotiris Nikoletseas (Ed.), Experimental and Efficient Algorithms, Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), Santorini, Greece, LNCS 3503, Springer, p. 452-463, May 2005.

Bernd Becker, Markus Behle, Friedrich Eisenbrand, Martin Fränzle, Marc Herbstritt, Christian Herde, Jörg Hoffmann, Daniel Kröning, Bernhard Nebel, Ilia Polian and Ralf Wimmer;
Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems [pdf]
In Proceedings of the 7th GI/ITG/GMM-Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, Kaiserslautern, Germany, ISBN 3-8322-2486-6, p. 65-75, February 2004.

Markus Behle;
Primale Separierung für Max-Cut und gradbeschränkte minimale Spannbäume [pdf]
Diplomarbeit (Master's thesis), Cologne, Germany, February 2003.

June 2007 -
Researcher at Robert Bosch GmbH, Corporate Research
May 2003 - May 2007
Ph.D. student at the Max Planck Institute for Computer Science, Advisor: Friedrich Eisenbrand
October 1996 - February 2003
Studies in Mathematics at the University of Cologne
Title of Diploma Thesis: "Primale Separierung für Max-Cut und gradbeschränkte minimale Spannbäume",
Advisor: Michael Jünger
June 1995
Abitur at the Leibniz-Gymnasium, Dormagen-Hackenbroich

AVACS (Automatic Verification and Analysis of Complex Systems) is a transregional collaborative research center (SFB Transregio) linking the sites Freiburg, Oldenburg and Saarbrücken and was funded by the German Research Foundation (DFG).
This project addresses the mathematical analysis of models of complex safety critical computerized systems, such as aircrafts, trains, cars, or other artifacts. The overall aim is to raise the state of the art in automatic verification and analysis techniques to a level allowing a comprehensive verification of such systems.