The following pages link to Jens M. Schmidt (Q343697):
Displaying 39 items.
- Lower bounds for locally highly connected graphs (Q343698) (← links)
- Largest inscribed rectangles in convex polygons (Q450533) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions (Q1730030) (← links)
- Edge-orders (Q1741850) (← links)
- A simple test on 2-vertex- and 2-edge-connectivity (Q1943645) (← links)
- Compact cactus representations of all non-trivial min-cuts (Q1983141) (← links)
- Cycle spectra of contraction-critically 4-connected planar graphs (Q2053680) (← links)
- On short fastest paths in temporal graphs (Q2232230) (← links)
- Longer cycles in essentially 4-connected planar graphs (Q2282479) (← links)
- Computing vertex-disjoint paths in large graphs using MAOs (Q2285055) (← links)
- Shortness coefficient of cyclically 4-edge-connected cubic graphs (Q2294112) (← links)
- Construction sequences and certifying 3-connectivity (Q2428654) (← links)
- An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (Q2429326) (← links)
- Counting \(K_4\)-subdivisions (Q2515581) (← links)
- Thoughts on Barnette's Conjecture (Q2800788) (← links)
- Mondshein Sequences (a.k.a. (2,1)-Orders) (Q2832896) (← links)
- Contractions, Removals, and Certifying 3-Connectivity in Linear Time (Q2840980) (← links)
- Certifying 3-Connectivity in Linear Time (Q2843301) (← links)
- A Planarity Test via Construction Sequences (Q2849960) (← links)
- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time (Q2864304) (← links)
- Computing 2-Walks in Polynomial Time (Q2955033) (← links)
- Small-Area Orthogonal Drawings of 3-Connected Graphs (Q2959753) (← links)
- Which point sets admit a $k$-angulation? (Q2968108) (← links)
- Construction Sequences and Certifying 3-Connectedness (Q3113786) (← links)
- Tight bounds for the vertices of degree k in minimally k‐connected graphs (Q4575523) (← links)
- Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge (Q4908826) (← links)
- Computing Tutte Paths (Q5002780) (← links)
- (Q5091003) (← links)
- (Q5091030) (← links)
- (Q5111406) (← links)
- On the Circumference of Essentially 4-connected Planar Graphs (Q5208868) (← links)
- Linear-Time Recognition of Map Graphs with Outerplanar Witness (Q5369507) (← links)
- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time (Q5494860) (← links)
- Circumference of essentially 4-connected planar triangulations (Q5856664) (← links)
- Contractible edges in longest cycles (Q6074596) (← links)
- Rooted minors and locally spanning subgraphs (Q6143382) (← links)
- Generalized cut trees for edge-connectivity (Q6187342) (← links)
