You are here: Home › Staff › Ernst Althaus, Prof. Dr.

Ernst Althaus, Prof. Dr.

Ernst Althaus, Prof. Dr.

Head of Theoretical Computer Science

 Room: 03-423
Johannes Gutenberg-Universität Mainz
Institut für Informatik
Staudingerweg 9
55099 Mainz, Germany

Office Phone: +49-6131-39-23610
Fax number: +49-6131-39-23534



Office Hours:

Nach Vereinbarung per Email


Publications:

Next 10 items » 1 2 3 4 5

Althaus, E and Dumitriu, D (2012).
Certifying Feasibility and Objective Value of Linear Programs
Operations Research Letters.

Althaus, E, Hoffmann, S, Kupilas, J, and Thaden, E (2012).
A Column Generation Approach to Scheduling of Real-Time Networks
In: Proceedings of the World Congress on Engineering and Computer Science (WCECS), vol. 1, pp. 224–229, IAENG, San Francisco, USA, IAENG (ISBN: 978-988-19251-6-9).

Althaus, E, Becker, B, Dumitriu, D, and Kupferschmid, S (2011).
Integration of an LP Solver into Interval Constraint Propagation
In: Proc. 5th International Conference on Combinatorial Optimization and Applications (COCOA '11), ed. by Wang, Weifan and Zhu, Xuding and Du, Ding-Zhu, vol. 6831, pp. 343-356, Springer. LNCS (ISBN: 978-3-642-22615-1).

Althaus, E, Kupilas, J, and Naujoks, R (2011).
On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation, ed. by Ogihara, Mitsunori and Tarui, Jun, vol. 6648, pp. 308-319, Springer Berlin / Heidelberg. Lecture Notes in Computer Science.

Althaus, E, Canzar, S, Ehrler, C, Emmett, MR, Karrenbauer, A, Marshall, AG, Meyer-Bäse, A, Tipton, JD, and Zhang, H (2010).
Computing H/D-Exchange rates of single residues from data of proteolytic fragments
BMC Bioinformatics, 11(424).

Althaus, E and Dumitriu, D (2009).
Fast and Accurate Bounds on Linear Programs
In: Proc. 8th International Symposium on Experimental Algorithms, ed. by Jan Vahrenhold, vol. 5526, pp. 40-50, Springer. LNCS.

Althaus, E, Canzar, S, Ehrler, C, Emmett, MR, Karrenbauer, A, Marshall, AG, Meyer-Bäse, A, Tiptopn, J, and Zhang, H (2009).
Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments
In: BIOCOMP, pp. 496-502.

Althaus, E, Klau, GW, Kohlbacher, O, Lenhof, H, and Reinert, K (2009).
Integer Linear Programming in Computational Biology
In: Efficient Algorithms, pp. 199-218.

Althaus, E, Kruglov, E, and Weidenbach, C (2009).
Superposition Modulo Linear Arithmetic SUP(LA)
In: FroCos, pp. 84-99.

Meyer-Baese, A, Cappendijk, S, and Althaus, E (2009).
Global Uniform Stability Analysis of Biological Networks with Different Time-Scales under Pertubations
In: Proceedings of the 2009 International Joint Conference Neural Networks.

Next 10 items » 1 2 3 4 5

Short Scientific CV:

  • since December 2008
    Professor at the Johannes Gutenberg-Universität Mainz
    Head of the research group on "Theoretical Computer Science"
  • since December 2009
    Senior Researcher at the Max-Planck-Institut für Informatik, Saarbrücken
  • April 2007 - November 2008
    Senior Researcher at the Max-Planck-Insitut für Informatik, Saarbrücken
    Heading research area "Combinatorial Optmization"
  • October 2005 - March 2007
    Visiting Professor at the Johannes Gutenberg-Universität Mainz
    Head of the research group on "Theoretical Computer Science"
  • April 2004 - September 2005
    Head of an independent research group at the Laboratoire lorrain de recherche en informatique et ses applications (LORIA), Nancy
    Heading a research group on "Optimization in Bioinformatics"
  • September 2002 - March 2004
    Postdoc at the Max-Planck-Insitut für Informatik, Saarbrücken
  • September 2001 - August 2002
    Postdoc at the International Computer Science Institute, Berkeley, CA
  • May 2001 - August 2001
    Postdoc at the Max-Planck-Insitut für Informatik, Saarbrücken
  • February 1999 - April 2001
    Researcher at the Max-Planck-Insitut für Informatik, Saarbrücken
    Ph. D. candidate in Computer Science at University of Saarbrücken (Universität des Saarlandes) and at MPII. 
  • January 2008
    Habilitation
    Universität des Saarlandes, Saarbrücken
  • April 2001
    Promotion
    Supervisor: Kurt Mehlhorn
    Title: Curve Reconstruction and the Traveling Salesman Problem
  • December 1998
    Diploma
    Supervisor: Kurt Mehlhorn
    Title: Berechnung optimaler Steinerbäume in der Ebene

Teaching:

Vorlesung Datenstrukturen und effiziente Algorithmen (WS 08/09)
Praktikum Datenstrukturen und effiziente Algorithmen (WS 08/09)
Lecture Optimization (SS 08)
Lecutre Datastructures and Algorithms (WS 07/08)
Vorlesung Lineare Optimierung (WS 06/07)
Vorlesung Theoretische Grundlagen der Informatik II (WS 06/07)
Seminar Bioinformatik (WS 06/07)
Vorlesung Graphenalgorithmen (SS 06)
Vorlesung Theoretische Grundlagen der Informatik I (SS 06)
Vorlesung Datenstrukturen und effiziente Algorithmen (WS 05/06)
Seminar Bioinformatik (WS 05/06)
Lecture Optimization (SS 05)
Part of the Lecture Pépites algorithmiques (March 2005)
Lecture Datastructures and Algorithms (WS 04/05)
Lecture Large Scale Optimization (SS 04)
Seminar Integer Programming and Combinatorial Optimization (WS 03/04)
Lecture Randomized Algorithms (WS 03/04)