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

1 |
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs |
Koana, Tomohiro et al. |
2022 |

2 |
The Complexity of Finding Fair Many-To-One Matchings |
Boehmer, Niclas et al. |
2022 |

3 |
Binary Matrix Completion Under Diameter Constraints |
Koana, Tomohiro et al. |
2021 |

4 |
Essentially Tight Kernels For (Weakly) Closed Graphs |
Koana, Tomohiro et al. |
2021 |

5 |
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing |
Kellerhals, Leon et al. |
2021 |

6 |
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs |
Koana, Tomohiro et al. |
2020 |

7 |
Exploiting c-Closure in Kernelization Algorithms for Graph Problems |
Koana, Tomohiro et al. |
2020 |

8 |
Parameterized Algorithms for Matrix Completion with Radius Constraints |
Koana, Tomohiro et al. |
2020 |

9 |
Parameterized Complexity of Geodetic Set |
Kellerhals, Leon et al. |
2020 |