| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication | Bentert, Matthias et al. | 2023 |
| 2 | Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions | Heeger, Klaus et al. | 2023 |
| 3 | Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems | Boehmer, Niclas et al. | 2022 |
| 4 | Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters | Bentert, Matthias et al. | 2020 |
| 5 | Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters | Bredereck, Robert et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |