BibTeX record conf/isaac/AndreevCCDAR95

download as .bib file

@inproceedings{DBLP:conf/isaac/AndreevCCDAR95,
  author       = {Alexander E. Andreev and
                  Andrea Clementi and
                  Pierluigi Crescenzi and
                  Elias Dahlhaus and
                  Sergio De Agostino and
                  Jos{\'{e}} D. P. Rolim},
  editor       = {John Staples and
                  Peter Eades and
                  Naoki Katoh and
                  Alistair Moffat},
  title        = {The Parallel Complexity of Approximating the High Degree Subgraph
                  Problem},
  booktitle    = {Algorithms and Computation, 6th International Symposium, {ISAAC} '95,
                  Cairns, Australia, December 4-6, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1004},
  pages        = {132--141},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/BFb0015416},
  doi          = {10.1007/BFB0015416},
  timestamp    = {Tue, 09 Apr 2024 09:09:00 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/AndreevCCDAR95.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.