Matchings, Critical Nodes, and Popular Solutions

Telikepalli Kavitha. Matchings, Critical Nodes, and Popular Solutions. In Mikolaj Bojanczyk, Chandra Chekuri, editors, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. Volume 213 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

@inproceedings{Kavitha21-1,
  title = {Matchings, Critical Nodes, and Popular Solutions},
  author = {Telikepalli Kavitha},
  year = {2021},
  doi = {10.4230/LIPIcs.FSTTCS.2021.25},
  url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.25},
  researchr = {https://researchr.org/publication/Kavitha21-1},
  cites = {0},
  citedby = {0},
  booktitle = {41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference},
  editor = {Mikolaj Bojanczyk and Chandra Chekuri},
  volume = {213},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-215-0},
}