ETH E-Collection · ETH Institutional Repository

1. Algorithmen für Normalformen von Graphen

Schnyder, Walter Albert (1983)

Doctoral and Habilitation Theses

2. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs

Gfeller, Beat and Vicari, Elias (2007)

Reports

3. Concrete constructions of unbalanced bipartite expander graphs and generalized conductors

Werner, Rose-Line (2008)

Master Theses

4. Transitive orientation, boolean matrix multiplication and the test for transitivity

Trunz, Paul (1998)

Doctoral and Habilitation Theses

5. Generalized modular decompositions and the recognition of classes of perfectly orderable graphs

Raschle, Thomas (1999)

Doctoral and Habilitation Theses

6. Estimating high-dimensional dependence structures with the PC-algorithm

Kalisch, Markus (2008)

Doctoral and Habilitation Theses

7. A graph theoretical approach for reconstruction and generation of oriented matroids

Finschi, Lukas (2001)

Doctoral and Habilitation Theses

8. Towards a classification of Hamiltonian cycles in the 6-cube

Chebiryak, Yury and Kröning, Daniel (2008)

Reports

9. Finding a minimal transitive reduction in a strongly connected digraph within linear time

Simon, Klaus (1989)

Reports

10. Flow complexes

John, Matthias (2003)

Doctoral and Habilitation Theses

11. On the existence of paths and cycles

Hoffmann, Michael (2005)

Doctoral and Habilitation Theses

12. On the P₄-components of graphs

Raschle, Thomas and Simon, Klaus (1997)

Reports

13. Crossing-free configurations on planar point sets

Razen, Andreas (2009)

Doctoral and Habilitation Theses

14. Colorings and transversals of graphs

Berke, Robert (2008)

Doctoral and Habilitation Theses

15. The price of locality

Kuhn, Fabian (2005)

Doctoral and Habilitation Theses

16. Graph excerpts

Derungs, Jörg (2008)

Doctoral and Habilitation Theses

17. Message-passing algorithms and analog electronic circuits

Merkli, Patrick P. (2005)

Doctoral and Habilitation Theses

18. Mapping polygons

Disser, Yann (2011)

Doctoral and Habilitation Theses

19. Depth, crossings and conflicts in discrete geometry

Sulovský, Marek (2012)

Doctoral and Habilitation Theses

20. Finding lean induced cycles in binary hypercubes

Chebiryak, Yury, Wahl, Thomas, Haller, Leopold and Kröning, Daniel (2009)

Reports

21. Relaxed two-coloring of cubic graphs

Berke, Robert and Szabó, Tibor

Reports

22. Advice Complexity of the Online Vertex Coloring Problem

Seibert, Sebastian, Sprock, Andreas and Unger, Walter (2012)

Reports

23. Balanced partitioning of grids and related graphs

Feldmann, Andreas Emil (2012)

Doctoral and Habilitation Theses

24. Line simplification with restricted orientations

Neyer, Gabriele (1998)

Reports

25. Sparse convex optimization methods for machine learning

Jaggi, Martin (2011)

Doctoral and Habilitation Theses