Graph Drawing

DOI10.1007/b105810zbMath1111.68566OpenAlexW4206160220WikidataQ56267165 ScholiaQ56267165MaRDI QIDQ5711635

Erik D. Demaine, Mohammad Taghi Hajiaghayi

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105810

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

Contraction bidimensionality of geometric intersection graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Improved bounds on the planar branchwidth with respect to the largest grid minor size ⋮ The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs ⋮ Slightly Superexponential Parameterized Problems ⋮ Exact algorithms for the Hamiltonian cycle problem in planar graphs ⋮ New bounds on the edge number of ak-map graph ⋮ A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs ⋮ Optimality program in segment and string graphs ⋮ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction ⋮ Subexponential parameterized algorithms for graphs of polynomial growth ⋮ Contraction-Bidimensionality of Geometric Intersection Graphs

This page was built for publication: Graph Drawing