D. Fon-Der-Flaass

573 total citations
25 papers, 293 citations indexed

About

D. Fon-Der-Flaass is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, D. Fon-Der-Flaass has authored 25 papers receiving a total of 293 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Electrical and Electronic Engineering, 11 papers in Discrete Mathematics and Combinatorics and 10 papers in Artificial Intelligence. Recurrent topics in D. Fon-Der-Flaass's work include graph theory and CDMA systems (14 papers), Coding theory and cryptography (10 papers) and Finite Group Theory Research (6 papers). D. Fon-Der-Flaass is often cited by papers focused on graph theory and CDMA systems (14 papers), Coding theory and cryptography (10 papers) and Finite Group Theory Research (6 papers). D. Fon-Der-Flaass collaborates with scholars based in Russia, United Kingdom and Netherlands. D. Fon-Der-Flaass's co-authors include Peter J‎. Cameron, Maria Axenovich, Edwin van Dam, Alexandr Kostochka, S. V. Avgustinovich, O. V. Borodin, Éric Sopena, André Raspaud, D. de Caen and Zs. Tuza and has published in prestigious journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B and Journal of Combinatorial Theory Series A.

In The Last Decade

D. Fon-Der-Flaass

24 papers receiving 268 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
D. Fon-Der-Flaass Russia 11 168 127 122 112 90 25 293
Leonard H. Soicher United Kingdom 9 168 1.0× 122 1.0× 79 0.6× 125 1.1× 111 1.2× 31 284
L. Pyber Hungary 13 366 2.2× 147 1.2× 267 2.2× 100 0.9× 145 1.6× 27 450
Thomas A. Dowling United States 9 162 1.0× 91 0.7× 156 1.3× 42 0.4× 91 1.0× 19 332
Michael I. Hartley Malaysia 10 158 0.9× 79 0.6× 54 0.4× 81 0.7× 92 1.0× 29 255
Charles Vanden Eynden United States 11 98 0.6× 175 1.4× 137 1.1× 113 1.0× 52 0.6× 55 305
Glenn Hurlbert United States 11 161 1.0× 87 0.7× 233 1.9× 78 0.7× 98 1.1× 45 322
Madhu Raka India 10 81 0.5× 122 1.0× 104 0.9× 223 2.0× 29 0.3× 39 284
Johan P. Hansen Denmark 7 52 0.3× 46 0.4× 81 0.7× 141 1.3× 121 1.3× 18 251
Karen Meagher Canada 13 270 1.6× 160 1.3× 192 1.6× 76 0.7× 131 1.5× 40 453
Levon H. Khachatrian Germany 10 372 2.2× 185 1.5× 303 2.5× 100 0.9× 154 1.7× 22 523

Countries citing papers authored by D. Fon-Der-Flaass

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Fon-Der-Flaass, D., et al.. (2007). On periodicity and low complexity of infinite permutations. European Journal of Combinatorics. 28(8). 2106–2114. 14 indexed citations
2.
Fon-Der-Flaass, D.. (2007). Perfect 2-colorings of a hypercube. Siberian Mathematical Journal. 48(4). 740–745. 33 indexed citations
3.
Caen, D. de & D. Fon-Der-Flaass. (2005). Distance Regular Covers of Complete Graphs from Latin Squares. Designs Codes and Cryptography. 34(2-3). 149–153. 2 indexed citations
4.
Axenovich, Maria & D. Fon-Der-Flaass. (2004). On Rainbow Arithmetic Progressions. The Electronic Journal of Combinatorics. 11(1). 20 indexed citations
5.
Dam, Edwin van & D. Fon-Der-Flaass. (2003). Codes, graphs, and schemes from nonlinear functions. European Journal of Combinatorics. 24(1). 85–98. 20 indexed citations
6.
Borodin, O. V., D. Fon-Der-Flaass, Alexandr Kostochka, André Raspaud, & Éric Sopena. (2001). On Deeply Critical Oriented Graphs. Journal of Combinatorial Theory Series B. 81(1). 150–155. 9 indexed citations
7.
Avgustinovich, S. V. & D. Fon-Der-Flaass. (2000). Cartesian Products of Graphs and Metric Spaces. European Journal of Combinatorics. 21(7). 847–851. 5 indexed citations
8.
Dam, Edwin van & D. Fon-Der-Flaass. (2000). Codes, Graphs and Schemes from Nonlinear Functions. Research portal (Tilburg University). 790. 2 indexed citations
9.
Fon-Der-Flaass, D.. (1997). Arrays of distinct representatives — a very simple NP-complete problem. Discrete Mathematics. 171(1-3). 295–298. 9 indexed citations
10.
Fon-Der-Flaass, D.. (1996). A Combinatorial Construction For Twin Trees. European Journal of Combinatorics. 17(2-3). 177–189. 2 indexed citations
11.
Fon-Der-Flaass, D.. (1996). A Note on Greedy Codes. Journal of Combinatorial Theory Series A. 76(1). 156–159. 5 indexed citations
12.
Cameron, Peter J‎. & D. Fon-Der-Flaass. (1995). Bases for permutation groups and matroids. European Journal of Combinatorics. 16(6). 537–544. 14 indexed citations
13.
Axenovich, Maria, D. Fon-Der-Flaass, & Alexandr Kostochka. (1995). On set systems without weak 3-Δ-subsystems. Discrete Mathematics. 138(1-3). 57–62. 5 indexed citations
14.
Cameron, Peter J‎. & D. Fon-Der-Flaass. (1995). Orbits of antichains revisited. European Journal of Combinatorics. 16(6). 545–554. 37 indexed citations
15.
Fon-Der-Flaass, D.. (1993). There Exists no Distance-regular Graph with Intersection Array (5,4,3; 1,1,2). European Journal of Combinatorics. 14(5). 409–412. 5 indexed citations
16.
Fon-Der-Flaass, D.. (1993). Orbits of Antichains in Ranked Posets. European Journal of Combinatorics. 14(1). 17–22. 22 indexed citations
17.
Fon-Der-Flaass, D. & Alexandr Kostochka. (1993). Covering boxes by points. Discrete Mathematics. 120(1-3). 269–275. 13 indexed citations
18.
Fon-Der-Flaass, D. & Ivan Rival. (1993). COLLECTING INFORMATION IN GRADED ORDERED SETS. Parallel Processing Letters. 3(3). 253–260. 1 indexed citations
19.
Erdös, P., D. Fon-Der-Flaass, Alexandr Kostochka, & Zs. Tuza. (1992). Small transversals in uniform hypergraphs. Siberian Advances in Mathematics. 2(1). 82–88. 5 indexed citations
20.
Fon-Der-Flaass, D.. (1988). Method for construction of (3, 4)-graphs. Mathematical Notes. 44(4). 781–783. 11 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

Rankless by CCL
2026