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”, Theoretical Computer Science, volume 806, number 2, February 2020, pages 332–343.

BibTeX

@Article{NAEReconfiguration_TCS,
  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},
  JOURNAL       = {Theoretical Computer Science},
  journalurl    = {https://www.journals.elsevier.com/theoretical-computer-science},
  VOLUME        = 806,
  NUMBER        = 2,
  MONTH         = {February},
  YEAR          = 2020,
  PAGES         = {332--343},

  doi           = {https://dx.doi.org/10.1016/J.TCS.2019.05.028},
  dblp          = {https://dblp.org/rec/journals/tcs/CardinalDEHW20},
  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.1016/j.tcs.2019.05.028">ScienceDirect</A>.},
  replaces      = {NAEReconfiguration_COCOON2018},
  papers        = {NAEReconfiguration_COCOON2018},
}

Comments:

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

Availability:

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

[Google Scholar search]

Related papers:

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