2022

Master

• Alain Bastian, Minimum Partition into Plane Subgraphs.
  Advisor: H. Hoang, M. Hoffmann / to be completed
  PDF:
  HC:
• Eleonora Eichelberg, Hardness of Counting Crossing-free Geometric Graphs..
  Advisor: M. Wettstein / to be completed
  PDF:
  HC:

Bachelor

2021

Master

• Judith Beestermoeller, Decomposing Polyhedra as Cartesian Products.
  Advisor: B. Gärtner, E. Welzl / August 18, 2021
  PDF: link
  HC:
• Francois Clément, Variants of the Erdos distinct distances problem..
  Advisor: Th. Pham, E. Welzl / July 6, 2021
  PDF: link
  HC:
• Paul Delacour, Smallest Enclosing Balls of Balls.
  Advisor: B. Gärtner / September 17, 2021
  PDF: link
  HC:
Ning Gao, The maximum geometric subgraph problem.
Advisor: N. Grelier (head), M. M. Reddy / September 2, 2021
PDF: link
HC:
• Alexandre Krattinger, Edge-Coloring Simple Topological Drawings..
  Advisor: M. Hoffmann, M. M. Reddy (head) / September 2, 2021
  PDF:
  HC:
• Daniel Rutschmann, On Chains and Point Configurations with many Triangulations..
  Advisor: M. Wettstein / September 13, 2021
  PDF: link
  HC:
• Alain Senn, Advanced Language Support in Cloud-based IDEs.
  Advisor: M. Dahinden, D. Sichau (head), B. Gärtner / to be completed
  PDF:
  HC:
• Valentin Stoppiello, Triangulations and Subdivisions in three dimensions.
  Advisor: N. Grelier, P. Schnider, E. Welzl (head) / September 1, 2021
  PDF: link
  HC:

Bachelor

• Ivan Baburin, Algorithms for Color Constrained Perfect Matchings in Edge Colored Graphs.
  Advisor: N. El Maalouly / to be completed
  PDF:
  HC:
• Nathalie Bäbler, Improvement of the Trivial Exact Matching Algorithm.
  Advisor: N. El Maalouly (head), B. Gärtner / June 18, 2021
  PDF: link
  HC:
• Alain Bastian, Edge coloring complete geometric graphs.
  Advisor: M. Hoffmann, M. M. Reddy / May 31, 2021
  PDF:
  HC:
• Qi Cai, Unique Sink Orientations of Simple 3-Polytopes..
  Advisor: B. Gärtner / January 14, 2021
  PDF: link
  HC:
• Simon Gautschi,, P-matroid Unique Sink Orientations.
  Advisor: S. Weber (head), B. Gärtner / to be completed
  PDF:
  HC:
• Valentin Stoppiello, Perfect Coarsening and Slack for Triangulation Flips Graphs in Higher Dimensions.
  Advisor: N. Grelier, P. Schnider, E. Welzl (head) / September 1, 2021
  PDF: link
  HC:
• Chio Ge, The Multi-Run procedure in ARRIVAL.
  Advisor: B. Gärtner, H. Hoang / July 5, 2021
  PDF: link
  HC:
• David Gu, Random Ternary Search Trees..
  Advisor: B. Gärtner / June 29, 2021
  PDF: link
  HC:
• Sebastian Haslebacher, Restrictions on ARRIVAL (Part 2).
  Advisor: B. Gärtner, H. Hoang / January 14, 2021
  PDF: link
  HC:
• Nicola Hoffstetter, Delaunay Depth Histograms, (D-MATH)..
  Advisor: D. Bertschinger (head), E. Welzl / September 17, 2021
  PDF: link
  HC:
• Lukas Egeling,, The Connectivity of Edge Flip Graphs of Few Points in the Plane..
  Advisor: Th. Pham, E. Welzl / March 19, 2021
  PDF: link
  HC:
• Nils Jensen, Undecided Linear Programming.
  Advisor: B. Gärtner (head), E. Welzl / June 8, 2021
  PDF: link
  HC:
• Ari Jordan, Routing in Convex Partitions with Few Edges..
  Advisor: N. Grelier, M. Hoffmann / February 19, 2021
  PDF:
  HC:
• Ivana Klasovita, Teaching Computer Science to Third- and Fourth-Graders.
  Advisor: B. Gärtner / July 12, 2021
  PDF: link
  HC:
• Enrico Mann, Lions on Graphs..
  Advisor: D. Bertschinger (head), M. M. Reddy / to be completed
  PDF:
  HC:
• Maximilian Mosler, Exact Linear Programming.
  Advisor: B. Gärtner (head), Bram van den Heuvel / July 16, 2021
  PDF: link
  HC:
• Manuel Nowack, Hamiltonicity of Minimal Jump Graphs.
  Advisor: B. Gärtner, S. Ilchi (head) / to be completed
  PDF:
  HC:
• Luca Pinter, Covering Points with Lines..
  Advisor: N. Grelier / to be completed
  PDF: link
  HC:
• Patrick Stählin, Study of different constraints for matching problems in graphs.
  Advisor: N. El Maalouly / to be completed
  PDF: link
  HC:
• Michael Stemmle, Solving Graph Labeling Problems via Universal Simultaneous Messaging Protocol..
  Advisor: B. Gärtner, S. Ilchi / March 1, 2021
  PDF: link
  HC:
Valentin Stoppiello, The Structure of Triangulation Flip Graphs in Dimension 3 and Beyond.
Advisor: N. Grelier, E. Welzl / February 28, 2021
PDF:
HC:
• Jan Tempus, Conditional Oriented Matroids and Range Spaces.
  Advisor: B. Gärtner / to be completed
  PDF:
  HC:
• Yiting Wang, Sum-product theory in the matrix rings.
  Advisor: Th. Pham, E. Welzl / June 28, 2021
  PDF: link
  HC:
Manuel Wiedmer, Reachability in the Hunger Game, D-MATH.
Advisor: B. Gärtner, H. Hoang (head) / September 30, 2021
PDF: link
HC:
• Mengtao Zhang, Behaviour of branching random walks on connected graphs.
  Advisor: T. Taubner, E. Welzl / February 28, 2021
  PDF: link
  HC:



2020

Master

• Katharina Daun, Teaching Scratch in Grades 5 and 6.
  Advisor: Bernd Gärtner / March 1, 2020
  PDF: link
  HC:
