List of some publications related to "Combinatorial Reconfiguration"

This page contains a nonexhaustive list of publications related to Combinatorial Reconfiguration, a research area in Computer Science. The publications are categorized by year. Everyone can edit this site by becoming a member. (See all members of this site.)
Extra Materials
 One can also download a BibTeX version of the list.
 A list of open problems from CoRe 2019.
 A report from CoRe 2017. (See also the slides of an introductory talk at CoRe 2017 by Takehiro Ito.)
 Recent surveys on Combinatorial Reconfiguration.

 Naomi Nishimura. Introduction to Reconfiguration, Algorithms, 11:4 (2018), article 52, April 2018. (Preprint: doi:10.20944/preprints201709.0055.v1). (See also the slides of her talk at CanaDAM 2017.)
 Jan van den Heuvel. The complexity of change, Surveys in Combinatorics 2013, pp. 127160, July 2013. (Preprint: arXiv:1312.2816). (See also Talks at conferences and seminars by Jan van den Heuvel for the slides of his talk with the same title.)

2019
 Alexandre Blanché, Haruka Mizuta, Paul Ouvrard and Akira Suzuki. Decremental Optimization of Dominating Sets Under Reachability Constraints. (Preprint: arXiv:1906.05163).
 Carl Feghali. Reconfiguring colourings of graphs with bounded maximum average degree. (Preprint: arXiv:1904.12698).
 Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec and Alexi Turcotte. Token Swapping on Trees. (Preprint: arXiv:1903.06981).
 Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann and Csaba D. Tóth. Reconfiguration of Connected Graph Partitions. (Preprint: arXiv:1902.10765).
 Carl Feghali and Jiří Fiala. Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs. (Preprint: arXiv:1902.08071).
 Carl Feghali. Reconfiguring $10$colourings of planar graphs. (Preprint: arXiv:1902.02278).
 Paul Bonsma and Daniël Paulusma. Using Contracted Solution Graphs for Solving Reconfiguration Problems, Acta Informatica, May 2019. (A primary version is available in the Proceedings of MFCS 2016, LIPIcs 58, pp. 20:120:15. Preprint: arXiv:1509.06357).
 Saeid Alikhani, Davood Fatehi and Kieka Mynhardt. On $k$Total Dominating Graphs, Australasian Journal of Combinatorics, 73:2 (2019), pp. 313333, February 2019. (Preprint: arXiv:1711.04363).
 Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto. Reconfiguration of MaximumWeight $b$Matchings in a Graph, Journal of Combinatorial Optimization, 37:2 (2019), pp. 454464, February 2019. (A primary version is available in the Proceedings of COCOON 2017, LNCS 10392, pp. 287296).
 Prateek Bhakta, Benjamin Brett Buckner, Lauren Farquhar, Vikram Kamat, Sara Krehbiel and Heather M. Russell. CutColorings in Coloring Graphs, Graphs and Combinatorics, 35:1 (2019), pp. 239248, January 2019.
 Carl Feghali. Paths between colourings of sparse graphs, European Journal of Combinatorics, 75 (2019), pp. 169171, January 2019. (Preprint: arXiv:1803.03950).
 C. M. Mynhardt, R. Roux and L. E. Teshima. Connected $k$Dominating Graphs, Discrete Mathematics, 342:1 (2019), pp. 145151, January 2019. (Preprint: arXiv:1708.05458).
 Daniel Lokshtanov and Amer E. Mouawad. The complexity of independent set reconfiguration on bipartite graphs, ACM Transactions on Algorithms, 15:1 (2019), pp. 7:17:19, January 2019. (A primary version is available in the Proceedings of SODA 2018, pp. 185195. Preprint: arXiv:1707.02638).
 Jun Kawahara, Toshiki Saitoh and Ryo Yoshinaka. The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant, Journal of Graph Algorithms and Applications, 23:1 (2019), pp. 2970, January 2019. (A primary version is available in the Proceedings of WALCOM 2017, LNCS 10167, pp. 448459. Preprint: arXiv:1612.02948).
 Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, ShinIchi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara and Takeaki Uno. Sequentially Swapping Colored Tokens on Graphs, Journal of Graph Algorithms and Applications, 23:1 (2019), pp. 327, January 2019. (A primary version is available in the Proceedings of WALCOM 2017, LNCS 10167, pp. 435447).
 Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto. Shortest reconfiguration of perfect matchings via alternating cycles, Proceedings of ESA 2019.
 Rahnuma Islam Nishat and Sue Whitesides. Reconfiguring Hamiltonian Cycles in LShaped Grid Graphs. Proceedings of WG 2019.
 Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito and Moritz Mühlenthaler. Shortest Reconfiguration of Matchings, Proceedings of WG 2019. (Preprint: arXiv:1812.05419).
 Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono and Yota Otachi. Independent Set Reconfiguration Parameterized by ModularWidth, Proceedings of WG 2019. (Preprint: arXiv:1905.00340).
 Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi and Florian Sikora. Token Sliding on Split Graphs, Proceedings of STACS 2019, LIPIcs 126, pp. 13:113:7 (Preprint: arXiv:1807.05322).
 Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou. Reconfiguration of Minimum Steiner Trees via Vertex Exchanges, Proceedings of MFCS 2019.
 Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler and Kunihiro Wasa. The Perfect Matching Reconfiguration Problem, Proceedings of MFCS 2019 (Preprint: arXiv:1904.06184).
 Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno. Reconfiguring Undirected Paths, Proceedings of WADS 2019 (Preprint: arXiv:1905.00518).
 Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muehlenthaler, Akira Suzuki and Kunihiro Wasa. Diameter of Colorings Under Kempe Changes, Proceedings of COCOON 2019.
 Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki. Incremental Optimization of Independent Sets under Reachability Constraints, Proceedings of COCOON 2019. (Preprint: arXiv:1804.09422).
 Duc A. Hoang, Amanj Khorramian and Ryuhei Uehara. Shortest Reconfiguration Sequence for Sliding Tokens on Spiders, Proceedings of CIAC 2019, LNCS 11485, pp. 262273. (Preprint: arXiv:1806.08291).
 Carl Feghali. Paths between colourings of graphs with bounded treewidth. Information Processing Letters, 144 (2019), pp. 3738, April 2019.
 Manoj Gupta, Hitesh Kumar and Neeldhara Misra. On the Complexity of Optimal Matching Reconfiguration, Proceedings of SOFSEM 2019, LNCS 11376, pp. 221233.
2018
 Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou. Complexity of Reconfiguration Problems for Constraint Satisfaction. (Preprint: arXiv:1812.10629).
 Marthe Bonamy, Nicolas Bousquet and Guillem Perarnau. Frozen $(\Delta+1)$colourings of bounded degree graphs. (Preprint: arXiv:1811.12650).
 Keren CensorHillel and Mikaël Rabie. Distributed Reconfiguration of Maximal Independent Sets. (Preprint: arXiv:1810.02106).
 Eduard Eiben and Carl Feghali. Towards Cereceda's conjecture for planar graphs. (Preprint: arXiv:1810.00731).
 Matt DeVos, Adam Dyck, Jonathan Jedwab and Samuel Simon. Which graphs occur as $\gamma$graphs? (Preprint: arXiv:1810.01583).
 JaeBaek Lee, Jonathan A. Noel and Mark Siggers. Reconfiguring Graph Homomorphisms on the Sphere. (Preprint: arXiv:1810.01111).
 John Asplund and Brett Werner. Classification of Reconfiguration Graphs of Shortest Path Graphs With No Induced $4$cycles. (Preprint: arXiv:1808.09387).
 Michael Anastos and Alan Frieze. On the connectivity threshold for colorings of random graphs and hypergraphs. (Preprint: arXiv:1803.05246).
 Mark de Berg, Bart M. P. Jansen and Debankur Mukherjee. IndependentSet Reconfiguration Thresholds of Hereditary Graph Classes, Discrete Applied Mathematics, 250 (2018), pp. 165182, December 2018. (A primary version is available in the Proceedings of FSTTCS 2016, LIPIcs 65, pp. 34:134:15. Preprint: arXiv:1610.03766).
 Faisal AbuKhzam, Henning Fernau and Ryuhei Uehara. Special Issue on Reconfiguration Problems, Algorithms, 11:11 (2018), article 187, November 2018.
 John Asplund, Kossi Edoh, Ruth Haas, Yulia Hristova, Beth Novick and Brett Werner. Reconfiguration graphs of shortest paths, Discrete Mathematics, 341:10 (2018), pp. 29382948, October 2018. (Preprint: arXiv:1705.09385).
 Asahi Takaoka. Complexity of Hamiltonian Cycle Reconfiguration, Algorithms, 11:9 (2018), article 140, September 2018.
 Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou. Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters, Theoretical Computer Science, 739 (2018), pp. 6579, August 2018. (A primary version is available in the Proceedings of MFCS 2017, LIPIcs 83, pp. 51:151:13. Preprint: arXiv:1705.07551).
 Sebastian Siebertz. Reconfiguration on nowhere dense graph classes, The Electronic Journal of Combinatorics, 25:3 (2018), P3.24, August 2018. (Preprint: arXiv:1707.06775).
 J. Leaños and A. L. TrujilloNegrete. The Connectivity of Token Graphs, Graphs and Combinatorics, 34:4 (2018), pp. 777790, July 2018.
 C.M. Mynhardt and L.E. Teshima. A note on some variations of the $\gamma$graph, Journal of Combinatorial Mathematics and Combinatorial Computing, 104 (2018), pp. 217230, February 2018. (Preprint: arXiv:1707.02039).
 Michelle Edwards, Gary MacGillivray and Shahla Nasserasr. Reconfiguring minimum dominating sets: the $\gamma$graph of a tree, Discussiones Mathematicae Graph Theory, 38:3 (2018), pp. 114, June 2018.
 Richard C. Brewster, JaeBaek Lee and Mark Siggers. Recolouring reflexive digraphs, Discrete Mathematics, 341:6 (2018), pp. 17081721, June 2018. (Preprint: PDF). [Thanks to Benjamin Moore for suggesting this publication]
 Marcin Wrochna. Reconfiguration in bounded bandwidth and treedepth, Journal of Computer and System Sciences, 93 (2018), pp. 110, May 2018. (Preprint: arXiv:1405.0847).
 Naomi Nishimura. Introduction to Reconfiguration, Algorithms, 11:4 (2018), article 52, April 2018. (Preprint: doi:10.20944/preprints201709.0055.v1).
 Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan and Saket Saurabh. Reconfiguration on Sparse Graphs, Journal of Computer and System Sciences, 95 (2018), pp. 122131, August 2018. (A primary version is available in the Proceedings of WADS 2015, LNCS 9214, pp. 506517).
 Sevag Gharibian and Jamie Sikora. Ground State Connectivity of Local Hamiltonians, ACM Transactions on Computation Theory, 10:2 (2018), article 8, April 2018. (A primary version is available in the Proceedings of ICALP 2015, LNCS 9134, pp. 617628. Preprint: arXiv:1409.3182).
 Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara and Yushi Uno. Swapping Colored Tokens on Graphs, Theoretical Computer Science, 729 (2018), pp. 110, June 2018. (A primary version is available in the Proceedings of WADS 2015, LNCS 9214, pp. 619628. Preprint: arXiv:1803.06816).
 Ruth Haas and Gary MacGillivray. Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs, Algorithms, 11:4 (2018), article 40, March 2018.
 Marthe Bonamy and Nicolas Bousquet. Recoloring graphs via tree decompositions, European Journal of Combinatorics, 69 (2018), pp. 200213, March 2018. (Preprint: arXiv:1403.6386).
 Valentin Garnero, Konstanty JunoszaSzaniawski, Mathieu Liedloff, Pedro Montealegre and Paweł Rzążewski. Fixing Improper Colorings of Graphs, Theoretical Computer Science, 711 (2018), pp. 6678, February 2018. (A primary version is available in the Proceedings of SOFSEM 2015, LNCS 8939, pp. 266276. Preprint: arXiv:1607.06911).
 Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman and Sebastian Siebertz. Vertex Cover Reconfiguration and Beyond, Algorithms, 11:2 (2018), article 20, February 2018. (A primary version is available in the Proceedings of ISAAC 2014, LNCS 8889, pp. 452463. Preprint: arXiv:1402.4926).
 Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou. The Complexity of (List) EdgeColoring Reconfiguration Problem, IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E101A:1 (2018), pp. 232238, January 2018. (A primary version is available in the Proceedings of WALCOM 2017, LNCS 10167, pp. 347358. Preprint: arXiv:1609.00109).
 Nicolas Bousquet and Arnaud Mary. Reconfiguration of graphs with connectivity constraints, Proceedings of WAOA 2018, LNCS 11312, pp. 295309. (Preprint: arXiv:1809.05443).
 Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou. Algorithms for Coloring Reconfiguration under Recolorability Constraints, Proceedings of ISAAC 2018, LIPIcs 123, pp. 37:137:13.
 Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela and Jara Uitto. Distributed Recoloring, Proceedings of DISC 2018, LIPIcs 121, pp. 12:112:17. (Preprint: arXiv:1802.06742).
 Marthe Bonamy, Nicolas Bousquet and Guillem Perarnau. Frozen colourings of bounded degree graphs, Proceedings of Discrete Mathematics Days 2018, ENDM 68, pp.167172.
 Benjamin Moore, Naomi Nishimura and Vijay Subramanya. Reconfiguration of graph minors, Proceedings of MFCS 2018, LIPIcs 117, pp. 75:175:15. (Preprint: arXiv:1804.09240).
 Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid and Sebastian Wiederrecht. CongestionFree Rerouting of Flows on DAGs, Proceedings of ICALP 2018, LIPIcs 107, pp. 143:1143:13. (Preprint: arXiv:1611.09296).
 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, Proceedings of COCOON 2018, LNCS 10976, pp. 365377. (Preprint: arXiv:1805.04055).
 Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan. Reconfiguring spanning and induced subgraphs. Proceedings of COCOON 2018, LNCS 10976, pp. 428440. (Preprint: arXiv:1803.06074).
 Takehiro Ito and Yota Otachi. Reconfiguration of Colorable Sets in Classes of Perfect Graphs, Proceedings of SWAT 2018, LIPIcs 101, pp. 27:1  27:13. (Preprint: arXiv:1802.06511).
 Erik D. Demaine, Sarah Eisenstat and Mikhail Rudoy. Solving the Rubik's Cube Optimally is NPcomplete. Proceedings of STACS 2018, LIPIcs 96, pp. 24:124:13. (Preprint: arXiv:1706.06708).
