Search dblp for Publications

export results for "The Complexity of Rationalizing Matchings."

 download as .bib file

@inproceedings{DBLP:conf/isaac/KalyanaramanU08,
  author       = {Shankar Kalyanaraman and
                  Christopher Umans},
  editor       = {Seok{-}Hee Hong and
                  Hiroshi Nagamochi and
                  Takuro Fukunaga},
  title        = {The Complexity of Rationalizing Matchings},
  booktitle    = {Algorithms and Computation, 19th International Symposium, {ISAAC}
                  2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5369},
  pages        = {171--182},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92182-0\_18},
  doi          = {10.1007/978-3-540-92182-0\_18},
  timestamp    = {Thu, 27 Apr 2023 14:57:19 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/KalyanaramanU08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KalyanaramanU08,
  author       = {Shankar Kalyanaraman and
                  Christopher Umans},
  title        = {The Complexity of Rationalizing Matchings},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR08-021}},
  year         = {2008},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-021/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR08-021},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/KalyanaramanU08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}