ETH E-Collection · ETH Institutional Repository

1. Random graphs with structural constraints

Weissl, Andreas Christian (2007)

Doctoral and Habilitation Theses

2. Endliche Hyperturniere

Wirth, Karl (1978)

Doctoral and Habilitation Theses

3. Ramsey-type results on planar geometric objects

Solymosi, József (2001)

Doctoral and Habilitation Theses

4. Games on graphs

Stojaković, Miloš (2005)

Doctoral and Habilitation Theses

5. Random walks, disconnection and random interlacements

Windisch, David (2009)

Doctoral and Habilitation Theses

6. Planar subdivisions

Tóth, Csaba Dávid (2002)

Doctoral and Habilitation Theses

7. Perfectness notions related to polarity

Gaillard, Arlette D. (1991)

Doctoral and Habilitation Theses

8. Ramsey games in random graphs

Mütze, Torsten (2011)

Doctoral and Habilitation Theses

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

Werner, Rose-Line (2008)

Master Theses

10. Topology of discrete structures

Čukić, Sonja (2006)

Doctoral and Habilitation Theses

11. Colorability properties of random graphs

Panagiotou, Konstantinos (2008)

Doctoral and Habilitation Theses

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

Trunz, Paul (1998)

Doctoral and Habilitation Theses

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

Raschle, Thomas (1999)

Doctoral and Habilitation Theses

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

Kalisch, Markus (2008)

Doctoral and Habilitation Theses

15. Ramsey and Turán type problems in random graphs

Marciniszyn, Martin (2006)

Doctoral and Habilitation Theses

16. Computations in groups acting on a product of trees: normal subgroup structures and quaternion lattices

Rattaggi, Diego Attilio (2004)

Doctoral and Habilitation Theses

17. A new linear algorithm to detect a line graph and output its root graph

Degiorgi, Daniele (1990)

Reports

18. Theorie und Anwendung des Graphmodells der kombinatorischen Logik

Fehlmann, Thomas Michael (1981)

Reports

19. Crossing-free configurations on planar point sets

Razen, Andreas (2009)

Doctoral and Habilitation Theses

20. Percolative properties of random interlacements

Teixeira, Augusto (2010)

Doctoral and Habilitation Theses

21. Message-passing algorithms and analog electronic circuits

Merkli, Patrick P. (2005)

Doctoral and Habilitation Theses

22. On the power of choices in random graph processes

Spöhel, Reto (2010)

Doctoral and Habilitation Theses

23. Two linear time algorithms for MST on minor closed graph classes

Mareš, Martin (2002)

Reports

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

Finschi, Lukas (2001)

Doctoral and Habilitation Theses

25. Groups of tree-automorphisms and their unitary representations

Amann, Olivier Éric (2003)

Doctoral and Habilitation Theses