2017
 Richard C. Brewster, JaeBaek Lee, Benjamin Moore, Jonathan A. Noel and Mark Siggers. Graph Homomorphism Reconfiguration and Frozen $H$Colourings. (Preprint: arXiv:1712.00200).
 Paul Bonsma. Rerouting shortest paths in planar graphs, Discrete Applied Mathematics, 231 (2017), pp. 95112, November 2017. (A primary version is available in the Proceedings of FSTTCS 2012, LIPIcs 18, pp. 337349. Preprint: arXiv:1204.5613).
 Édouard Bonnet, Tillmann Miltzow and Paweł Rzążewski. Complexity of Token Swapping and its Variants, Algorithmica, Special Issue dedicated to the 60th Birthday of Gregory Gutin, pp. 127, October 2017. (A primary version is available in the Proceedings of STACS 2017, LIPIcs 66, pp. 16:1–16:14. Preprint: arXiv:1607.07676).
 Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak and Venkatesh Raman. Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas, SIAM Journal on Discrete Mathematics, 31:3 (2017), pp. 21852200, September 2017. (A primary version is available in the Proceedings of ICALP 2015, LNCS 9134, pp. 985996. Preprint: arXiv:1404.3801).
 Saeid Alikhani, Davood Fatehi and Sandi Klavžar. On the Structure of Dominating Graphs, Graphs and Combinatorics, 33:4 (2017), pp. 665672, July 2017. (Preprint: arXiv:1512.07514).
 Haruka Mizuta, Takehiro Ito and Xiao Zhou. Reconfiguration of Steiner Trees in an Unweighted Graph, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E100A:7 (2017), pp.15321540, July 2017. (A primary version is available in the Proceedings of IWOCA 2016, LNCS 9843, pp. 163175).
 Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour and Akira Suzuki. On the Parameterized Complexity of Reconfiguration Problems, Algorithmica, 78:1 (2017), pp. 274297, May 2017. (A primary version is available in the Proceedings of IPEC 2013, LNCS 8246, pp. 281294. Preprint: arXiv:1308.2409).
 Soroush Alamdari, Patrizio Angelini, Fidel BarreraCruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla and Bryan T. Wilkinson. How to Morph Planar Graph Drawings, SIAM Journal on Computing, 46:2 (2017), pp. 824852, April 2017. (Preprint: arXiv:1606.00425).
 Ruth Haas and Karen Seyffarth. Reconfiguring dominating sets in some wellcovered and other classes of graphs, Discrete Mathematics 340 (2017), pp. 18021817, March 2017.
 Carl Feghali, Matthew Johnson and Daniël Paulusma. Kempe Equivalence of Colourings of Cubic Graphs, European Journal of Combinatorics, 59 (2017), pp. 110, January 2017. (A primary version is available in the Proceedings of EuroComb 2015, ENDM 49, pp. 243249. Preprint: arXiv:1503.03430).
 Davood Fatehi, Saeid Alikhani and Abdul Jalil M. Khalaf. The $k$independent graph of a graph, Advances and Applications in Discrete Mathematics, 18:1 (2017), pp. 4556, January 2017. (Preprint: arXiv:1510.05360).
 Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou. The Coloring Reconfiguration Problem on Specific Graph Classes, Proceedings of COCOA 2017, LNCS 10627, pp. 152162.
 Naomi Nishimura and Vijay Subramanya. Graph Editing to a Given Neighbourhood Degree List is FixedParameter Tractable, Proceedings of COCOA 2017, LNCS 10627, pp. 138153.
 Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou. Complexity of Coloring Reconfiguration under Recolorability Constraints, Proceedings of ISAAC 2017, LIPIcs 92, pp. 62:162:12.
 Marthe Bonamy and Nicolas Bousquet. Token Sliding on Chordal Graphs, Proceedings of WG 2017, LNCS 10520, pp. 127139. (Preprint: arXiv:1605.00442).
 Nicolas Bousquet, Arnaud Mary and Aline Parreau. Token Jumping in minorclosed classes, Proceedings of FCT 2017, LNCS 10472, pp 136149. (Preprint: arXiv:1706.09608).
 Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma. Recognizing Graphs Close to Bipartite Graphs, Proceedings of MFCS 2017, LIPIcs 83, pp. 70:170:14. (Preprint: arXiv:1707.09817).
