Mark Ginn

According to our database, Mark Ginn authored at least 2 papers between 1995 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1999

Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes.

Mark Ginn

J. Graph Theory, 1999

1995

On the Computational Complexity of Ordered Subgraph Recognition.

Dwight Duffus, Mark Ginn, Vojtech Rödl

Random Struct. Algorithms, 1995