• Michael Frey, Counting Polygonizations on the Double Chain via Meanders and Path Covers.
  Advisor: M. Wettstein / September 1, 2020
  PDF: link
  HC:
• Justin Dallant, Counting Partial Triangulations.
  Advisor: D. Bertschinger, E. Welzl / September 15, 2020
  PDF: link
  HC:
• Simon Weber, Random Facet on Cyclic USOs.
  Advisor: B. Gärtner / November 10, 2020
  PDF: link
  HC:

Bachelor

• Davide Bernardi, Eyed and Bowed Unique Sink Orientations.
  Advisor: Bernd Gärtner / January 23, 2020
  PDF: link
  HC:
• Justin Dallant, Algorithms for (p,q)-theorems. (semester thesis)
  Advisor: P. Schnider / January 31, 2020
  PDF: link
  HC:
• Daniel Rutschmann, Approximate Median Selection with Unreliable Comparisons.
  Advisor: C.-H. Liu / February 24, 2020
  PDF: link
  HC:
• Tobias Birchler, Enclosing Depth.
  Advisor: Bernd Gärtner / August 2, 2020
  PDF: link
  HC:
• Sebastian Haslebacher, Restrictions on ARRIVAL.
  Advisor: Bernd Gärtner, Hung Hoang / Juni 29, 2020
  PDF: link
  HC:
• Ning Gao, Graphs inherited from Tukey depth.
  Advisor: P. Schnider, T. Taubner / Juli 25, 2020
  PDF: link
  HC:
• Yuan Gao, The Lamperski Property in Unique Sink Orientations.
  Advisor: Bernd Gärtner / June 8, 2020
  PDF: link
  HC:
• Philip Jordan, Discrete and Computational Geometry on the Sphere.
  Advisor: Nicolas Grelier, Emo Welzl / October 7, 2020
  PDF: link
  HC:
• Manuel Nowack, EMinimum Jump Graph.
  Advisor: Hung Hoang, Torsten Mütze / July 10, 2020
  PDF: link
  HC:
• Jonas Passweg, Depth Histograms.
  Advisor: Daniel Bertschinger, Patrick Schnider / July 12, 2020
  PDF: link
  HC:
• Julian Schilliger, Unique Sink Orientations of the Combinatorial Hypercube.
  Advisor: Bernd Gärtner / August 4, 2020
  PDF: link
  HC:



2019

Master

• Daniel Bertschinger, One-sided Epsilon-approximants.
  Advisor: P. Schnider / July 1, 2019
  PDF: link
  HC:
• Giovanni Compagnoni, Flip Graphs of Combinatorial Triangulations.
  Advisors: H. Hoang, M. Hoffmann / September 26, 2019
  PDF: link
  HC:
• Cyril Frei, Algorithms for Transversals.
  Advisors: L. Barba, P. Schnider/ July 31, 2019
  PDF:link
  HC:
• Johannes Obenaus, Spanning Trees with Low (Shallow) Stabbing Number.
  Advisors: M. Hoffmann, W. Mulzer (FU Berlin), E. Welzl / December 6, 2019
  PDF: link
  HC:
• Swaneet Sahoo, Majority Model on Complex Networks.
  Advisors: B. Gärtner, Ahad N. Zehmakan / March 1, 2019
  PDF: link
  HC:
• Raphael Wegner, Computing the Distance between Convex Polyhedra.
  Advisor: L. Barba / September 16, 2019
  PDF: link
  HC:

Bachelor

• Manuel Göggel, Randomly Climbing a Ladder.
  Advisor: B. Gärtner / April 16, 2019
  PDF: link
  HC:
• Jakob Roffler, Solving Small Unique Sink Orientations.
  Advisor: B. Gärtner, H. Hoang / March 29, 2019
  PDF: link
  HC:
• Emanuel Seemann, Monotone topological book embeddings of planar graphs with fixed spinal order.
  Advisors: M. Hoffmann, M. M. Reddy / December 31, 2019
  PDF: link
  HC:
• Jan Schilliger, Unique Sink Orientations and End of Potential Line.
  Advisors: B. Gärtner, H. Hoang / July 29, 2019
  PDF: link
  HC:
• Nina Wiedemann, The Random Facet algorithm on cyclic USOs. (semester thesis)
  Advisors: B. Gärtner / October 1, 2019
  PDF: link
  HC:



2018

Master

• Clemens Jeger, Random Majority Model.
  Advisors: B. Gärtner, A.N. Zehmakan / 6.3.2018
  PDF: link
  HC:
• Wendel Liu, Combinatorial structure and algorithms in shape-constrained spline model selection.
  Advisors: B. Gärtner, E. Welzl / 31.10.2018
  PDF: link
  HC:

Bachelor

• Alain Bastian, Dynamos in the Majority Model.
  Advisor: B. Gärtner / 20.12.2018
  PDF: link
  HC:
• Daniel Bertschinger, Non-straight Drawings. (semester thesis)
  Advisor: M. Hoffmann / 21.12.2018
  PDF: link
  HC:
• Cyril Frei, Collision detection between polyhedra with linear movement.
  Advisors: L. Barba, E. Welzl/ 20.09.2018
  PDF:link
  HC:
• Lucas Irvine, Rumour Spreading in Random Gatherings.
  Advisor: B. Gärtner/ 10.01.2018
  PDF: link
  HC:
• Jela Kovecevic, Graceful Flip Graphs..
  Advisors: M. Hoffmann, J. Nummenpalo/ 23.07.2018
  PDF: link
  HC:
• Stefan Lochau, Simplicial depth for multiple points. (semester thesis)
  Advisors: A. Pilz, P. Schnider/ 01.06.2018
  PDF: link
  HC:
• Stefan Tiegel ARRIVAL: A zero player graph game.
  Advisor: B. Gärtner/ 23.08.2018
  PDF: link
  HC:
• Jonathan Unger, Pseudo Unique Sink Orientations.
  Advisor: B. Gärtner/ 09.12.2018
  PDF: link
  HC:
• Jakob von Kalle, Ambracing Triangels, Graphs of Polytopes, and Linear Programs.
  Advisors: B. Gärtner, M. Milatz/ 19.04.2018
  PDF: link
  HC:

2017

Master

• Anastasia Moskovaya, Graph Packing.
  Advisors: M. Hoffmann, E. Welzl / 26. 1. 2017
  PDF: link
  HC:
