Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
21
search results - page 5 / 5
»
dam 2011
Sort
relevance
views
votes
recent
update
View
thumb
title
133
click to vote
DAM
2011
210
views
Theoretical Computer Science
»
more
DAM 2011
»
Untangling planar graphs from a specified vertex position - Hard cases
14 years 10 months ago
Download
www.math.cmu.edu
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
claim paper
Read More »
« Prev
« First
page 5 / 5
Last »
Next »