Ilia Ponomarenko

38 papers A* 2B 1C 1Journal 33
YearRankTypeTitle / Venue / Authors
2026 J jnl
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable.
Algorithmica
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
2025 J jnl
A Large Family of Strongly Regular Graphs with Small Weisfeiler-Leman Dimension.
Comb.
Jinzhuan Cai, Jin Guo, Alexander L. Gavrilyuk, Ilia Ponomarenko
2025 J jnl
A Linear Programming Bound for Sum-Rank Metric Codes.
IEEE Trans. Inf. Theory
Aida Abiad, Alexander L. Gavrilyuk, Antonina P. Khramova, Ilia Ponomarenko
2025 J jnl
Cartesian products of graphs and their coherent configurations.
Discret. Math.
Jinzhuan Cai, Jin Guo, Alexander L. Gavrilyuk, Ilia Ponomarenko
2025 J jnl
Isomorphism testing of k-spanning tournaments is fixed parameter tractable.
Art Discret. Appl. Math.
Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov
2025 J jnl
On the Weisfeiler algorithm of depth-1 stabilization.
Theor. Comput. Sci.
Gang Chen, Qing Ren, Ilia Ponomarenko
2024 J jnl
On computing the closures of solvable permutation groups.
Int. J. Algebra Comput.
Ilia Ponomarenko, Andrey Vasil'ev
2024 J jnl
On the Weisfeiler-Leman Dimension of Permutation Graphs.
SIAM J. Discret. Math.
Jin Guo, Alexander L. Gavrilyuk, Ilia Ponomarenko
2023 J jnl
On the Weisfeiler-Leman dimension of permutation graphs.
CoRR
Jin Guo, Alexander L. Gavrilyuk, Ilia Ponomarenko
2023 J jnl
The Weisfeiler-Leman Dimension of Distance-Hereditary Graphs.
Graphs Comb.
Alexander L. Gavrilyuk, Roman Nedela, Ilia Ponomarenko
2022 J jnl
Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable.
CoRR
Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov
2022 J jnl
On a Huge Family of Non-Schurian Schur Rings.
Electron. J. Comb.
Akihide Hanaki, Takuto Hirai, Ilia Ponomarenko
2022 B conf
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract).
WG
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
2021 J jnl
A characterization of exceptional pseudocyclic association schemes by multidimensional intersection numbers.
Ars Math. Contemp.
Gang Chen, Jiawei He, Ilia Ponomarenko, Andrey Vasil'ev
2021 J jnl
Tensor products of coherent configurations.
CoRR
Gang Chen, Ilia Ponomarenko
2021 J jnl
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable.
CoRR
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
2021 C conf
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties.
CIAC
Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky
2021 J jnl
The Weisfeiler-Leman Dimension of Chordal Bipartite Graphs Without Bipartite Claw.
Graphs Comb.
Ilia Ponomarenko, Grigory Ryabov
2021 J jnl
The Weisfeiler-Leman algorithm and recognition of graph properties.
Theor. Comput. Sci.
Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky
2020 J jnl
Testing isomorphism of circulant objects in polynomial time.
J. Comb. Theory A
Mikhail E. Muzychuk, Ilia Ponomarenko
2020 J jnl
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties.
CoRR
Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky
2020 J jnl
The Weisfeiler-Leman dimension of distance-hereditary graphs.
CoRR
Alexander L. Gavrilyuk, Roman Nedela, Ilia Ponomarenko
2020 J jnl
Two-closures of supersolvable permutation groups in polynomial time.
Comput. Complex.
Ilia Ponomarenko, Andrey Vasil'ev
2019 J jnl
The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3.
J. ACM
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
2019 J jnl
Two-closure of supersolvable permutation group in polynomial time.
CoRR
Ilia Ponomarenko, Andrey Vasil'ev
2019 A* conf
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm.
LICS
Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
2019 J jnl
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm.
CoRR
Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
2017 J jnl
Recognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time.
CoRR
Roman Nedela, Ilia Ponomarenko
2017 J jnl
Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time.
CoRR
Ilia Ponomarenko, Andrey Vasil'ev
2017 J jnl
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3.
CoRR
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
2017 A* conf
The Weisfeiler-Leman dimension of planar graphs is at most 3.
LICS
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
2010 J jnl
Schur rings over a Galois ring of odd characteristic.
J. Comb. Theory A
Sergei Evdokimov, Ilia Ponomarenko
2009 — book
Algorithmic Algebraic Combinatorics and Gröbner Bases
Mikhail H. Klin, Gareth A. Jones, Aleksandar Jurisic, Mikhail E. Muzychuk, Ilia Ponomarenko
2009 J jnl
Non-Isomorphic Graphs with Cospectral Symmetric Powers.
Electron. J. Comb.
Amir Rahnamai Barghi, Ilia Ponomarenko
2009 J jnl
Permutation group approach to association schemes.
Eur. J. Comb.
Sergei Evdokimov, Ilia Ponomarenko
2009 J jnl
Preface.
Eur. J. Comb.
Ilia Ponomarenko, Paul-Hermann Zieschang
2009 J jnl
The Basis Digraphs of
Graphs Comb.
Amir Rahnamai Barghi, Ilia Ponomarenko
2003 J jnl
Homomorphic public-key cryptosystems and encrypting boolean circuits.
IACR Cryptol. ePrint Arch.
Dima Grigoriev, Ilia Ponomarenko