Flip distance between triangulations of a simple polygon is NP-complete, Discrete & Computational Geometry, vol.54, issue.2, pp.368-389, 2015. ,
Transforming Graphs with the Same Graphic Sequence, Journal of Information Processing, vol.25, pp.627-633, 2017. ,
Reconfiguring independent sets in cographs, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01431388
Independent set reconfiguration in cographs and their generalizations, Journal of Graph Theory, vol.83, issue.2, pp.164-195, 2016. ,
Reconfiguring Independent Sets in Claw-Free Graphs, Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014 ), vol.8503, pp.86-97, 2014. ,
Token Jumping in Minor-Closed Classes, Proceedings of the 21st International Symposium on Fundamentals of Computation Theory, vol.10472, pp.136-149, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01634505
Linear-time algorithm for sliding tokens on trees, Theoretical Computer Science, vol.600, pp.132-142, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-02124863
Statistical problems involving permutations with restricted positions, Lecture Notes-Monograph Series, vol.36, pp.195-222, 2001. ,
, Graph Theory, vol.173, 2005.
On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract), Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, vol.1335, pp.184-198, 1997. ,
Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs, Discrete Applied Mathematics, vol.99, issue.1-3, pp.427-442, 2000. ,
Counting perfect matchings and the switch chain, 2017. ,
On the Switch Markov Chain for Perfect Matchings, Journal of the ACM, vol.64, issue.2, 2017. ,
The Stable Marriage Problem: Structure and Algorithms, 1989. ,
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II, Uniqueness. Journal of the Society for Industrial and Applied Mathematics, vol.11, issue.1, pp.135-147, 1963. ,
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation, Theoretical Computer Science, vol.343, issue.1-2, p.14, 2005. ,
, The Perfect Matching Reconfiguration Problem
The complexity of change, Surveys in Combinatorics 2013, pp.127-160, 2013. ,
Graphs of triangulations and perfect matchings, Graphs and Combinatorics, vol.21, issue.3, pp.325-331, 2005. ,
A Simple Test for Interval Graphs, Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science, vol.657, pp.11-16, 1992. ,
Flipping edges in triangulations, Discrete & Computational Geometry, vol.22, issue.3, pp.333-346, 1999. ,
On the complexity of reconfiguration problems, Theoretical Computer Science, vol.412, pp.1054-1065, 2011. ,
On the Parameterized Complexity for Token Jumping on Graphs, Proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, vol.8402, pp.341-351, 2014. ,
Complexity of independent set reconfigurability problems, Theoretical Computer Science, vol.439, pp.9-15, 2012. ,
Software for C1 surface interpolation, Mathematical software, pp.161-194, 1977. ,
Flip distance between two triangulations of a point set is NP-complete, Computational Geometry, vol.49, pp.17-23, 2015. ,
Reconfiguration of Steiner Trees in an Unweighted Graph, IEICE Transactions on Fundamentals of Electronics, issue.7, pp.1532-1540, 2017. ,
Introduction to Reconfiguration, Algorithms, vol.11, issue.4, p.52, 2018. ,
Spaces of domino tilings, Discrete & Computational Geometry, vol.14, issue.2, pp.207-233, 1995. ,
Relationships Between Nondeterministic and Deterministic Tape Complexities, Journal of Computer and System Sciences, vol.4, pp.177-192, 1970. ,
Partitions and Their Representative Graphs, American Journal of Mathematics, vol.73, issue.3, pp.663-689, 1951. ,
On Counting Perfect Matchings in General Graphs, Proceedings of the 13th Latin American Theoretical Informatics Symposium (LATIN 2018 ), vol.10807, pp.873-885, 2018. ,
Switching Distance Between Graphs with the Same Degrees, SIAM Journal on Discrete Mathematics, vol.12, issue.3, pp.298-306, 1999. ,
Reconfiguration in bounded bandwidth and tree-depth, Journal of Computer and System Sciences, vol.93, pp.1-10, 2018. ,
Parameterized Complexity of Graph Constraint Logic, Proceedings of the 10th International Symposium on Parameterized and Exact Computation, vol.43, pp.282-293, 2015. ,