BibTeX record journals/dam/NishizekiVZ01

download as .bib file

@article{DBLP:journals/dam/NishizekiVZ01,
  author       = {Takao Nishizeki and
                  Jens Vygen and
                  Xiao Zhou},
  title        = {The edge-disjoint paths problem is NP-complete for series-parallel
                  graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {115},
  number       = {1-3},
  pages        = {177--186},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(01)00223-2},
  doi          = {10.1016/S0166-218X(01)00223-2},
  timestamp    = {Thu, 11 Feb 2021 23:26:49 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/NishizekiVZ01.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.