photo of Pascal

Dr Pascal SCHWEITZER

Position:CS Visiting Fellow
Email: pascal.schweitzer@anu.edu.au
Url:http://users.cecs.anu.edu.au/~pascal/
Building:CSIT (108)
Room:N333
Department:CS, AlgData
Staff category:Visitor
FNR AFR Marie-Curie
FNR AFR Marie-Curie
ANU

Research Interests


  • Graph isomorphisms
  • Ramsey Numbers
  • Algorithmic Graph Theory
  • Geometric Group theory
  • Complexity of Word Problems of Groups
  • Certifying Algorithms

Publications


  • C. Bertolini, M. Schäf, P. Schweitzer: Infeasible Code Detection
    to appear in Proceedings of Verified Software: Theories, Tools and Experiments (VSTTE2012) Philadelphia, USA, 2012
  • P. Schweitzer: Isomorphism of (mis)labeled graphs
    In Proceedings of European Symposium on Algorithms (ESA2011) Saarbrücken, Germany, 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)
  • 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)
  • 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


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

Teaching



Academic Appointments



Education



Hobbies


  • Volleyball, Cycling, Snowboarding, Fruit, Diving