Jens M. Schmidt

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 40

Top Venues

CoRR

J. Graph Theory

Algorithmica

J. Graph Algorithms Appl.

Free University of Berlin (PHD)

Education History

Free University of Berlin

PHD

Publications

Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt
Rooted minors and locally spanning subgraphs. J. Graph Theory 105 (2) (2024)
Christian Ortlieb, Jens M. Schmidt
Trees and co-trees in planar 3-connected planar graphs An easier proof via Schnyder woods. CoRR (2024)
Christian Ortlieb, Jens M. Schmidt
Toward Grünbaum's Conjecture. SWAT (2024)
Christian Ortlieb, Jens M. Schmidt
Toward Grünbaum's Conjecture. CoRR (2024)
On-Hei Solomon Lo, Jens M. Schmidt
Generalized cut trees for edge-connectivity. J. Comb. Theory, Ser. B 165 (2024)
Tsz Lung Chan, Matthias Kriesell, Jens M. Schmidt
Contractible edges in longest cycles. J. Graph Theory 103 (3) (2023)
On-Hei Solomon Lo, Jens M. Schmidt
Cycle Spectra of Contraction-Critically 4-Connected Planar Graphs. Graphs Comb. 37 (6) (2021)
On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
Compact cactus representations of all non-trivial min-cuts. Discret. Appl. Math. 303 (2021)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
Circumference of essentially 4-connected planar triangulations. J. Graph Algorithms Appl. 25 (1) (2021)
Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, M. Srikanth
On Short Fastest Paths in Temporal Graphs. WALCOM (2021)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
Longer cycles in essentially 4-connected planar graphs. Discuss. Math. Graph Theory 40 (1) (2020)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
On the Circumference of Essentially 4-connected Planar Graphs. J. Graph Algorithms Appl. 24 (1) (2020)
Johanna E. Preißer, Jens M. Schmidt
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. Algorithmica 82 (1) (2020)
Jan Kessler, Jens M. Schmidt
Dynamics of Cycles in Polyhedra I: The Isolation Lemma. CoRR (2020)
On-Hei Solomon Lo, Jens M. Schmidt, Nico Van Cleemput, Carol T. Zamfirescu
Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs. Electron. J. Comb. 27 (1) (2020)
Lena Schlipf, Jens M. Schmidt
Edge-Orders. Algorithmica 81 (5) (2019)
Lena Schlipf, Jens M. Schmidt
Simple computation of st-edge- and st-numberings from ear decompositions. Inf. Process. Lett. 145 (2019)
Matthias Kriesell, Jens M. Schmidt
More on foxes. J. Graph Theory 89 (2) (2018)
Jens M. Schmidt
Tight bounds for the vertices of degree k in minimally k-connected graphs. J. Graph Theory 88 (1) (2018)
Andreas Schmid, Jens M. Schmidt
Computing Tutte Paths. ICALP (2018)
Johanna E. Preißer, Jens M. Schmidt
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. ISAAC (2018)
Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
Linear-time recognition of map graphs with outerplanar witness. Discret. Optim. 28 (2018)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
Even Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR (2018)
On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
Contraction-Based Sparsification in Near-Linear Time. CoRR (2018)
On-Hei Solomon Lo, Jens M. Schmidt
Longest cycles in cyclically 4-edge-connected cubic planar graphs. Australas. J Comb. 72 (2018)
Andreas Schmid, Jens M. Schmidt
Computing 2-Walks in Polynomial Time. ACM Trans. Algorithms 14 (2) (2018)
On-Hei Solomon Lo, Jens M. Schmidt
A Cut Tree Representation for Pendant Pairs. ISAAC (2018)
Andreas Schmid, Jens M. Schmidt
Computing Tutte Paths. CoRR (2017)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR (2017)
Lena Schlipf, Jens M. Schmidt
Edge-Orders. ICALP (2017)
On-Hei Solomon Lo, Jens M. Schmidt
Cut Tree Structures with Applications on Contraction-Based Sparsification. CoRR (2017)
Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
Certifying 3-Edge-Connectivity. Algorithmica 77 (2) (2017)
Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt
Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. 32 (5) (2016)
Johanna E. Preißer, Jens M. Schmidt
Computing Vertex-Disjoint Paths using MAOs. CoRR (2016)
Lena Schlipf, Jens M. Schmidt
Edge-Orders. CoRR (2016)
Jens M. Schmidt
A Tight Bound for Minimal Connectivity. CoRR (2016)
Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood
Thoughts on Barnette's Conjecture. Australas. J Comb. 64 (2016)
Matthias Kriesell, Jens M. Schmidt
More on foxes. CoRR (2016)
Jens M. Schmidt
Mondshein Sequences (a.k.a. (2, 1)-Orders). SIAM J. Comput. 45 (6) (2016)
Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
Linear-Time Recognition of Map Graphs with Outerplanar Witness. SWAT (2016)
Therese C. Biedl, Jens M. Schmidt
Small-Area Orthogonal Drawings of 3-Connected Graphs. Graph Drawing (2015)
Therese C. Biedl, Jens M. Schmidt
Small-Area Orthogonal Drawings of 3-Connected Graphs. CoRR (2015)
Tillmann Miltzow, Jens M. Schmidt, Mingji Xia
-subdivisions. Discret. Math. 338 (12) (2015)
Andreas Schmid, Jens M. Schmidt
Computing 2-Walks in Polynomial Time. STACS (2015)
Jens M. Schmidt, Pavel Valtr
Cubic plane graphs on a given point set. Comput. Geom. 48 (1) (2015)
Tillmann Miltzow, Jens M. Schmidt, Mingji Xia
Counting K_4-Subdivisions. CoRR (2014)
Michael S. Payne, Jens M. Schmidt, David R. Wood
Which point sets admit a k-angulation? J. Comput. Geom. 5 (1) (2014)
Jens M. Schmidt
The Mondshein Sequence. ICALP (1) (2014)
Carola Doerr, G. Ramakrishna, Jens M. Schmidt
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. J. Graph Algorithms Appl. 18 (3) (2014)
Carola Doerr, G. Ramakrishna, Jens M. Schmidt
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time CoRR (2013)
Carola Doerr, G. Ramakrishna, Jens M. Schmidt
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. WG (2013)
Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
Certifying 3-Edge-Connectivity. WG (2013)
Jens M. Schmidt
A Planarity Test via Construction Sequences. MFCS (2013)
Jens M. Schmidt
Contractions, Removals, and Certifying 3-Connectivity in Linear Time. SIAM J. Comput. 42 (2) (2013)
Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. J. Graph Theory 72 (1) (2013)
Jens M. Schmidt
A simple test on 2-vertex- and 2-edge-connectivity. Inf. Process. Lett. 113 (7) (2013)
Jens M. Schmidt
The Mondshein Sequence. CoRR (2013)
Michael S. Payne, Jens M. Schmidt, David R. Wood
Which point sets admit a k-angulation? CoRR (2012)
Jens M. Schmidt
A Planarity Test via Construction Sequences CoRR (2012)
Jens M. Schmidt
Certifying 3-Connectivity in Linear Time. ICALP (1) (2012)
Jens M. Schmidt
Construction Sequences and Certifying 3-connectivity. Algorithmica 62 (1-2) (2012)
Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. Algorithmica 62 (3-4) (2012)
Jens M. Schmidt, Pavel Valtr
Cubic plane graphs on a given point set. SCG (2012)
Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
Certifying 3-Edge-Connectivity CoRR (2012)
Jens M. Schmidt
A Simple Test on 2-Vertex- and 2-Edge-Connectivity CoRR (2012)
Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary
Largest inscribed rectangles in convex polygons. J. Discrete Algorithms 13 (2012)
Jens M. Schmidt
Contractions, Removals and How to Certify 3-Connectivity in Linear Time CoRR (2010)
Jens M. Schmidt
Construction Sequences and Certifying 3-Connectedness. STACS (2010)
Jens M. Schmidt
Construction Sequences and Certifying 3-Connectedness CoRR (2009)
Jens M. Schmidt
Interval Stabbing Problems in Small Integer Ranges. ISAAC (2009)
Markus Chimani, Petra Mutzel, Jens M. Schmidt
Efficient Extraction of Multiple Kuratowski Subdivisions. Graph Drawing (2007)
Bastian Baranski, Thomas Bartz-Beielstein, Rüdiger Ehlers, Thusinthan Kajendran, Björn Kosslers, Jörn Mehnen, Tomasz Polaszek, Ralf Reimholz, Jens M. Schmidt, Karlheinz Schmitt, Danny Seis, Rafael Slodzinski, Simon Steeg, Nils Wiemann, Marc Zimmermann
The Impact of Group Reputation in Multiagent Environments. IEEE Congress on Evolutionary Computation (2006)
Bastian Baranski, Thomas Bartz-Beielstein, Rüdiger Ehlers, Thusinthan Kajendran, Björn Kosslers, Jörn Mehnen, Tomasz Polaszek, Ralf Reimholz, Jens M. Schmidt, Karlheinz Schmitt, Danny Seis, Rafael Slodzinski, Simon Steeg, Nils Wiemann, Marc Zimmermann
High-order punishment and the evolution of cooperation. GECCO (2006)

Jens M. Schmidt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jens M. Schmidt