Logo TU Ilmenau


Juniorprofessor Dr. rer. nat. Jens M. Schmidt

Combinatorial Optimization

Telefon +49 3677 69-3630

E-Mail senden

Ihre Position


Jun.-Prof. Dr. Jens M. Schmidt

Jens M. Schmidt

TU Ilmenau
Combinatorial Optimization
Institute of Mathematics

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)

  • Simplification and Certification of Algorithms


  • 2018 - 2019: Visiting Professor (W3 Prof. Schrader), University of Cologne
  • since 2014: Juniorprofessor for Combinatorial Optimization at TU Ilmenau (positively evaluated 2016)

Professional Experience and Research Grants

  • starting 2019: 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)

  • OGDF EIST (with Manuel Fiedler, in next dev-version): Computes all edge-independent spanning trees of a graph (C++).
  • OGDF MAOam (with Sebastian Semper): Exhaustive extraction and visualization of all maximal adjacency orderings of a graph.

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

  • OGDF Planarity Test: Fast O(n)-time C++-implementation of Boyer-Myrvold + extraction of multiple Kuratowski subgraphs, see also here


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


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

  • since 12/2018: Jan Kessler, Master (Math), University of Cologne
    Longest Cycles in Graphs
  • since 10/2015: Solomon Lo, PhD (Math), TU Ilmenau
    Maximal Adjacency Orderings and Connectivity in Graphs

  • since 07/2015: Johanna Preißer, PhD (Math), TU Ilmenau
    Theorie und Algorithmen für Zusammenhang in Graphen
  • 09/2016 - 12/2016: Luca Trautmann, Bachelor (Math), TU Ilmenau
    Zwischen geordneten Pfadpartitionen und Schnyder-Wäldern
  • 03/2015 - 08/2015: Michaela Krumbholz, Master (Math), TU Ilmenau
    Kontrahierbare Kanten in Spannbäumen 3-zusammenhängender Graphen und die Konstruktion von Füchsen

  • 08/2013 - 01/2014: Andreas Schmid, Master (CS), Saarland University
    2-Walks in 3-Connected Plane Graphs
  • 11/2011 - 04/2012: Nicole Haesler, Diplom (Math), FU Berlin
    Facetten beschränkter Knotengradsumme in Triangulierungen planarer Graphen