Matches in DBpedia 2016-04 for { ?s ?p "Daniel P. Sanders is an American mathematician. He known for his 1996 efficient proof (algorithm) of proving the Four color theorem (with Neil Robertson, Paul Seymour, and Robin Thomas). He used to be a guest professor of the department of computer science at Columbia University.Sanders received his Ph.D. in algorithms, combinatorics, and optimization from Georgia Tech in 1993 under the guidance of professor Robin Thomas. He was the Graph Theory Resources editor of www.graphtheory.com."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Daniel_P._Sanders comment "Daniel P. Sanders is an American mathematician. He known for his 1996 efficient proof (algorithm) of proving the Four color theorem (with Neil Robertson, Paul Seymour, and Robin Thomas). He used to be a guest professor of the department of computer science at Columbia University.Sanders received his Ph.D. in algorithms, combinatorics, and optimization from Georgia Tech in 1993 under the guidance of professor Robin Thomas. He was the Graph Theory Resources editor of www.graphtheory.com.".
- Q5218370 comment "Daniel P. Sanders is an American mathematician. He known for his 1996 efficient proof (algorithm) of proving the Four color theorem (with Neil Robertson, Paul Seymour, and Robin Thomas). He used to be a guest professor of the department of computer science at Columbia University.Sanders received his Ph.D. in algorithms, combinatorics, and optimization from Georgia Tech in 1993 under the guidance of professor Robin Thomas. He was the Graph Theory Resources editor of www.graphtheory.com.".