• Kilian Risse, Unique Sink Orientations of the Combinatorial Hypercube.
  Advisors: B. Gärtner, A. Thomas / 20. 3. 2017
  PDF: link
  HC:Y
• Roland Schmid, Layers of complete geometric graphs.
  Advisors: L. Barba, P. Schnider / to be completed
  PDF:link
  HC:
• Christian Schneebeli, Partitions into Crossing-Free Graphs.
  Advisors: A. Pilz, P. Schnider, E. Welzl / 7. 3. 2017
  PDF: link
  HC:Y

Bachelor

• Stefan Oancea, Exploring graceful labelings of trees.
  Advisors: M. Hoffmann, J. Nummenpalo, E. Welzl / 20. 6. 2017
  PDF: link
  HC:

2016

Master

• L. Teodoro Filippini, Constructing Covering Codes.
  Advisors: C. Annamalai, E. Welzl / 23. 3. 2016
  PDF: link
  HC:Y
• Robin Leroy, On the number of crossing-free perfect matchings with designated left and right endpoints.
  Advisors: E. Welzl, M. Wettstein / 15. 10. 2016
  PDF:link
  HC:
• Georg Nührenberg, Integrated timetabling and rolling stock scheduling for public transportation.
  Advisors: B. Gärtner, M. Laumans, R. Zenklusen / 5. 7. 2016
  PDF:link
  HC:Y
• Pál András Papp, SAT Sparsification - Under Investigation.
  Advisors: C. Annamalai, E. Welzl / 24. 3. 2016
  PDF:link
  HC:Y

Bachelor

• Patrick Gantner, Approximating the Traveling Salesman Problem on Graphic Metrics.
  Advisors: M. Szedlák, E. Welzl / 24. 6. 2016
  PDF:link
  HC:
• Clemens Jeger, Bereichsevakuierung.
  Advisors: B. Gärtner, E. Welzl / 10. 6. 2016
  PDF:link
  HC:Y
• Nicolas Kirchmayr, The Kidney Exchange Problem.
  Advisors: P. Dütting, E. Welzl / 18. 5. 2016
  PDF:link
  HC:
• Janis Nertinger, Book Embeddings of Planar Graphs.
  Advisors: M. Hoffmann, E. Welzl / 2. 9. 2016
  PDF:link
  HC:
• Laurin Köhler-Schindler, Random Majority-voting.
  Advisors: B. Gärtner, A. N. Zehmakan, E. Welzl / 11. 11. 2016
  PDF:link
  HC:Y

2015

Master

• Vitor Bosshard, Classical and Quantum Algorithms for USO Recognition,
  Advisors: A. Baumeler, B. Gärtner, S. Wolf / 13.10.2015
  PDF: link
  HC:
• Jérôme Dohrau, Edge Flips in Combinatorial Triangulations,
  Advisors: Michael Hoffmann, Vincent Kusters / 4.11.2015
  PDF:link
  HC:
• Luca Eggemann, Survey on Random SAT,
  Advisors: Timon Hertli, Emo Welzl / 24.2.2015
  PDF:link
  HC:Y
• Nathanael Gutmann, Intersection Restricted Families of Sets,
  Advisors: Torsten Mütze, Emo Welzl / 9.3.2015
  PDF: link
  HC:Y
• Jakob Olbrich, Screening Rules for Machine Learning Applications,
  Advisors: B. Gärtner, M. Jaggi / 9.9.2015
  PDF:link
  HC:
• Patrick Schnider, Partitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths,
  Advisors: Manuel Wettstein, Emo Welzl / 25.7.2015
  PDF:link
  HC:Y

Bachelor

• Stephan Ammann, Draw an outerplanar graph and a matching at the same time,
  Advisors: Michael Hoffmann, Vincent Kusters / 2.4.2015
  PDF:
  HC:
• Michael Bühler, A new Algorithm for Linear programming,
  Advisors: B. Gärtner / 31.7.2015
  PDF:link
  HC:Y
• Christian Schneebeli, Polyhedral Boundary Detection with Random Walk,
  Advisors: Komei Fukuda, May Szedlák / 18.11.2015
  PDF:link
  HC:
• Pascal Su, Hamilton cycles in Kneser graphs,
  Advisors: Torsten Mütze, Emo Welzl / 23.3.2015
  PDF: link
  HC:Y
• Julia Wysling, Screening Rules for Support Vector Machines,
  Advisors: B. Gärtner, M. Jaggi / 15.2.2015
  PDF:link
  HC:

2014

Master

• Isabelle Hurbain, Towards the Derandomization of the PPSZ algorithm for the Multiple Satisfying Assignments Case,
  Advisor: Timon Hertli / 31.3.2014
  PDF: link
  HC:Y

Bachelor

• Luca Eggemann, A View of Triangulations as Maximal Cliques,
  Advisor: Emo Welzl / 8.5.2014
  PDF:link
  HC:
• Qinheping Hu, Survey on Partial Satisfaction,
  Advisors: Timon Hertli, Emo Welzl / 22.8.2014
  PDF:link
  HC:Y
• Patrick Schnider, Shortest Paths in Disk Coverings,
  Advisors: Michael Hoffmann, Torsten Mütze / 1.1.2014
  PDF: link
  HC:

2013

Master

• Akaki Mamageishvili, 3-Dimensional thickenings and embeddings of 2-dimensional complexes,
  Advisor: Uli Wagner / 9.4.2013
  PDF:link
  HC:
• Marco Nembrini, Lossless Data Compression (LDC),
  Advisors: Marcus Hutter (Australian National University, Canberra), Emo Welzl / 1.3.2013
  PDF:
  HC:
• Manuel Wettstein, Algorithms for Counting Crossing-free Configurations,
  Advisor: Emo Welzl / 5.4.2013
  PDF:link
  HC:
• May Szedlák, On the Cheeger Inequality for Simplicial Complexes,
  Advisor: Anna Gundert / 20.8.2013
  PDF:
  HC:
• Hörður Yngvason, A study of zonotopes with applications in biomechanics,
  Advisors: Bernd Gärtner, Komei Fukuda / 2.11.2013
  PDF:link
  HC:Y

Bachelor

• Vitor Bosshard, Regular Unique Sink Orientations,
  Advisor: Bernd Gärtner / 31.08.2013
  PDF:link
  HC:
• Shun Fukuda, K-USOs and locally uniform P-USOs, (not submitted)
  Advisor: Bernd Gärtner / 29.10.2013
  PDF:
  HC:
