Graph Drawing
From MaRDI portal
Publication:5896903
DOI10.1007/b94919zbMath1215.05185OpenAlexW4250021921MaRDI QIDQ5896903
Michael Kaufmann, Henning Fernau, Vida Dujmović
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94919
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Fixed parameter algorithms for one-sided crossing minimization revisited ⋮ Ranking and Drawing in Subexponential Time ⋮ On the parameterized complexity of layered graph drawing ⋮ On the one-sided crossing minimization in a bipartite graph with large degrees ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ Parameterized algorithmics for linear arrangement problems
This page was built for publication: Graph Drawing
