Paper by Erik D. Demaine

Reference:

Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, and Andrew Winslow, “Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect”, in Proceedings of the 24th International Conference on Computing and Combinatorics (COCOON 2018), Qing Dao, China, July 2–4, 2018, pages 365–377.

BibTeX

@InProceedings{NAEReconfiguration_COCOON2018,
  AUTHOR        = {Jean Cardinal and Erik D. Demaine and David Eppstein and Robert A. Hearn and Andrew Winslow},
  TITLE         = {Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect},
  BOOKTITLE     = {Proceedings of the 24th International Conference on Computing and Combinatorics (COCOON 2018)},
  bookurl       = {http://cocoon2018.sdu.edu.cn/},
  ADDRESS       = {Qing Dao, China},
  MONTH         = {July 2--4},
  YEAR          = 2018,
  PAGES         = {365--377},

  doi           = {https://dx.doi.org/10.1007/978-3-319-94776-1_31},
  dblp          = {https://dblp.org/rec/conf/cocoon/CardinalDEHW18},
  comments      = {This paper is available as <A HREF="https://arXiv.org/abs/1805.04055">arXiv:1805.04055</A> and from <A HREF="https://doi.org/10.1007/978-3-319-94776-1_31">SpringerLink</A>.},
  papers        = {NAEReconfiguration_TCS},
}

Comments:

This paper is available as arXiv:1805.04055 and from SpringerLink.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]

Related papers:

NAEReconfiguration_TCS (Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect)