research
∙
05/25/2023
On the Weisfeiler-Leman dimension of permutation graphs
It is proved that the Weisfeiler-Leman dimension of the class of permuta...
share
research
∙
01/28/2022
Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable
An arc-colored tournament is said to be k-spanning for an integer k≥ 1 i...
research
∙
07/22/2021
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
It is known that testing isomorphism of chordal graphs is as hard as the...
research
∙
05/22/2021
Tensor products of coherent configurations
A Cartesian decomposition of a coherent configuration X is defined as a ...
research
∙
05/24/2020
The Weisfeiler-Leman dimension of distance-hereditary graphs
A graph is said to be distance-hereditary if the distance function in ev...
research
∙
05/18/2020
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties
The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a very useful com...
research
∙
05/18/2020
The Weifeiler-Leman Algorithm and Recognition of Graph Properties
The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a very useful com...
research
∙
12/21/2019
Two-closure of supersolvable permutation group in polynomial time
The 2-closure G of a permutation group G on Ω is defined to be the large...
research
∙
05/08/2019
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm
We show that the 2-dimensional Weisfeiler-Leman algorithm stabilizes n-v...
research
∙
03/26/2019
Testing isomorphism of circular-arc graphs in polynomial time
A graph is said to be circular-arc if the vertices can be associated wit...
research
∙
12/15/2018
Testing isomorphism of circulant objects in polynomial time
Let K be a class of combinatorial objects invariant with respect to a g...
research
∙
08/24/2017