2016
 Anna Lubiw, Vinayak Pathak. Reconfiguring Ordered Bases of a Matroid. (Preprint: arXiv:1612.00958).
 Akira Suzuki, Amer E. Mouawad and Naomi Nishimura. Reconfiguration of dominating sets, Journal of Combinatorial Optimization, 32:4 (2016), pp 11821195, November 2016. (A primary version is available in the Proceedings of COCOON 2014, LNCS 8591, pp. 405416. Preprint: arXiv:1401.5714).
 Carl Feghali, Matthew Johnson, Daniël Paulusma. A Reconfigurations Analogue of Brooks' Theorem and its Consequences, Journal of Graph Theory, 83:4 (2016), pp. 340358, October 2016. (A primary version is available in the Proceedings of MFCS 2014, LNCS 8635, pp. 287298. Preprint: arXiv:1501.05800).
 Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki and Youcef Tebbal. The complexity of dominating set reconfiguration, Theoretical Computer Science, 651 (2016), pp. 3749, October 2016. (A primary version is available in the Proceedings of WADS 2015, LNCS 9214, pp. 398409. Preprint: arXiv:1503.00833).
 Marcel Celaya, Kelly Choo, Gary MacGillivray and Karen Seyffarth. Reconfiguring $k$colourings of Complete Bipartite Graphs, Kyungpook Mathematical Journal, 56:3 (2016), pp. 647655, September 2016.
 Julie Beier, Janet Fierson, Ruth Haas, Heather M. Russell and Kara Shavo. Classifying coloring graphs, Discrete Mathematics, 339:8 (2016), pp. 21002112, August 2016.
 Richard C. Brewster, Sean McGuinness, Benjamin Moore and Jonathan A. Noel. A dichotomy theorem for circular colouring reconfiguration, Theoretical Computer Science, 639 (2016), pp. 113, August 2016. (Preprint: arXiv:1508.05573).
 Paul Bonsma. Independent Set Reconfiguration in Cographs and their Generalizations, Journal of Graph Theory, 83:2 (2016), pp. 164195, August 2016. (A primary version is available in the Proceedings of WG 2014, LNCS 8747, pp. 105116. Preprint: arXiv:1402.1587).
 Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel and Daniël Paulusma, Finding Shortest Paths Between Graph Colourings, Algorithmica, 75:2 (2016), pp. 295321, June 2016. (A primary version is available in the Proceedings of IPEC 2014, LNCS 8894, pp. 221233. Preprint: arXiv:1403.6347).
 Takehiro Ito, Hiroyuki Nooka and Xiao Zhou. Reconfiguration of Vertex Covers in a Graph, IEICE Trans. on Information and Systems, E99D:3 (2016), pp. 598606, March 2016. (A primary version is available in the Proceedings of IWOCA 2014, LNCS 8986, pp. 164175).
 Nicolas Bousquet and Guillem Perarnau. Fast recoloring of sparse graphs, European Journal of Combinatorics, 52 (2016), pp. 111, February 2016. (Preprint: arXiv:1411.6997).
 Duc A. Hoang and Ryuhei Uehara. Sliding Tokens on a Cactus, Proceedings of ISAAC 2016, LIPIcs 64, pp. 37:137:26.
 Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas and Takeaki Uno. Approximation and Hardness of Token Swapping, Proceedings of ESA 2016, LIPIcs 57, pp. 66:166:15. (Preprint: arXiv:1602.05150).
 Takeshi Yamada and Ryuhei Uehara. Shortest Reconfiguration of Sliding Tokens on a Caterpillar, Proceedings of WALCOM 2016, LNCS 9627, pp. 236248. (Preprint: arXiv:1511.00243).
 Kunihiro Wasa, Katsuhisa Yamanaka and Hiroki Arimura. The Complexity of Induced Tree Reconfiguration Problems, Proceedings of LATA 2016, LNCS 9618, pp 330342.
2015
 Daniel C. McDonald. Connectedness and Hamiltonicity of graphs on vertex colorings. (Preprint: arXiv:1507.05344).
 Richard C. Brewster and Jonathan A. Noel. Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings, Journal of Graph Theory, 80:3 (2015), pp. 173198, November 2015. (Preprint: arXiv:1412.3493).
 Erik D. Demaine, Martin L. Demaine, Eli FoxEpstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara and Takeshi Yamada. Lineartime algorithm for sliding tokens on trees, Theoretical Computer Science, 600 (2015), pp. 132142, October 2015. (A primary version is available in the Proceedings of ISAAC 2014, LNCS 8889, pp. 389400. Preprint: arXiv:1406.6576).
 Anna Bień. Gamma Graphs Of Some Special Classes Of Trees, Annales Mathematicae Silesianae, 29:1 (2015), pp. 2534, September 2015.
 Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou. The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E98.A:6 (2015), pp. 11681178, June 2015. (A primary version is available in the Proceedings of COCOA 2014, LNCS 8881, pp. 314328. Preprint: arXiv:1407.4235).
 Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa and Takeaki Uno. Swapping Labeled Tokens on Graphs, Theoretical Computer Science, 586 (2015), pp. 8194, June 2015. (A primary version is available in the Proceedings of FUN 2014, LNCS 8496, pp. 364375).
 Eli FoxEpstein, Duc A. Hoang, Yota Otachi and Ryuhei Uehara. Sliding Token on Bipartite Permutation Graphs, Proceedings of ISAAC 2015, LNCS 9472, pp. 237247.
 Tom C. van der Zanden. Parameterized Complexity of Graph Constraint Logic, Proceedings of IPEC 2015, LIPIcs 43, pp. 282293. (Preprint: arXiv:1509.02683).
 Marcin Wrochna. Homomorphism Reconfiguration via Homotopy, Proceedings of STACS 2015, LIPIcs 30, pp. 730–742. (Preprint: arXiv:1408.2812).
 Moritz Mühlenthaler. DegreeConstrained Subgraph Reconfiguration is in P, Proceedings of MFCS 2015, LNCS 9235, pp. 505516. (Preprint: arXiv:1508.01372).
 Takehiro Ito, Hirotaka Ono and Yota Otachi. Reconfiguration of Cliques in a Graph, Proceedings of TAMC 2015, LNCS 9076, pp. 212223. (Preprint: arXiv:1412.3976).
