The following pages link to Graph Drawing (Q5711635):
Displaying 12 items.
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- New bounds on the edge number of ak-map graph (Q3594951) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
