D. Fon-Der-Flaass
- Discrete Mathematics and Combinatorics top 5%
- Electrical and Electronic Engineering
- Computational Theory and Mathematics top 5%
- Artificial Intelligence top 10%
- Geometry and Topology top 5%
- Co-authors
- Peter J. CameronMaria AxenovichAlexandr KostochkaEdwin van DamS. V. AvgustinovichAndré RaspaudÉric SopenaO. V. Borodin
- Topics
- graph theory and CDMA systems (14 papers)Coding theory and cryptography (10 papers)Finite Group Theory Research (6 papers)
- Journals
- Discrete MathematicsJournal of Combinatorial Theory Series BJournal of Combinatorial Theory Series A
- Partner nations
- RussiaUnited KingdomNetherlands
In The Last Decade
D. Fon-Der-Flaass
24 papers receiving 268 citations
Peers
Comparison fields: 5 of 34
- Discrete Mathematics and Combinatorics 168
- Electrical and Electronic Engineering 127
- Computational Theory and Mathematics 122
- Artificial Intelligence 112
- Geometry and Topology 90
Countries citing papers authored by D. Fon-Der-Flaass
This map shows the geographic impact of D. Fon-Der-Flaass'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 D. Fon-Der-Flaass with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites D. Fon-Der-Flaass more than expected).
Fields of papers citing papers by D. Fon-Der-Flaass
This network shows the impact of papers produced by D. Fon-Der-Flaass. 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 D. Fon-Der-Flaass. The network helps show where D. Fon-Der-Flaass may publish in the future.
Co-authorship network of co-authors of D. Fon-Der-Flaass
This figure shows the co-authorship network connecting the top 25 collaborators of D. Fon-Der-Flaass. A scholar is included among the top collaborators of D. Fon-Der-Flaass 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 D. Fon-Der-Flaass. D. Fon-Der-Flaass is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 14 | |
| 2 | 33 | |
| 3 | 20 | |
| 4 | 20 | |
| 5 | 9 | |
| 6 | Codes, Graphs and Schemes from Nonlinear Functions | 2 |
| 7 | 5 | |
| 8 | 9 | |
| 9 | 2 | |
| 10 | 5 | |
| 11 | 14 | |
| 12 | 5 | |
| 13 | 37 | |
| 14 | 5 | |
| 15 | 22 | |
| 16 | 13 | |
| 17 | 1 | |
| 18 | 4 | |
| 19 | Small transversals in uniform hypergraphs | 5 |
| 20 | 11 |
About D. Fon-Der-Flaass
D. Fon-Der-Flaass is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Computational Theory and Mathematics, having authored 25 papers that have together received 293 indexed citations. Recurring topics across this work include graph theory and CDMA systems (14 papers), Coding theory and cryptography (10 papers) and Finite Group Theory Research (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (168 citations), Geometry and Topology (90 citations) and Algebra and Number Theory (46 citations). D. Fon-Der-Flaass has collaborated with scholars based in Russia, United Kingdom and Netherlands. Frequent co-authors include Peter J. Cameron, Maria Axenovich, Alexandr Kostochka, Edwin van Dam, S. V. Avgustinovich, André Raspaud, Éric Sopena, O. V. Borodin, Ivan Rival and D. de Caen. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B and Journal of Combinatorial Theory Series A.
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.