Ilia N. Ponomarenko - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2005

Circulant graphs: efficient recognizing and isomorphism testing: (extended abstract)Sergei Evdokimov, Ilia N. Ponomarenko. endm, 22:7-12, 2005. [doi]

2001

Two-closure of odd permutation group in polynomial timeSergei Evdokimov, Ilia N. Ponomarenko. DM, 235(1-3):221-232, 2001. [doi]

2000

Separability Number and Schurity Number of Coherent ConfigurationsSergei Evdokimov, Ilia N. Ponomarenko. combinatorics, 7, 2000. [doi]

Forestal algebras and algebraic forests (on a new class of weakly compact graphs)Sergei Evdokimov, Ilia N. Ponomarenko, Gottfried Tinhofer. DM, 225(1-3):149-172, 2000. [doi]

1999

Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan BlocksSergei Evdokimov, Ilia N. Ponomarenko. combinatorica, 19(3):321-333, 1999. [doi]

On Highly Closed Cellular Algebras and Highly Closed IsomorphismsSergei Evdokimov, Ilia N. Ponomarenko. combinatorics, 6, 1999. [doi]

Compact cellular algebras and permutation groupsSergei Evdokimov, Marek Karpinski, Ilia N. Ponomarenko. DM, 197-198:247-267, 1999. [doi]

1996

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path GraphsLuitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer. jal, 21(3):542-564, 1996.

1994

Direct Path Graph Isomorphism (Extended Abstract)Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer. criwg 1995: 395-406

Graph Isomorphism Problem and 2-Closed Permutation GroupsIlia N. Ponomarenko. aaecc, 5:9-22, 1994.

Graph Algebras and the Graph Isomorphism ProblemIlia N. Ponomarenko. aaecc, 5:277-286, 1994.

Sign in or sign up to see more results.

runs on WebDSL