11 citations · 34 across the 14 of their papers we have counts for
17 papers
On the Weisfeiler-Leman dimension of permutation graphs
Jin Guo, Alexander L. Gavrilyuk, Ilia Ponomarenko
It is proved that the Weisfeiler-Leman dimension of the class of permutation graphs is at most 18. Previously it was only known that this dimension is finite (Grußien, 2017).
On computing the closures of solvable permutation groups
Ilia Ponomarenko, Andrey V. Vasil'ev
Let be an integer. It is proved that the -closure of a given solvable permutation group of degree can be constructed in time .
Isomorphism testing of -spanning tournaments is Fixed Parameter Tractable
Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov
An arc-colored tournament is said to be -spanning for an integer if the union of its arc-color classes of maximal valency at most is the arc set of a strongly conn…
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko +1
The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chor…
On -closed abelian permutation groups
Dmitry Churikov, Ilia Ponomarenko
A permutation group is said to be -closed if no group such that has the same orbits on as . A simple…
The Weisfeiler-Leman dimension of distance-hereditary graphs
Alexander L. Gavrilyuk, Roman Nedela, Ilia Ponomarenko
A graph is said to be distance-hereditary if the distance function in every connected induced subgraph is the same as in the graph itself. We prove that the ordinary Weisfeiler-Lem…