No. Title Author Year
1 Fixed-Parameter Algorithms for Graph Constraint Logic Hatanaka, Tatsuhiko et al. 2020
2 Minimization and Parameterized Variants of Vertex Partition Problems on Graphs Tamura, Yuma et al. 2020
3 Reconfiguration of Spanning Trees with Many or Few Leaves Bousquet, Nicolas et al. 2020
4 Shortest Reconfiguration of Colorings Under Kempe Changes Bonamy, Marthe et al. 2020
5 Reconfiguration of Minimum Steiner Trees via Vertex Exchanges Mizuta, Haruka et al. 2019
6 Shortest Reconfiguration of Perfect Matchings via Alternating Cycles Ito, Takehiro et al. 2019
7 The Perfect Matching Reconfiguration Problem Bonamy, Marthe et al. 2019
8 Algorithms for Coloring Reconfiguration Under Recolorability Constraints Osawa, Hiroki et al. 2018
9 Reconfiguration of Colorable Sets in Classes of Perfect Graphs Ito, Takehiro et al. 2018
10 Complexity of Coloring Reconfiguration under Recolorability Constraints Osawa, Hiroki et al. 2017
11 Complexity of the Multi-Service Center Problem Ito, Takehiro et al. 2017
12 Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters Hatanaka, Tatsuhiko et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 12

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI