BibTeX record conf/fct/MielikainenU01

download as .bib file

@inproceedings{DBLP:conf/fct/MielikainenU01,
  author       = {Taneli Mielik{\"{a}}inen and
                  Esko Ukkonen},
  editor       = {Rusins Freivalds},
  title        = {The Complexity of Maximum Matroid-Greedoid Intersection},
  booktitle    = {Fundamentals of Computation Theory, 13th International Symposium,
                  {FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2138},
  pages        = {535--540},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-44669-9\_60},
  doi          = {10.1007/3-540-44669-9\_60},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/MielikainenU01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.