SIGN IN
SIGN UP
Integer representations of convex polygon intersection graphs
Full Text:
PDF
Buy this Article
Authors:
Tobias Müller
Centrum Wiskunde & Informatica, Amsterdam, Netherlands
Erik Jan van Leeuwen
University of Bergen, Bergen, Norway
Jan van Leeuwen
Utrecht University, Utrecht, Netherlands
Published in:
· Proceeding
SoCG '11
Proceedings of the 27th annual ACM symposium on Computational geometry
Pages 300-307
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0682-9
doi>
10.1145/1998196.1998248
2011 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 18
· Downloads (cumulative): 39
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
convex polygons
geometric intersection graphs
geometrical problems and computations
integer representation
object representation
theory
upper and lower bounds
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder