BibTeX record journals/mlq/DietelH00

download as .bib file

@article{DBLP:journals/mlq/DietelH00,
  author       = {Jana Dietel and
                  Hans{-}Dietrich Hecker},
  title        = {A P-Completeness Result for Visibility Graphs of Simple Polygons},
  journal      = {Math. Log. Q.},
  volume       = {46},
  number       = {3},
  pages        = {361--375},
  year         = {2000},
  url          = {https://doi.org/10.1002/1521-3870(200008)46:3\<361::AID-MALQ361\>3.0.CO;2-0},
  doi          = {10.1002/1521-3870(200008)46:3\<361::AID-MALQ361\>3.0.CO;2-0},
  timestamp    = {Wed, 17 May 2017 14:25:50 +0200},
  biburl       = {https://dblp.org/rec/journals/mlq/DietelH00.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.