Homepage
NOTE: I moved to the Department of Computer Science of
Friedrich Schiller University Jena.
This homepage is no longer updated, EMail to this old address is forwarded.
My new homepage can be found here.
Sören Laue
Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus
E1 4, Room 314
66123 Saarbrücken
Germany
Email:
Get my email address via email
Phone: +49 681 9325 114
Fax: +49 681 9325 199
- Computational Geometry
- Combinatorial Optimization
- Approximation Algorithms
- S. Laue
Geometric Set Cover and Hitting Sets for Polytopes in R^3
In 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2008.
- S. Funke, S. Laue, R. Naujoks, and Z. Lotker
Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-efficient Travelling Salesman Tours.
In 4th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2008, Santorini, LNCS. Springer, 2008.
- S. Laue and D. Matijevic
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
Information Processing Letters, 107/3-4:96-101, 2008.
An extended abstract appeared as:
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
In 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, Ottawa.
- S. Funke, S. Laue, and R. Naujoks
Minimum-Energy Broadcast with Few Senders.
In 3rd IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2007, Santa Fe, LNCS. Springer, 2007.
- S. Funke and S. Laue.
Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets.
In 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, Aachen, LNCS. Springer, 2007.
- F. Eisenbrand and S. Laue.
A linear algorithm for integer programming in the plane.
Mathematical Programming, 102(2):249-259, 2005.
An extended abstract appeared as:
A faster algorithm for two variable integer programming.
In 14th Annual International Symposium on Algorithms and Computation, ISAAC 2003, Kyoto, LNCS. Springer, 2003. F. Eisenbrand and S. Laue.
- Intensive Mini Course Introduction to Algorithms
at the Department of Mathematics, University of Osijek, Croatia (April 2007)
- Intensive Mini Course Introduction to Algorithms
at the Department of Mathematics, University of Osijek, Croatia (May 2006)