• Sven Hammann, Band matrix linear complementarity problems,
  Advisor: Bernd Gärtner / 3.12.2013
  PDF:link
  HC:
• Isabelle Hurbain, Understanding the PPSZ Algorithm for Clause Satisfaction Problems,
  Advisor: Timon Hertli / 19.09.2013
  PDF:link
  HC:Y
• Johannes Kirschner, Reinforcement Learning with Linear Function Approximation,
  Advisors: Marcus Hutter (Australian National University, Canberra), Emo Welzl / 16.12.2013
  PDF:
  HC:
• Steve Muller, Optimal Randomized Algorithms,
  Advisor: Emo Welzl / 21.8.2013
  PDF:
  HC:
• Nico Neureiter, Verifying Unsatisfiability Using a Certificate,
  Advisor: Timon Hertli / 17.7.2013
  PDF:link
  HC:Y

2012

Master

• Abel Camacho, Abstract Optimization Problems and Combinatorial Abstractions,
  Advisors: Bernd Gärtner / 14.3.2012
  PDF:link
  HC:
• Sebastian Millius, Towards a Generalization of the PPSZ Algorithm for Large Domains and Multiple Solutions,
  Advisors: Timon Hertli, Robin Moser / 19.4.2012
  PDF:link
  HC:
• Lovro Soldo, Stochastic Geometric Facility Location Problem,
  Advisors: Subhash Suri (UC Santa Barbara), Emo Welzl / 30.9.2012
  PDF:
  HC:Y

Bachelor

• Ersan Aras, Überdeckung einer Disk mit Halbdisks,
  Advisor: B. Gärtner / 26.6.2012
  PDF:link
  HC:Y
• Dominik Müller, About Constricted Cycles in Nash Equilibria of the Local Connection Game,
  Advisors: Matus Mihalak, Emo Welzl / 13.1.2012.
  PDF:
  HC:
• Yoshiki Ota, Takeru Takahashi, Klee-Minty Cubes are also Goldfarb Cubes,
  Advisor: B. Gärtner / 4.10.2012
  PDF:link
  HC:
• Michel Verlinden, Sublinear Algorithms for Support Vector Machines,
  Advisor: Martin Jaggi / 16.1.2012.
  PDF:link
  HC:

2011

Master

• Andreas Bärtschi, Coloring Variations of the Art Gallery Problem,
  Advisors: Subhash Suri (UC Santa Barbara), Emo Welzl / 25.8.2011
  PDF:
  HC:
• Beat Saurenmann, Algorithms and Combinatorics of Linear CNF-Formulas,
  Advisors: Heidi Gebauer, Timon Hertli / 1.10.2011
  PDF:link
  HC:Y
• Jan Christoph Schlegel, Which metrics are planar?,
  Advisor: Uli Wagner / 30.04.2011
  PDF:
  HC:
• Markus Sprecher, The Complexity of P-LCP,
  Advisor: Bernd Gärtner / 5.7.2011
  PDF:link
  HC:Y

Bachelor

• Bernhard Friedrich Brodowsky, Sparse Regularity Revisited,
  Advisor: Uli Wagner / 23.12.2011
  PDF:link
  HC:
• Elena Fattorini, The Kidney Exchange Problem: Algorithmic and Game-Theoretic Considerations,
  Advisors: Matus Mihalak, Emo Welzl / 20.4.2011
  PDF:link
  HC:
• Frank Mousset, Rainbow Cycles and Paths,
  Advisor: Heidi Gebauer / 22.8.2011
  PDF:link
  HC:Y
• Aditya Gupta, Smallest Enclosing Balls of Points: A Faster and more Flexible Implementation, (not submitted)
  Advisor: Bernd Gärtner / 13.7.2011
  PDF:
  HC:
• Jan Christoph Schlegel, The Structure of Equilibrium Graphs in Network Creation Games,
  Advisors: Matus Mihalak, Emo Welzl / 31.5.2011
  PDF:link
  HC:
• Markus Sprecher, What happens when P is close to K?,
  Advisor: Bernd Gärtner / 11.1.2011
  PDF:link
  HC:
• May Szedlak, Applying the PPSZ Algorithm to Uniquely Satisfiable Constraint Satisfaction Problems,
  Advisor: Robin Moser, Dominik Scheder / 27.6.2011
  PDF:
  HC:
• David Tschirky, Covering a Polygon with Triangles,
  Advisor: Tobias Christ / 5.4.2011
  PDF:
  HC:Y
• Manuel Wettstein, Investigating Violator Spaces,
  Advisor: Yves Brise, Bernd Gärtner / 7.7.2011
  PDF:link
  HC:

2010

Master

• Dan Bühler, Describing Rectilinear Regions,
  Advisor: Tobias Christ / 10.8.2010
  PDF:
  HC:Y
• Christian Helbling, Extreme points in medium and high dimensions,
  Advisor: Bernd Gärtner / 17.11.2010
  PDF: link
  HC:Y
• Timon Hertli, Investigating and improving the PPSZ algorithm for SAT ,
  Advisor: Robin Moser, Dominik Scheder / 15.10.2010
  PDF: link
  HC:Y
• Michèle Müller-Itten, Packing Rectangles into a Square,
  Advisor: Michael Hoffmann, Marek Sulovský / 25.6.2010
  PDF:
  HC:
• Stefan Kraft, Structural Properties of Minimal Unsatisfiable and Autarky-Free CNF Formulas,
  Advisor: Heidi Gebauer, Dominik Scheder / 11.4.2010
  PDF:link
  HC:
• Stefan Schneider, Random Walk Algorithms for SAT,
  Advisor: Robin Moser / 15.8.2010
  PDF:link
  HC:Y

Bachelor

• Mikheil Amashukeli, Constrained Plane Graphs with Parity Constraints,
  Advisor: Michael Hoffmann / 15.7.2010
  PDF:
  HC:
• Jörg Bader, Experiments for Counting Triangulations of Point Sets,
  Advisor: Emo Welzl / 30.9.2010
  PDF:
  HC:
• Timon Hertli, A Simple Algorithm for 3-SAT,
  Advisor: Dominik Scheder / 8.4.2010
  PDF:link
  HC:Y
• Urs Holzer, Reductions preserving Size,
  Advisor: Dominik Scheder / 25. 6. 2010
  PDF:
  HC:Y
