Follow
Jens M. Schmidt
Title
Cited by
Cited by
Year
A simple test on 2-vertex-and 2-edge-connectivity
JM Schmidt
Information Processing Letters 113 (7), 241-244, 2013
982013
Largest inscribed rectangles in convex polygons
C Knauer, L Schlipf, JM Schmidt, HR Tiwary
Journal of discrete algorithms 13, 78-85, 2012
432012
Largest Inscribed Rectangles in Convex Polygons
C Knauer, L Schlipf, JM Schmidt, HR Tiwary
EuroCG'10, 2010
432010
Certifying 3-edge-connectivity
K Mehlhorn, A Neumann, JM Schmidt
Graph-Theoretic Concepts in Computer Science (WG 2013), 358-369, 2013
28*2013
Interval stabbing problems in small integer ranges
JM Schmidt
Algorithms and Computation (ISAAC'09), 163-172, 2009
242009
Structure and constructions of 3-connected graphs
JM Schmidt
182011
Structure and constructions of 3-connected graphs
JM Schmidt
182011
Efficient extraction of multiple Kuratowski subdivisions
M Chimani, P Mutzel, JM Schmidt
Graph Drawing (GD'07), 159-170, 2008
182008
The Mondshein sequence
JM Schmidt
International Colloquium on Automata, Languages, and Programming, 967-978, 2014
172014
Contractions, removals, and certifying 3-connectivity in linear time
JM Schmidt
SIAM Journal on Computing 42 (2), 494-535, 2013
172013
Construction sequences and certifying 3-connectedness
JM Schmidt
Symposium on Theoretical Aspects of Computer Science (STACS'10), 2010
162010
Computing tutte paths
A Schmid, JM Schmidt
arXiv preprint arXiv:1707.05994, 2017
112017
Every DFS tree of a 3‐connected graph contains a contractible edge
A Elmasry, K Mehlhorn, JM Schmidt
Journal of graph theory 72 (1), 112-121, 2013
112013
Compact cactus representations of all non-trivial min-cuts
OHS Lo, JM Schmidt, M Thorup
Discrete applied mathematics 303, 296-304, 2021
92021
Linear-time recognition of map graphs with outerplanar witness
M Mnich, I Rutter, JM Schmidt
Discrete optimization 28, 63-77, 2018
92018
An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
A Elmasry, K Mehlhorn, JM Schmidt
Algorithmica 62 (3-4), 754-766, 2012
92012
On the Circumference of Essentially 4-connected Planar Graphs.
I Fabrici, J Harant, S Mohr, JM Schmidt
J. Graph Algorithms Appl. 24 (1), 21-46, 2020
72020
Thoughts on Barnette's conjecture
H Alt, MS Payne, JM Schmidt, DR Wood
arXiv preprint arXiv:1312.3783, 2013
72013
The Impact of Group Reputation in Multiagent Environments.
B Baranski, T Bartz-Beielstein, R Ehlers, T Kajendran, B Kosslers, ...
IEEE Congress on Evolutionary Computation (CEC'06), 1224-1231, 2006
72006
Computing 2-walks in polynomial time
A Schmid, JM Schmidt
ACM Transactions on Algorithms (TALG) 14 (2), 1-18, 2018
62018
The system can't perform the operation now. Try again later.
Articles 1–20