On Area-Optimal Planar Graph Drawings

DOI10.1007/978-3-662-43948-7_17zbMath1409.68205DBLPconf/icalp/Biedl14OpenAlexW43225448WikidataQ56689776 ScholiaQ56689776MaRDI QIDQ5167742

Therese C. Biedl

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Positive planar satisfiability problems under 3-connectivity constraints ⋮ On Upward Drawings of Trees on a Given Grid

This page was built for publication: On Area-Optimal Planar Graph Drawings