Direct Path Graph Isomorphism (Extended Abstract). - Luitpold Babel; Ilia N. Ponomarenko; Gottfried Tinhofer (WG, 1994)

Graph Isomorphism Problem and 2-Closed Permutation Groups. - Ilia N. Ponomarenko (Appl. Algebra Eng. Commun. Comput., 1994)

Graph Algebras and the Graph Isomorphism Problem. - Ilia N. Ponomarenko (Appl. Algebra Eng. Commun. Comput., 1994)

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. - Luitpold Babel; Ilia N. Ponomarenko; Gottfried Tinhofer (J. Algorithms, 1996)

Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks. - Sergei Evdokimov 001; Ilia N. Ponomarenko (Comb., 1999)

On Highly Closed Cellular Algebras and Highly Closed Isomorphisms. - Sergei Evdokimov 001; Ilia N. Ponomarenko (Electron. J. Comb., 1999)

Compact cellular algebras and permutation groups. - Sergei Evdokimov 001; Marek Karpinski; Ilia N. Ponomarenko (Discret. Math., 1999)

Separability Number and Schurity Number of Coherent Configurations. - Sergei Evdokimov 001; Ilia N. Ponomarenko (Electron. J. Comb., 2000)

Forestal algebras and algebraic forests (on a new class of weakly compact graphs). - Sergei Evdokimov 001; Ilia N. Ponomarenko; Gottfried Tinhofer (Discret. Math., 2000)

Two-closure of odd permutation group in polynomial time. - Sergei Evdokimov 001; Ilia N. Ponomarenko (Discret. Math., 2001)

On non-abelian homomorphic public-key cryptosystems - Dima Grigoriev; Ilia N. Ponomarenko (CoRR, 2002)

Homomorphic public-key cryptosystems over groups and rings - Dima Grigoriev; Ilia N. Ponomarenko (CoRR, 2003)

Constructions in public-key cryptography over matrix groups - Dimitri Grigoriev; Ilia N. Ponomarenko (CoRR, 2005)

Circulant graphs: efficient recognizing and isomorphism testing: (extended abstract). - Sergei Evdokimov 001; Ilia N. Ponomarenko (Electron. Notes Discret. Math., 2005)

Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits. - Dima Grigoriev; Ilia N. Ponomarenko (Appl. Algebra Eng. Commun. Comput., 2006)

Non-Isomorphic Graphs with Cospectral Symmetric Powers. - Amir Rahnamai Barghi; Ilia Ponomarenko (Electron. J. Comb., 2009)

Permutation group approach to association schemes. - Sergei Evdokimov 001; Ilia Ponomarenko (Eur. J. Comb., 2009)

Schur rings. - Mikhail E. Muzychuk; Ilia N. Ponomarenko (Eur. J. Comb., 2009)

Preface. - Ilia Ponomarenko; Paul-Hermann Zieschang (Eur. J. Comb., 2009)

The Basis Digraphs of p-schemes. - Amir Rahnamai Barghi; Ilia Ponomarenko (Graphs Comb., 2009)

Schur rings over a Galois ring of odd characteristic. - Sergei Evdokimov 001; Ilia Ponomarenko (J. Comb. Theory A, 2010)

On pseudocyclic association schemes. - Mikhail E. Muzychuk; Ilia N. Ponomarenko (Ars Math. Contemp., 2012)

Tensor Rank: Matching Polynomials and Schur Rings. - Dima Grigoriev; Mikhail E. Muzychuk; Ilia N. Ponomarenko (Found. Comput. Math., 2014)

Recognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time. - Roman Nedela; Ilia Ponomarenko (CoRR, 2017)

Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time. - Ilia Ponomarenko; Andrey Vasil'ev (CoRR, 2017)

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. - Moritz Lichter; Ilia Ponomarenko; Pascal Schweitzer (LICS, 2019)

Two-closure of supersolvable permutation group in polynomial time. - Ilia Ponomarenko; Andrey Vasil'ev (CoRR, 2019)

The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3. - Sandra Kiefer; Ilia Ponomarenko; Pascal Schweitzer (J. ACM, 2019)

Two-closures of supersolvable permutation groups in polynomial time. - Ilia Ponomarenko; Andrey Vasil'ev (Comput. Complex., 2020)

Testing isomorphism of circulant objects in polynomial time. - Mikhail E. Muzychuk; Ilia Ponomarenko (J. Comb. Theory A, 2020)

A characterization of exceptional pseudocyclic association schemes by multidimensional intersection numbers. - Gang Chen; Jiawei He; Ilia Ponomarenko; Andrey Vasil'ev (Ars Math. Contemp., 2021)

Tensor products of coherent configurations. - Gang Chen; Ilia Ponomarenko (CoRR, 2021)

Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. - Vikraman Arvind; Roman Nedela; Ilia Ponomarenko; Peter Zeman 001 (CoRR, 2021)

The Weisfeiler-Leman Dimension of Chordal Bipartite Graphs Without Bipartite Claw. - Ilia Ponomarenko; Grigory Ryabov (Graphs Comb., 2021)

The Weisfeiler-Leman algorithm and recognition of graph properties. - Frank Fuhlbrück; Johannes Köbler; Ilia Ponomarenko; Oleg Verbitsky 001 (Theor. Comput. Sci., 2021)

Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). - Vikraman Arvind; Roman Nedela; Ilia Ponomarenko; Peter Zeman 001 (WG, 2022)

On a Huge Family of Non-Schurian Schur Rings. - Akihide Hanaki; Takuto Hirai; Ilia Ponomarenko (Electron. J. Comb., 2022)

The Weisfeiler-Leman Dimension of Distance-Hereditary Graphs. - Alexander L. Gavrilyuk; Roman Nedela; Ilia Ponomarenko (Graphs Comb., 2023)

On the Weisfeiler-Leman Dimension of Permutation Graphs. - Jin Guo; Alexander L. Gavrilyuk; Ilia Ponomarenko (SIAM J. Discret. Math., 2024)

On computing the closures of solvable permutation groups. - Ilia Ponomarenko; Andrey Vasil'ev (Int. J. Algebra Comput., 2024)

Isomorphism testing of k-spanning tournaments is fixed parameter tractable. - Vikraman Arvind; Ilia Ponomarenko; Grigory Ryabov (Art Discret. Appl. Math., 2025)

Cartesian products of graphs and their coherent configurations. - Jinzhuan Cai; Jin Guo; Alexander L. Gavrilyuk; Ilia Ponomarenko (Discret. Math., 2025)

On the Weisfeiler algorithm of depth-1 stabilization. - Gang Chen; Qing Ren; Ilia Ponomarenko (Theor. Comput. Sci., 2025)

A Linear Programming Bound for Sum-Rank Metric Codes. - Aida Abiad; Alexander L. Gavrilyuk; Antonina P. Khramova; Ilia Ponomarenko (IEEE Trans. Inf. Theory, 2025)

A Large Family of Strongly Regular Graphs with Small Weisfeiler-Leman Dimension. - Jinzhuan Cai; Jin Guo; Alexander L. Gavrilyuk; Ilia Ponomarenko (Comb., 2025)