Ignasi Sau

Cited by

	All	Since 2016
Citations	868	480
h-index	16	11
i10-index	26	13

160

120

2007200820092010201120122013201420152016201720182019202020215 13 43 33 40 67 53 59 52 77 92 80 75 144 5

Co-authors

Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensVerified email at math.uoa.gr
stephane perennescnrsVerified email at cnrs.fr
George B. MertziosAssociate Professor, Durham UniversityVerified email at durham.ac.uk
Eun Jung KimLAMSADEVerified email at dauphine.fr
zaks shmuelProfessor, Department of Computer Science, Technion, Haifa, IsraelVerified email at cs.technion.ac.il
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
Jean-Claude BermondDirecteur de Recherche CNRSVerified email at sophia.inria.fr
Ueverton SouzaFluminense Federal UniversityVerified email at ic.uff.br
Mordechai ShalomTel Hai Academic CollegeVerified email at telhai.ac.il
Juanjo RuéAssociate Professor, Universitat Politècnica de Catalunya and BgsMathVerified email at upc.edu
David PelegProfessor of Computer Science, Weizmann InstituteVerified email at weizmann.ac.il
Xavier MunozMatemàtiques, Universitat Politecnica de CatalunyaVerified email at upc.edu
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
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
Sang-il OumCI, Discrete Mathematics Group, Institute for Basic Science and Professor, KAISTVerified email at ibs.re.kr

Ignasi Sau

CNRS, LIRMM, 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	102	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	50	2011
Hardness and approximation of traffic grooming O Amini, S Pérennes, I Sau Theoretical Computer Science 410 (38-40), 3751-3760, 2009	42	2009
Dynamic programming for graphs on surfaces J Rué, I Sau, DM Thilikos International Colloquium on Automata, Languages, and Programming, 372-383, 2010	39*	2010
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs I Sau, DM Thilikos Journal of Discrete Algorithms 8 (3), 330-338, 2010	31*	2010
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	30	2008
The recognition of tolerance and bounded tolerance graphs GB Mertzios, I Sau, S Zaks SIAM Journal on Computing 40 (5), 1234-1257, 2011	26*	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	23	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	23	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	22	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	22	2012
Fast minor testing in planar graphs I Adler, F Dorn, FV Fomin, I Sau, DM Thilikos Algorithmica 64 (1), 69-84, 2012	19	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	17	2019
An edge variant of the Erdős–Pósa property JF Raymond, I Sau, DM Thilikos Discrete Mathematics 339 (8), 2027-2035, 2016	17	2016
Parameterized complexity of finding small degree-constrained subgraphs O Amini, I Sau, S Saurabh Journal of Discrete Algorithms 10, 70-83, 2012	16	2012
A new intersection model and improved algorithms for tolerance graphs GB Mertzios, I Sau, S Zaks SIAM Journal on Discrete Mathematics 23 (4), 1800-1813, 2010	16	2010
Traffic grooming in bidirectional WDM ring networks JC Bermond, X Muñoz, I Sau Networks 58 (1), 20-35, 2017	15*	2017
Asymptotic enumeration of non-crossing partitions on surfaces J Rué, I Sau, DM Thilikos Discrete Mathematics 313 (5), 635-649, 2013	15	2013
Traffic grooming in unidirectional WDM rings with bounded degree request graph X Munoz, I Sau International Workshop on Graph-Theoretic Concepts in Computer Science, 300-311, 2008	15	2008
An optimal permutation routing algorithm on full-duplex hexagonal networks J Žerovnik, I Sau Discrete Mathematics & Theoretical Computer Science 10, 2008	15*	2008

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

Upload PDF

Follow this author

Cited by

Co-authors