Mitre C. Dourado

1.2k total citations
80 papers, 614 citations indexed

About

Mitre C. Dourado is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Mitre C. Dourado has authored 80 papers receiving a total of 614 indexed citations (citations by other indexed papers that have themselves been cited), including 70 papers in Computational Theory and Mathematics, 23 papers in Discrete Mathematics and Combinatorics and 14 papers in Geometry and Topology. Recurrent topics in Mitre C. Dourado's work include Advanced Graph Theory Research (64 papers), Graph Labeling and Dimension Problems (32 papers) and Complexity and Algorithms in Graphs (28 papers). Mitre C. Dourado is often cited by papers focused on Advanced Graph Theory Research (64 papers), Graph Labeling and Dimension Problems (32 papers) and Complexity and Algorithms in Graphs (28 papers). Mitre C. Dourado collaborates with scholars based in Brazil, Germany and Argentina. Mitre C. Dourado's co-authors include Jayme L. Szwarcfiter, Fábio Protti, Dieter Rautenbach, Lúcia Draque Penso, Rudini Sampaio, Jan Kratochvı́l, Simone Dantas, John Gimbel, Rommel Barbosa and Vinícius F. dos Santos and has published in prestigious journals such as SHILAP Revista de lepidopterología, Applied Mathematics and Computation and Annals of Operations Research.

In The Last Decade

Mitre C. Dourado

69 papers receiving 578 citations

Peers

Mitre C. Dourado

CTM

DMC

GT

CNC

EEE

V. Neumann‐Lara Mexico

Thomas Andreae Germany

Richard A. Duke United States

S. Poljak Czechia

Frédéric Maffray France

Petr Hliněný Czechia

Martin Farber Canada

Stephan Kreutzer Germany

Jenő Lehel Hungary

Penny Haxell Canada

V. Neumann‐Lara Mexico

Mitre C. Dourado

562 ×1.0

CTM

311 ×1.6

DMC

291 ×2.0

GT

45 ×0.6

CNC

91 ×1.8

EEE

Citations per year, relative to Mitre C. Dourado Mitre C. Dourado (= 1×) peers V. Neumann‐Lara

Countries citing papers authored by Mitre C. Dourado

Since Specialization

Citations

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

Fields of papers citing papers by Mitre C. Dourado

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Mitre C. Dourado

This figure shows the co-authorship network connecting the top 25 collaborators of Mitre C. Dourado. A scholar is included among the top collaborators of Mitre C. Dourado 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 Mitre C. Dourado. Mitre C. Dourado 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

1.

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

2.

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

3.

Dourado, Mitre C., et al.. (2021). On the Δ-interval and the Δ-convexity numbers of graphs and graph products. Discrete Applied Mathematics. 319. 487–498.

4.

Dourado, Mitre C., et al.. (2021). Computational and structural aspects of the geodetic and the hull numbers of shadow graphs. Discrete Applied Mathematics. 307. 50–61. 1 indexed citations

5.

Changat, Manoj, et al.. (2019). On the Carathéodory and exchange numbers of geodetic convexity in graphs. Theoretical Computer Science. 804. 46–57.

6.

Dourado, Mitre C., Lúcia Draque Penso, & Dieter Rautenbach. (2017). Geodetic convexity parameters for (q,q−4)-graphs. Discrete Applied Mathematics. 223. 64–71. 2 indexed citations

7.

Dourado, Mitre C., et al.. (2017). Inapproximability results and bounds for the Helly and Radon numbers of a graph. Discrete Applied Mathematics. 232. 134–141. 2 indexed citations

8.

Dourado, Mitre C. & Rudini Sampaio. (2016). Complexity aspects of the triangle path convexity. Discrete Applied Mathematics. 206. 39–47. 10 indexed citations

9.

Dourado, Mitre C.. (2016). Computing role assignments of split graphs. Theoretical Computer Science. 635. 74–84. 9 indexed citations

10.

Dourado, Mitre C., et al.. (2015). Inapproximability results for graph convexity parameters. Theoretical Computer Science. 600. 49–58. 8 indexed citations

11.

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

12.

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

13.

Dourado, Mitre C., et al.. (2014). The Carathéodory number of theP3convexity of chordal graphs. Discrete Applied Mathematics. 172. 104–108. 7 indexed citations

14.

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

15.

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

16.

Dantas, Simone, et al.. (2011). Partitioning a graph into convex sets. Discrete Mathematics. 311(17). 1968–1977. 11 indexed citations

17.

Barbosa, Rommel, et al.. (2011). The colorful Helly theorem and general hypergraphs. European Journal of Combinatorics. 33(5). 743–749. 1 indexed citations

18.

Dourado, Mitre C., et al.. (2011). Irreversible conversion of graphs. Theoretical Computer Science. 412(29). 3693–3700. 67 indexed citations

19.

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

20.

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

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