2014
 Marthe Bonamy and Nicolas Bousquet. Reconfiguring Independent Sets in Cographs. (Preprint: arXiv:1406.1433).
 Takehiro Ito and Erik D. Demaine. Approximability of the subset sum reconfiguration problem, Journal of Combinatorial Optimization, 28:3 (2014), pp. 639654, October 2014. (A primary version is available in the Proceedings of TAMC 2011, LNCS 6648, pp. 5869).
 Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou. Reconfiguration of list $L(2,1)$labelings in a graph, Theoretical Computer Science, 544 (2016), pp. 8497, August 2014. (A primary version is available in the Proceedings of ISAAC 2012, LNCS 7676, pp. 3443).
 Konrad W. Schwerdtfeger. A Computational Trichotomy for Connectivity of Boolean Satisfiability, Journal on Satisfiability, Boolean Modeling and Computation 8 (2014), pp. 173195, June 2014. (Preprint: arXiv:1312.4524).
 Ruth Haas and Karen Seyffarth. The $k$Dominating Graph, Graphs and Combinatorics, 30:3 (2014), pp. 609617, May 2014. (Preprint: arXiv:1209.5138).
 sarahmarie belcastro and Ruth Haas. Counting edgeKempeequivalence classes for $3$edgecolored cubic graphs, Discrete Mathematics, 325 (2014), pp. 7784, March 2014. (Preprint: arXiv:1209.1730).
 Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel and Daniël Paulusma. Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs, Journal of Combinatorial Optimization, 27:1 (2014), pp. 132143, January 2014.
 Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman and Marcin Wrochna. Reconfiguration over Tree Decompositions, Proceedings of IPEC 2014, LNCS 8894, pp. 246257. (Preprint: arXiv:1405.2447).
 Paul Bonsma, Amer E. Mouawad, Naomi Nishimura and Venkatesh Raman. The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration, Proceedings of IPEC 2014, LNCS 8894, pp. 110121. (Preprint: arXiv:1404.0337).
 Takehiro Ito, Marcin Kamiński and Hirotaka Ono. FixedParameter Tractability of Token Jumping on Planar Graphs, Proceedings of ISAAC 2014, LNCS 8889, pp. 208219. (Preprint: arXiv:1406.6567).
 Paul Bonsma, Marcin Kamiński and Marcin Wrochna. Reconfiguring Independent Sets in ClawFree Graphs, Proceedings of SWAT 2014, LNCS 8503, pp. 8697. (Preprint: arXiv:1403.0359).
