Photo Patrick Schnider

Patrick Schnider

mail: patrick.schnider@inf.ethz.ch
phone:+41-44-633 4909
address: Institute of Theoretical Computer Science, ETH Zürich, CAB G 36.2, Universitätstr. 6, CH - 8092 Zürich

I am a PhD student at ETH Zürich in the Department of Computer Science, Theory of Combinatorial Algorithms Group, led by Prof. Emo Welzl My research interests are discrete and computational geometry.

Theses and Publications:

Even flying cops should think ahead,
Joint work with Anders Martinsson, Florian Meier, Angelika Steger
Appeared in Abstracts 5th International Symposium on Combinatorial Optimization ISCO 2018), Marrakesh, Morocco, 2018.
Full version available on ArXiv.
NP-Completeness of Max-Cut for Segment Intersection Graphs,
Joint work with Oswin Aichholzer, Wolfgang Mulzer, Birgit Vogtenhuber
Appeared in Abstracts 34th European Workshop on Computational Geometry (EuroCG '18), Berlin, Germany, 2018.
A combinatorial measure of closeness in point sets,
Joint work with Alexander Pilz
Appeared in Abstracts 34th European Workshop on Computational Geometry (EuroCG '18), Berlin, Germany, 2018.
The Partition Spanning Forest Problem,
Joint work with Philipp Kindermann, Boris Klemz, Ignaz Rutter, André Schulz
Appeared in Abstracts 34th European Workshop on Computational Geometry (EuroCG '18), Berlin, Germany, 2018.
Sharing a pizza: bisecting masses with two cuts,
Joint work with Luis Barba.
Appeared in Abstracts 29th Canadian Conference on Computational Geometry (CCCCG '17), Ottawa, Canada, 2017, 174-178.
A Generalization of Crossing Families,
Appeared in Abstracts 33rd European Workshop on Computational Geometry (EuroCG '17), Malmö, Sweden, 2017, 273-276.
Full version available on ArXiv.
Packing Plane Spanning Double Stars into Complete Geometric Graphs,
Appeared in Abstracts 32nd European Workshop on Computational Geometry (EuroCG '16), Lugano, Switzerland, 2016, 91-94.
Partitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths,
Master thesis in Mathematics, July 2015.
Shortest Paths in Disk Coverings,
Bachelor thesis in Mathematics, August 2013.

Talks:

A combinatorial measure of closeness in point sets
22 March 2018, EuroCG 2018 Freie Universität Berlin
The Partition Spanning Forest Problem
21 March 2018, EuroCG 2018 Freie Universität Berlin
Measures of depth for multiple points
8 December 2017, Mittagsseminar TU Berlin
Measures of depth for multiple points
9 November 2017, Mittagsseminar ETHZ
Sharing a pizza: bisecting masses with two cuts
27 July 2017, CCCG 2017 Carleton University, Ottawa
Best Student Presentation Award
A Generalization of Crossing Families
7 April 2017, EuroCG 2017 Malmö University
How to share a pizza
30 March 2017, Mittagsseminar ETHZ
A Generalization of Crossing Families
21 June 2016, Mittagsseminar ETHZ
Packing Plane Spanning Double Stars into Complete Geometric Graphs
30 March 2016, EuroCG 2016 USI Lugano
Partitions with Plane Spanning Double Stars
25 August 2015, Mittagsseminar ETHZ

Teaching:

Algorithmen und Wahrscheinlichkeit, Spring 2018
Geometry: Combinatorics & Algorithms , Fall 2017
Algorithmen und Wahrscheinlichkeit, Spring 2017
Geometry: Combinatorics & Algorithms , Fall 2016
Diskrete Mathematik , Fall 2015