André Große

According to our database, André Große authored at least 5 papers between 2001 and 2006.

Collaborative distances:

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

2006

On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P.

André Große, Jörg Rothe, Gerd Wechsung

Inf. Process. Lett., 2006

2003

On Functions and Relations.

André Große, Harald Hempel

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002

Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones.

André Große, Jörg Rothe, Gerd Wechsung

Theory Comput. Syst., 2002

2001

A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs

André Große, Jörg Rothe, Gerd Wechsung

CoRR, 2001

Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions.

André Große, Jörg Rothe, Gerd Wechsung

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001