Ana Silva

461 total citations
50 papers, 181 citations indexed

About

Ana Silva is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Ana Silva has authored 50 papers receiving a total of 181 indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Computational Theory and Mathematics, 20 papers in Discrete Mathematics and Combinatorics and 9 papers in Computer Networks and Communications. Recurrent topics in Ana Silva's work include Advanced Graph Theory Research (37 papers), Graph Labeling and Dimension Problems (26 papers) and Limits and Structures in Graph Theory (20 papers). Ana Silva is often cited by papers focused on Advanced Graph Theory Research (37 papers), Graph Labeling and Dimension Problems (26 papers) and Limits and Structures in Graph Theory (20 papers). Ana Silva collaborates with scholars based in Brazil, France and Italy. Ana Silva's co-authors include Víctor Campos, Frédéric Maffray, Cláudia Linhares Sales, Rudini Sampaio, Andrea Marino, Manoel Campêlo, Mirko Perkusich, Frédéric Havet, Hyggo Almeida and Jayme L. Szwarcfiter and has published in prestigious journals such as Annals of Operations Research, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Ana Silva

39 papers receiving 178 citations

Peers

Ana Silva
Uéverton S. Souza Brazil
Rajiv Raman United States
Ioannis Milis Greece
N. V. R. Mahadev United States
Pim van ’t Hof Norway
Tınaz Ekim Türkiye
Pierre Kelsen Luxembourg
Thomas Hune Denmark
Madhavan Mukund India
Liang Feng Zhang China
Uéverton S. Souza Brazil
Ana Silva
Citations per year, relative to Ana Silva Ana Silva (= 1×) peers Uéverton S. Souza

Countries citing papers authored by Ana Silva

Since Specialization
Citations

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

Fields of papers citing papers by Ana Silva

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ana Silva

This figure shows the co-authorship network connecting the top 25 collaborators of Ana Silva. A scholar is included among the top collaborators of Ana Silva 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 Ana Silva. Ana Silva is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
2.
Silva, Ana, et al.. (2025). Conhecimento de estudantes de saúde acerca da assistência à população LGBTQIA+. Revista Eletrônica Acervo Saúde. 25. e17031–e17031.
3.
Silva, Ana, et al.. (2024). Acyclic coloring of products of digraphs. Discrete Applied Mathematics. 349. 59–69.
4.
Marino, Andrea, et al.. (2024). On computing large temporal (unilateral) connected components. Journal of Computer and System Sciences. 144. 103548–103548.
5.
Marino, Andrea, et al.. (2024). On computing optimal temporal branchings and spanning subgraphs. Journal of Computer and System Sciences. 148. 103596–103596.
6.
Figueiredo, Celina M.H. de, et al.. (2022). Revising Johnson's Table for the 21st century. Florence Research (University of Florence). 5 indexed citations
7.
Santos, Vinícius F. dos, et al.. (2021). On the proper orientation number of chordal graphs. Florence Research (University of Florence). 2 indexed citations
8.
Campos, Víctor, et al.. (2020). On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. Florence Research (University of Florence). 1 indexed citations
9.
Campos, Víctor, et al.. (2018). Dual Parameterization of Weighted Coloring. arXiv (Cornell University). 1 indexed citations
10.
Havet, Frédéric, et al.. (2016). Proper orientation of cacti. Theoretical Computer Science. 639. 14–25. 8 indexed citations
11.
Campos, Víctor, et al.. (2015). Graphs of girth at least 7 have high b-chromatic number. European Journal of Combinatorics. 48. 154–164. 9 indexed citations
12.
Campos, Víctor, et al.. (2015). The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. European Journal of Combinatorics. 48. 88–99. 8 indexed citations
13.
Campos, Víctor, et al.. (2015). The b-chromatic index of graphs. Discrete Mathematics. 338(11). 2072–2079. 9 indexed citations
14.
Campos, Víctor, Rudini Sampaio, Ana Silva, & Jayme L. Szwarcfiter. (2014). Graphs with fewP4’s under the convexity of paths of order three. Discrete Applied Mathematics. 192. 28–39. 10 indexed citations
15.
Campos, Víctor, Sulamita Klein, Rudini Sampaio, & Ana Silva. (2013). Fixed-parameter algorithms for the cocoloring problem. Discrete Applied Mathematics. 167. 52–60. 2 indexed citations
16.
Campos, Víctor, Rudini Sampaio, Ana Silva, & Jayme L. Szwarcfiter. (2012). Graphs with Few P4's Under the Convexity of Paths of Order Three.. 60–63. 2 indexed citations
17.
Maffray, Frédéric & Ana Silva. (2012). b-colouring outerplanar graphs with large girth. Discrete Mathematics. 312(10). 1796–1803. 9 indexed citations
18.
Maffray, Frédéric & Ana Silva. (2011). b-colouring the Cartesian product of trees and some other graphs. Discrete Applied Mathematics. 161(4-5). 650–669. 6 indexed citations
19.
Dantas, Simone, Frédéric Maffray, & Ana Silva. (2010). 2K2-partition of some classes of graphs. Discrete Applied Mathematics. 160(18). 2662–2668. 4 indexed citations
20.
Silva, Ana, et al.. (2009). A bound on the treewidth of planar even-hole-free graphs. Discrete Applied Mathematics. 158(12). 1229–1239. 6 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

Breakdown of academic impact, for papers by Uéverton S. Souza Breakdown of academic impact, for papers by Rajiv Raman Breakdown of academic impact, for papers by Ioannis Milis Breakdown of academic impact, for papers by N. V. R. Mahadev Breakdown of academic impact, for papers by Pim van ’t Hof Breakdown of academic impact, for papers by Tınaz Ekim Breakdown of academic impact, for papers by Pierre Kelsen Breakdown of academic impact, for papers by Thomas Hune Breakdown of academic impact, for papers by Madhavan Mukund Breakdown of academic impact, for papers by Liang Feng Zhang
Rankless by CCL
2026