No. Title Author Year
1 An FPT Algorithm for Minimum Additive Spanner Problem Kobayashi, Yusuke 2020
2 Reconfiguration of Spanning Trees with Many or Few Leaves Bousquet, Nicolas et al. 2020
3 Shortest Reconfiguration of Colorings Under Kempe Changes Bonamy, Marthe et al. 2020
4 Improved Analysis of Highest-Degree Branching for Feedback Vertex Set Iwata, Yoichi et al. 2019
5 Parameterized Algorithms for Maximum Cut with Connectivity Constraints Eto, Hiroshi 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 Complexity of the Multi-Service Center Problem Ito, Takehiro et al. 2017
9 The Directed Disjoint Shortest Paths Problem Berczi, Kristof et al. 2017
10 Edge-disjoint Odd Cycles in 4-edge-connected Graphs Kawarabayashi, Ken-ichi et al. 2012
11 Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid Kawarabayashi, Ken-ichi et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 11


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