2013
 Paul Bonsma. The complexity of rerouting shortest paths, Theoretical Computer Science, 510 (2013), pp. 112, October 2013. (A primary version is available in the Proceedings of MFCS 2012, LNCS 7464, pp. 222233).
 N. Sridharan, S. Amutha and S.B. Rao. Induced subgraphs of gamma graphs, Discrete Mathematics, Algorithms and Applications, 5:3 (2013), 1350012 (5 pages), August 2013.
 Jan van den Heuvel. The complexity of change, Surveys in Combinatorics 2013, pp. 127160, July 2013. (Preprint: arXiv:1312.2816).
 Adrian Dumitrescu and Minghui Jiang. On reconfiguration of disks in the plane and related problems, Computational Geometry, 46:3 (2013), pp. 191202, April 2013. (A primary version is available in the Proceedings of WADS 2009, LNCS 5664, pp. 254265).
 Marthe Bonamy and Nicolas Bousquet. Recoloring bounded treewidth graphs, Proceedings of LAGOS 2013, ENDM 44, pp. 257262. (Preprint: arXiv:1302.3486).
2012
 Takehiro Ito, Marcin Kamińskib, Erik D. Demaine. Reconfiguration of list edgecolorings in a graph, Discrete Applied Mathematics, 160:15 (2012), pp. 21992207, October 2012. (A primary version is available in the Proceedings of WADS 2009, LNCS 5664, pp. 375386).
 Jessica McDonald, Bojan Mohar and Diego Scheide. Kempe Equivalence of EdgeColorings in Subcubic and Subquartic Graphs, Journal of Graph Theory, 70:2 (2012), pp. 226239, June 2012. (Preprint: arXiv:1005.2248).
 Marcin Kamiński, Paul Medvedev and Martin Milanič. Complexity of independent set reconfigurability problems, Theoretical Computer Science, 439 (2012), pp. 915, June 2012. (A primary version is available in the Proceedings of IWOCA 2010, LNCS 6460, pp. 5667. Preprint: arXiv:1008.4563).
 Ruy FabilaMonroy, David FloresPeñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia and David R. Wood. Token Graphs, Graphs and Combinatorics, 28:3, pp. 365380, May 2012.
 Takehiro Ito, Kazuto Kawamura and Xiao Zhou. An Improved Sufficient Condition for Reconfiguration of List EdgeColorings in a Tree, IEICE Transactions on Information and Systems, E95.D:3 (2012), pp. 737745, March 2012. (A primary version is available in the Proceedings of TAMC 2011, LNCS 6648, pp. 94105).
 Ruth Haas. The canonical coloring graph of trees and cycles, Ars Mathematica Contemporanea, 5:1 (2012), pp. 149157, January 2012.
