BibTeX record conf/wg/Dahlhaus98

download as .bib file

@inproceedings{DBLP:conf/wg/Dahlhaus98,
  author       = {Elias Dahlhaus},
  editor       = {Juraj Hromkovic and
                  Ondrej S{\'{y}}kora},
  title        = {Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into
                  Chordal Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
                  {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1517},
  pages        = {351--358},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/10692760\_28},
  doi          = {10.1007/10692760\_28},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/Dahlhaus98.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.