• Akaki Mamageishvili, Embeddings of 2-Dimensional Complexes: Small Examples,
  Advisor: Uli Wagner / 15.7.2010
  PDF:
  HC:
• Clément Maria, An Exponential Lower Bound on the Complexity of Regularization Paths,
  Advisors: Bernd Gärtner, Martin Jaggi / 27.8.2010
  PDF:link
  HC:

2009

Master

• Andrea Francke, Quasioptima for Linear Programs,
  Advisors: Bernd Gärtner, Uli Wagner / 3.12.2009
  PDF:link
  HC:Y
• Andrei Giurgiu, Random Walk Algorithms for SAT,
  Advisor: Robin Moser / 25.09.2009
  PDF:link
  HC:
• Dave Meyer, Implementierung von geometrischen Algorithmen für Support-Vektor-Maschinen,
  Advisor: Martin Jaggi / 13.8.2009
  PDF:link
  HC:Y
• Sabrina Wiedersheim, Spiders and Snowflakes,
  Advisor: Michael Hoffmann / 13.3.2009
  PDF:
  HC:

Bachelor

• Andrea Francke, In Search of the Boundaries of Intractability for Euclidean Degree-k MST Problems
  Advisor: M. Hoffmann / 6.10.2009
  PDF:
  HC:Y
• Stefan Kraft, The History of Mersenne's Conjecture,
  Advisor: B. Gärtner / 15.9.2009
  PDF:link
  HC:Y
• Zygmunt Malecki, Fairy Chess Endgames
  Advisors: B. Gärtner / 23.6.2009
  PDF:link
  HC:
• Aurosish Mishra, Wireless Vertex Guards,
  Advisor: Michael Hoffmann, Tobias Christ / 15.7.2009
  PDF:
  HC:

2008

Master

• Daniel Donatsch, Variants of the smallest enclosing ball problem
  Advisor: B. Gärtner / 8.2.2008
  PDF:link
  HC:Y
• Gabriel Katz, Tropical convexity, halfspace arrangements and optimization
  Advisors: M. Jaggi, U. Wagner / 5.9.2008
  PDF: link
  HC:Y
• Lucia Keller, Probabilistic and combinatorial methods of partial satisfaction of k-satisfiable CNF formulas
  Advisor: D. Scheder / 7.2.2008
  PDF:link
  HC:Y
• Rafael Robleda, Eine dünnbesetzte Version des CGAL-Lösers für Quadratische Programme/i>
  Advisor: B. Gärtner / 5.2.2008
  PDF:link
  HC:Y

Bachelor

• Ruedi Becker, Bounded Two-Colorings of Planar Subcubic Graphs
  Advisor: R. Berke / 3.7.2008
  PDF:
  HC: Y
• Dan Bühler, Rekursiv Gekämmte Würfel
  Advisor: B.Gärtner / 5.8.2008
  PDF:link
  HC: Y
• Andrea Francke, Bounded Degree Spanning Trees
  Advisor: Michael Hoffmann / 31.10.2008
  PDF:
  HC:
• Sarah Hauser, An Exact Algorithm for the Chromatic Number of Hypergraphs
  Advisors: R. Berke, P. Zumstein / 1.2.2008
  PDF:
  HC:Y
• Praveen Kumar Naga Katta, Polychromatic colorings of the cube,
  Advisor: Tibor Szabó / 15.7.2008
  PDF:
  HC:
• Dave Meyer, Unique Sink Orientations in Gittergraphen
  Advisor: B. Gärtner / 30.12.2008
  PDF:link
  HC:
• Thao Minh Vuong, Triple-Crossings of Triangles and Equivariant Methods,
  Advisor: Uli Wagner / 15.7.2008
  PDF:
  HC:
• Lutz Warnke, Symmetry in Satisfiability (Excellence Project)
  Advisor: E. Welzl / 26.8.2008
  PDF:
  HC:

2007

Master

• Heidi Gebauer, How many Hamiltonian Cycles, Spanning Trees, Perfect Matchings are there?
  Advisors: T. Szabó, E. Welzl / 4.3.2007
  PDF:link
  HC:Y
• Stefanie Gubler, Biased Positional Games
  Advisor: T. Szabó / 9.3.2007
  PDF:
  HC:
• Anna Höpli, The Game of SAT
  Advisors: D. Scheder, E. Welzl / 26.7.2007
  PDF:
  HC:Y
• Niels Kistler, Curve Invariants, Gauss Diagrams, and Dissection Graphs
  Advisor: U. Wagner / 18.7.2007
  PDF:
  HC:Y
• Corinne Roos, Multiroute Flows - Theory and Practice
  Advisors: P. Kolman, J. Matousek (Charles University Prague), E. Welzl / 14.4.2007
  PDF:
  HC:Y
• Jeannine Röthlin, Über die Komplexität des MinMax Regret Problem
  Advisor: B. Gärtner / 31.7.2007
  PDF:link
  HC:Y
• Hugues Salamin, Splitting Algorithms and Lower Bounds for SAT
  Advisor: E. Welzl / 28.2.2007
  PDF:
  HC:
• Bruno Spori, Transforming Crossing-Free Configurations in Geometric Graphs
  Advisor: A. Razen / 24.9.2007
  PDF:
  HC:Y
• Jeannette Spühler, Coloring 4-colorable graphs by combining Arora-Chlamatac-Charikar, Blum and Alon-Kahale
  Advisors: J. Håstad (KTH Stockholm), E. Welzl / 31.8.2007
  PDF:
  HC:Y
• Björn Steffen, Visualizing Higher-Dimensional Point Configurations
  Advisor: U. Wagner / 26.4.2007
  PDF:
  HC:
• Stefanie Zürcher, Minimal Ramsey Graphs
  Advisors: T. Szabó, P. Zumstein / 9.3.2007
  PDF:
  HC:

Bachelor

• Stefan Geisseler, Hard Instances for Local Search
  Advisor: P. Traxler / 15.5.2007
  PDF:
  HC:Y
• Olivia Gradenwitz, Does Spectral Analysis Work?
  Advisors: J. Giesen, E. Schuberth / 6.9.2007
  PDF:
  HC:Y
• Chinmay Jain, The List Coloring Number of the Hypercube,
  Advisor: T. Szabó / 12.7.2007
  PDF:
  HC:
• Niels Kistler, Gamut Mapping by Using Locally Optimal Solutions
  Advisors: J. Giesen, E. Schuberth / 2.2.2007
  PDF:
  HC:Y
