Ignasi Sau
Ignasi Sau
CNRS, LIRMM, Montpellier, France
E-mail confirmado em lirmm.fr - Página inicial
Título
Citado por
Citado por
Ano
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
972015
Dynamic programming for graphs on surfaces
J Rué, I Sau, DM Thilikos
International Colloquium on Automata, Languages, and Programming, 372-383, 2010
39*2010
Faster parameterized algorithms for minor containment
I Adler, F Dorn, FV Fomin, I Sau, DM Thilikos
Theoretical Computer Science 412 (50), 7018-7028, 2011
302011
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
302008
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
I Sau, DM Thilikos
Journal of Discrete Algorithms 8 (3), 330-338, 2010
282010
Hardness and approximation of traffic grooming
O Amini, S Pérennes, I Sau
Theoretical Computer Science 410 (38-40), 3751-3760, 2009
262009
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
232012
Explicit linear kernels via dynamic programming
V Garnero, C Paul, I Sau, DM Thilikos
SIAM Journal on Discrete Mathematics 29 (4), 1864-1894, 2015
222015
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
222012
Hitting and harvesting pumpkins
G Joret, C Paul, I Sau, S Saurabh, S Thomassé
SIAM Journal on Discrete Mathematics 28 (3), 1363-1390, 2014
212014
Faster parameterized algorithms for minor containment
I Adler, F Dorn, FV Fomin, I Sau, DM Thilikos
Scandinavian Workshop on Algorithm Theory, 322-333, 2010
202010
Fast minor testing in planar graphs
I Adler, F Dorn, FV Fomin, I Sau, DM Thilikos
Algorithmica 64 (1), 69-84, 2012
182012
Hardness and approximation of traffic grooming
O Amini, S Pérennes, I Sau
International Symposium on Algorithms and Computation, 561-573, 2007
172007
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
M Bougeret, I Sau
Algorithmica 81 (10), 4043-4068, 2019
162019
An edge variant of the Erdős–Pósa property
JF Raymond, I Sau, DM Thilikos
Discrete Mathematics 339 (8), 2027-2035, 2016
162016
Parameterized complexity of finding small degree-constrained subgraphs
O Amini, I Sau, S Saurabh
Journal of Discrete Algorithms 10, 70-83, 2012
162012
The recognition of tolerance and bounded tolerance graphs
GB Mertzios, I Sau, S Zaks
SIAM Journal on Computing 40 (5), 1234-1257, 2011
162011
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
162010
Asymptotic enumeration of non-crossing partitions on surfaces
J Rué, I Sau, DM Thilikos
Discrete Mathematics 313 (5), 635-649, 2013
152013
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
152008
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20