BibTeX record journals/dcg/PachRTT06

download as .bib file

@article{DBLP:journals/dcg/PachRTT06,
  author       = {J{\'{a}}nos Pach and
                  Rados Radoicic and
                  G{\'{a}}bor Tardos and
                  G{\'{e}}za T{\'{o}}th},
  title        = {Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs},
  journal      = {Discret. Comput. Geom.},
  volume       = {36},
  number       = {4},
  pages        = {527--552},
  year         = {2006},
  url          = {https://doi.org/10.1007/s00454-006-1264-9},
  doi          = {10.1007/S00454-006-1264-9},
  timestamp    = {Thu, 12 Mar 2020 17:20:51 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/PachRTT06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.