The Impact of Group Reputation in Multiagent Environments. - 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; et al. (IEEE Congress on Evolutionary Computation, 2006)

High-order punishment and the evolution of cooperation. - 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; et al. (GECCO, 2006)

Efficient Extraction of Multiple Kuratowski Subdivisions. - Markus Chimani; Petra Mutzel; Jens M. Schmidt (GD, 2007)

Interval Stabbing Problems in Small Integer Ranges. - Jens M. Schmidt (ISAAC, 2009)

Construction Sequences and Certifying 3-Connectedness. - Jens M. Schmidt (STACS, 2010)

Contractions, Removals and How to Certify 3-Connectivity in Linear Time - Jens M. Schmidt (CoRR, 2010)

Structure and constructions of 3-connected graphs. - Jens M. Schmidt (2011)

Certifying 3-Connectivity in Linear Time. - Jens M. Schmidt (ICALP (1), 2012)

An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. - Amr Elmasry; Kurt Mehlhorn; Jens M. Schmidt (Algorithmica, 2012)

Construction Sequences and Certifying 3-connectivity. - Jens M. Schmidt (Algorithmica, 2012)

Largest inscribed rectangles in convex polygons. - Christian Knauer; Lena Schlipf; Jens M. Schmidt; Hans Raj Tiwary (J. Discrete Algorithms, 2012)

A Planarity Test via Construction Sequences. - Jens M. Schmidt (MFCS, 2013)

A simple test on 2-vertex- and 2-edge-connectivity. - Jens M. Schmidt (Inf. Process. Lett., 2013)

Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. - Amr Elmasry; Kurt Mehlhorn; Jens M. Schmidt (J. Graph Theory, 2013)

Contractions, Removals, and Certifying 3-Connectivity in Linear Time. - Jens M. Schmidt (SIAM J. Comput., 2013)

The Mondshein Sequence. - Jens M. Schmidt (ICALP (1), 2014)

Counting K_4-Subdivisions. - Tillmann Miltzow; Jens M. Schmidt; Mingji Xia (CoRR, 2014)

Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. - Carola Doerr; G. Ramakrishna; Jens M. Schmidt (J. Graph Algorithms Appl., 2014)

Which point sets admit a k-angulation? - Michael S. Payne; Jens M. Schmidt; David R. Wood (J. Comput. Geom., 2014)

Small-Area Orthogonal Drawings of 3-Connected Graphs. - Therese Biedl; Jens M. Schmidt (GD, 2015)

Cubic plane graphs on a given point set. - Jens M. Schmidt; Pavel Valtr 001 (Comput. Geom., 2015)

Counting K4-subdivisions. - Tillmann Miltzow; Jens M. Schmidt; Mingji Xia (Discret. Math., 2015)

Thoughts on Barnette's Conjecture. - Helmut Alt; Michael S. Payne; Jens M. Schmidt; David R. Wood (Australas. J Comb., 2016)

Computing Vertex-Disjoint Paths using MAOs. - Johanna E. Preißer; Jens M. Schmidt (CoRR, 2016)

A Tight Bound for Minimal Connectivity. - Jens M. Schmidt (CoRR, 2016)

Lower Bounds for Locally Highly Connected Graphs. - Anna Adamaszek; Michal Adamaszek; Matthias Mnich; Jens M. Schmidt (Graphs Comb., 2016)

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

Certifying 3-Edge-Connectivity. - Kurt Mehlhorn; Adrian Neumann; Jens M. Schmidt (Algorithmica, 2017)

Cut Tree Structures with Applications on Contraction-Based Sparsification. - On-Hei Solomon Lo; Jens M. Schmidt (CoRR, 2017)

Computing Tutte Paths. - Andreas Schmid 003; Jens M. Schmidt (ICALP, 2018)

A Cut Tree Representation for Pendant Pairs. - On-Hei Solomon Lo; Jens M. Schmidt (ISAAC, 2018)

Longest cycles in cyclically 4-edge-connected cubic planar graphs. - On-Hei Solomon Lo; Jens M. Schmidt (Australas. J Comb., 2018)

Even Longer Cycles in Essentially 4-Connected Planar Graphs. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (CoRR, 2018)

Contraction-Based Sparsification in Near-Linear Time. - On-Hei Solomon Lo; Jens M. Schmidt; Mikkel Thorup (CoRR, 2018)

Linear-time recognition of map graphs with outerplanar witness. - Matthias Mnich; Ignaz Rutter; Jens M. Schmidt (Discret. Optim., 2018)

More on foxes. - Matthias Kriesell; Jens M. Schmidt (J. Graph Theory, 2018)

Tight bounds for the vertices of degree k in minimally k-connected graphs. - Jens M. Schmidt (J. Graph Theory, 2018)

Computing 2-Walks in Polynomial Time. - Andreas Schmid 003; Jens M. Schmidt (ACM Trans. Algorithms, 2018)

Edge-Orders. - Lena Schlipf; Jens M. Schmidt (Algorithmica, 2019)

Simple computation of st-edge- and st-numberings from ear decompositions. - Lena Schlipf; Jens M. Schmidt (Inf. Process. Lett., 2019)

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. - Johanna E. Preißer; Jens M. Schmidt (Algorithmica, 2020)

Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs. - On-Hei Solomon Lo; Jens M. Schmidt; Nico Van Cleemput; Carol T. Zamfirescu (Electron. J. Comb., 2020)

Dynamics of Cycles in Polyhedra I: The Isolation Lemma. - Jan Kessler; Jens M. Schmidt (CoRR, 2020)

Longer cycles in essentially 4-connected planar graphs. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (Discuss. Math. Graph Theory, 2020)

On the Circumference of Essentially 4-connected Planar Graphs. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (J. Graph Algorithms Appl., 2020)

On Short Fastest Paths in Temporal Graphs. - Umesh Sandeep Danda; G. Ramakrishna; Jens M. Schmidt; Mithinti Srikanth (WALCOM, 2021)

Compact cactus representations of all non-trivial min-cuts. - On-Hei Solomon Lo; Jens M. Schmidt; Mikkel Thorup (Discret. Appl. Math., 2021)

Cycle Spectra of Contraction-Critically 4-Connected Planar Graphs. - On-Hei Solomon Lo; Jens M. Schmidt (Graphs Comb., 2021)

Circumference of essentially 4-connected planar triangulations. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (J. Graph Algorithms Appl., 2021)

Contractible edges in longest cycles. - Tsz Lung Chan; Matthias Kriesell; Jens M. Schmidt (J. Graph Theory, 2023)

Toward Grünbaum's Conjecture. - Christian Ortlieb; Jens M. Schmidt (SWAT, 2024)

Trees and co-trees in planar 3-connected planar graphs An easier proof via Schnyder woods. - Christian Ortlieb; Jens M. Schmidt (CoRR, 2024)

Rooted minors and locally spanning subgraphs. - Thomas Böhme 001; Jochen Harant; Matthias Kriesell; Samuel Mohr; Jens M. Schmidt (J. Graph Theory, 2024)

Generalized cut trees for edge-connectivity. - On-Hei Solomon Lo; Jens M. Schmidt (J. Comb. Theory B, 2024)

Shortness parameters of polyhedral graphs with few distinct vertex degrees. - On-Hei Solomon Lo; Jens M. Schmidt; Nico Van Cleemput; Carol T. Zamfirescu (Discret. Math., 2025)

Structural parameters of Schnyder woods. - Christian Ortlieb; Jens M. Schmidt (Discret. Math., 2025)