Ioan Todinca
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 10%
- Artificial Intelligence
- Discrete Mathematics and Combinatorics top 10%
- Molecular Biology
- Co-authors
- Vincent BouchittéDieter KratschFedor V. FominYngve VillangerKarol SuchanHaiko MüllerMathieu LiedloffIván Rapaport
- Topics
- Advanced Graph Theory Research (28 papers)Complexity and Algorithms in Graphs (24 papers)Graph Labeling and Dimension Problems (11 papers)
In The Last Decade
Ioan Todinca
33 papers receiving 347 citations
Peers
Comparison fields: 5 of 33
- Computational Theory and Mathematics 325
- Computer Networks and Communications 153
- Artificial Intelligence 43
- Discrete Mathematics and Combinatorics 36
- Molecular Biology 25
Countries citing papers authored by Ioan Todinca
This map shows the geographic impact of Ioan Todinca'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 Ioan Todinca with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ioan Todinca more than expected).
Fields of papers citing papers by Ioan Todinca
This network shows the impact of papers produced by Ioan Todinca. 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 Ioan Todinca. The network helps show where Ioan Todinca may publish in the future.
Co-authorship network of co-authors of Ioan Todinca
This figure shows the co-authorship network connecting the top 25 collaborators of Ioan Todinca. A scholar is included among the top collaborators of Ioan Todinca 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 Ioan Todinca. Ioan Todinca is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 1 | |
| 6 | 2 | |
| 7 | 0 | |
| 8 | 1 | |
| 9 | 2 | |
| 10 | 14 | |
| 11 | 6 | |
| 12 | 2 | |
| 13 | 33 | |
| 14 | 16 | |
| 15 | 13 | |
| 16 | Characterizing minimal interval completions towards better understanding of profile and pathwidth | 5 |
| 17 | Minimal interval completion through graph exploration | 1 |
| 18 | 25 | |
| 19 | 15 | |
| 20 | 42 |
About Ioan Todinca
Ioan Todinca is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications, having authored 39 papers that have together received 371 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (28 papers), Complexity and Algorithms in Graphs (24 papers) and Graph Labeling and Dimension Problems (11 papers). The work is most often cited by research in Computational Theory and Mathematics (325 citations), Discrete Mathematics and Combinatorics (36 citations) and Computer Networks and Communications (153 citations). Ioan Todinca has collaborated with scholars based in France, Chile and Poland. Frequent co-authors include Vincent Bouchitté, Dieter Kratsch, Fedor V. Fomin, Yngve Villanger, Karol Suchan, Haiko Müller, Mathieu Liedloff, Iván Rapaport, Dimitrios M. Thilikos and Eric Goles. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Lecture notes in computer science.
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.