Arist Kojevnikov
-
- Formal Methods in Verification 4
- Polynomial and algebraic computation 2
- semigroups and automata theory 2
-
- Constraint Satisfaction and Optimization 2
-
- Coding theory and cryptography 2
- Logic, programming, and type systems 2
-
- Computational Geometry and Mesh Generation 2
-
- Geometric and Algebraic Topology 2
- Co-authors
- Edward HirschAlexander S. KulikovGrigory YaroslavtsevG. E. MintsSergey NikolenkoD. Grigoriev
- Cited by
- Computational Theory and MathematicsComputer Networks and CommunicationsArtificial Intelligence
- Journals
- Information Processing Letters (1 paper)Annals of Pure and Applied Logic (1 paper)Annals of Mathematics and Artificial Intelligence (2 papers)
- Partner nations
- RussiaUnited StatesFrance
In The Last Decade
Arist Kojevnikov
9 papers receiving 108 citations
Peers
Comparison fields: 5 of 15
- Computational Theory and Mathematics 89
- Computer Networks and Communications 67
- Artificial Intelligence 68
- Software 7
- Computer Graphics and Computer-Aided Design 5
Countries citing papers authored by Arist Kojevnikov
This map shows the geographic impact of Arist Kojevnikov'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 Arist Kojevnikov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arist Kojevnikov more than expected).
Fields of papers citing papers by Arist Kojevnikov
This network shows the impact of papers produced by Arist Kojevnikov. 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 Arist Kojevnikov. The network helps show where Arist Kojevnikov may publish in the future.
Co-authorship network
The 6 scholars most cited alongside Arist Kojevnikov, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2010 | 14 | |
| 2 | 2009 | 0 | |
| 3 | 2007 | 5 | |
| 4 | 2006 | 18 | |
| 5 | 2006 | 2 | |
| 6 | 2006 | 7 | |
| 7 | 2006 | 9 | |
| 8 | 2004 | 17 | |
| 9 | 2004 | 40 | |
| 10 | Several notes on the power of Gomory-Chvatal cuts | 2003 | 4 |
About Arist Kojevnikov
Arist Kojevnikov is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, having authored 10 papers that have together received 116 indexed citations. Recurring topics across this work include Formal Methods in Verification (4 papers), Polynomial and algebraic computation (2 papers), semigroups and automata theory (2 papers), Computational Geometry and Mesh Generation (2 papers), Coding theory and cryptography (2 papers), Constraint Satisfaction and Optimization (2 papers), Logic, programming, and type systems (2 papers) and Geometric and Algebraic Topology (2 papers). The work is most often cited by research in Computational Theory and Mathematics (89 citations), Computer Networks and Communications (67 citations) and Artificial Intelligence (68 citations). Arist Kojevnikov has collaborated with scholars based in Russia, United States and France. Frequent co-authors include Edward Hirsch, Alexander S. Kulikov, Grigory Yaroslavtsev, G. E. Mints, Sergey Nikolenko and D. Grigoriev. Their work appears in journals such as Information Processing Letters, Annals of Pure and Applied Logic and Annals of Mathematics and Artificial Intelligence.
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.