Philipp Zumstein


Philipp Zumstein
Institut für Theoretische Informatik
ETH Zürich, CAB G 17
Universitätsstr.  6
CH – 8092 Zürich

Phone: 044 632 73 18

Email: zuphilip@inf.ethz.ch
Teaching Assistant
Theoretische Informatik 05 (Kernfach)

Theoretische Informatik 05/06

Theoretische Informatik 06 (Kernfach)

Algorithms, Probability, and Computing 06/07

Extremal Combinatorics 07

Diskrete Mathematik (D-ITET) 07

Datenstrukturen und Algorithmen 08
Advicing

Mittagsseminar: The projective plane of a given order (open)

Master/Diploma/Bachelor/Semester Thesis: Coloring Triangulations (open)

Master/Diploma/Bachelor/Semester Thesis: Ramsey Multiplicity of Graphs (open)

Diploma-Thesis: Visualizing Concepts in Satisfiability
(taken by Michael Buhmann, complete )

Master-Thesis: Structure and Generating of Splitting Rules
(taken by Yves Brise, complete)

Diploma-Thesis: Minimal Ramsey Graphs
(taken by Stefanie Züricher, complete)

Semester-Thesis: On Hypergraph Coloring
(taken by Sarah Hauser, complete)
My Stuff
Diploma Thesis: Comparison of Spectral Methods Through the Adjacency Matrix and the Laplacian of a Graph advised by Tibor Szabó. 

Talk in the Mittagsseminar: Fourier Analysis in Computer Science and Combinatorics Powerpoint-Slides or PDF document

Satisfiability with Exponential Families:
with Dominik Scheder
  • Satisfiability with exponential families. Theory and applications of satisfiability testing--SAT 2007, 148--158, Lecture Notes in Comput. Sci., 4501, Springer, Berlin, 2007 PDF document
  • Talk in the Mittagsseminar ETHZ PDF document
  • Talk at SAT'07 in Lisbon PDF document
Polychromatic Colorings of Plane Graphs:
with N. Alon, R. Berke, K. Buchin, M. Buchin, P. Csorba, S. Shannigrahi, B. Speckmann
  • Polychromatic colorings of plane graphs, Proc. of the 24 Annual Symposium on Computational Geometry, 2008, 338-345 PDF document
  • talk in the Mittagsseminar
  • Journal version to appear
On the minimum degree of Ramsey-minimal graphs:
with Tibor Szabo and Stefanie Zürcher How many conflicts does it need to be unsatisfiable?:
with Dominik Scheder
  • How many conflicts does it need to be unsatisfiable?, Theory and applications of satisfiability testing--SAT 2008, 246--256, Lecture Notes in Comput. Sci., 4996, Springer, Berlin, 2008 PDF document
  • An improved bound on the number of conflicts in unsatisfiable k-CNF formulas arxiv link
Areas of Interest
  • Ramsey theory
  • satisfiability of boolean formulas
  • extremal graph theory
  • spectral graph theory
  • pseudo-random graphs
last update: 16. October 2009 - special thanks to nägi