No. |
Title |
Author |
Year |
---|

1 |
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited |
Gima, Tatsuya et al. |
2022 |

2 |
Extended MSO Model Checking via Small Vertex Integrity |
Gima, Tatsuya et al. |
2022 |

3 |
Independent Set Reconfiguration on Directed Graphs |
Ito, Takehiro et al. |
2022 |

4 |
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets |
Abhinav, Ankit et al. |
2022 |

5 |
Sorting Balls and Water: Equivalence and Computational Complexity |
Ito, Takehiro et al. |
2022 |

6 |
Grundy Distinguishes Treewidth from Pathwidth |
Belmonte, Rémy et al. |
2020 |

7 |
Parameterized Complexity of Graph Burning |
Kobayashi, Yasuaki et al. |
2020 |

8 |
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs |
Izumi, Taisuke et al. |
2020 |

9 |
Low-Congestion Shortcut and Graph Parameters |
Kitamura, Naoki et al. |
2019 |

10 |
Token Sliding on Split Graphs |
Belmonte, Rémy et al. |
2019 |

11 |
How Bad is the Freedom to Flood-It? |
Belmonte, Rémy et al. |
2018 |

12 |
Parameterized Orientable Deletion |
Hanaka, Tesshu et al. |
2018 |

13 |
Reconfiguration of Colorable Sets in Classes of Perfect Graphs |
Ito, Takehiro et al. |
2018 |

14 |
Space-Efficient Algorithms for Longest Increasing Subsequence |
Kiyomi, Masashi et al. |
2018 |

15 |
Vertex Deletion Problems on Chordal Graphs |
Cao, Yixin et al. |
2018 |

16 |
A Faster Parameterized Algorithm for Pseudoforest Deletion |
Bodlaender, Hans L. et al. |
2017 |

17 |
A Lower Bound on Opaque Sets |
Kawamura, Akitoshi et al. |
2016 |

18 |
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity |
Bodlaender, Hans L. et al. |
2016 |

19 |
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths |
Klavík, Pavel et al. |
2016 |