Andreas Schmid
Research Interests
Graph Theory
Graph Algorithms
Approximation Algorithms
Publications
A Tight Extremal Bound on the Lovasz Cactus Number in Planar Graphs
with Parinya Chalermsook and Sumedha Uniyal
Proceedings of the 36th Symposium on Theoretical Aspects of Computer Science (STACS'19) (pdf)(Full)
Computing Tutte Paths
with Jens M. Schmidt
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP'18) (pdf)
Finding Triangles for Maximum Planar Subgraphs
with Parinya Chalermsook
Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM'17)(pdf)
Computing 2-Walks in Polynomial Time
with Jens M. Schmidt
Proceedings of the 32nd Symposium on Theoretical Aspects of Computer Science (STACS'15) (pdf)
Journal Version: ACM Transactions on Algorithms (TALG)
Teaching
Winter 2016/2017, Teaching Assistant for Algorithms and Data Structures
Winter 2015/2016, Teaching Assistant for Approximation Algorithms
Winter 2014/2015, Tutor for Algorithms and Data Structures
Summer 2014, Tutor for Optimization
Summer 2013, Teaching Assistant for Graph Theory
Education
November 2018 - November 2019:
Visiting Doctoral Candidate at Aalto University, Espoo, Finnland.
August 2017 - November 2017:
Visiting Student Researcher at the Simons Institute for the Theory of Computing, University of California, Berkeley.
April 2014 - December 2019:
Ph. D. in Computer Science at the Universität des Saarlandes, Saarbrücken, Germany and the Max-Planck-Institut für Informatik
Title of PhD Thesis: Plane and Simple: Using Planar Subgraphs for Efficient Algorithms (supervisors: Prof. Dr. Kurt Mehlhorn, Prof. Dr. Parinya Chalermsook) (link)
October 2011 - February 2014:
Master Degree in Computer Science at the Universität des Saarlandes
Title of Master's Thesis: 2-Walks in 3-Connected Planar Graphs are Polynomial Time Computable (supervisors: Prof. Dr. Kurt Mehlhorn, Dr. Jens M. Schmidt)