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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Note on the Pair-Crossing Number and the Odd-Crossing Number
Sort
relevance
views
votes
recent
update
View
thumb
title
14
click to vote
CCCG
2007
104
views
Computational Geometry
»
more
CCCG 2007
»
Note on the Pair-Crossing Number and the Odd-Crossing Number
13 years 6 months ago
Download
www.cs.bme.hu
Géza Tóth
claim paper
Read More »
10
click to vote
GD
2009
Springer
143
views
Computer Graphics
»
more
GD 2009
»
Removing Independently Even Crossings
13 years 9 months ago
Download
ovid.cs.depaul.edu
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »