A simple test on 2-vertex-and 2-edge-connectivity JM Schmidt Information Processing Letters 113 (7), 241-244, 2013 | 100 | 2013 |
Largest Inscribed Rectangles in Convex Polygons C Knauer, L Schlipf, JM Schmidt, HR Tiwary EuroCG'10, 2010 | 45 | 2010 |
Certifying 3-edge-connectivity K Mehlhorn, A Neumann, JM Schmidt Graph-Theoretic Concepts in Computer Science (WG 2013), 358-369, 2013 | 29* | 2013 |
Interval stabbing problems in small integer ranges JM Schmidt Algorithms and Computation (ISAAC'09), 163-172, 2009 | 25 | 2009 |
Contractions, removals, and certifying 3-connectivity in linear time JM Schmidt SIAM Journal on Computing 42 (2), 494-535, 2013 | 18 | 2013 |
Structure and constructions of 3-connected graphs JM Schmidt | 18 | 2011 |
Efficient extraction of multiple Kuratowski subdivisions M Chimani, P Mutzel, JM Schmidt Graph Drawing (GD'07), 159-170, 2008 | 18 | 2008 |
The Mondshein sequence JM Schmidt International Colloquium on Automata, Languages, and Programming, 967-978, 2014 | 17 | 2014 |
Construction sequences and certifying 3-connectedness JM Schmidt Symposium on Theoretical Aspects of Computer Science (STACS'10), 2010 | 17 | 2010 |
Mitigating risk of failure in information technology projects: Causes and mechanisms J Schmidt Project Leadership and Society 4, 100097, 2023 | 14 | 2023 |
Computing tutte paths A Schmid, JM Schmidt arXiv preprint arXiv:1707.05994, 2017 | 11 | 2017 |
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 | 11 | 2013 |
Compact cactus representations of all non-trivial min-cuts OHS Lo, JM Schmidt, M Thorup Discrete applied mathematics 303, 296-304, 2021 | 9 | 2021 |
Linear-time recognition of map graphs with outerplanar witness M Mnich, I Rutter, JM Schmidt Discrete optimization 28, 63-77, 2018 | 9 | 2018 |
An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs A Elmasry, K Mehlhorn, JM Schmidt Algorithmica 62 (3-4), 754-766, 2012 | 9 | 2012 |
Thoughts on Barnette's conjecture H Alt, MS Payne, JM Schmidt, DR Wood arXiv preprint arXiv:1312.3783, 2013 | 8 | 2013 |
On the circumference of essentially 4-connected planar graphs I Fabrici, J Harant, S Mohr, J Schmidt Journal of graph algorithms and applications 24 (1), 21-46, 2020 | 7 | 2020 |
Computing 2-walks in polynomial time A Schmid, JM Schmidt ACM Transactions on Algorithms (TALG) 14 (2), 1-18, 2018 | 7 | 2018 |
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 | 7 | 2006 |
A planarity test via construction sequences JM Schmidt Mathematical Foundations of Computer Science (MFCS'13), 765-776, 2013 | 6 | 2013 |