activity
20022006
most citedComputing roots of directed graphs is graph isomorphism hard

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing 2005 · math.COShow all

Nothing from them under that filter.

Their other years and fields are still on the left.