Ignasi Sau

Cited by

	All	Since 2020
Citations	1407	731
h-index	21	14
i10-index	47	29

160

120

20072008200920102011201220132014201520162017201820192020202120222023202420256 14 34 30 38 59 46 54 48 89 75 66 80 117 127 134 155 134 51

Public access

View all

43 articles

1 article

available

not available

Based on funding mandates

Co-authors

Dimitrios M. ThilikosVerified email at thilikos.info
stephane perennescnrsVerified email at cnrs.fr
Ueverton S. SouzaFluminense Federal UniversityVerified email at ic.uff.br
Eun Jung KimKAIST, CNRSVerified email at kaist.ac.kr
janez žerovnikUniversity of LjubljanaVerified email at fs.uni-lj.si
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
David CoudertINRIAVerified email at inria.fr
zaks shmuelProfessor, Department of Computer Science, Technion, Haifa, IsraelVerified email at cs.technion.ac.il
Jean-Claude BermondDirecteur de Recherche CNRSVerified email at sophia.inria.fr
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Mordechai ShalomTel Hai Academic CollegeVerified email at telhai.ac.il
George B. MertziosAssociate Professor, Durham UniversityVerified email at durham.ac.uk
David PelegProfessor of Computer Science, Weizmann InstituteVerified email at weizmann.ac.il
Juanjo RuéAssociate Professor, Universitat Politècnica de Catalunya and Centre de Recerca MatemàticaVerified email at upc.edu
Xavier MunozMatemàtiques, Universitat Politecnica de CatalunyaVerified email at upc.edu
Gwenaël JoretUniversité libre de BruxellesVerified email at ulb.be
Felix ReidlSenior Lecturer, Birkbeck UniversityVerified email at dcs.bbk.ac.uk
Alexander LangerRWTH Aachen UniversityVerified email at cs.rwth-aachen.de
Sang-il OumDistinguished Research Fellow / CI. Discrete Mathematics Group, Institute for Basic ScienceVerified email at ibs.re.kr
Samuel FioriniUniversité libre de BruxellesVerified email at ulb.ac.be

Ignasi Sau

CNRS, LIRMM, Université de Montpellier, France

Verified email at lirmm.fr - Homepage

Graph Theory Parameterized Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	125	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	59	2011
Hardness and approximation of traffic grooming O Amini, S Pérennes, I Sau Theoretical Computer Science 410 (38-40), 3751-3760, 2009	44	2009
Dynamic programming for graphs on surfaces J Rué, I Sau, DM Thilikos ACM Transactions on Algorithms (TALG) 10 (2), 1-26, 2014	41	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	38	2008
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	35*	2020
Parameterized complexity of finding small degree-constrained subgraphs O Amini, I Sau, S Saurabh Journal of Discrete Algorithms 10, 70-83, 2012	35*	2012
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	34	2020
The recognition of tolerance and bounded tolerance graphs GB Mertzios, I Sau, S Zaks SIAM Journal on Computing 40 (5), 1234-1257, 2011	33*	2011
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs I Sau, DM Thilikos Journal of Discrete Algorithms 8 (3), 330-338, 2010	33*	2010
Hitting and harvesting pumpkins G Joret, C Paul, I Sau, S Saurabh, S Thomassé SIAM Journal on Discrete Mathematics 28 (3), 1363-1390, 2014	32	2014
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	32	2012
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? M Bougeret, I Sau Algorithmica 81 (10), 4043-4068, 2019	30	2019
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization GCM Gomes, I Sau Algorithmica 83, 1677-1706, 2021	28	2021
Explicit linear kernels via dynamic programming V Garnero, C Paul, I Sau, DM Thilikos SIAM Journal on Discrete Mathematics 29 (4), 1864-1894, 2015	28	2015
An FPT 2-approximation for tree-cut decomposition EJ Kim, S Oum, C Paul, I Sau, DM Thilikos Algorithmica 80, 116-135, 2018	26	2018
Hitting forbidden induced subgraphs on bounded treewidth graphs I Sau, U dos Santos Souza Information and Computation 281, 104812, 2021	25	2021
Fast minor testing in planar graphs I Adler, F Dorn, FV Fomin, I Sau, DM Thilikos Algorithmica 64, 69-84, 2012	25	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	24	2012
An FPT-algorithm for recognizing k-apices of minor-closed graph classes I Sau, G Stamoulis, DM Thilikos 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020	22	2020

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors