Остановите войну!
for scientists:
default search action
Ilia Ponomarenko
Person information
- affiliation: Steklov Institute of Mathematics, St. Petersburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j28]Ilia Ponomarenko, Andrey Vasil'ev:
On computing the closures of solvable permutation groups. Int. J. Algebra Comput. 34(1): 137-145 (2024) - 2023
- [j27]Alexander L. Gavrilyuk, Roman Nedela, Ilia Ponomarenko:
The Weisfeiler-Leman Dimension of Distance-Hereditary Graphs. Graphs Comb. 39(4): 84 (2023) - [i17]Jin Guo, Alexander L. Gavrilyuk, Ilia Ponomarenko:
On the Weisfeiler-Leman dimension of permutation graphs. CoRR abs/2305.15861 (2023) - 2022
- [j26]Akihide Hanaki, Takuto Hirai, Ilia Ponomarenko:
On a Huge Family of Non-Schurian Schur Rings. Electron. J. Comb. 29(2) (2022) - [c5]Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman:
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). WG 2022: 29-42 - [i16]Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov:
Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable. CoRR abs/2201.12312 (2022) - 2021
- [j25]Gang Chen, Jiawei He, Ilia Ponomarenko, Andrey Vasil'ev:
A characterization of exceptional pseudocyclic association schemes by multidimensional intersection numbers. Ars Math. Contemp. 21(1): 1 (2021) - [j24]Ilia Ponomarenko, Grigory Ryabov:
The Weisfeiler-Leman Dimension of Chordal Bipartite Graphs Without Bipartite Claw. Graphs Comb. 37(3): 1089-1102 (2021) - [j23]Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky:
The Weisfeiler-Leman algorithm and recognition of graph properties. Theor. Comput. Sci. 895: 96-114 (2021) - [c4]Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky:
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties. CIAC 2021: 245-257 - [i15]Gang Chen, Ilia Ponomarenko:
Tensor products of coherent configurations. CoRR abs/2105.10679 (2021) - [i14]Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman:
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. CoRR abs/2107.10689 (2021) - 2020
- [j22]Ilia Ponomarenko, Andrey Vasil'ev:
Two-closures of supersolvable permutation groups in polynomial time. Comput. Complex. 29(1): 5 (2020) - [j21]Mikhail E. Muzychuk, Ilia Ponomarenko:
Testing isomorphism of circulant objects in polynomial time. J. Comb. Theory A 169 (2020) - [i13]Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky:
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties. CoRR abs/2005.08887 (2020) - [i12]Alexander L. Gavrilyuk, Roman Nedela, Ilia Ponomarenko:
The Weisfeiler-Leman dimension of distance-hereditary graphs. CoRR abs/2005.11766 (2020)
2010 – 2019
- 2019
- [j20]Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer:
The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3. J. ACM 66(6): 44:1-44:31 (2019) - [c3]Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer:
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. LICS 2019: 1-13 - [i11]Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer:
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. CoRR abs/1905.03008 (2019) - [i10]Ilia Ponomarenko, Andrey Vasil'ev:
Two-closure of supersolvable permutation group in polynomial time. CoRR abs/1912.10217 (2019) - 2018
- [i9]Mikhail E. Muzychuk, Ilia N. Ponomarenko:
Testing isomorphism of circulant objects in polynomial time. CoRR abs/1812.06246 (2018) - 2017
- [c2]Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer:
The Weisfeiler-Leman dimension of planar graphs is at most 3. LICS 2017: 1-12 - [i8]Ilia Ponomarenko, Andrey Vasil'ev:
Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time. CoRR abs/1704.00990 (2017) - [i7]Roman Nedela, Ilia Ponomarenko:
Recognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time. CoRR abs/1706.06145 (2017) - [i6]Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer:
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3. CoRR abs/1708.07354 (2017) - 2014
- [j19]Dima Grigoriev, Mikhail E. Muzychuk, Ilia N. Ponomarenko:
Tensor Rank: Matching Polynomials and Schur Rings. Found. Comput. Math. 14(3): 457-481 (2014) - 2012
- [j18]Mikhail E. Muzychuk, Ilia N. Ponomarenko:
On pseudocyclic association schemes. Ars Math. Contemp. 5(1): 1-25 (2012) - 2010
- [j17]Sergei Evdokimov, Ilia Ponomarenko:
Schur rings over a Galois ring of odd characteristic. J. Comb. Theory A 117(7): 827-841 (2010)
2000 – 2009
- 2009
- [j16]Amir Rahnamai Barghi, Ilia Ponomarenko:
Non-Isomorphic Graphs with Cospectral Symmetric Powers. Electron. J. Comb. 16(1) (2009) - [j15]Ilia Ponomarenko, Paul-Hermann Zieschang:
Preface. Eur. J. Comb. 30(6): 1387-1391 (2009) - [j14]Sergei Evdokimov, Ilia Ponomarenko:
Permutation group approach to association schemes. Eur. J. Comb. 30(6): 1456-1476 (2009) - [j13]Mikhail E. Muzychuk, Ilia N. Ponomarenko:
Schur rings. Eur. J. Comb. 30(6): 1526-1539 (2009) - [j12]Amir Rahnamai Barghi, Ilia Ponomarenko:
The Basis Digraphs of p-schemes. Graphs Comb. 25(3): 265-271 (2009) - [e1]Mikhail H. Klin, Gareth A. Jones, Aleksandar Jurisic, Mikhail E. Muzychuk, Ilia Ponomarenko:
Algorithmic Algebraic Combinatorics and Gröbner Bases. Springer 2009, ISBN 978-3-642-01959-3 [contents] - 2006
- [j11]Dima Grigoriev, Ilia N. Ponomarenko:
Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits. Appl. Algebra Eng. Commun. Comput. 17(3-4): 239-255 (2006) - 2005
- [j10]Sergei Evdokimov, Ilia N. Ponomarenko:
Circulant graphs: efficient recognizing and isomorphism testing: (extended abstract). Electron. Notes Discret. Math. 22: 7-12 (2005) - [i5]Dimitri Grigoriev, Ilia N. Ponomarenko:
Constructions in public-key cryptography over matrix groups. CoRR abs/math/0506180 (2005) - 2003
- [i4]Dima Grigoriev, Ilia N. Ponomarenko:
Homomorphic public-key cryptosystems and encrypting boolean circuits. CoRR cs.CR/0301022 (2003) - [i3]Dima Grigoriev, Ilia N. Ponomarenko:
Homomorphic public-key cryptosystems over groups and rings. CoRR cs.CR/0309010 (2003) - [i2]Dima Grigoriev, Ilia Ponomarenko:
Homomorphic public-key cryptosystems and encrypting boolean circuits. IACR Cryptol. ePrint Arch. 2003: 25 (2003) - 2002
- [i1]Dima Grigoriev, Ilia N. Ponomarenko:
On non-abelian homomorphic public-key cryptosystems. CoRR cs.CR/0207079 (2002) - 2001
- [j9]Sergei Evdokimov, Ilia N. Ponomarenko:
Two-closure of odd permutation group in polynomial time. Discret. Math. 235(1-3): 221-232 (2001) - 2000
- [j8]Sergei Evdokimov, Ilia N. Ponomarenko:
Separability Number and Schurity Number of Coherent Configurations. Electron. J. Comb. 7 (2000) - [j7]Sergei Evdokimov, Ilia N. Ponomarenko, Gottfried Tinhofer:
Forestal algebras and algebraic forests (on a new class of weakly compact graphs). Discret. Math. 225(1-3): 149-172 (2000)
1990 – 1999
- 1999
- [j6]Sergei Evdokimov, Ilia N. Ponomarenko:
Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks. Comb. 19(3): 321-333 (1999) - [j5]Sergei Evdokimov, Ilia N. Ponomarenko:
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms. Electron. J. Comb. 6 (1999) - [j4]Sergei Evdokimov, Marek Karpinski, Ilia N. Ponomarenko:
Compact cellular algebras and permutation groups. Discret. Math. 197-198: 247-267 (1999) - 1996
- [j3]Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer:
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. J. Algorithms 21(3): 542-564 (1996) - 1994
- [j2]Ilia N. Ponomarenko:
Graph Isomorphism Problem and 2-Closed Permutation Groups. Appl. Algebra Eng. Commun. Comput. 5: 9-22 (1994) - [j1]Ilia N. Ponomarenko:
Graph Algebras and the Graph Isomorphism Problem. Appl. Algebra Eng. Commun. Comput. 5: 277-286 (1994) - [c1]Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer:
Direct Path Graph Isomorphism (Extended Abstract). WG 1994: 395-406
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint