Edit Profile Sau, Ignasi Compute Distance To: Compute Author ID: sau.ignasi Published as: Sau, Ignasi External Links: ORCID Documents Indexed: 98 Publications since 2007, including 1 Book all top 5 Co-Authors 0 single-authored 31 Thilikos, Dimitrios M. 20 Paul, Christophe 18 Baste, Julien 8 Kim, Eunjung 8 Shalom, Mordechai 7 Mertzios, George B. 7 Zaks, Shmuel 6 Amini, Omid 6 Araújo, Júlio César Silva 6 Faria, Luerbio 6 Klein, Sulamita 6 Pérennes, Stéphane 6 Saurabh, Saket 5 Garnero, Valentin 5 Raymond, Jean-Florent 4 Adler, Isolde 4 Bermond, Jean-Claude 4 Cohen, Nathann 4 Coudert, David 4 Dorn, Frederic 4 Fomin, Fedor V. 4 Gonçalves, Daniel 4 Muñoz, Xavier 4 Peleg, David 4 Rué, Juanjo 4 Thomassé, Stéphan 3 Campos, Victor A. 3 Chatzidimitriou, Dimitris 3 Gözüpek, Didem 3 Joret, Gwenaël 3 Rautenbach, Dieter 3 Souza, Uéverton S. 3 Sucupira, Rubens 3 Žerovnik, Janez 2 Alves, Sancrey Rodrigues 2 Bougeret, Marin 2 Bousquet, Nicolas 2 Dabrowski, Konrad Kazimierz 2 Havet, Frédéric 2 Langer, Alexander 2 Li, Zhentao 2 Maia, Ana Karolinna 2 Mazauric, Dorian 2 Montejano, Luis Pedro 2 Moulierac, Joanna 2 Noy, Marc 2 Oum, Sang-Il 2 Ozkan, Sibel 2 Reidl, Felix 2 Rossmanith, Peter 2 Scornavacca, Celine 2 Sikdar, Somnath 2 Silva, Ana Maria F. 2 Solano Donado, Fernando 2 Watrigant, Rémi 2 Weller, Mathias 1 Aboulker, Pierre 1 Beggas, Fairouz 1 Benevides, Fabricio Siqueira 1 Cinkler, Tibor 1 Colbourn, Charles J. 1 Cray, Henri 1 de Oliveira Bastos, Josefran 1 dos Santos Souza, Uéverton 1 du Cray, Henri Perret 1 Fernandes dos Santos, Vinícius 1 Fiorini, Samuel 1 Flammini, Michele 1 Gionfriddo, Lucia 1 Giroire, Frédéric 1 Huynh, Tony 1 Kheddouci, Hamamache 1 Lima, Carlos Vinícius G. C. 1 Linhares-Sales, Claudia 1 Monaco, Gianpiero 1 Moscardelli, Luca 1 Mota, Guilherme Oliveira 1 Quattrocchi, Gaetano 1 Silva, Ana Carolina 1 Silva, Ana L. 1 Šparl, Petra all top 5 Serials 10 Theoretical Computer Science 7 Algorithmica 7 SIAM Journal on Discrete Mathematics 6 Discrete Applied Mathematics 5 Discrete Mathematics 3 Journal of Computer and System Sciences 3 Discrete Mathematics and Theoretical Computer Science. DMTCS 3 Journal of Discrete Algorithms 2 European Journal of Combinatorics 2 Theory of Computing Systems 2 ACM Transactions on Algorithms 1 Information Processing Letters 1 Bulletin of Mathematical Biology 1 Journal of Graph Theory 1 Networks 1 SIAM Journal on Computing 1 Lecture Notes in Computer Science all top 5 Fields 77 Computer science (68-XX) 71 Combinatorics (05-XX) 24 Operations research, mathematical programming (90-XX) 1 General and overarching topics; collections (00-XX) 1 Biology and other natural sciences (92-XX) 1 Information and communication theory, circuits (94-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 66 Publications have been cited 229 times in 152 Documents Cited by ▼ Year ▼ Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1336.68201Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath 25 2013 Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1398.68245Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath 11 2016 Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. Zbl 1192.90239Sau, Ignasi; Thilikos, Dimitrios M. 10 2010 Explicit linear kernels via dynamic programming. Zbl 1323.05119Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 9 2015 Dynamic programming for graphs on surfaces. Zbl 1288.05286Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. 9 2010 Degree-constrained subgraph problems: Hardness and approximation results. Zbl 1209.68629Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket 9 2009 The recognition of tolerance and bounded tolerance graphs. Zbl 1235.05098Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel 8 2011 Placing regenerators in optical networks to satisfy multiple sets of requests. Zbl 1288.68014Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel 7 2010 Faster parameterized algorithms for minor containment. Zbl 1285.68206Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. 7 2010 Hardness and approximation of traffic grooming. Zbl 1171.68049Amini, Omid; Pérennes, Stéphane; Sau, Ignasi 7 2009 Parameterized complexity of finding small degree-constrained subgraphs. Zbl 1242.68119Amini, Omid; Sau, Ignasi; Saurabh, Saket 6 2012 Faster parameterized algorithms for minor containment. Zbl 1228.68035Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. 6 2011 Parameterized complexity of the smallest degree-constrained subgraph problem. Zbl 1142.68450Amini, Omid; Sau, Ignasi; Saurabh, Saket 6 2008 An edge variant of the Erdős-Pósa property. Zbl 1336.05108Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M. 5 2016 Dynamic programming for graphs on surfaces. Zbl 1321.05276Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. 5 2014 Hitting and harvesting pumpkins. Zbl 1305.05221Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan 5 2014 Dynamic programming for \(H\)-minor-free graphs. Zbl 1364.68231Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. 5 2012 A new intersection model and improved algorithms for tolerance graphs. Zbl 1207.05132Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel 5 2009 Counting Gallai 3-colorings of complete graphs. Zbl 1416.05098Bastos, Josefran de Oliveira; Benevides, Fabrício Siqueira; Mota, Guilherme Oliveira; Sau, Ignasi 4 2019 On the approximability of some degree-constrained subgraph problems. Zbl 1246.05040Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket 4 2012 Fast minor testing in planar graphs. Zbl 1287.05141Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. 4 2010 How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? Zbl 1430.68126Bougeret, Marin; Sau, Ignasi 3 2019 Ruling out FPT algorithms for weighted coloring on forests. Zbl 1391.68045Araújo, Júlio; Baste, Julien; Sau, Ignasi 3 2018 Improved FPT algorithms for weighted independent set in bull-free graphs. Zbl 1376.05155du Cray, Henri Perret; Sau, Ignasi 3 2018 A linear kernel for planar red-blue dominating set. Zbl 1358.05217Garnero, Valentin; Sau, Ignasi; Thilikos, Dimitrios M. 3 2017 An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68222Kim, Eunjung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 3 2015 The role of planarity in connectivity problems parameterized by treewidth. Zbl 1306.05123Baste, Julien; Sau, Ignasi 3 2015 Asymptotic enumeration of non-crossing partitions on surfaces. Zbl 1259.05013Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. 3 2013 An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\). Zbl 1386.05149Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M. 2 2018 Uniquely restricted matchings and edge colorings. Zbl 06821992Baste, Julien; Rautenbach, Dieter; Sau, Ignasi 2 2017 On the number of labeled graphs of bounded treewidth. Zbl 06821991Baste, Julien; Noy, Marc; Sau, Ignasi 2 2017 Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1372.92069Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine 2 2017 Minors in graphs of large \(\theta_r\)-girth. Zbl 1369.05187Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M. 2 2017 On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. Zbl 06679781Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; dos Santos Souza, Uéverton 2 2016 An \(O(\log \mathrm{OPT})\)-Approximation for Covering/Packing Minor Models of \(\theta _{r}\). Zbl 06545971Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M. 2 2015 Simpler multicoloring of triangle-free hexagonal graphs. Zbl 1233.05107Sau, Ignasi; Šparl, Petra; Žerovnik, Janez 2 2012 Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs. Zbl 1237.05168Muñoz, Xavier; Li, Zhentao; Sau, Ignasi 2 2011 Drop cost and wavelength optimal two-period grooming with ratio 4. Zbl 1214.68260Bermond, Jean-Claude; Colbourn, Charles J.; Gionfriddo, Lucia; Quattrocchi, Gaetano; Sau, Ignasi 2 2010 Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs. Zbl 1267.05271Sau, Ignasi; Thilikos, Dimitrios M. 2 2009 Traffic grooming in unidirectional WDM rings with bounded degree request graph. Zbl 1202.68040Muñoz, Xavier; Sau, Ignasi 2 2008 Hardness and approximation of traffic grooming. Zbl 1193.68285Amini, Omid; Pérennes, Stéphane; Sau, Ignasi 2 2007 Maximum cuts in edge-colored graphs. Zbl 1440.05085Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.; Sucupira, Rubens 1 2020 Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Zbl 1435.68122Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. 1 2020 Hitting minors on bounded treewidth graphs. III. Lower bounds. Zbl 1435.68121Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. 1 2020 Explicit linear kernels for packing problems. Zbl 1422.68111Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 1 2019 Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth. Zbl 1443.68120Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. 1 2018 A linear kernel for planar total dominating set. Zbl 1401.05218Garnero, Valentin; Sau, Ignasi 1 2018 On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. Zbl 1400.68078Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. 1 2018 On the number of labeled graphs of bounded treewidth. Zbl 1387.05114Baste, Julien; Noy, Marc; Sau, Ignasi 1 2018 Ruling out FPT algorithms for weighted coloring on forests. Zbl 1383.05090Araújo, Júlio; Baste, Julien; Sau, Ignasi 1 2017 Maximum cuts in edge-colored graphs. Zbl 1383.05122Sucupira, Rubens; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. 1 2017 Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Zbl 1370.68131Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 1 2017 On the complexity of computing the \(k\)-restricted edge-connectivity of a graph. Zbl 1356.68107Montejano, Luis Pedro; Sau, Ignasi 1 2017 Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai 1 2016 Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 06649746Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine 1 2016 Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. Zbl 1378.68084Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 1 2015 A polynomial-time algorithm for outerplanar diameter improvement. Zbl 06496818Cohen, Nathann; Gonçalves, Daniel; Kim, Eunjung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias 1 2015 Parameterized domination in circle graphs. Zbl 1286.68222Bousquet, Nicolas; Gonçalves, Daniel; Mertzios, George B.; Paul, Christophe; Sau, Ignasi; Thomassé, Stéphan 1 2014 On approximating the \(d\)-girth of a graph. Zbl 1285.05041Peleg, David; Sau, Ignasi; Shalom, Mordechai 1 2013 GMPLS label space minimization through hypergraph layouts. Zbl 1243.68024Bermond, Jean-Claude; Coudert, David; Moulierac, Joanna; Pérennes, Stéphane; Sau, Ignasi; Solano Donado, Fernando 1 2012 Traffic grooming in bidirectional WDM ring networks. Zbl 1231.90124Bermond, Jean-Claude; Muñoz, Xavier; Sau, Ignasi 1 2011 Hitting and harvesting pumpkins. Zbl 1346.68111Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan 1 2011 On approximating the \(d\)-girth of a graph. Zbl 1298.68297Peleg, David; Sau, Ignasi; Shalom, Mordechai 1 2011 The recognition of tolerance and bounded tolerance graphs. Zbl 1230.68095Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel 1 2010 Designing hypergraph layouts to GMPLS routing strategies. Zbl 1274.68004Bermond, Jean-Claude; Coudert, David; Moulierac, Joanna; Pérennes, Stéphane; Sau, Ignasi; Solano Donado, Fernando 1 2010 Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027Cinkler, Tibor; Coudert, David; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Muñoz, Xavier; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel 1 2010 Maximum cuts in edge-colored graphs. Zbl 1440.05085Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.; Sucupira, Rubens 1 2020 Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Zbl 1435.68122Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. 1 2020 Hitting minors on bounded treewidth graphs. III. Lower bounds. Zbl 1435.68121Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. 1 2020 Counting Gallai 3-colorings of complete graphs. Zbl 1416.05098Bastos, Josefran de Oliveira; Benevides, Fabrício Siqueira; Mota, Guilherme Oliveira; Sau, Ignasi 4 2019 How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? Zbl 1430.68126Bougeret, Marin; Sau, Ignasi 3 2019 Explicit linear kernels for packing problems. Zbl 1422.68111Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 1 2019 Ruling out FPT algorithms for weighted coloring on forests. Zbl 1391.68045Araújo, Júlio; Baste, Julien; Sau, Ignasi 3 2018 Improved FPT algorithms for weighted independent set in bull-free graphs. Zbl 1376.05155du Cray, Henri Perret; Sau, Ignasi 3 2018 An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\). Zbl 1386.05149Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M. 2 2018 Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth. Zbl 1443.68120Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. 1 2018 A linear kernel for planar total dominating set. Zbl 1401.05218Garnero, Valentin; Sau, Ignasi 1 2018 On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. Zbl 1400.68078Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. 1 2018 On the number of labeled graphs of bounded treewidth. Zbl 1387.05114Baste, Julien; Noy, Marc; Sau, Ignasi 1 2018 A linear kernel for planar red-blue dominating set. Zbl 1358.05217Garnero, Valentin; Sau, Ignasi; Thilikos, Dimitrios M. 3 2017 Uniquely restricted matchings and edge colorings. Zbl 06821992Baste, Julien; Rautenbach, Dieter; Sau, Ignasi 2 2017 On the number of labeled graphs of bounded treewidth. Zbl 06821991Baste, Julien; Noy, Marc; Sau, Ignasi 2 2017 Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1372.92069Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine 2 2017 Minors in graphs of large \(\theta_r\)-girth. Zbl 1369.05187Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M. 2 2017 Ruling out FPT algorithms for weighted coloring on forests. Zbl 1383.05090Araújo, Júlio; Baste, Julien; Sau, Ignasi 1 2017 Maximum cuts in edge-colored graphs. Zbl 1383.05122Sucupira, Rubens; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. 1 2017 Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Zbl 1370.68131Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 1 2017 On the complexity of computing the \(k\)-restricted edge-connectivity of a graph. Zbl 1356.68107Montejano, Luis Pedro; Sau, Ignasi 1 2017 Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1398.68245Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath 11 2016 An edge variant of the Erdős-Pósa property. Zbl 1336.05108Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M. 5 2016 On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. Zbl 06679781Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; dos Santos Souza, Uéverton 2 2016 Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai 1 2016 Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 06649746Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine 1 2016 Explicit linear kernels via dynamic programming. Zbl 1323.05119Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 9 2015 An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68222Kim, Eunjung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 3 2015 The role of planarity in connectivity problems parameterized by treewidth. Zbl 1306.05123Baste, Julien; Sau, Ignasi 3 2015 An \(O(\log \mathrm{OPT})\)-Approximation for Covering/Packing Minor Models of \(\theta _{r}\). Zbl 06545971Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M. 2 2015 Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. Zbl 1378.68084Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 1 2015 A polynomial-time algorithm for outerplanar diameter improvement. Zbl 06496818Cohen, Nathann; Gonçalves, Daniel; Kim, Eunjung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias 1 2015 Dynamic programming for graphs on surfaces. Zbl 1321.05276Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. 5 2014 Hitting and harvesting pumpkins. Zbl 1305.05221Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan 5 2014 Parameterized domination in circle graphs. Zbl 1286.68222Bousquet, Nicolas; Gonçalves, Daniel; Mertzios, George B.; Paul, Christophe; Sau, Ignasi; Thomassé, Stéphan 1 2014 Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1336.68201Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath 25 2013 Asymptotic enumeration of non-crossing partitions on surfaces. Zbl 1259.05013Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. 3 2013 On approximating the \(d\)-girth of a graph. Zbl 1285.05041Peleg, David; Sau, Ignasi; Shalom, Mordechai 1 2013 Parameterized complexity of finding small degree-constrained subgraphs. Zbl 1242.68119Amini, Omid; Sau, Ignasi; Saurabh, Saket 6 2012 Dynamic programming for \(H\)-minor-free graphs. Zbl 1364.68231Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. 5 2012 On the approximability of some degree-constrained subgraph problems. Zbl 1246.05040Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket 4 2012 Simpler multicoloring of triangle-free hexagonal graphs. Zbl 1233.05107Sau, Ignasi; Šparl, Petra; Žerovnik, Janez 2 2012 GMPLS label space minimization through hypergraph layouts. Zbl 1243.68024Bermond, Jean-Claude; Coudert, David; Moulierac, Joanna; Pérennes, Stéphane; Sau, Ignasi; Solano Donado, Fernando 1 2012 The recognition of tolerance and bounded tolerance graphs. Zbl 1235.05098Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel 8 2011 Faster parameterized algorithms for minor containment. Zbl 1228.68035Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. 6 2011 Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs. Zbl 1237.05168Muñoz, Xavier; Li, Zhentao; Sau, Ignasi 2 2011 Traffic grooming in bidirectional WDM ring networks. Zbl 1231.90124Bermond, Jean-Claude; Muñoz, Xavier; Sau, Ignasi 1 2011 Hitting and harvesting pumpkins. Zbl 1346.68111Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan 1 2011 On approximating the \(d\)-girth of a graph. Zbl 1298.68297Peleg, David; Sau, Ignasi; Shalom, Mordechai 1 2011 Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. Zbl 1192.90239Sau, Ignasi; Thilikos, Dimitrios M. 10 2010 Dynamic programming for graphs on surfaces. Zbl 1288.05286Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. 9 2010 Placing regenerators in optical networks to satisfy multiple sets of requests. Zbl 1288.68014Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel 7 2010 Faster parameterized algorithms for minor containment. Zbl 1285.68206Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. 7 2010 Fast minor testing in planar graphs. Zbl 1287.05141Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. 4 2010 Drop cost and wavelength optimal two-period grooming with ratio 4. Zbl 1214.68260Bermond, Jean-Claude; Colbourn, Charles J.; Gionfriddo, Lucia; Quattrocchi, Gaetano; Sau, Ignasi 2 2010 The recognition of tolerance and bounded tolerance graphs. Zbl 1230.68095Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel 1 2010 Designing hypergraph layouts to GMPLS routing strategies. Zbl 1274.68004Bermond, Jean-Claude; Coudert, David; Moulierac, Joanna; Pérennes, Stéphane; Sau, Ignasi; Solano Donado, Fernando 1 2010 Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027Cinkler, Tibor; Coudert, David; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Muñoz, Xavier; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel 1 2010 Degree-constrained subgraph problems: Hardness and approximation results. Zbl 1209.68629Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket 9 2009 Hardness and approximation of traffic grooming. Zbl 1171.68049Amini, Omid; Pérennes, Stéphane; Sau, Ignasi 7 2009 A new intersection model and improved algorithms for tolerance graphs. Zbl 1207.05132Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel 5 2009 Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs. Zbl 1267.05271Sau, Ignasi; Thilikos, Dimitrios M. 2 2009 Parameterized complexity of the smallest degree-constrained subgraph problem. Zbl 1142.68450Amini, Omid; Sau, Ignasi; Saurabh, Saket 6 2008 Traffic grooming in unidirectional WDM rings with bounded degree request graph. Zbl 1202.68040Muñoz, Xavier; Sau, Ignasi 2 2008 Hardness and approximation of traffic grooming. Zbl 1193.68285Amini, Omid; Pérennes, Stéphane; Sau, Ignasi 2 2007 all cited Publications top 5 cited Publications all top 5 Cited by 251 Authors 39 Sau, Ignasi 35 Thilikos, Dimitrios M. 10 Paul, Christophe 10 Saurabh, Saket 9 Baste, Julien 9 Mertzios, George B. 9 Shalom, Mordechai 7 Golovach, Petr A. 7 Kwon, Ojoung 7 Raymond, Jean-Florent 6 Jansen, Bart M. P. 6 Zaks, Shmuel 5 Giannopoulou, Archontia C. 5 Kim, Eunjung 4 Amini, Omid 4 Gözüpek, Didem 4 Kamiński, Marcin Marek 4 Lokshtanov, Daniel 4 Paulusma, Daniël 4 Peleg, David 4 Pérennes, Stéphane 3 Adler, Isolde 3 Araújo, Júlio César Silva 3 Bonnet, Edouard 3 Dorn, Frederic 3 Eiben, Eduard 3 Fomin, Fedor V. 3 Garnero, Valentin 3 Kratsch, Stefan 3 Panolan, Fahad 3 Reidl, Felix 3 Thomassé, Stéphan 2 Agrawal, Akanksha 2 Bermond, Jean-Claude 2 Bougeret, Marin 2 Bousquet, Nicolas 2 Brettell, Nick 2 Broersma, Hajo J. 2 Chatzidimitriou, Dimitris 2 Dabrowski, Konrad Kazimierz 2 Faria, Luerbio 2 Flammini, Michele 2 Ganian, Robert 2 Gonçalves, Daniel 2 Joret, Gwenaël 2 Kelk, Steven 2 Klein, Sulamita 2 Komusiewicz, Christian 2 Marx, Dániel 2 Monaco, Gianpiero 2 Moscardelli, Luca 2 Mouawad, Amer E. 2 Muñoz, Xavier 2 Nestoridis, Nestor V. 2 Ozkan, Sibel 2 Patel, Viresh 2 Quattrocchi, Gaetano 2 Raghavan, S. Raghu 2 Ragusa, Giorgio 2 Rai, Ashutosh 2 Ramanujan, M. S. 2 Rautenbach, Dieter 2 Rossmanith, Peter 2 Rué, Juanjo 2 Sánchez Villaamil, Fernando 2 Sikdar, Somnath 2 Sorge, Manuel 2 Souza, Uéverton S. 2 Šparl, Petra 2 Stamoulis, Georgios 2 Sullivan, Blair D. 2 Takaoka, Asahi 2 Wu, Taoyang 1 Aboulker, Pierre 1 Alves, Sancrey Rodrigues 1 Aneja, Yash P. 1 Antonakopoulos, Spyridon 1 Bagan, Guillaume 1 Balasubramaniam, Chitra 1 Balogh, József 1 Benevides, Fabricio Siqueira 1 Bian, Zhengbing 1 Bishnu, Arijit 1 Bodlaender, Hans L. 1 Bogdanović, Milena 1 Bonamy, Marthe 1 Bruhn, Henning 1 Brun, Todd A. 1 Bui-Xuan, Binh-Minh 1 Bulteau, Laurent 1 Butenko, Sergiy I. 1 Cames van Batenburg, Wouter 1 Campos, Victor A. 1 Cao, Yixin 1 Changiz Rezaei, Seyed Saeed 1 Charbit, Pierre 1 Chen, Si 1 Chen, Xujin 1 Chudak, Fabián A. 1 Cohen-Addad, Vincent ...and 151 more Authors all top 5 Cited in 33 Serials 21 Discrete Applied Mathematics 21 Theoretical Computer Science 17 Algorithmica 11 SIAM Journal on Discrete Mathematics 9 Journal of Computer and System Sciences 6 Discrete Mathematics 4 European Journal of Combinatorics 3 Quantum Information Processing 2 Journal of Combinatorial Theory. Series B 2 Theory of Computing Systems 2 Journal of Graph Algorithms and Applications 2 Journal of Discrete Algorithms 1 Computers & Mathematics with Applications 1 Information Processing Letters 1 Networks 1 SIAM Journal on Computing 1 Advances in Applied Mathematics 1 Graphs and Combinatorics 1 Information and Computation 1 Asia-Pacific Journal of Operational Research 1 Annals of Operations Research 1 European Journal of Operational Research 1 Distributed Computing 1 INFORMS Journal on Computing 1 Journal of Combinatorial Optimization 1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series 1 JMMA. Journal of Mathematical Modelling and Algorithms 1 Discrete Optimization 1 Logical Methods in Computer Science 1 ACM Transactions on Algorithms 1 Computer Science Review 1 Journal of Mathematical Modelling and Algorithms in Operations Research 1 Bulletin of the Hellenic Mathematical Society all top 5 Cited in 10 Fields 117 Combinatorics (05-XX) 95 Computer science (68-XX) 29 Operations research, mathematical programming (90-XX) 3 Quantum theory (81-XX) 2 Order, lattices, ordered algebraic structures (06-XX) 2 Biology and other natural sciences (92-XX) 1 Mathematical logic and foundations (03-XX) 1 Numerical analysis (65-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Information and communication theory, circuits (94-XX) Citations by Year