Sciweavers

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

65

Voted

JCDCG
1998
Springer

favoriteEmaildiscussreport

130views Discrete Geometry» more JCDCG 1998»

Crossing Numbers

15 years 1 months ago

Crossing Numbers

Download www.math.uwaterloo.ca

János Pach

Real-time Traffic

Discrete Geometry | JCDCG 1998 |

claim paper

Related Content

» Odd Crossing Number and Crossing Number Are Not the Same

» Crossing Numbers and Parameterized Complexity

» Crossing Number and Weighted Crossing Number of NearPlanar Graphs

» Odd Crossing Number Is Not Crossing Number

» Note on the PairCrossing Number and the OddCrossing Number

» Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor

» Crossing Number Is Hard for Cubic Graphs

» Computing crossing numbers in quadratic time

» Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

» Crossing and Weighted Crossing Number of NearPlanar Graphs

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	JCDCG
Authors	János Pach

Comments (0)