• Simon Lüthy, Unique Sink Orientations Generated by Convex Functions
  Advisors: B. Gärtner, L. Rüst / 28.8.2007
  PDF:
  HC:
• Thomas Rauber, The Linear Arboricity of Graphs
  Advisor: R. Berke / 7.9.2007
  PDF:
  HC:Y
• Rafael Robleda, A Randomized Approximation Algorithm for the Smallest Bridgeless Spanning Subgraph Problem
  Advisor: D. Scheder / 11.10.2007
  PDF:
  HC:
• David Umbricht, Best Overlap of Graphs
  Advisors: M. Sulovský, E. Welzl / 27.11.2007
  PDF:
  HC:Y
• Anuradha Venugopalan, Homomorphisms of Geometric Graphs,
  Advisor: U. Wagner / 12.7.2007
  PDF:
  HC:
• Sabrina Wiedersheim, Conflict Free Coloring of Hypergraphs
  Advisors: R. Berke, E. Welzl / 7.9.2007
  PDF:
  HC:Y
• Lutz Warnke, The 8-Queens Problem - Mathematics and Experiments with Randomization
  Advisors: R. Berke, E. Welzl / 1.3.2007
  PDF:
  HC:Y

2006

Master

• Jutta Bonan, Gamut Mapping Using Support Vector Machines
  Advisors: J. Giesen, E. Schuberth / 2.3.2006
  PDF:
  HC:Y
• Yves Brise, Structure and Generation of Splitting Rules for SAT
  Advisors: Ph. Zumstein, E. Welzl / 2.10.2006
  PDF:
  HC:Y
• Michael Bumann, Visualizing Concepts in Satisfiability
  Advisors: A. Razen, Ph. Zumstein, E. Welzl / 31.8.2006
  PDF:
  HC:Y
• Michael Eigensatz, Detecting Shape Features in Sampled Surfaces Using the Slab SVM
  Advisors: J. Giesen, M. Pauly, J. Buhmann / 16.3.2006
  PDF:
  HC:
• Martin Jaggi, Linear and Quadratic Programming by Unique Sink Orientations
  Advisor: B. Gärtner / 9.9.2006
  PDF:link
  HC:Y
• Claudia Käppeli, Ratio of Satisfiable Clauses Under Local Constraints
  Advisors: D. Scheder, E. Welzl / 11.10.2006
  PDF:
  HC:Y
• Balint Miklos, The Medial Axis and Growing Balls
  Advisors: J. Giesen, M. Pauly / 5.9.2006
  PDF:
  HC:
• Samuel Zürcher, Anistropic Smallest Enclosing Balls
  Advisor: B. Gärtner / 28.2.2006
  PDF:link
  HC:Y

Bachelor

• Bhaskara Aditya, k-Wise Intersection Theorems
  Advisor: T. Szabó / 5.7.2006
  PDF:
  HC:
• Anshul Gandhi, Perfectly Centered Neighborly Polytopes
  Advisor: U. Wagner / 5.7.2006
  PDF:
  HC:
• Dominic Meier, k-Satisfiable CNF Formulas with and without Repetitions
  Advisor: E. Welzl / 7.7.2006
  PDF:
  HC:Y
• Robin Moser, On the Search for Solutions to Bounded Occurrence Instances of SAT
  Advisor: E. Welzl / 15.7.2006
  PDF:
  HC:Y
• Amit Smotra, Improving CGAL's Quadratic Programming Solver (not submitted)
  Advisor: B. Gärtner / 5.7.2006
  PDF:
  HC:
• Daniel Zeiter, Image Dependent Gamut Mapping
  Advisors: J. Giesen, E. Schuberth / 3.3.2006
  PDF:
  HC:
• Samuel Zuercher, Forbidden Patterns in 0-1 Matrices
  Advisor: R. Berke / 3.3.2006
  PDF:
  HC:Y
• Oliver Zweifel, Psycho-Physical Test for Image Dependent Gamut Mapping
  Advisors: J. Giesen, E. Schuberth / 22.3.2006
  PDF:
  HC:

2005

Master

• Danilo Negro, Algorithms for the Minimum Path Cover Problem in Graphs
  Advisor: Y. Okamoto / 1.3.2005
  PDF:
  HC:Y
• Andreas Razen, Counting Satisfying 2-SAT Assignments
  Advisors: T. Szabó, E. Welzl / 28.2.2005
  PDF:
  HC:Y
• Marion Wenger, Hall Type Theorems for Graphs and Hypergraphs - an Approach Through Triangulations
  Advisors: T. Szabó, P. Csorba / 28.2.2005
  PDF:
  HC:Y
• Philipp Zumstein, Comparison of Spectral Methods Through the Adjacency Matrix and the Laplacian of a Graph
  Advisor: T. Szabó / 28.2.2005
  PDF:
  HC:Y

Bachelor

• Miklos Balint, Geometric Modelling with the Flow Complex
  Advisor: J. Giesen / 29.09.2005
  PDF:
  HC:
• Yves Brise, Hierachical Spectral Clustering
  Advisors: J. Giesen, D. Mitsche / 26.9.2005
  PDF:
  HC:Y
• Heidi Gebauer, On Counting the Number of Forests in a Graph
  Advisor: Y. Okamoto / 22.3.2005
  PDF:link
  HC:Y
• Claudia Käppeli, Satisfiability in 2-Satisfiable Formulae
  Advisor: E. Welzl / 23.10.2005
  PDF:
  HC:Y
• Joest Smit, Optimization over Conic Regions
  Advisor: B. Gärtner / 21.10.2005
  PDF:link
  HC:

2004

Master

• Stefan Feistenauer, Conformal Alpha Shapes
  Advisor: J. Giesen / 13.10.2004
  PDF:
  HC:Y
• Sabina Giavera, Applications of Fourier Analysis in Computer Science
  Advisor: M. Cochand, IFOR ETH Zurich (E. Welzl) / 15.3.2004
  PDF:
  HC:Y
• Axel Rasche, On Kalai's survey of linear proramming and simple polytopes
  Advisor: B. Gärtner / 10.3.2004
  PDF:link
  HC:Y
• Dominik Raymann, Implementation of Alon-Yuster-Zwick's Color-Coding Algorithm
  Advisor: Y. Okamoto / 5.8.2004
  PDF:
  HC:Y
• Leonard Rüst, Unique Sink Orientations on Grids (master thesis)
  Advisor: B. Gärtner / 14.3.2004
  PDF:link
  HC:Y
• Johannes Schneider, Estimating the State of a Markov Process (master thesis)
  Advisor: O. Watanabe, Tokyo Institute of Technology, (E. Welzl) / 10.5.2004
  PDF:
  HC:
• Marina Suà, Vermutung von Keller für Orientierungen mit Eindeutiger-Senke-Eigenschaft
  Advisor: I. Schurr / 10.3.2004
  PDF:
  HC:Y
• Joris Ticozzelli, Analyzing Single Point Estimators for Conjoint Analysis
  Advisors: J. Giesen, S. Spalinger / 3.3.2004
  PDF:
  HC:Y
• Josias Thöny, Entropy and Sorting
  Advisors: J. Giesen / 28.7.2004
  PDF:
  HC:Y
• Elias Vicari, Off-Diagonal Ramsey Numbers
  Advisor: T. Szabó / 11.3.2004
  PDF:
  HC:Y

Bachelor

• Thomas Bietenhader, Core stability of minimum coloring games
  Advisor: Y. Okamoto / 11.3.2004.
  PDF:
  HC:Y
• Stefan Feistenauer, Two Applications of the adaptive neighborhood graph
  Advisor: J. Giesen / 15.2.2004.
  PDF:
  HC:Y
• Isha Geigenfeind, Implementation of miniball-of-balls using USO-algorithms
  Advisor: K. Fischer / 29.3.2004.
  PDF:
  HC:
• Tobias Gysi, Efficient generation of the hamiltonian paths in cocomparability graphs
  Advisor: Y. Okamoto / 21.10.2004.
  PDF:link
  HC:Y
• Mélanie Raemy, Approximation algorithms for matroids
  Advisor: Y. Okamoto / 10.9.2004.
  PDF:
  HC:Y
• Stefano Tessaro, Randomized algorithms to locate the sink in low dimensional unique sink orientations of cubes
  Advisors: I. Schurr, T. Szabó / 22.10.2004.
  PDF:link
  HC:Y

2003

Master

• Michael Balmer, Finding the Sink in a Unique Sink Oriented 5-Cube
  Advisor: T. Szabó / 3.3.2003
  PDF:
  HC:Y
• Philipp Gehr, Reconstructing Surfaces that Exhibit Sharp Features
  Advisor: J. Giesen, M. John / 24.3.2003
  PDF:
  HC:Y
• Michel Hauswirth, Call Control in Stars and Rings
  Advisor: U. Adamy / 28.2.2003
  PDF:
  HC:Y
• Didier Matthey, Feature Segmentation of Union of Balls
  Advisor: J. Giesen / 28.11.2003
  PDF:
  HC:Y
• Stefan Mehr, Implementation of a Hierarchical Miniball Algorithm
  Advisor: K. Fischer, J. Giesen / 18.12.2003
  PDF:
  HC:Y
• Fabio Roncoroni, Spectral Clustering under Noise
  Advisor: J. Giesen / 19.12.2003
  PDF:
  HC:
• Stephan Schärli, Automatische Erzeugung von Requirements Dokumenten
  Advisor: J. Giesen / 9.7.2003
  PDF:
  HC:Y
• Simon Spalinger, Conjoint Analysis for Requirements Prioritizing
  Advisor: J. Giesen / 27.2.2003
  PDF:
  HC:Y

Bachelor

• Mattias Andersson, Provably Good Normal Approximation Using k Nearest Neighbours
  Advisor: B. Speckmann / 31.3.2003.
  PDF:
  HC:
• Oliver Bay, Implementation and Visualisierung eines Approximationsalgorithmus für minimale Manhattan Netzwerke
  Advisors: B. Speckmann, B. Weber / 21.5.2003.
  PDF:
  HC:
• Lisa von Böhmer, Analysis and Visualization of 4-Cube-Orientations
  Advisor: F. Tschirschnitz / 31.3.2003.
  PDF:
  HC:Y
• Lisa von Böhmer, Hamiltonicity of Zonotopes
  Advisor: Y. Okamoto / 15.10.2003.
  PDF:
  HC:Y
• Matthias Hengartner, Hamiltonian Cycles in Segment Endpoint Visibility Graphs
  Advisor: M. Hoffmann / 18.6.03.
  PDF:
  HC:Y
• Anja Krech, Turan-Type Problems in the Hypercube
  Advisor: T. Szabó / 31.3.2003.
  PDF:
  HC:
• Shankar Lakshminarayanan, P-Matrix LCP and Quadratic Programming
  Advisor: B. Gärtner / 31.3.2003.
  PDF:link (project)
  HC:
• Leonard Rüst, LCP-Algorithmen für kleinste umschliessende Bälle
  Advisor: B. Gärtner / 15.6.2003.
  PDF:link
  HC:
• Johannes Schneider, On a Randomized Algorithm to Focus a Picture
  Advisor: T. Szabó / 4.11.2003.
  PDF:
  HC:Y
• Daniel Soll, Unique Sink Orientations from Various Points of View
  Advisor: B. Gärtner / 31.3.2003.
  PDF:
  HC:

2002

Master

• Matthias Kaufmann, Schöning's k-SAT algorithm
  Advisor: U. Wagner / 28. 2. 2002
  PDF: link
  HC:Y
• Papik Meli, Spectral Voronoi Clustering
  Advisor: J. Giesen / 28. 2. 2002
  PDF:
  HC:Y
• Michel Stöcklin, Algorithms and Implementations for Disk Induced Flows
  Advisors: J. Giesen, M. John / 28. 2. 2002
  PDF: link
  HC:Y

Bachelor

• Mattias Andersson, Rectangle Grid Packing (Pre-Doc mid term)
  Advisor: B. Gärtner / 19. 12. 2002.
  PDF:
  HC:
• Péter Csorba, Finding Transversals with Bounded Components (Pre-Doc final)
  Advisor: T. Szabó / 26. 3. 2002.
  PDF:
  HC:
• Kaspar Fischer, Implementation of Miniball of Balls (Pre-Doc final)
  Advisor: E. Welzl / 26. 3. 2002.
  PDF:
  HC:
• Philipp Keller, On-line Market Research
  Advisor: J. Giesen / 15. 3. 2002.
  PDF:
  HC:Y
• Yoshio Okamoto, Unique Sink Orientations and Related Topics (Pre-Doc final)
  Advisor: E. Welzl / 26. 3. 2002.
  PDF:
  HC:
• Daniel Soll, Cycles in Smallest-Enclosing-Ball Induced USO (Pre-Doc mid term)
  Advisor: B. Gärtner, E. Welzl / 19.12. 2002.
  PDF:link
  HC:
• Milos Stojakovic, Small Sample Spaces for Permutations (Pre-Doc final)
  Advisor: E. Welzl / 26. 3. 2002.
  PDF:link
  HC:
• Frans Wessendorp, Optimal Search in Unique Sink Orientations of the 5-Cube (Pre-Doc final)
  Advisor: T. Szabó / 26. 3. 2002.
  PDF:
  HC:

2001

Diploma

• Fischer Kaspar, The Smallest Enclosing Ball of Balls
  Advisor: B. Gärtner / Completed: Apr 3, 2001.
  PDF:link
  HC:Y
• Wessendorp Franciscus, Notes on Morris' Cube Orientations
  Advisor: B. Gärtner / Completed: Mar 18, 2001.
  PDF:link
  HC:

Semester/Predoc

• Brändle Markus, Flächenvereinfachung
  Advisor: U. Adamy / Completed: Oct 18, 2001.
  PDF:
  HC:Y
• Péter Csorba, Finding Transversals with Bounded Components, (Pre-Doc mid term)
  Advisor: T. Szabó / Completed: Dec 20, 2001.
  PDF:
  HC:
• Eisenring Michael, Decomposition of Masses, (Pre-Doc mid term)
  Advisor: M. Cieliebak, Zs. Lipták, E. Welzl / Completed: Dec 20, 2001.
  PDF:
  HC:
• Gatto Michael, Enumerating Corner Cuts
  Advisor: U. Wagner / Completed: Mar 30, 2001.
  PDF:
  HC:Y
• Gehr Philipp, Delaunay Based Feature Detection in 2D
  Advisors: J. Giesen, U. Adamy / Completed: Oct 11, 2001.
  PDF:
  HC:Y
• Pietrzak Krzysztof, Ist OPT=OPTBAR NP-hart?
  Advisor: C. Ambühl / Completed: Mar 30, 2001.
  PDF:
  HC:
• Stöcklin Michel, Delaunay Based Feature Detection in 3D
  Advisors: J. Giesen, U. Adamy / Completed: Oct 11, 2001.
  PDF:
  HC:
• Stojakovic Milos, Small Sample Spaces, (Pre-Doc mid term)
  Advisor: E. Welzl / Completed: Dec 20, 2001.
  PDF:link
  HC:

• Wessendorp Franciscus, Optimal Search in Unique Sink Orientations of the 5-Cube, (Pre-Doc mid term)
  Advisor: T. Szabó / Completed: Dec 20, 2001.
  PDF:
  HC:

2000

Diploma

• Thomas Herrmann, Berechnung der Breite dreidimensionaler Punktmengen
  Betreuer: B. Gärtner
  fertiggestellt am 29. Februar 2000
  PDF:
  HC:Y
• Uli Wagner (FU Berlin und ETH Zürich), Continuous counterparts of j-facets and h-vectors
  Betreuer: E. Welzl
  fertigestellt am 14. Januar 2000
  PDF:
  HC:

Semester

• Martin Gantenbein, Entwurf einer Computational Geometry Bibliothek in Java
  Betreuer: M. John
  fertigestellt am 14.Juli 2000
  PDF:link
  HC:

1999

Diploma

• Oscar Chinellato, Subexponentielle Algorithmen für das Kürzester Vektor Problem
  Betreuer: J. Blömer
  Beginn: 16. November 1998
  fertiggestellt am 15. März 1999
  PDF:
  HC:Y
• Vincent Tscherter, Rekonstruktion von Bahn und Karten aus Scandaten
  Betreuer: L. Kettner und E. Welzl
  Beginn: 6. April 1999
  fertiggestellt am 5. August 1999
  PDF:
  HC:Y
• Samuele Pedroni, Aufzählen und Abzählen von Triangulierungen
  Betreuer: B. Gärtner und E. Welzl
  Beginn: 30. April 1999
  fertiggestellt am 17. August 1999
  PDF:
  HC:Y
• Thomas Andres Specification and Implementation of a Conic Class for CGAL
  Betreuer: B. Gärtner
  Beginn: 1. Mai 1999
  fertiggestellt am 27. August 1999
  PDF:link
  HC:Y

Semester

• Kaspar Fischer, Gale Transformation
  Betreuer: B. Gärtner
  fertiggestellt am 22. Juni 1999
  PDF:
  HC:Y
• Franz Wessendorp, Abstrakte Zielfunktionen auf dem 4-Würfel
  Betreuer: B. Gärtner
  fertiggestellt am 1. März 1999
  PDF:link
  HC:

1998

Diploma

• Christoph Ambühl, Untersuchungen zum List-Update-Problem
  Betreuer: B Gärtner, B. von Stengel
  fertiggestellt am 3. März 1998
  PDF:
  HC:Y
• Thomas Kausch, Gitter, ihre Anwendung in der Kryptographie und Nichtapproximierbarkeitsresultate
  Betreuer: J. Blömer
  Beginn: 15. April 1998
  fertiggestellt am 14. August 1998
  PDF:
  HC:Y
• Maya Weisstanner, Beispiele für symmetrische Polynome in stochastischen Prozessen
  Betreuer: B. Trachsler, J. Blömer
  Beginn: 14. April 1998
  fertiggestellt am 13. August 1998
  PDF:
  HC:Y

Semester

• Thomas Kausch, Minimale Schnitte in Graphen
  Betreuer: J. Giesen
  fertiggestellt am 3. Februar 1998
  PDF:
  HC:Y
• Bartosz Przydatek, Probabilistische Methoden für das Teilsummenproblem
  Betreuer: E. Welzl
  fertiggestellt am 25. August 1998
  PDF:
  HC:Y

1997

Diploma

• Stephan Eidenbenz, Optimale Nichtapproximierbarkeitsresultate und die Klasse MaxSNP
  Betreuer: Dr. Johannes Blömer
  Abgabe der Arbeit: 23.07.97
  PDF:
  HC:Y
• Philippe Bolgiani Visualisierung von Kugelmodellen von Molekülen
  Betreuer: Hans-Martin Will
  Abgabe der Arbeit: 11.03.97
  PDF:
  HC:Y