default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJens M. Schmidt
Person information
- affiliation: Universität Rostock, Rostock, Germany
- affiliation (former): TU Ilmenau, Institute of Mathematics
- affiliation (former): Max Planck Institute for Informatics
- affiliation (former): FU Berlin, Department of Computer Science
- affiliation (former): Dortmund University, Department of Computer Science
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[j33]On-Hei Solomon Lo, Jens M. Schmidt, Nico Van Cleemput, Carol T. Zamfirescu:
Shortness parameters of polyhedral graphs with few distinct vertex degrees. Discret. Math. 348(1): 114518 (2025)- [j32]Christian Ortlieb, Jens M. Schmidt:
Structural parameters of Schnyder woods. Discret. Math. 348(2): 114282 (2025) - 2024
- [j31]On-Hei Solomon Lo
, Jens M. Schmidt:
Generalized cut trees for edge-connectivity. J. Comb. Theory B 165: 47-67 (2024) - [j30]Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt:
Rooted minors and locally spanning subgraphs. J. Graph Theory 105(2): 209-229 (2024) - [c20]Christian Ortlieb, Jens M. Schmidt:
Toward Grünbaum's Conjecture. SWAT 2024: 37:1-37:17 - [i22]Christian Ortlieb, Jens M. Schmidt:
Trees and co-trees in planar 3-connected planar graphs An easier proof via Schnyder woods. CoRR abs/2402.01230 (2024) - [i21]Christian Ortlieb, Jens M. Schmidt:
Toward Grünbaum's Conjecture. CoRR abs/2402.05681 (2024) - 2023
- [j29]Tsz Lung Chan, Matthias Kriesell, Jens M. Schmidt:
Contractible edges in longest cycles. J. Graph Theory 103(3): 542-563 (2023) - 2021
- [j28]On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup:
Compact cactus representations of all non-trivial min-cuts. Discret. Appl. Math. 303: 296-304 (2021) - [j27]On-Hei Solomon Lo, Jens M. Schmidt:
Cycle Spectra of Contraction-Critically 4-Connected Planar Graphs. Graphs Comb. 37(6): 2129-2137 (2021) - [j26]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Circumference of essentially 4-connected planar triangulations. J. Graph Algorithms Appl. 25(1): 121-132 (2021) - [c19]Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, Mithinti Srikanth:
On Short Fastest Paths in Temporal Graphs. WALCOM 2021: 40-51 - 2020
- [j25]Johanna E. Preißer, Jens M. Schmidt:
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. Algorithmica 82(1): 146-162 (2020) - [j24]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): 1 (2020) - [j23]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Longer cycles in essentially 4-connected planar graphs. Discuss. Math. Graph Theory 40(1): 269-277 (2020) - [j22]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
On the Circumference of Essentially 4-connected Planar Graphs. J. Graph Algorithms Appl. 24(1): 21-46 (2020) - [i20]Jan Kessler, Jens M. Schmidt:
Dynamics of Cycles in Polyhedra I: The Isolation Lemma. CoRR abs/2002.07698 (2020)
2010 – 2019
- 2019
- [j21]Lena Schlipf, Jens M. Schmidt:
Edge-Orders. Algorithmica 81(5): 1881-1900 (2019) - [j20]Lena Schlipf, Jens M. Schmidt:
Simple computation of st-edge- and st-numberings from ear decompositions. Inf. Process. Lett. 145: 58-63 (2019) - 2018
- [j19]On-Hei Solomon Lo, Jens M. Schmidt:
Longest cycles in cyclically 4-edge-connected cubic planar graphs. Australas. J Comb. 72: 155-162 (2018) - [j18]Matthias Mnich, Ignaz Rutter, Jens M. Schmidt:
Linear-time recognition of map graphs with outerplanar witness. Discret. Optim. 28: 63-77 (2018) - [j17]Jens M. Schmidt:
Tight bounds for the vertices of degree k in minimally k-connected graphs. J. Graph Theory 88(1): 146-153 (2018) - [j16]Matthias Kriesell, Jens M. Schmidt:
More on foxes. J. Graph Theory 89(2): 101-114 (2018) - [j15]Andreas Schmid, Jens M. Schmidt:
Computing 2-Walks in Polynomial Time. ACM Trans. Algorithms 14(2): 22:1-22:18 (2018) - [c18]Andreas Schmid, Jens M. Schmidt:
Computing Tutte Paths. ICALP 2018: 98:1-98:14 - [c17]Johanna E. Preißer, Jens M. Schmidt:
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. ISAAC 2018: 13:1-13:12 - [c16]On-Hei Solomon Lo, Jens M. Schmidt:
A Cut Tree Representation for Pendant Pairs. ISAAC 2018: 38:1-38:9 - [i19]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Even Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR abs/1806.09413 (2018) - [i18]On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup:
Contraction-Based Sparsification in Near-Linear Time. CoRR abs/1810.03865 (2018) - 2017
- [j14]Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt:
Certifying 3-Edge-Connectivity. Algorithmica 77(2): 309-335 (2017) - [c15]Lena Schlipf, Jens M. Schmidt:
Edge-Orders. ICALP 2017: 75:1-75:14 - [i17]On-Hei Solomon Lo, Jens M. Schmidt:
Cut Tree Structures with Applications on Contraction-Based Sparsification. CoRR abs/1707.00572 (2017) - [i16]Andreas Schmid, Jens M. Schmidt:
Computing Tutte Paths. CoRR abs/1707.05994 (2017) - [i15]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR abs/1710.05619 (2017) - 2016
- [j13]Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood:
Thoughts on Barnette's Conjecture. Australas. J Comb. 64: 354-365 (2016) - [j12]Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt:
Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. 32(5): 1641-1650 (2016) - [j11]Jens M. Schmidt:
Mondshein Sequences (a.k.a. (2, 1)-Orders). SIAM J. Comput. 45(6): 1985-2003 (2016) - [c14]Matthias Mnich, Ignaz Rutter, Jens M. Schmidt:
Linear-Time Recognition of Map Graphs with Outerplanar Witness. SWAT 2016: 5:1-5:14 - [i14]Jens M. Schmidt:
A Tight Bound for Minimal Connectivity. CoRR abs/1603.09281 (2016) - [i13]Lena Schlipf, Jens M. Schmidt:
Edge-Orders. CoRR abs/1607.04431 (2016) - [i12]Johanna E. Preißer, Jens M. Schmidt:
Computing Vertex-Disjoint Paths using MAOs. CoRR abs/1609.06522 (2016) - [i11]Matthias Kriesell, Jens M. Schmidt:
More on foxes. CoRR abs/1610.09093 (2016) - 2015
- [j10]Jens M. Schmidt, Pavel Valtr:
Cubic plane graphs on a given point set. Comput. Geom. 48(1): 1-13 (2015) - [j9]Tillmann Miltzow, Jens M. Schmidt, Mingji Xia:
Counting K4-subdivisions. Discret. Math. 338(12): 2387-2392 (2015) - [c13]Therese Biedl, Jens M. Schmidt:
Small-Area Orthogonal Drawings of 3-Connected Graphs. GD 2015: 153-165 - [c12]Andreas Schmid, Jens M. Schmidt:
Computing 2-Walks in Polynomial Time. STACS 2015: 676-688 - [i10]Therese Biedl, Jens M. Schmidt:
Small-Area Orthogonal Drawings of 3-Connected Graphs. CoRR abs/1510.02322 (2015) - 2014
- [j8]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): 325-346 (2014) - [j7]Michael S. Payne, Jens M. Schmidt, David R. Wood:
Which point sets admit a k-angulation? J. Comput. Geom. 5(1): 41-55 (2014) - [c11]Jens M. Schmidt:
The Mondshein Sequence. ICALP (1) 2014: 967-978 - [i9]Tillmann Miltzow, Jens M. Schmidt, Mingji Xia:
Counting K_4-Subdivisions. CoRR abs/1411.4819 (2014) - 2013
- [j6]Jens M. Schmidt:
A simple test on 2-vertex- and 2-edge-connectivity. Inf. Process. Lett. 113(7): 241-244 (2013) - [j5]Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt:
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. J. Graph Theory 72(1): 112-121 (2013) - [j4]Jens M. Schmidt:
Contractions, Removals, and Certifying 3-Connectivity in Linear Time. SIAM J. Comput. 42(2): 494-535 (2013) - [c10]Jens M. Schmidt:
A Planarity Test via Construction Sequences. MFCS 2013: 765-776 - [c9]Carola Doerr, G. Ramakrishna, Jens M. Schmidt:
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. WG 2013: 225-236 - [c8]Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt:
Certifying 3-Edge-Connectivity. WG 2013: 358-369 - [i8]Carola Doerr, G. Ramakrishna, Jens M. Schmidt:
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. CoRR abs/1303.0728 (2013) - [i7]Jens M. Schmidt:
The Mondshein Sequence. CoRR abs/1311.0750 (2013) - 2012
- [j3]Jens M. Schmidt:
Construction Sequences and Certifying 3-connectivity. Algorithmica 62(1-2): 192-208 (2012) - [j2]Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt:
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. Algorithmica 62(3-4): 754-766 (2012) - [j1]Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary:
Largest inscribed rectangles in convex polygons. J. Discrete Algorithms 13: 78-85 (2012) - [c7]Jens M. Schmidt, Pavel Valtr:
Cubic plane graphs on a given point set. SCG 2012: 201-208 - [c6]Jens M. Schmidt:
Certifying 3-Connectivity in Linear Time. ICALP (1) 2012: 786-797 - [i6]Jens M. Schmidt:
A Planarity Test via Construction Sequences. CoRR abs/1202.5003 (2012) - [i5]Michael S. Payne, Jens M. Schmidt, David R. Wood:
Which point sets admit a k-angulation? CoRR abs/1203.3618 (2012) - [i4]Jens M. Schmidt:
A Simple Test on 2-Vertex- and 2-Edge-Connectivity. CoRR abs/1209.0700 (2012) - [i3]Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt:
Certifying 3-Edge-Connectivity. CoRR abs/1211.6553 (2012) - 2011
- [b1]Jens M. Schmidt:
Structure and constructions of 3-connected graphs. Free University of Berlin, 2011, pp. 1-103 - 2010
- [c5]Jens M. Schmidt:
Construction Sequences and Certifying 3-Connectedness. STACS 2010: 633-644 - [i2]Jens M. Schmidt:
Contractions, Removals and How to Certify 3-Connectivity in Linear Time. CoRR abs/1011.6187 (2010)
2000 – 2009
- 2009
- [c4]Jens M. Schmidt:
Interval Stabbing Problems in Small Integer Ranges. ISAAC 2009: 163-172 - [i1]Jens M. Schmidt:
Construction Sequences and Certifying 3-Connectedness. CoRR abs/0912.2561 (2009) - 2007
- [c3]Markus Chimani, Petra Mutzel, Jens M. Schmidt:
Efficient Extraction of Multiple Kuratowski Subdivisions. GD 2007: 159-170 - 2006
- [c2]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: 1224-1231 - [c1]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: 379-380
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-12-12 01:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
