The Robustness of LWPP and WPP, with an Application to Graph Reconstruction

Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe 0001. The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. In Igor Potapov, Paul G. Spirakis, James Worrell 0001, editors, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. Volume 117 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

@inproceedings{HemaspaandraHS018,
  title = {The Robustness of LWPP and WPP, with an Application to Graph Reconstruction},
  author = {Edith Hemaspaandra and Lane A. Hemaspaandra and Holger Spakowski and Osamu Watanabe 0001},
  year = {2018},
  doi = {10.4230/LIPIcs.MFCS.2018.51},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.51},
  researchr = {https://researchr.org/publication/HemaspaandraHS018},
  cites = {0},
  citedby = {0},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK},
  editor = {Igor Potapov and Paul G. Spirakis and James Worrell 0001},
  volume = {117},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-086-6},
}