Items where Author is "Schmidt, Jens M."

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 4.

Mehlhorn, Kurt and Neumann, Adrian and Schmidt, Jens M.
(2017) Certifying 3-Edge-Connectivity.
Algorithmica, 77 (2). 309–335.

Elmasry, Amr and Schmidt, Jens M. and Mehlhorn, Kurt
(2013) Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge.
Journal of Graph Theory, 72 (1). pp. 112-121.

Mehlhorn, Kurt and Neumann, Adrian and Schmidt, Jens M.
(2013) Certifying 3-Edge-Connectivity.
Algorithmica, 8165. 358–369.

Elmasry, Amr and Mehlhorn, Kurt and Schmidt, Jens M.
(2012) An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.
Algorithmica, 62 (3-4). pp. 754-766.

This list was generated on Sun Dec 22 03:30:41 2024 CET.
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.