Fábio Protti

1.5k total citations
102 papers, 738 citations indexed

About

Fábio Protti is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Fábio Protti has authored 102 papers receiving a total of 738 indexed citations (citations by other indexed papers that have themselves been cited), including 76 papers in Computational Theory and Mathematics, 26 papers in Computer Networks and Communications and 24 papers in Electrical and Electronic Engineering. Recurrent topics in Fábio Protti's work include Advanced Graph Theory Research (66 papers), Graph Labeling and Dimension Problems (30 papers) and Complexity and Algorithms in Graphs (25 papers). Fábio Protti is often cited by papers focused on Advanced Graph Theory Research (66 papers), Graph Labeling and Dimension Problems (30 papers) and Complexity and Algorithms in Graphs (25 papers). Fábio Protti collaborates with scholars based in Brazil, Germany and Argentina. Fábio Protti's co-authors include Jayme L. Szwarcfiter, Mitre C. Dourado, Dieter Rautenbach, Sulamita Klein, Pavol Hell, Uéverton S. Souza, Luiz Satoru Ochi, Jan Kratochvı́l, John Gimbel and Luci Pìrmez and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and Applied Mathematics and Computation.

In The Last Decade

Fábio Protti

89 papers receiving 699 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Fábio Protti Brazil	15	512	170	153	100	98	102	738
Elizna Burger South Africa	3	314 0.6×	111 0.7×	86 0.6×	77 0.8×	99 1.0×	8	594
Stefan Hougardy Germany	14	253 0.5×	171 1.0×	53 0.3×	195 1.9×	35 0.4×	43	680
Ali Ridha Mahjoub France	15	512 1.0×	112 0.7×	49 0.3×	209 2.1×	36 0.4×	41	701
Joseph Cheriyan Canada	18	678 1.3×	603 3.5×	33 0.2×	187 1.9×	26 0.3×	62	917
Illya V. Hicks United States	10	214 0.4×	167 1.0×	14 0.1×	63 0.6×	26 0.3×	44	481
Meena Mahajan India	11	344 0.7×	149 0.9×	23 0.2×	46 0.5×	15 0.2×	67	546
Ephraim Korach Israel	14	259 0.5×	507 3.0×	20 0.1×	78 0.8×	23 0.2×	54	703
Balabhaskar Balasundaram United States	12	263 0.5×	162 1.0×	16 0.1×	16 0.2×	33 0.3×	35	563
D. H. Younger Canada	8	350 0.7×	94 0.6×	60 0.4×	55 0.6×	39 0.4×	17	817
Bang Ye Wu Taiwan	15	247 0.5×	172 1.0×	11 0.1×	83 0.8×	18 0.2×	48	669

Countries citing papers authored by Fábio Protti

Since Specialization

Citations

This map shows the geographic impact of Fábio Protti'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 Fábio Protti with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Fábio Protti more than expected).

Fields of papers citing papers by Fábio Protti

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Fábio Protti. 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 Fábio Protti. The network helps show where Fábio Protti may publish in the future.

Co-authorship network of co-authors of Fábio Protti

This figure shows the co-authorship network connecting the top 25 collaborators of Fábio Protti. A scholar is included among the top collaborators of Fábio Protti 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 Fábio Protti. Fábio Protti 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

Dourado, Mitre C., et al.. (2024). The iteration time and the general position number in graph convexities. Applied Mathematics and Computation. 487. 129084–129084.

Dourado, Mitre C., et al.. (2023). Characterizations of Graph Classes Via Convex Geometries: A Survey. SSRN Electronic Journal. 2 indexed citations

Protti, Fábio, et al.. (2021). Edge clique partition in ( k , ℓ ) -graphs. Discrete Applied Mathematics. 306. 89–97.

Filho, Milton Brown Do Coutto, et al.. (2021). Topological Approach for Identifying Critical Measurements and Sets in State Estimation. IEEE Latin America Transactions. 20(1). 100–107. 1 indexed citations

Protti, Fábio, et al.. (2021). Declawing a graph: polyhedra and Branch-and-Cut algorithms. Journal of Combinatorial Optimization. 42(1). 85–124. 1 indexed citations

Ramalhinho, Helena, Miquel Oliver, Luiz Satoru Ochi, et al.. (2020). Mobility, Citizens, Innovation and Technology in Digital and Smart Cities. Future Internet. 12(2). 22–22. 22 indexed citations

Protti, Fábio, et al.. (2018). Cograph generation with linear delay. Theoretical Computer Science. 713. 1–10. 2 indexed citations

Souza, Uéverton S. & Fábio Protti. (2017). Tractability, hardness, and kernelization lower bound for and/or graph solution. Discrete Applied Mathematics. 232. 125–133. 3 indexed citations

Penso, Lúcia Draque, Fábio Protti, Dieter Rautenbach, & Uéverton S. Souza. (2015). Complexity analysis of P3-convexity problems on bounded-degree and planar graphs. Theoretical Computer Science. 607. 83–95. 9 indexed citations

10.

Dourado, Mitre C., et al.. (2015). Robust recoverable perfect matchings. Networks. 66(3). 210–213. 6 indexed citations

11.

Dourado, Mitre C., Fábio Protti, & Jayme L. Szwarcfiter. (2014). On Helly Hypergraphs with Variable Intersection Sizes.. Ars Combinatoria. 114. 185–191.

12.

Brandstädt, Andreas, et al.. (2014). Clique cycle-transversals in distance-hereditary graphs. Discrete Applied Mathematics. 210. 38–44.

13.

Protti, Fábio, et al.. (2013). Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks.. Ars Combinatoria. 112. 193–204. 2 indexed citations

14.

Souza, Uéverton S., et al.. (2012). COMPLEXIDADE PARAMETRIZADA PARA PROBLEMAS EM GRAFOS E/OU. 4(2). 160–174. 4 indexed citations

15.

Protti, Fábio, et al.. (2012). Exact and approximation algorithms for error-detecting even codes. Theoretical Computer Science. 440-441. 60–72. 2 indexed citations

16.

Dourado, Mitre C., et al.. (2012). Design of connection networks with bounded number of non-terminal vertices. Matemática Contemporânea. 42(5). 3 indexed citations

17.

Dourado, Mitre C., Van Bang Lê, Fábio Protti, Dieter Rautenbach, & Jayme L. Szwarcfiter. (2012). Mixed unit interval graphs. Discrete Mathematics. 312(22). 3357–3363. 6 indexed citations

18.

Dourado, Mitre C., Fábio Protti, Dieter Rautenbach, & Jayme L. Szwarcfiter. (2009). Some remarks on the geodetic number of a graph. Discrete Mathematics. 310(4). 832–837. 36 indexed citations

19.

Dourado, Mitre C., John Gimbel, Jan Kratochvı́l, Fábio Protti, & Jayme L. Szwarcfiter. (2008). On the computation of the hull number of a graph. Discrete Mathematics. 309(18). 5668–5674. 55 indexed citations

20.

Feder, Tomás, et al.. (2005). List matrix partitions of chordal graphs. Theoretical Computer Science. 349(1). 52–66. 28 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