Logo TU Ilmenau


Juniorprofessor Dr. rer. nat. Jens M. Schmidt

Combinatorial Optimization

Telefon +49 3677 69-3630

E-Mail senden


Jun.-Prof. Dr. Jens M. Schmidt

Jens M. Schmidt

Combinatorial Optimization
Institute of Mathematics, TU Ilmenau

Weimarer Straße 25, Curiebau C210
98693 Ilmenau, Germany

Email:        firstname(without M.)
Phone:      +49 3677 69-3630
Fax:           +49 3677 69-3272

Staff:         Solomon Lo, PhD-student (funded by DFG-grant SCHM3186)
                  Johanna Preißer, PhD-student (funded by DFG-grant SCHM3186)
                  Ute Leithold, Secretary

Research Interests

  • Algorithmic Graph Theory (in particular connectivity and planarity)

  • Big Data and Resilient Networks (in particular the IST Conjecture)

  • Algorithm Engineering

  • Certifying and Simplifying Algorithms


News: I moved to TU Hamburg. This site is not longer maintained.

News: Here is a page describing our new Isolation Lemma.

News: We have openings for up to 2 PhD-Positions, apply here.




  • 2014 - 2020: Juniorprofessor for Combinatorial Optimization at TU Ilmenau (positively evaluated 2016)

  • 2018 - 2019: Visiting Professor (W3 Prof. Schrader), University of Cologne

Research Grants and Professional Experience

  • starting 2020: PI of the 3-year DFG-project Resilient Broadcasting via Independent Spanning Trees

  • 2019 - 2020: PI of the German side of the second DAAD-funded PPP-program between TU Ilmenau and the University of Kosice

  • 2017 - 2018: PI of the German side of the DAAD-funded PPP-program between TU Ilmenau and the University of Kosice

  • 2015 - 2018: PI of the DFG-project Combining Connectivity Theory and Algorithms with MAOs
  • 2015: PC Member of ICALP'15, Kyoto, Japan
  • since 2014: Committee activities in the committees Wissenschaftlicher Nachwuchs and Studierendengewinnung
  • 2013: Co-lecturer of two workshops for Bundeswettbewerb Informatik.
    Since 2016: Jury member of the regional Jugend forscht Math/CS-competition.

  • 2012, 2013, 2016: Supervisor of 3 DAAD WISE programs
  • 2011 - 2012: Assistant Project Leader of the DAAD joint-research cooperation scheme between FU Berlin and University of Melbourne
  • 2010: Organizer of the 33rd Workshop Berliner Algorithmen Tag (BAT 2010), Berlin
  • 2007 - 2010: Member of the DFG-funded Research Group Methods for Discrete Structures, Berlin
  • since 2005: Contributor of

  • 2005: Co-organizer of the Iterated Prisoner's Dilemma-Competition, Dortmund

Software (open source) and Combinatorial Data

  • PCP (C++, with Carolin Kästner):
    Identifies no-instances of the Post correspondence problem for problem sets with bounded length.

  • MinCut (C++, part of next OGDF, with Sascha Alder):
    Fast computation of a minimum cut of a weighted graph using an engineered variant of Nagamochi-Ibaraki. Can handle large graphs up to 5 million edges.

  • EIST (C++, part of OGDF, with Manuel Fiedler):
    Computes exhaustively all edge-independent spanning trees of a graph, which gives a guarantee for the resilience of a network.

  • Combinatorial Data:
    Connectivity related graph counts, some linked with Sloane's integer sequence database.
  • MAOam (C++, part of OGDF, with Sebastian Semper and Sascha Alder):
    Extracts all maximal adjacency orderings of a graph exhaustively and visualizes the output.

  • IntervalStabbing (C++):
    Solves interval stabbing problems in small integer ranges faster and more directly than the state of the art before due to Chazelle.

  • Boyer-Myrvold (C++, part of OGDF):
    Fast O(n)-time implementation of the Boyer-Myrvold planarity test. Features additionally the extraction of multiple Kuratowski subgraphs in output-linear time.


  • Research Immersion Lab on Certifying Algorithms - Winter 2013/14 (MPI Saarbrücken)



If you're interested in doing your Bachelor / Master Thesis in Efficient Algorithms or Graph Theory, I may have a topic for you. Drop by at my office!

  • Sascha Alder, Master (CS): Min-Cut Reworked

  • Julian Sauer, Master (CS): Ising Model: Beyond Planarity

  • Jan Kessler, Master (Math): The Circumference of Essentially 4-Connected Planar Graphs
  • Solomon Lo, PhD (Math): Maximal Adjacency Orderings and Connectivity in Graphs
  • Johanna Preißer, PhD (Math): Theorie und Algorithmen für Zusammenhang in Graphen
  • Luca Trautmann, Bachelor (Math): Zwischen geordneten Pfadpartitionen und Schnyder-Wäldern
  • Michaela Krumbholz, Master (Math): Kontrahierbare Kanten in Spannbäumen 3-zshngd. Graphen und die Konstruktion von Füchsen

  • Andreas Schmid, Master (CS): 2-Walks in 3-Connected Plane Graphs
  • Nicole Haesler, Diplom (Math): Facetten beschränkter Knotengradsumme in Triangulierungen planarer Graphen