2011
 Marcin Kamiński, Paul Medvedev and Martin Milanič. Shortest paths between shortest paths, Theoretical Computer Science, 412:39 (2011), pp. 52055210, September 2011. (A primary version is available in the Proceedings of IWOCA 2010, LNCS 6460, pp. 5667. Preprint: arXiv:1008.4563).
 Kazuhisa Makino, Suguru Tamaki and Masaki Yamamoto. An exact algorithm for the Boolean connectivity problem for $k$CNF, Theoretical Computer Science, 412:35 (2011), pp. 46134618, August 2011. (A primary version is available in the Proceedings of SAT 2010, LNCS 6175, pp. 172180).
 Gerd H. Fricke, Sandra M. Hedetniemi, Stephen T. Hedetniemi and Kevin R. Hutson. $\gamma$graphs of graphs, Discussiones Mathematicae Graph Theory, 31:3 (2011), pp. 517531, 2011.
 Elizabeth Connelly, Kevin R. Hutson and Stephen T. Hedetniemi. A note on $\gamma$graphs, AKCE Journal of Graphs and Combinatorics, 8:3 (2011), pp. 2331, June 2011.
 Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Siderie, Ryuhei Uehara and Yushi Uno. On the complexity of reconfiguration problems, Theoretical Computer Science, 412:(12–14) (2011), pp. 10541065, March 2011. (A primary version is available in the Proceedings of ISAAC 2008, LNCS 5369, pp. 2839).
 Luis Cereceda, Jan van den Heuvel and Matthew Johnson. Finding paths between $3$colorings, Journal of Graph Theory, 67:1 (2011), pp. 6982, March 2011. (A primary version is available in the Proceedings of IWOCA 2008, College Publications, pp. 182196).
2010
 Somkiat Trakultraipruk. Connectedness of Strong $k$Colour Graphs. (Preprint: arXiv:1009.4440).
 Kazuhisa Makino, Suguru Tamaki and Masaki Yamamoto. On the Boolean connectivity problem for Horn relations, Discrete Applied Mathematics, 158: 18 (2010), pp. 20242030, November 2010. (A primary version is available in the Proceedings of SAT 2007, LNCS 4501, pp. 187200).
 S. Aparna Lakshmanan and A. Vijayakumar. The gamma graph of a graph, AKCE Journal of Graphs and Combinatorics, 7:1 (2010), pp. 5359, June 2010.
2009
 Luis Cereceda, Jan van den Heuvel and Matthew Johnson. Mixing $3$colourings in bipartite graphs, European Journal of Combinatorics, 30:7 (2009), pp. 15931606, October 2009. (A primary version is available in the Proceedings of WG 2007, LNCS 4769, pp. 166177).
 Paul Bonsma and Luis Cereceda. Finding paths between graph colourings: PSPACEcompleteness and superpolynomial distances, Theoretical Computer Science, 410 (2009), pp. 52155226, September 2009. (A primary version is available in the Proceedings of MFCS 2007, LNCS 4708, pp. 738749).
 N. Sridharan and K. Subramanian. Trees and Unicyclic Graphs are $\gamma$graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 69 (2009), pp. 231236, May 2009.
 Parikshit Gopalan, Phokion G. Kolaitis, Elitza Maneva, and Christos H. Papadimitriou. The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies, SIAM Journal on Computing, 38:6 (2009), pp. 23302355, March 2009. (A primary version is available in the Proceedings of ICALP 2006, LNCS 4051, pp. 346357. Preprint: arXiv:cs/0609072).
2008
 Luis Cereceda, Jan van den Heuvel and Matthew Johnson. Connectedness of the graph of vertexcolourings, Discrete Mathematics, 308:(5–6) (2008), pp. 913919, March 2008.
 Gruia Călinescu, Adrian Dumitrescu, and János Pach. Reconfigurations in Graphs and Grids, SIAM Journal on Discrete Mathematics, 22:1 (2008), pp. 124138, February 2008. (A primary version is available in the Proceedings of LATIN 2006, LNCS 3887, pp. 262273).
2007
 Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel and Matthew Johnson. Finding Paths between Graph Colourings: Computational Complexity and Possible Distances, Proceedings of EuroComb 2007, ENDM 29, pp. 463469.
 Adrian Dumitrescu. Motion Planning and Reconfiguration for Systems of Multiple Objects, Mobile Robots: Perception & Navigation, IntechOpen, pp. 523542 (chapter 24), February 2007.
2006
 Bojan Mohar. Kempe Equivalence of Colorings, Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge, pp. 287297. Trends in Mathematics. Birkhäuser Basel.
2005
 Robert A. Hearn and Erik D. Demaine. PSPACEcompleteness of slidingblock puzzles and other problems through the nondeterministic constraint logic model of computation, Theoretical Computer Science, 343:(1–2) (2005), pp. 7296, October 2005. (Preprint: arXiv:cs/0205005).
1999
 V. Auletta, A. Monti, M. Parente and P. Persiano. A LinearTime Algorithm for the Feasibility of Pebble Motion on Trees, Algorithmica, 23:3 (1999), pp. 223245, March 1999. (A primary version is available in the Proceedings of SWAT 1996, LNCS 1097, pp. 259270).
1994
 Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan and Hisao Tamaki. Motion planning on a graph. Proceedings of SFCS 1994, pp. 511520, IEEE.