Laura Heinrich-Litan

Dr. LAURA HEINRICH-LITAN

Institute of Computer Science
Freie Universität Berlin
Takustraße 9
D-14195 Berlin
Germany

phone: +49 30 838-75103

fax: +49 30 838-75192

e-mail: laura AT heinrich-litan.de

e-mail: litan AT inf.fu-berlin.de

I am currently a visiting researcher of the work group Theoretical Computer Science at Freie Universität Berlin. My research interests center on Algorithms and Data Structures, in particular Computational Geometry and Combinatorial Optimization. I am interested both in theoretical issues and applications.

Education

Ph.D.	Computer Science (Dr.rer.nat.) Freie Universität Berlin, November 2002.
Master of Science	Computer Science (Dipl. Inform.) MLU Halle-Wittenberg, April 1997.
Bachelor of Science	Computer Science (Vordiplom) MLU Halle-Wittenberg, November 1994.
Bachelor of Science	Mathematics (Vordiplom) MLU Halle-Wittenberg, November 1994.

Academic Positions

11/2002 - 03/2005	Postdoc at the Department Mathematical Optimization, TU Braunschweig
04/1999 - 10/2002	Member of the workgroup Theoretical Computer Science at Freie Universität Berlin
04/1999 - 09/2001	Graduate Student in the graduate program Computational Discrete Mathematics
05/1997 - 03/1999	Member of the workgroup Computer Engineering at MLU Halle-Wittenberg
03/1995 - 04/1997	Research Assistent in DFG research project Logic Synthesis of Random Logic Circuits, at MLU Halle-Wittenberg

Research Interests

Algorithms
Computational Geometry
Combinatorial Optimization
Combinatorics

Teaching

Lineare Optimierung WS 2004/2005

Logik für Informatiker WS 2004/2005

Einführung in die Optimierung SS 2004

Lineare Optimierung WS 2003/2004

Diskrete Optimierung SS 2003

Lineare Optimierung WS 2002/2003

Publications

Accepted Papers

L. Heinrich-Litan and M. Lübbecke.
Rectangle Covers Revisited Computationally.
Accepted at 4th International Workshop on Efficient and Experimental Algorithms (WEA'05).
[abstract] [pdf][ps]

Papers Published in Refereed Journals

P. Braß, L. Heinrich-Litan, and P. Morin.
Computing the center of area of a convex polygon.
In International Journal of Computational Geometry and Applications,13:439-445, 2003.
[abstract] [pdf][ps]

Laura Heinrich-Litan and Paul Molitor.
Least Upper Bounds for the Size of OBDDs using Symmetries.
In IEEE Transactions on Computers, 49:360-368, April 2000.
[abstract] [pdf]

Conference Publications

Laura Heinrich-Litan.
Exact $L_{\infty}$ -Nearest Neighbor Search in High Dimensions.
18th European Workshop on Computational Geometry, Warszawa, April 2002.
Helmut Alt and Laura Heinrich-Litan.
Exact $L_{\infty}$ -Nearest Neighbor Search in High Dimensions.
In Proceedings of the 17th ACM Symposium on Computational Geometry, Boston, June 2001.
[abstract] [pdf] [ps]
Laura Heinrich-Litan.
Time-Space tradeoffs for exact $L_{\infty}$ -Nearest Neighbor Search in High Dimensions.
17th European Workshop on Computational Geometry , Berlin, March 2001.
Laura Heinrich-Litan, Ursula Fissgus , Stephan Sutter, Paul Molitor and Thomas Rauber.
Modeling the Communication Behavior on Distributed Memory Machines by Genetic Programming.
In Proceedings of Euro-Par 1998, Southampton, GB, September 1998.
[abstract] [ps]
Laura Litan, Paul Molitor and Dirk Möller.
Least upper bounds on the sizes of symmetric variable order based OBDDs.
In Proceedings of the 6th Great Lakes Symposium on VLSI 96, pp.126-129, Iowa, March 1996.

Theses

PhD thesis:
Exact $L_{\infty}$ -Nearest-Neighbor Search in High Dimensions. Freie Universität Berlin, November 2002.
Master's thesis:
Least Upper Bounds for ROBDDs of Boolean Functions. Martin-Luther-University, Halle, April 1997.

Technical Reports

L. Heinrich-Litan and M. Lübbecke.
Rectangle Covers Revisited Computationally.
Technical Report 037-2004, Technische Universität Berlin, Institut für Mathematik, 2004.
[abstract,ps,pdf]
Peter Brass and Laura Heinrich-Litan.
Computing the center of area of a convex polygon.
Technical Report B 02-10, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 2002.
[abstract] [pdf] [ps]
Laura Heinrich-Litan.
Monotone Subsequences in R^d.
Technical Report B 00-19, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 2000.
[abstract] [pdf] [ps]