Ilia Ponomarenko

According to our database, Ilia Ponomarenko authored at least 42 papers between 1994 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A Linear Programming Bound for Sum-Rank Metric Codes.

Aida Abiad, Alexander L. Gavrilyuk, Antonina P. Khramova, Ilia Ponomarenko

IEEE Trans. Inf. Theory, January, 2025

2024

On computing the closures of solvable permutation groups.

Ilia Ponomarenko, Andrey Vasil'ev

Int. J. Algebra Comput., February, 2024

On the Weisfeiler-Leman Dimension of Permutation Graphs.

Jin Guo, Alexander L. Gavrilyuk, Ilia Ponomarenko

SIAM J. Discret. Math., 2024

2023

The Weisfeiler-Leman Dimension of Distance-Hereditary Graphs.

Alexander L. Gavrilyuk, Roman Nedela, Ilia Ponomarenko

Graphs Comb., August, 2023

2022

Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable.

Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov

CoRR, 2022

On a Huge Family of Non-Schurian Schur Rings.

Akihide Hanaki, Takuto Hirai, Ilia Ponomarenko

Electron. J. Comb., 2022

Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract).

Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021

The Weisfeiler-Leman algorithm and recognition of graph properties.

Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky

Theor. Comput. Sci., 2021

The Weisfeiler-Leman Dimension of Chordal Bipartite Graphs Without Bipartite Claw.

Ilia Ponomarenko, Grigory Ryabov

Graphs Comb., 2021

Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable.

Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman

CoRR, 2021

Tensor products of coherent configurations.

Gang Chen, Ilia Ponomarenko

CoRR, 2021

A characterization of exceptional pseudocyclic association schemes by multidimensional intersection numbers.

Gang Chen, Jiawei He, Ilia Ponomarenko, Andrey Vasil'ev

Ars Math. Contemp., 2021

2020

Testing isomorphism of circulant objects in polynomial time.

Mikhail E. Muzychuk, Ilia Ponomarenko

J. Comb. Theory A, 2020

Two-closures of supersolvable permutation groups in polynomial time.

Ilia Ponomarenko, Andrey Vasil'ev

Comput. Complex., 2020

2019

The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3.

Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer

J. ACM, 2019

Two-closure of supersolvable permutation group in polynomial time.

Ilia Ponomarenko, Andrey Vasil'ev

CoRR, 2019

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm.

Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2017

Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time.

Ilia Ponomarenko, Andrey Vasil'ev

CoRR, 2017

Recognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time.

Roman Nedela, Ilia Ponomarenko

CoRR, 2017

2014

Tensor Rank: Matching Polynomials and Schur Rings.

Dima Grigoriev, Mikhail E. Muzychuk, Ilia N. Ponomarenko

Found. Comput. Math., 2014

2012

On pseudocyclic association schemes.

Mikhail E. Muzychuk, Ilia N. Ponomarenko

Ars Math. Contemp., 2012

2010

Schur rings over a Galois ring of odd characteristic.

Sergei Evdokimov, Ilia Ponomarenko

J. Comb. Theory A, 2010

2009

The Basis Digraphs of <i>p</i>-schemes.

Amir Rahnamai Barghi, Ilia Ponomarenko

Graphs Comb., 2009

Preface.

Ilia Ponomarenko, Paul-Hermann Zieschang

Eur. J. Comb., 2009

Schur rings.

Mikhail E. Muzychuk, Ilia N. Ponomarenko

Eur. J. Comb., 2009

Permutation group approach to association schemes.

Sergei Evdokimov, Ilia Ponomarenko

Eur. J. Comb., 2009

Non-Isomorphic Graphs with Cospectral Symmetric Powers.

Amir Rahnamai Barghi, Ilia Ponomarenko

Electron. J. Comb., 2009

2006

Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits.

Dima Grigoriev, Ilia N. Ponomarenko

Appl. Algebra Eng. Commun. Comput., 2006

2005

Circulant graphs: efficient recognizing and isomorphism testing: (extended abstract).

Sergei Evdokimov, Ilia N. Ponomarenko

Electron. Notes Discret. Math., 2005

Constructions in public-key cryptography over matrix groups

Dimitri Grigoriev, Ilia N. Ponomarenko

CoRR, 2005

2003

Homomorphic public-key cryptosystems over groups and rings

Dima Grigoriev, Ilia N. Ponomarenko

CoRR, 2003

2002

On non-abelian homomorphic public-key cryptosystems

Dima Grigoriev, Ilia N. Ponomarenko

CoRR, 2002

2001

Two-closure of odd permutation group in polynomial time.

Sergei Evdokimov, Ilia N. Ponomarenko

Discret. Math., 2001

2000

Forestal algebras and algebraic forests (on a new class of weakly compact graphs).

Sergei Evdokimov, Ilia N. Ponomarenko, Gottfried Tinhofer

Discret. Math., 2000

Separability Number and Schurity Number of Coherent Configurations.

Sergei Evdokimov, Ilia N. Ponomarenko

Electron. J. Comb., 2000

1999

Compact cellular algebras and permutation groups.

Sergei Evdokimov, Marek Karpinski, Ilia N. Ponomarenko

Discret. Math., 1999

On Highly Closed Cellular Algebras and Highly Closed Isomorphisms.

Sergei Evdokimov, Ilia N. Ponomarenko

Electron. J. Comb., 1999

Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks.

Sergei Evdokimov, Ilia N. Ponomarenko

Comb., 1999

1996

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs.

Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer

J. Algorithms, 1996

1994

Graph Algebras and the Graph Isomorphism Problem.

Ilia N. Ponomarenko

Appl. Algebra Eng. Commun. Comput., 1994

Graph Isomorphism Problem and 2-Closed Permutation Groups.

Ilia N. Ponomarenko

Appl. Algebra Eng. Commun. Comput., 1994

Direct Path Graph Isomorphism (Extended Abstract).

Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994