"Improving the crossing lemma by finding more crossings in sparse graphs: ..."

János Pach et al. (2004)

> Home

Details and statistics

DOI: 10.1145/997817.997831

access: closed

type: Conference or Workshop Paper

metadata version: 2021-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/compgeom/PachRTT04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/PachRTT04
János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth:
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]. SCG 2004: 68-75

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.