Jens M. Schmidt

According to our database1, Jens M. Schmidt authored at least 47 papers between 2006 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Circumference of essentially 4-connected planar triangulations.
J. Graph Algorithms Appl., 2021

On Short Fastest Paths in Temporal Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2021

On the Circumference of Essentially 4-connected Planar Graphs.
J. Graph Algorithms Appl., 2020

Longer cycles in essentially 4-connected planar graphs.
Discuss. Math. Graph Theory, 2020

Dynamics of Cycles in Polyhedra I: The Isolation Lemma.
CoRR, 2020

Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs.
Electron. J. Comb., 2020

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs.
Algorithmica, 2020

Simple computation of st-edge- and st-numberings from ear decompositions.
Inf. Process. Lett., 2019

Algorithmica, 2019

Computing 2-Walks in Polynomial Time.
ACM Trans. Algorithms, 2018

Tight bounds for the vertices of degree k in minimally k-connected graphs.
J. Graph Theory, 2018

More on foxes.
J. Graph Theory, 2018

Linear-time recognition of map graphs with outerplanar witness.
Discret. Optim., 2018

Contraction-Based Sparsification in Near-Linear Time.
CoRR, 2018

Even Longer Cycles in Essentially 4-Connected Planar Graphs.
CoRR, 2018

Longest cycles in cyclically 4-edge-connected cubic planar graphs.
Australas. J Comb., 2018

A Cut Tree Representation for Pendant Pairs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Computing Tutte Paths.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Cut Tree Structures with Applications on Contraction-Based Sparsification.
CoRR, 2017

Certifying 3-Edge-Connectivity.
Algorithmica, 2017

Mondshein Sequences (a.k.a. (2, 1)-Orders).
SIAM J. Comput., 2016

Lower Bounds for Locally Highly Connected Graphs.
Graphs Comb., 2016

A Tight Bound for Minimal Connectivity.
CoRR, 2016

Computing Vertex-Disjoint Paths using MAOs.
CoRR, 2016

Thoughts on Barnette's Conjecture.
Australas. J Comb., 2016

Counting K<sub>4</sub>-subdivisions.
Discret. Math., 2015

Cubic plane graphs on a given point set.
Comput. Geom., 2015

Small-Area Orthogonal Drawings of 3-Connected Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Which point sets admit a k-angulation?
J. Comput. Geom., 2014

Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time.
J. Graph Algorithms Appl., 2014

Counting K_4-Subdivisions.
CoRR, 2014

The Mondshein Sequence.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Contractions, Removals, and Certifying 3-Connectivity in Linear Time.
SIAM J. Comput., 2013

Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge.
J. Graph Theory, 2013

A simple test on 2-vertex- and 2-edge-connectivity.
Inf. Process. Lett., 2013

A Planarity Test via Construction Sequences.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Largest inscribed rectangles in convex polygons.
J. Discrete Algorithms, 2012

Construction Sequences and Certifying 3-connectivity.
Algorithmica, 2012

An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.
Algorithmica, 2012

Certifying 3-Connectivity in Linear Time.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Structure and constructions of 3-connected graphs.
PhD thesis, 2011

Contractions, Removals and How to Certify 3-Connectivity in Linear Time
CoRR, 2010

Construction Sequences and Certifying 3-Connectedness.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Interval Stabbing Problems in Small Integer Ranges.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Efficient Extraction of Multiple Kuratowski Subdivisions.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

High-order punishment and the evolution of cooperation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

The Impact of Group Reputation in Multiagent Environments.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006