Ignasi Sau
Ignasi Sau
CNRS, LIRMM, Université de Montpellier, France
Verified email at - Homepage
Cited by
Cited by
Linear kernels and single-exponential algorithms via protrusion decompositions
EJ Kim, A Langer, C Paul, F Reidl, P Rossmanith, I Sau, S Sikdar
ACM Transactions on Algorithms (TALG) 12 (2), 1-41, 2015
Faster parameterized algorithms for minor containment
I Adler, F Dorn, FV Fomin, I Sau, DM Thilikos
Theoretical Computer Science 412 (50), 7018-7028, 2011
Hardness and approximation of traffic grooming
O Amini, S Pérennes, I Sau
Theoretical Computer Science 410 (38-40), 3751-3760, 2009
Dynamic programming for graphs on surfaces
J Rué, I Sau, DM Thilikos
ACM Transactions on Algorithms (TALG) 10 (2), 1-26, 2014
Degree-constrained subgraph problems: Hardness and approximation results
O Amini, D Peleg, S Pérennes, I Sau, S Saurabh
International Workshop on Approximation and Online Algorithms, 29-42, 2008
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
I Sau, DM Thilikos
Journal of Discrete Algorithms 8 (3), 330-338, 2010
Parameterized complexity of finding small degree-constrained subgraphs
O Amini, I Sau, S Saurabh
Journal of Discrete Algorithms 10, 70-83, 2012
Hitting minors on bounded treewidth graphs. I. General upper bounds
J Baste, I Sau, DM Thilikos
SIAM Journal on Discrete Mathematics 34 (3), 1623-1648, 2020
On the approximability of some degree-constrained subgraph problems
O Amini, D Peleg, S Pérennes, I Sau, S Saurabh
Discrete Applied Mathematics 160 (12), 1661-1679, 2012
Hitting and harvesting pumpkins
G Joret, C Paul, I Sau, S Saurabh, S Thomassé
SIAM Journal on Discrete Mathematics 28 (3), 1363-1390, 2014
The recognition of tolerance and bounded tolerance graphs
GB Mertzios, I Sau, S Zaks
SIAM Journal on Computing 40 (5), 1234-1257, 2011
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
J Baste, I Sau, DM Thilikos
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
M Bougeret, I Sau
Algorithmica 81 (10), 4043-4068, 2019
Explicit linear kernels via dynamic programming
V Garnero, C Paul, I Sau, DM Thilikos
SIAM Journal on Discrete Mathematics 29 (4), 1864-1894, 2015
Fast minor testing in planar graphs
I Adler, F Dorn, FV Fomin, I Sau, DM Thilikos
Algorithmica 64, 69-84, 2012
Placing regenerators in optical networks to satisfy multiple sets of requests
GB Mertzios, I Sau, M Shalom, S Zaks
IEEE/ACM Transactions on Networking 20 (6), 1870-1879, 2012
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
GCM Gomes, I Sau
Algorithmica 83, 1677-1706, 2021
An FPT 2-approximation for tree-cut decomposition
EJ Kim, S Oum, C Paul, I Sau, DM Thilikos
Algorithmica 80, 116-135, 2018
Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs
X Munoz, Z Li, I Sau
SIAM Journal on Discrete Mathematics 25 (4), 1490-1505, 2011
Hitting forbidden induced subgraphs on bounded treewidth graphs
I Sau, U dos Santos Souza
Information and Computation 281, 104812, 2021
The system can't perform the operation now. Try again later.
Articles 1–20