author-photo

Ignasi Sau

University of Montpellier
Centre national de la recherche scientifique
Federal University of Ceará

217

Papers

1131

Citations

Citation Trend

Filter By

Papers (155) Sort By

Journal Conference Others

Introducing lop-Kernels: A Framework for Kernelization Lower Bounds - Algorithmica

2022 Algorithmica
Show All
- Source
- Cite
- Save
Citations (0)
-apices of Minor-closed Graph Classes. II. Parameterized Algorithms

2022 ACM Transactions on Algorithms
Show All
- Source
- Cite
- Save
Citations (0)
Hitting minors on bounded treewidth graphs. I. General upper bounds.

2021 arXiv: Data Structures and Algorithms
Show All
- Source
- Cite
- Save
Citations (1)
Reducing graph transversals via edge contractions

2021 Journal of Computer and System Sciences
Show All
- Source
- Cite
- Save
Citations (0)
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization

2021 Algorithmica
- Guilherme de C. M. Gomes
- Ignasi Sau
Show All
- Source
- Cite
- Save
Citations (1)
k-apices of minor-closed graph classes. I. Bounding the obstructions.

2021 arXiv: Combinatorics
Show All
- Source
- Cite
- Save
Citations (3)
A more accurate view of the Flat Wall Theorem.

2021 arXiv: Discrete Mathematics
Show All
- Source
- Cite
- Save
Citations (5)
Hitting minors on bounded treewidth graphs. III. Lower bounds.

2021 arXiv: Data Structures and Algorithms
Show All
- Source
- Cite
- Save
Citations (0)
k-apices of minor-closed graph classes. II. Parameterized algorithms.

2021 arXiv: Data Structures and Algorithms
Show All
- Source
- Cite
- Save
Citations (5)
Parameterized complexity of computing maximum minimal blocking and hitting sets.

2021 arXiv: Data Structures and Algorithms
Show All
- Source
- Cite
- Save
Citations (1)