Jens M. Schmidt

76 papers A* 2A 5B 8Journal 55Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Shortness parameters of polyhedral graphs with few distinct vertex degrees. Discret. Math. On-Hei Solomon Lo, Jens M. Schmidt, Nico Van Cleemput, Carol T. Zamfirescu
2025	J	`jnl`	Structural parameters of Schnyder woods. Discret. Math. Christian Ortlieb, Jens M. Schmidt
2024	J	`jnl`	Generalized cut trees for edge-connectivity. J. Comb. Theory B On-Hei Solomon Lo, Jens M. Schmidt
2024	J	`jnl`	Rooted minors and locally spanning subgraphs. J. Graph Theory Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt
2024	—	`conf`	Toward Grünbaum's Conjecture. SWAT Christian Ortlieb, Jens M. Schmidt
2024	J	`jnl`	Toward Grünbaum's Conjecture. CoRR Christian Ortlieb, Jens M. Schmidt
2024	J	`jnl`	Trees and co-trees in planar 3-connected planar graphs An easier proof via Schnyder woods. CoRR Christian Ortlieb, Jens M. Schmidt
2023	J	`jnl`	Contractible edges in longest cycles. J. Graph Theory Tsz Lung Chan, Matthias Kriesell, Jens M. Schmidt
2021	J	`jnl`	Circumference of essentially 4-connected planar triangulations. J. Graph Algorithms Appl. Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2021	J	`jnl`	Compact cactus representations of all non-trivial min-cuts. Discret. Appl. Math. On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
2021	J	`jnl`	Cycle Spectra of Contraction-Critically 4-Connected Planar Graphs. Graphs Comb. On-Hei Solomon Lo, Jens M. Schmidt
2021	B	`conf`	On Short Fastest Paths in Temporal Graphs. WALCOM Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, Mithinti Srikanth
2020	J	`jnl`	Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. Algorithmica Johanna E. Preißer, Jens M. Schmidt
2020	J	`jnl`	Dynamics of Cycles in Polyhedra I: The Isolation Lemma. CoRR Jan Kessler, Jens M. Schmidt
2020	J	`jnl`	Longer cycles in essentially 4-connected planar graphs. Discuss. Math. Graph Theory Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2020	J	`jnl`	On the Circumference of Essentially 4-connected Planar Graphs. J. Graph Algorithms Appl. Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2020	J	`jnl`	Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs. Electron. J. Comb. On-Hei Solomon Lo, Jens M. Schmidt, Nico Van Cleemput, Carol T. Zamfirescu
2019	J	`jnl`	Edge-Orders. Algorithmica Lena Schlipf, Jens M. Schmidt
2019	J	`jnl`	Simple computation of st-edge- and st-numberings from ear decompositions. Inf. Process. Lett. Lena Schlipf, Jens M. Schmidt
2018	B	`conf`	A Cut Tree Representation for Pendant Pairs. ISAAC On-Hei Solomon Lo, Jens M. Schmidt
2018	J	`jnl`	Computing 2-Walks in Polynomial Time. ACM Trans. Algorithms Andreas Schmid, Jens M. Schmidt
2018	A*	`conf`	Computing Tutte Paths. ICALP Andreas Schmid, Jens M. Schmidt
2018	B	`conf`	Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. ISAAC Johanna E. Preißer, Jens M. Schmidt
2018	J	`jnl`	Contraction-Based Sparsification in Near-Linear Time. CoRR On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
2018	J	`jnl`	Even Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2018	J	`jnl`	Linear-time recognition of map graphs with outerplanar witness. Discret. Optim. Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
2018	J	`jnl`	Longest cycles in cyclically 4-edge-connected cubic planar graphs. Australas. J Comb. On-Hei Solomon Lo, Jens M. Schmidt
2018	J	`jnl`	More on foxes. J. Graph Theory Matthias Kriesell, Jens M. Schmidt
2018	J	`jnl`	Tight bounds for the vertices of degree k in minimally k-connected graphs. J. Graph Theory Jens M. Schmidt
2017	J	`jnl`	Certifying 3-Edge-Connectivity. Algorithmica Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
2017	J	`jnl`	Computing Tutte Paths. CoRR Andreas Schmid, Jens M. Schmidt
2017	J	`jnl`	Cut Tree Structures with Applications on Contraction-Based Sparsification. CoRR On-Hei Solomon Lo, Jens M. Schmidt
2017	A*	`conf`	Edge-Orders. ICALP Lena Schlipf, Jens M. Schmidt
2017	J	`jnl`	Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2016	J	`jnl`	A Tight Bound for Minimal Connectivity. CoRR Jens M. Schmidt
2016	J	`jnl`	Computing Vertex-Disjoint Paths using MAOs. CoRR Johanna E. Preißer, Jens M. Schmidt
2016	J	`jnl`	Edge-Orders. CoRR Lena Schlipf, Jens M. Schmidt
2016	—	`conf`	Linear-Time Recognition of Map Graphs with Outerplanar Witness. SWAT Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
2016	J	`jnl`	Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt
2016	J	`jnl`	Mondshein Sequences (a.k.a. (2, 1)-Orders). SIAM J. Comput. Jens M. Schmidt
2016	J	`jnl`	More on foxes. CoRR Matthias Kriesell, Jens M. Schmidt
2016	J	`jnl`	Thoughts on Barnette's Conjecture. Australas. J Comb. Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood
2015	A	`conf`	Computing 2-Walks in Polynomial Time. STACS Andreas Schmid, Jens M. Schmidt
2015	J	`jnl`	Counting K Discret. Math. Tillmann Miltzow, Jens M. Schmidt, Mingji Xia
2015	J	`jnl`	Cubic plane graphs on a given point set. Comput. Geom. Jens M. Schmidt, Pavel Valtr
2015	A	`conf`	Small-Area Orthogonal Drawings of 3-Connected Graphs. GD Therese Biedl, Jens M. Schmidt
2015	J	`jnl`	Small-Area Orthogonal Drawings of 3-Connected Graphs. CoRR Therese Biedl, Jens M. Schmidt
2014	J	`jnl`	Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. J. Graph Algorithms Appl. Carola Doerr, G. Ramakrishna, Jens M. Schmidt
2014	J	`jnl`	Counting K_4-Subdivisions. CoRR Tillmann Miltzow, Jens M. Schmidt, Mingji Xia
2014	—	`conf`	The Mondshein Sequence. ICALP (1) Jens M. Schmidt
2014	J	`jnl`	Which point sets admit a k-angulation? J. Comput. Geom. Michael S. Payne, Jens M. Schmidt, David R. Wood
2013	B	`conf`	A Planarity Test via Construction Sequences. MFCS Jens M. Schmidt
2013	J	`jnl`	A simple test on 2-vertex- and 2-edge-connectivity. Inf. Process. Lett. Jens M. Schmidt
2013	B	`conf`	Certifying 3-Edge-Connectivity. WG Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
2013	J	`jnl`	Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time CoRR Carola Doerr, G. Ramakrishna, Jens M. Schmidt
2013	B	`conf`	Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. WG Carola Doerr, G. Ramakrishna, Jens M. Schmidt
2013	J	`jnl`	Contractions, Removals, and Certifying 3-Connectivity in Linear Time. SIAM J. Comput. Jens M. Schmidt
2013	J	`jnl`	Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. J. Graph Theory Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
2013	J	`jnl`	The Mondshein Sequence. CoRR Jens M. Schmidt
2012	J	`jnl`	A Planarity Test via Construction Sequences CoRR Jens M. Schmidt
2012	J	`jnl`	A Simple Test on 2-Vertex- and 2-Edge-Connectivity CoRR Jens M. Schmidt
2012	J	`jnl`	An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. Algorithmica Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
2012	—	`conf`	Certifying 3-Connectivity in Linear Time. ICALP (1) Jens M. Schmidt
2012	J	`jnl`	Certifying 3-Edge-Connectivity CoRR Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
2012	J	`jnl`	Construction Sequences and Certifying 3-connectivity. Algorithmica Jens M. Schmidt
2012	—	`conf`	Cubic plane graphs on a given point set. SCG Jens M. Schmidt, Pavel Valtr
2012	J	`jnl`	Largest inscribed rectangles in convex polygons. J. Discrete Algorithms Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary
2012	J	`jnl`	Which point sets admit a k-angulation? CoRR Michael S. Payne, Jens M. Schmidt, David R. Wood
2011	—	`—`	Structure and constructions of 3-connected graphs. Jens M. Schmidt
2010	A	`conf`	Construction Sequences and Certifying 3-Connectedness. STACS Jens M. Schmidt
2010	J	`jnl`	Contractions, Removals and How to Certify 3-Connectivity in Linear Time CoRR Jens M. Schmidt
2009	J	`jnl`	Construction Sequences and Certifying 3-Connectedness CoRR Jens M. Schmidt
2009	B	`conf`	Interval Stabbing Problems in Small Integer Ranges. ISAAC Jens M. Schmidt
2007	A	`conf`	Efficient Extraction of Multiple Kuratowski Subdivisions. GD Markus Chimani, Petra Mutzel, Jens M. Schmidt
2006	A	`conf`	High-order punishment and the evolution of cooperation. GECCO 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
2006	B	`conf`	The Impact of Group Reputation in Multiagent Environments. IEEE Congress on Evolutionary Computation 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