866 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Steklov Mathematical InstituteRU415 papers
- St Petersburg UniversityRU162 papers
- Russian Academy of SciencesRU133 papers
- Centre National de la Recherche ScientifiqueFR23 papers
- University of HelsinkiFI23 papers
- Indiana University – Purdue University IndianapolisUS19 papers
- University of GenevaCH15 papers
- Bielefeld UniversityDE14 papers
- National Research University Higher School of EconomicsRU14 papers
- Pennsylvania State UniversityUS14 papers
- Universität HamburgDE14 papers
- University of Notre DameUS13 papers
Showing 2017 · math.COShow all
2 papers · 2 filters
math.CO2017★ 11 cited
Recognizing and testing isomorphism of Cayley graphs over an abelian group of order in polynomial time
Roman Nedela, Ilia Ponomarenko
We construct a polynomial-time algorithm that given a graph with vertices ( is prime), finds (if any) a Cayley representation of over the group $C_2\times C_2\times…
math.CO2017★ 2 cited
Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time
Ilia Ponomarenko, Andrey Vasil'ev
A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central Cayley graphs over explicitly given almost…