No. Title Author Year
1 Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint Bousquet, Nicolas et al. 2022
2 An FPT Algorithm for Minimum Additive Spanner Problem Kobayashi, Yusuke 2020
3 Fixed-Parameter Algorithms for Graph Constraint Logic Hatanaka, Tatsuhiko et al. 2020
4 Market Pricing for Matroid Rank Valuations Bérczi, Kristóf et al. 2020
5 Reconfiguration of Spanning Trees with Many or Few Leaves Bousquet, Nicolas et al. 2020
6 Shortest Reconfiguration of Colorings Under Kempe Changes Bonamy, Marthe et al. 2020
7 Improved Analysis of Highest-Degree Branching for Feedback Vertex Set Iwata, Yoichi et al. 2019
8 Parameterized Algorithms for Maximum Cut with Connectivity Constraints Eto, Hiroshi et al. 2019
9 Shortest Reconfiguration of Perfect Matchings via Alternating Cycles Ito, Takehiro et al. 2019
10 The Perfect Matching Reconfiguration Problem Bonamy, Marthe et al. 2019
11 Complexity of the Multi-Service Center Problem Ito, Takehiro et al. 2017
12 The Directed Disjoint Shortest Paths Problem Berczi, Kristof et al. 2017
13 Edge-disjoint Odd Cycles in 4-edge-connected Graphs Kawarabayashi, Ken-ichi et al. 2012
14 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: 14


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