No. Title Author Year
1 Correlating Theory and Practice in Finding Clubs and Plexes Figiel, Aleksander et al. 2023
2 FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges Fomin, Fedor V. et al. 2023
3 Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication Bentert, Matthias et al. 2023
4 Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability Koana, Tomohiro 2023
5 Covering Many (Or Few) Edges with k Vertices in Sparse Graphs Koana, Tomohiro et al. 2022
6 The Complexity of Finding Fair Many-To-One Matchings Boehmer, Niclas et al. 2022
7 Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees Kellerhals, Leon et al. 2022
8 Binary Matrix Completion Under Diameter Constraints Koana, Tomohiro et al. 2021
9 Essentially Tight Kernels For (Weakly) Closed Graphs Koana, Tomohiro et al. 2021
10 The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing Kellerhals, Leon et al. 2021
11 Computing Dense and Sparse Subgraphs of Weakly Closed Graphs Koana, Tomohiro et al. 2020
12 Exploiting c-Closure in Kernelization Algorithms for Graph Problems Koana, Tomohiro et al. 2020
13 Parameterized Algorithms for Matrix Completion with Radius Constraints Koana, Tomohiro et al. 2020
14 Parameterized Complexity of Geodetic Set Kellerhals, Leon et al. 2020
Current Page :
Number of result pages: 1
Number of documents: 14

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