Homepage
Jens M. Schmidt
Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 308
66123 Saarbrücken
Germany
Email:
jens.schmidt [at] mpi-inf.mpg.de
Phone: +49 681 9325 1008
Fax: +49 681 9325 199
- Graph Algorithms and Structures
- Inductive Graph Classes
- Planar and Geometric Graphs
see here for a complete list with bibtex-, presentation- and pdf-files
- Certifying 3-Connectivity in Linear Time
Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP'12), to appear.
- Cubic Plane Graphs on a Given Point Set
with P. Valtr
Proceedings of the 28th Annual Symposium on Computational Geometry (SoCG '12), to appear.
- Every DFS tree of a 3-connected graph contains a contractible edge
with A. Elmasry and K. Mehlhorn
Journal of Graph Theory, to appear (2012).
- Largest Inscribed Rectangles in Convex Polygons
with C. Knauer, L. Schlipf and H. R. Tiwary
Journal of Discrete Algorithms, 13:78-85, 2012.
- Construction Sequences and Certifying 3-Connectivity
Algorithmica, 62:192-208, 2012.
- An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
with A. Elmasry and K. Mehlhorn
Algorithmica, 62:754-766, 2012.
- Construction Sequences and Certifying 3-Connectedness
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS '10), pp. 633-644.
- Point sets with planar embeddings of cubic, connected graphs
J. Fink (Ed.), KAM-DIMATIA Series 959, Charles University, Prague, 2010.
- Interval Stabbing Problems in Small Integer Ranges
Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC '09), Vol. 5878 (LNCS), p. 163-172.
- Efficient Extraction of Multiple Kuratowski Subdivisions
with M. Chimani and P. Mutzel
Proceedings of the 15th International Symposium on Graph Drawing (GD '07), p. 159-170.
- High-order punishment and the evolution of cooperation
with B. Baranski, T. Bartz-Beielstein, R. Ehlers, T. Kajendran, B.
Kosslers, J. Mehnen, T. Polazek, R. Reimholz, K. Schmitt, D. Seis, R.
Slodzinski, S. Steeg, N. Wiemann and M. Zimmermann
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '06), p. 379-380.
- The impact of group reputation in multiagent environments
with B. Baranski, T. Bartz-Beielstein, R. Ehlers, T. Kajendran, B.
Kosslers, J. Mehnen, T. Polazek, R. Reimholz, K. Schmitt, D. Seis, R.
Slodzinski, S. Steeg, N. Wiemann and M. Zimmermann
Proceedings of the IEEE Congress on Evolutionary Computation (CEC '06), p. 1224-1231.
Supervised Theses
-
09/2011 - 04/2012: Nicole Haesler - Diplom in Mathematics at FU Berlin:
"Facetten beschränkter Knotengradsumme in Triangulierungen planarer
Graphen" (with Prof. Dr. Helmut Alt)