Ilia N. Ponomarenko

Algorithms & Complexity · 1995–2009

A researcher in the Science corpus: 3 papers; trusts 6 researchers and is trusted by 2 researchers here, as inferred from the citation graph.

Subfields

Whom Ilia N. Ponomarenko trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Jin-Yi Cai
  2. László Babai
  3. Eugene M. Luks
  4. Martin Fürer

Who trusts Ilia N. Ponomarenko overall

  1. B. Douglas
  2. Keyulu Xu
  3. Jamie Smith

Papers from Ilia N. Ponomarenko's perspective

Ordered by how strongly the researchers Ilia N. Ponomarenko trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Isomorphism of graphs of bounded valence can be tested in polynomial time
  2. Canonical labeling of graphs
  3. On construction and identification of graphs
  4. An optimal lower bound on the number of variables for graph identification
  5. Symmetric squares of graphs
  6. Coherent algebras and the graph isomorphism problem
  7. Isomorphism of graphs with bounded eigenvalue multiplicity
  8. Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
  9. Random Graph Isomorphism
  10. Graph isomorphism problem

Their papers