BibTeX record conf/isaac/ZhouN98

download as .bib file

@inproceedings{DBLP:conf/isaac/ZhouN98,
  author       = {Xiao Zhou and
                  Takao Nishizeki},
  editor       = {Kyung{-}Yong Chwa and
                  Oscar H. Ibarra},
  title        = {The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees},
  booktitle    = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98,
                  Taejon, Korea, December 14-16, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1533},
  pages        = {417--426},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/3-540-49381-6\_44},
  doi          = {10.1007/3-540-49381-6\_44},
  timestamp    = {Mon, 15 Jun 2020 16:12:58 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/ZhouN98.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.