Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

2

ENDM
2008

favoriteEmaildiscussreport

51views more ENDM 2008»

A Polynomial Bound for Untangling Geometric Planar Graphs

13 years 4 months ago

A Polynomial Bound for Untangling Geometric Planar Graphs

Download www.ms.unimelb.edu.au

Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat

Real-time Traffic

ENDM 2008 |

claim paper

Related Content

» Bounds on the Geometric Mean of Arc Lengths for BoundedDegree Planar Graphs

» PolynomialTime Approximation Schemes for SubsetConnectivity Problems in BoundedGenus Graph...

» Untangling Tanglegrams Comparing Trees by Their Drawings

» Compact ForbiddenSet Routing

» On Geometric Spanners of Euclidean and Unit Disk Graphs

» On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Mat...

» Greedy Routing with Bounded Stretch

» On the number of Go positions on lattice graphs

» Asymptotic connectivity of hyperbolic planar graphs

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENDM
Authors	Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood

Comments (0)