BibTeX record journals/tcs/DessmarkLP00

download as .bib file

@article{DBLP:journals/tcs/DessmarkLP00,
  author       = {Anders Dessmark and
                  Andrzej Lingas and
                  Andrzej Proskurowski},
  title        = {Maximum packing for k-connected partial k-trees in polynomial time},
  journal      = {Theor. Comput. Sci.},
  volume       = {236},
  number       = {1-2},
  pages        = {179--191},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00208-X},
  doi          = {10.1016/S0304-3975(99)00208-X},
  timestamp    = {Wed, 17 Feb 2021 21:58:54 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DessmarkLP00.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.