Felix Lazebnik

1.4k total citations
55 papers, 835 citations indexed

About

Felix Lazebnik is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology and Computational Theory and Mathematics. According to data from OpenAlex, Felix Lazebnik has authored 55 papers receiving a total of 835 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Discrete Mathematics and Combinatorics, 21 papers in Geometry and Topology and 20 papers in Computational Theory and Mathematics. Recurrent topics in Felix Lazebnik's work include Limits and Structures in Graph Theory (28 papers), Finite Group Theory Research (25 papers) and graph theory and CDMA systems (18 papers). Felix Lazebnik is often cited by papers focused on Limits and Structures in Graph Theory (28 papers), Finite Group Theory Research (25 papers) and graph theory and CDMA systems (18 papers). Felix Lazebnik collaborates with scholars based in United States, Ukraine and Belgium. Felix Lazebnik's co-authors include V. A. Ustimenko, Andrew J. Woldar, Jacques Verstraëte, Dhruv Mubayi, Ping Wang, Zoltán Füredi, Sebastian M. Cioabă, Ákos Seress, Robert S. Coulter and Andrew Thomason and has published in prestigious journals such as Mathematics of Computation, American Mathematical Monthly and Bulletin of the American Mathematical Society.

In The Last Decade

Felix Lazebnik

49 papers receiving 773 citations

Peers

Felix Lazebnik
Ian M. Wanless Australia
Tamás Szőnyi Hungary
Oriol Serra Spain
Hanno Lefmann Germany
Jin Ho Kwak South Korea
A. Blokhuis Netherlands
A. J. W. Hilton United Kingdom
Hikoe Enomoto Japan
Yair Caro Israel
Geoff Whittle New Zealand
Ian M. Wanless Australia
Felix Lazebnik
Citations per year, relative to Felix Lazebnik Felix Lazebnik (= 1×) peers Ian M. Wanless

Countries citing papers authored by Felix Lazebnik

Since Specialization
Citations

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

Fields of papers citing papers by Felix Lazebnik

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Felix Lazebnik

This figure shows the co-authorship network connecting the top 25 collaborators of Felix Lazebnik. A scholar is included among the top collaborators of Felix Lazebnik 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 Felix Lazebnik. Felix Lazebnik 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.
Lazebnik, Felix, et al.. (2018). On the uniqueness of some girth eight algebraically defined graphs, Part II. Discrete Applied Mathematics. 254. 161–170. 5 indexed citations
2.
Lazebnik, Felix, et al.. (2017). A Note on the Isomorphism Problem for Monomial Digraphs. Journal of Interconnection Networks. 17(03n04). 1741006–1741006. 2 indexed citations
3.
Lazebnik, Felix, et al.. (2016). On the uniqueness of some girth eight algebraically defined graphs. Discrete Applied Mathematics. 206. 188–194. 6 indexed citations
4.
Cioabă, Sebastian M., et al.. (2014). On the spectrum of Wenger graphs. Journal of Combinatorial Theory Series B. 107. 132–139. 13 indexed citations
5.
Coulter, Robert S. & Felix Lazebnik. (2011). On the classification of planar monomials over fields of square order. Finite Fields and Their Applications. 18(2). 316–336. 10 indexed citations
6.
Lazebnik, Felix, et al.. (2010). Methods for Euclidean Geometry. American Mathematical Society eBooks. 11 indexed citations
7.
Lazebnik, Felix, et al.. (2006). On monomial graphs of girth eight. Finite Fields and Their Applications. 13(4). 828–842. 16 indexed citations
8.
Lazebnik, Felix, et al.. (2005). Isomorphism criterion for monomial graphs. Journal of Graph Theory. 48(4). 322–328. 4 indexed citations
9.
Lazebnik, Felix, et al.. (2003). On the connectivity of certain graphs of high girth. Discrete Mathematics. 277(1-3). 309–319. 6 indexed citations
10.
Lazebnik, Felix & Dhruv Mubayi. (2002). New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs. Advances in Applied Mathematics. 28(3-4). 544–559. 13 indexed citations
11.
Jones, Gareth, Mikhail Klin, & Felix Lazebnik. (2000). Automorphic subsets of the -dimensional cube.. 41(2). 303–323. 1 indexed citations
12.
Lazebnik, Felix & Andrew J. Woldar. (2000). New Lower Bounds on the Multicolor Ramsey Numbers rk(C4). Journal of Combinatorial Theory Series B. 79(2). 172–176. 16 indexed citations
13.
Lazebnik, Felix, V. A. Ustimenko, & Andrew J. Woldar. (1999). Polarities and 2k-cycle-free graphs. Discrete Mathematics. 197-198. 503–513. 11 indexed citations
14.
Lazebnik, Felix, et al.. (1999). 10729. American Mathematical Monthly. 106(4). 362–362.
15.
Lazebnik, Felix, et al.. (1998). An Extremal Characterization of the Incidence Graphs of Projective Planes. Acta Applicandae Mathematicae. 52(1-3). 257–260. 4 indexed citations
16.
Lazebnik, Felix, V. A. Ustimenko, & Andrew J. Woldar. (1997). New upper bounds on the order of cages.. The Electronic Journal of Combinatorics. 4. 31 indexed citations
17.
Lazebnik, Felix, V. A. Ustimenko, & Andrew J. Woldar. (1996). A characterization of the components of the graphs D(k,q). Discrete Mathematics. 157(1-3). 271–283. 34 indexed citations
18.
Füredi, Zoltán, Felix Lazebnik, Ákos Seress, V. A. Ustimenko, & Andrew J. Woldar. (1995). Graphs of Prescribed Girth and Bi-Degree. Journal of Combinatorial Theory Series B. 64(2). 228–239. 25 indexed citations
19.
Lazebnik, Felix & V. A. Ustimenko. (1993). New Examples of Graphs without Small Cycles and of Large Size. European Journal of Combinatorics. 14(5). 445–460. 44 indexed citations
20.
Lazebnik, Felix, et al.. (1991). On the number of irregular assignments on a graph. Discrete Mathematics. 93(2-3). 131–142. 5 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 Ian M. Wanless Breakdown of academic impact, for papers by Tamás Szőnyi Breakdown of academic impact, for papers by Oriol Serra Breakdown of academic impact, for papers by Hanno Lefmann Breakdown of academic impact, for papers by Jin Ho Kwak Breakdown of academic impact, for papers by A. Blokhuis Breakdown of academic impact, for papers by A. J. W. Hilton Breakdown of academic impact, for papers by Hikoe Enomoto Breakdown of academic impact, for papers by Yair Caro Breakdown of academic impact, for papers by Geoff Whittle
Rankless by CCL
2026