Ignasi Sau

Cited by

	All	Since 2018
Citations	1141	605
h-index	18	12
i10-index	34	19

180

135

2006200720082009201020112012201320142015201620172018201920202021202220233 6 11 37 31 42 61 45 59 50 84 79 68 81 119 144 165 23

Public access

View all

35 articles

0 articles

available

not available

Based on funding mandates

Co-authors

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

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	120	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	54	2011
Hardness and approximation of traffic grooming O Amini, S Pérennes, I Sau Theoretical Computer Science 410 (38-40), 3751-3760, 2009	49	2009
Dynamic programming for graphs on surfaces J Rué, I Sau, DM Thilikos ACM Transactions on Algorithms (TALG) 10 (2), 1-26, 2014	38	2014
Degree-constrained subgraph problems: Hardness and approximation results O Amini, D Peleg, S Pérennes, I Sau, S Saurabh Approximation and Online Algorithms: 6th International Workshop, WAOA 2008 …, 2009	35	2009
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
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	29	2012
Parameterized complexity of finding small degree-constrained subgraphs O Amini, I Sau, S Saurabh Journal of Discrete Algorithms 10, 70-83, 2012	29*	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	27	2014
The recognition of tolerance and bounded tolerance graphs GB Mertzios, I Sau, S Zaks SIAM Journal on Computing 40 (5), 1234-1257, 2011	27*	2011
Explicit linear kernels via dynamic programming V Garnero, C Paul, I Sau, DM Thilikos SIAM Journal on Discrete Mathematics 29 (4), 1864-1894, 2015	26	2015
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	26	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	25*	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	23	2019
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	23*	2011
Fast minor testing in planar graphs I Adler, F Dorn, FV Fomin, I Sau, DM Thilikos Algorithmica 64, 69-84, 2012	21	2012
An edge variant of the Erdős–Pósa property JF Raymond, I Sau, DM Thilikos Discrete Mathematics 339 (8), 2027-2035, 2016	20	2016
On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph SR Alves, KK Dabrowski, L Faria, S Klein, I Sau, US Souza Theoretical Computer Science 746, 36-48, 2018	19*	2018
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	18	2020
An FPT 2-approximation for tree-cut decomposition EJ Kim, S Oum, C Paul, I Sau, DM Thilikos Algorithmica 80, 116-135, 2018	18	2018

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