Seven bridges of Königsberg 
The first graphtheoretic problem 
Leonhard Euler 
The inventor of graphtheory, solved the seven bridges of Königsberg problem 
Knight's tour 
One of the first graphtheoretic problems 
Max Friedrich William Bezzel 
Inventor of the 8queens puzzle 
8Queens puzzle 
One of the first graphtheoretic problems 
Sir William Rowan Hamilton 
Inventor of the hamiltonian path problem 
Dodecahedron 
The first instance of the hamiltonian path problem 
Dénes König 
Fundamental work in matchingtheory 
Karl Menger 
Fundamental works on the relation between connectivity and disjoint paths 
Kazimierz Kuratowski 
Fully characterized planar graphs 
K_5 and K_3,3 
The two fundamental nonplanar graphs 
Alan Mathison Turing 
Inventor of computability and complexity theory 
P 
One of the most interesting complexity classes 
Konrad Zuse 
Inventor of the programmable computer 
William Thomas Tutte 
Groundbreaking work in graph factorization 
Delbert Ray Fulkerson 
Fundamental work in networktheory 
Lester Randolph Ford, Jr. 
Fundamental work in networktheory 
Joseph Kruskal 

Robert Clay Prim 

Edsger Wybe Dijkstra 
Dijkstras Algorithm 
Claude Berge 

Jack Edmonds 
Groundbreaking work in matchingtheory and networktheory 
Laszlo Lovasz 

Stephen Arthur Cook 
Inventor of polynomialtimereductions and the complexity class NP 
NP 
The most interesting complexity class there is 
Richard Manning Karp 
EdmondsKarp Algorithm and 
Bjarne Stroustrup 
Inventor of C++ and pioneer in
object orientation 
Richard Matthew Stallman 
Founder of the FreeSoftware movement 
Neil Robertson 
Groundbreaking work in minortheory 
Paul D. Seymour 
Groundbreaking work in minortheory 
Sudoku 

Bruno Courcelle 
Courcelle's Theorem 
O(f(k)*p(n)) 
Definition of the running time of an FPT algorithm 
FPT 
The most important, parameterized complexity class 
XML 
A widely used fileformat for attributed trees 
Jörg Flum 

Martin Grohe 
