I am currently a laureate of the European Post-Doc Institute and Post-Doc at the Forschungsinstitut für Mathematik of ETH Zürich. I also maintain a homepage at the Australian National University.

Pascal Schweitzer

Email: Get email address via email

N. Megow, K. Mehlhorn, P. Schweitzer: Online Graph Exploration: New Results on Old and New Algorithms
Theoretical Computer Science, 463:62-72, 2012

S. Kratsch, P. Schweitzer: Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
In Proceedings of Workshop on Graph Theoretic Concepts in Computer (WG2012) Jerusalem, Isreal, 2012 (arXiv)

P. Eades, S. Hong, Naoki Katoh, Giuseppe Liotta, P. Schweitzer, Yusuke Suzuki: Testing maximal 1-planarity of graphs with a rotation system in linear time - (extended abstract)
In Proceedings of the 20th International Symposium on Graph Drawing (GD2012) Redmond, USA, 2012

C. Bertolini, M. Schäf, P. Schweitzer: Infeasible Code Detection
In Proceedings of Verified Software: Theories, Tools and Experiments (VSTTE2012) Philadelphia, USA, 2012

E. Alkassar, K. Mehlhorn, C. Rizkallah, P. Schweitzer: An Introduction to Certifying Algorithms
it - Information Technology, 53(6):287-293, 2011 (pdf)

P. Schweitzer: Isomorphism of (mis)labeled graphs
In Proceedings of the 19th Annual European Symposium on Algorithms (ESA2011) Saarbrücken, Germany, 2011 (pdf)

N. Shervashidze, P. Schweitzer, E.J. van Leeuwen, K. Mehlhorn, K.M. Borgwardt: Weisfeiler-Lehman Graph Kernels
Journal of Machine Learning Research, 12(Sep):2539−2561, 2011 (pdf)

N. Megow, K. Mehlhorn, P. Schweitzer: Online Graph Exploration: New Results on Old and New Algorithms
In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP2011), Zürich, Switzerland, 2011 (pdf)
(A refined version appeard in the journal Theoretical Computer Science, see above).

R. McConnell, K. Mehlhorn, S. Näher, and P. Schweitzer: Certifying Algorithms
Computer Science Review, 5(2):119-161, 2011 (pdf)

K. Mehlhorn, P. Schweitzer: Progress on certifying algorithms
In Proceedings of Frontiers of Algorithmics (FAW2010), Wuhan, China (pdf)

P. Schweitzer, P. Schweitzer: Connecting face hitting sets in planar graphs
Information Processing Letters, 111(1):11-15, 2010 (pdf,ps)

S. Kratsch, P. Schweitzer: Isomorphism for graphs of bounded feedback vertex set number
In Proceedings of Scandinavian Symposium and Workshops on Algorithm Theory (SWAT2010) Bergen, Norway, June 2010 (pdf,ps)

M. Rusinov, P. Schweitzer: Homomorphism-Homogeneous Graphs
Journal of Graph Theory 65(3):253–262, 2010 (pdf,ps)

S. Angelopoulos, P. Schweitzer: Paging and List Update under Bijective Analysis
In Proceedings of Symposium on Discrete Algorithms (SODA09), New York, New York, USA (pdf,ps)

P. Schweitzer: Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
Information Processing Letters, 109(4):229-232, 2009 (pdf,ps)

P. Cameron, D.Johannsen, T. Prellberg, P. Schweitzer: Counting Defective Parking Functions
Electronic Journal of Combinatorics, 15(1):R92, July 2008 (pdf,ps)

M. Kutz, P. Schweitzer: ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm.
In Proceedings of Workshop on Algorithm Engineering and Experiments (Alenex07), New Orleans, Lousiana, USA. (pdf,ps)

J. Lehnert, P. Schweitzer: The co-word problem for the Higman-Thompson group is context-free
Bulletin of the London Mathematical Society, 39(2):235-241, 2007; doi:10.1112/blms/bdl043 (Abstract ,html, pdf)

Appendix to
R. Bieri: Deficiency and the geometric invariants of a group (with an appendix by Pascal Schweitzer)
Journal of Pure and Applied Algebra, 208(3):951-959, March 2007, Pages 951-959

Phd thesis: Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers. (pdf)

Algorithms COMP4600 in Ss 2011
Algorithms COMP4600 in Ss 2010
Algorithms COMP3600/COMP6466 in Ss 2010
Assistant to Graph Theory lecture in Ws 06/07 given by Benjamin Doerr and Martin Kutz.

January 2012 - present:
Laureate of the European Post-Doc Institute (EPDI)
January 2013 - present:
Postdoctoral Fellowship at the Forschungsinstitut für Mathematik at ETH Zürich (in the course of EPDI Laureateship)
Juli 2012 - January 2013:
JSPS Postdoctoral Fellowship at the Japan Advanced Institute of Science and Technology (in the course of EPDI Laureateship)
January 2012 - May 2012:
Fellowship Grant at Institut Mittag-Leffler (in the course of EPDI Laureateship)
June 2010 - January 2012
Visting Fellow at the Australian National University founded by an AFR PostDoc Grant of the Fonds National de la Recherche of Luxembourg
July 2009 - June 2010:
PostDoc at the Max-Planck-Institut für Informatik

March 2006 - July 2009:
Ph. D. student in Computer Science at the Universität des Saarlandes, Saarbrücken, Germany and the Max-Planck-Institut für Informatik
Title of PhD Thesis: Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers. (supervisor: Prof. Dr. Kurt Mehlhorn) (pdf)
October 2002 - Dezember 2005:
Studies in Mathematics at the Johann Wolfgang Goethe University of Frankfurt
Title of Master Thesis (Diplomarbeit): Novikov Completions and their Application to the Geometric Invariant. (supervisor: Prof. Dr. Robert Bieri) (pdf in German )
October 2001 - October 2002:
Studies in Mathematics at the Fernuniversität Hagen
June 2001:
Abitur at the Otto-Hahn-Gymnasium Saarbrücken