Ignasi Sau

1.1k total citations
77 papers, 294 citations indexed

About

Ignasi Sau is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Ignasi Sau has authored 77 papers receiving a total of 294 indexed citations (citations by other indexed papers that have themselves been cited), including 64 papers in Computational Theory and Mathematics, 33 papers in Computer Networks and Communications and 19 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Ignasi Sau's work include Advanced Graph Theory Research (63 papers), Complexity and Algorithms in Graphs (48 papers) and Interconnection Networks and Systems (18 papers). Ignasi Sau is often cited by papers focused on Advanced Graph Theory Research (63 papers), Complexity and Algorithms in Graphs (48 papers) and Interconnection Networks and Systems (18 papers). Ignasi Sau collaborates with scholars based in France, Brazil and Greece. Ignasi Sau's co-authors include Dimitrios M. Thilikos, Dimitrios M. Thilikos, Omid Amini, Christophe Paul, Stéphane Pérennès, George B. Mertzios, Shmuel Zaks, Saket Saurabh, Eun Jung Kim and Mordechai Shalom and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE/ACM Transactions on Networking and SIAM Journal on Computing.

In The Last Decade

Ignasi Sau

66 papers receiving 281 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ignasi Sau France	9	222	87	65	49	31	77	294
Igor Razgon Ireland	11	370 1.7×	141 1.6×	48 0.7×	43 0.9×	51 1.6×	24	424
Rossella Petreschi Italy	11	264 1.2×	76 0.9×	33 0.5×	106 2.2×	33 1.1×	40	332
Yushi Uno Japan	8	188 0.8×	70 0.8×	24 0.4×	52 1.1×	38 1.2×	39	246
Janka Chlebı́ková Slovakia	8	241 1.1×	138 1.6×	27 0.4×	52 1.1×	32 1.0×	25	327
Sundar Vishwanathan India	10	186 0.8×	156 1.8×	38 0.6×	43 0.9×	38 1.2×	30	282
Mathieu Liedloff France	11	217 1.0×	110 1.3×	39 0.6×	31 0.6×	20 0.6×	36	276
Jesper Nederlof Netherlands	9	337 1.5×	132 1.5×	45 0.7×	48 1.0×	71 2.3×	35	373
Geir Agnarsson United States	7	154 0.7×	46 0.5×	73 1.1×	56 1.1×	21 0.7×	27	246
Garth Isaak United States	11	216 1.0×	43 0.5×	73 1.1×	45 0.9×	38 1.2×	31	305
Gwenaël Joret Belgium	10	182 0.8×	47 0.5×	66 1.0×	26 0.5×	37 1.2×	55	242

Countries citing papers authored by Ignasi Sau

Since Specialization

Citations

This map shows the geographic impact of Ignasi Sau's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ignasi Sau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ignasi Sau more than expected).

Fields of papers citing papers by Ignasi Sau

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ignasi Sau. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ignasi Sau. The network helps show where Ignasi Sau may publish in the future.

Co-authorship network of co-authors of Ignasi Sau

This figure shows the co-authorship network connecting the top 25 collaborators of Ignasi Sau. A scholar is included among the top collaborators of Ignasi Sau based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ignasi Sau. Ignasi Sau is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Sau, Ignasi, et al.. (2024). Faster parameterized algorithms for modification problems to minor-closed classes. SHILAP Revista de lepidopterología. Volume 3.

Sampaio, Rudini, et al.. (2023). Target set selection with maximum activation time. Discrete Applied Mathematics. 338. 199–217. 1 indexed citations

Bessy, Stéphane, et al.. (2023). FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discrete Applied Mathematics. 346. 80–94.

Santos, Vinícius F. dos, et al.. (2020). Reducing Graph Transversals via Edge Contractions. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 170. 1 indexed citations

Sau, Ignasi, et al.. (2020). Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theoretical Computer Science. 814. 135–152. 4 indexed citations

Sau, Ignasi, et al.. (2020). k-apices of minor-closed graph classes. II. Parameterized algorithms. arXiv (Cornell University). 6 indexed citations

Rautenbach, Dieter, et al.. (2019). Approximating maximum uniquely restricted matchings in bipartite graphs. Discrete Applied Mathematics. 267. 30–40.

Campos, Víctor, et al.. (2018). Dual Parameterization of Weighted Coloring. arXiv (Cornell University). 1 indexed citations

Rautenbach, Dieter, et al.. (2018). Upper bounds on the uniquely restricted chromatic index. Journal of Graph Theory. 91(3). 251–258. 2 indexed citations

10.

Sau, Ignasi, et al.. (2018). Ruling out FPT algorithms for Weighted Coloring on forests. Theoretical Computer Science. 729. 11–19. 1 indexed citations

11.

Sau, Ignasi, et al.. (2017). Improved FPT algorithms for weighted independent set in bull-free graphs. Discrete Mathematics. 341(2). 451–462. 3 indexed citations

12.

Kim, Eun Jung, Christophe Paul, Ignasi Sau, & Dimitrios M. Thilikos. (2017). Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Journal of Computer and System Sciences. 86. 191–206. 1 indexed citations

13.

Paul, Christophe, et al.. (2017). Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. Bulletin of Mathematical Biology. 79(4). 920–938. 4 indexed citations

14.

Sau, Ignasi, et al.. (2016). A linear kernel for planar red–blue dominating set. Discrete Applied Mathematics. 217. 536–547. 4 indexed citations

15.

Amini, Omid, David Peleg, Stéphane Pérennès, Ignasi Sau, & Saket Saurabh. (2012). On the approximability of some degree-constrained subgraph problems. Discrete Applied Mathematics. 160(12). 1661–1679. 18 indexed citations

16.

Bermond, Jean‐Claude, David Coudert, Joanna Mouliérac, et al.. (2012). GMPLS label space minimization through hypergraph layouts. Theoretical Computer Science. 444. 3–16. 1 indexed citations

17.

Amini, Omid, Ignasi Sau, & Saket Saurabh. (2011). Parameterized complexity of finding small degree-constrained subgraphs. Journal of Discrete Algorithms. 10. 70–83. 8 indexed citations

18.

Sau, Ignasi, et al.. (2011). Simpler multicoloring of triangle-free hexagonal graphs. Discrete Mathematics. 312(1). 181–187. 4 indexed citations

19.

Sau, Ignasi & Dimitrios M. Thilikos. (2010). Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. Journal of Discrete Algorithms. 8(3). 330–338. 11 indexed citations

20.

Mertzios, George B., Ignasi Sau, & Shmuel Zaks. (2009). The Recognition of Tolerance and Bounded Tolerance Graphs is NP-complete. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact