Dr. Daniel Werner

Freie Universität Berlin
Fachbereich Mathematik und Informatik
Institut für Informatik
AG Theoretische Informatik
Takustraße 9
D-14195 Berlin
Germany
Office: 124
Phone: +49 30 - 838 75 582
E-mail: daniel.werner [at] fu-berlin.de

Since Oct. 09, I was a Ph.D. student, supported by the DFG Research Training Group Methods for Discrete Structures.
My supervisor was Günter Rote.

I am still a member of the Berlin Mathematical School. My mentor is Günter M. Ziegler.

I've spent some awesome months at EPFL for the Special Semester on Discrete and Computational Geometry.
I recently finished my Ph.D. My thesis is available online: Computational aspects of some problems from discrete geometry in higher dimensions.
Now I am the CEO of keylight GmbH.

Publications

Journals

Fixed-Parameter Complexity and Approximability of Norm Maximization
accepted for publication in Discrete & Computational Geometry (DCG)
with Christian Knauer and Stefan König
Note: sneak

Approximating Tverberg Points in Linear Time for Any Fixed Dimension
accepted for publication in Discrete & Computational Geometry (DCG)
with Wolfgang Mulzer
Note: sneak

A Proof of the Oja-Depth Conjecture in the Plane [ EuroCG version ]
accepted for publication in Computational Geometry - Theory and Applications (CGTA) (Special Issue on the 27th European Workshop on Computational Geometry)
with Nabil H. Mustafa, Hans Raj Tiwary
Note: sneak

Hardness of discrepancy computation and epsilon-net verification in high dimension [ DOI ]
Journal of Complexity (JC), Elsevier 2011
with Panos Giannopoulos, Christian Knauer, Magnus Wahlström
Note: sneak

Fixed-parameter tractability and lower bounds for stabbing problems [ DOI ]
Computational Geometry - Theory and Applications (CGTA) (Special Issue on the 25th European Workshop on Computational Geometry), Elsevier 2011.
with Panos Giannopoulos, Christian Knauer, Günter Rote
Note: sneak

Conferences

On the computational complexity of Erdős-Szekeres and related problems in R^3
Accepted at the 21st European Symposium on Algorithms (ESA), Sophia Antipolis, France 2013
with Panos Giannopoulos, Christian Knauer
Note: sneak

Approximating Tverberg Points in Linear Time for Any Fixed Dimension [ arXiv version ]
Accepted at the 28th Symposium on Computational Geometry (SoCG), Chapel Hill, NC, USA 2012
with Wolfgang Mulzer
Note: sneak

On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems [ DROPS | pdf | talk ]
28th Symposium on Theoretical Aspects of Computer Science (STACS), Dortmund 2011
with Christian Knauer, Hans Raj Tiwary
Note: sneak

In Preparation

A Lower Bound for Shallow Partitions [ arXiv ]
in preparation
with Wolfgang Mulzer
Note: sneak

Weakly Reviewed Conferences

A Lower Bound for Shallow Partitions [ pdf ]
In Proceedings of the 28th European Workshop on Computational Geometry (EuroCG), Assisi, March 2012.
with Wolfgang Mulzer
Note: sneak

Approximating Tverberg Points in Linear Time for Any Fixed Dimension [ pdf ]
In Proceedings of the 28th European Workshop on Computational Geometry (EuroCG), Assisi, March 2012.
with Wolfgang Mulzer
Note: sneak

Erdős-Szekeres is NP-hard in 3 dimensions - and what now? [ pdf ]
In Proceedings of the 28th European Workshop on Computational Geometry (EuroCG), Assisi, March 2012.
with Christian Knauer
Note: sneak

A Proof of the Oja-Depth Conjecture in the Plane [ pdf | talk ]
In Proceedings of the 27th European Workshop on Computational Geometry (EuroCG), Morschach, Switzerland, March 2011.
with Nabil H. Mustafa, Hans Raj Tiwary
Note: sneak

Hardness of discrepancy and related problems parameterized by the dimension [ pdf | talk ]
In Proceedings of the 26th European Workshop on Computational Geometry (EuroCG), pp. 173-176, Dortmund, March 2010.
with Panos Giannopoulos, Christian Knauer, Magnus Wahlström
Note: sneak

Fixed-parameter tractability and lower bounds for stabbing problems [ pdf ]
In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), pp. 281-284, Brussels, Belgium, March 2009.
with Panos Giannopoulos, Christian Knauer, Günter Rote
Note: sneak

Other

Polynomial Bounds on the Slicing Number [ pdf ]
http://arxiv.org/abs/1004.3381, World Wide Web, July 2010 (withdrawn)
with Matthias Lenz
Note: sneak

My Coauthors

Panos Giannopoulos, Christian Knauer, Matthias Lenz, Nabil H. Mustafa, Wolfgang Mulzer, Günter Rote, Hans Raj Tiwary, Magnus Wahlström

Conferences and Workshops I attended

14.03. - 16.03.2009 25th European Symposium on Computational Geometry in Brussels, Belgium

22.03. - 24.03.2010 26th European Symposium on Computational Geometry in Dortmund

04.07. - 09.07.2010 13th Korean Workshop on Computational Geometry in Dagstuhl

30.08. - 03.09.2010 Bernoulli Conference on Discrete & Computational Geometry in Lausanne, Switzerland

27.09. - 01.10.2010 Conference on Geometric Graph Theory in Lausanne, Switzerland

29.11. - 03.12.2010 DCG Semester Culminating Workshop in Lausanne, Switzerland

20.12. - 23.12.2010 1st Workshop on Parameterized Complexity in Computational Geometry in Bayreuth

04.02. - 11.02.2011 10th INRIA - McGill - Victoria Workshop on Computational Geometry in Holetown, Barbados

09.03. - 12.03.2011 28th Symposium on Theoretical Aspects of Computer Science in Dortmund

28.03. - 30.03.2011 27th European Symposium on Computational Geometry in Morschach, Switzerland

27.02. - 02.03.2012 Bernoulli Reunion Conference on Discrete and Computational Geometry in Lausanne, Switzerland

19.03. - 21.03.2012 28th European Symposium on Computational Geometry in Assisi, Italy


Teaching

SoSe 09Teaching AssistantPro Informatik: Logik & Diskrete StrukturenDr. Frank Hoffmann, PD Dr. Klaus Kriegel
SoSe 08Teaching AssistantGrundlagen der Theoretischen InformatikDr. Frank Hoffmann, PD Dr. Klaus Kriegel
WiSe 07/08Teaching AssistantInformatik APD Dr. Klaus Kriegel
SoSe 07Teaching AssistantGrundlagen der Theoretischen InformatikProf. Helmut Alt
SoSe 06Teaching AssistantGrundlagen der Theoretischen Informatik (Foundations of Theoretical Computer Science)Prof. Christian Knauer
WiSe 05/06Teaching AssistantEntwurf und Analyse von Algorithmen (Design and Analysis of Algorithms)Prof. Günter Rote
SoSe 05Teaching AssistantAlgorithmen und Programmierung IVProf. Robert Tolksdorf
WiSe 04/05Teaching AssistantInformatik APD Dr. Klaus Kriegel
SoSe 04Teaching AssistantInformatik BPD Dr. Klaus Kriegel

Erdős-Bacon-Number

7 = 3 (DW - Günter Rote - Richard Pollack - PE) + 4 (DW - Hannes Stelzer - Sylvester Groth - Brad Pitt - KB)

Some good books (math-related)

Lectures on Discrete Geometry and all other books by Jiří Matoušek (!)
Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak
Introduction to the Theory of Computation by Michael Sipser
Lectures on Polytopes by Günter Ziegler
Einführung in die Mengenlehre von Oliver Deiser

Other

skillnut.com
Max Goldt
Thomas Pynchon
Jonathan Safran Foer
Haruki Murakami
Hertha BSC
Jever
TC WB Wannsee

Disclaimer/Impressum

Impressum
free counters
since June 10, 2010
Last update: February 28, 2015