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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
115
Voted
CCCG
2010
172
views
Computational Geometry
»
more
CCCG 2010
»
Orthogonal thickness of graphs
15 years 2 months ago
Download
www.cs.umanitoba.ca
Maryam Tahmasbi, S. Mehdi Hashemi
Real-time Traffic
CCCG 2007
|
CCCG 2010
|
Computational Geometry
|
claim paper
Related Content
»
On Graph Thickness Geometric Thickness and Separator Theorems
»
BoundedDegree Graphs have Arbitrarily Large Geometric Thickness
»
Geometric Thickness of Complete Graphs
»
On Representations of Some ThicknessTwo Graphs
»
Duality of Ends
»
The geometric thickness of low degree graphs
»
Bar kVisibility Graphs Bounds on the Number of Edges Chromatic Number and Thickness
»
Graph Treewidth and Geometric Thickness Parameters
»
Perfection thickness of graphs
more »
Post Info
More Details (n/a)
Added
06 Dec 2010
Updated
06 Dec 2010
Type
Conference
Year
2010
Where
CCCG
Authors
Maryam Tahmasbi, S. Mehdi Hashemi
Comments
(0)
Researcher Info
Computational Geometry Study Group
Computer Vision