|
gptkbp:instanceOf
|
gptkb:person
|
|
gptkbp:almaMater
|
gptkb:Harvard_University
gptkb:Stanford_University
|
|
gptkbp:awardReceived
|
gptkb:AAAS_Fellow
gptkb:ACM_Fellow
gptkb:IEEE_Fellow
|
|
gptkbp:birthYear
|
1963
|
|
gptkbp:doctoralAdvisor
|
gptkb:Donald_Knuth
|
|
gptkbp:editor
|
gptkb:Discrete_&_Computational_Geometry
gptkb:Journal_of_Graph_Algorithms_and_Applications
gptkb:ACM_Transactions_on_Algorithms
|
|
gptkbp:employer
|
gptkb:University_of_California,_Irvine
|
|
gptkbp:field
|
gptkb:mathematics
computer science
|
|
gptkbp:hasBlog
|
https://11011110.github.io/
|
|
gptkbp:hasPhD
|
gptkb:Stanford_University
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
David Eppstein
|
|
gptkbp:knownFor
|
gptkb:Eppstein's_algorithm
work on geometric spanners
work on graph drawing
work on planar graphs
|
|
gptkbp:memberOf
|
gptkb:American_Association_for_the_Advancement_of_Science
gptkb:Association_for_Computing_Machinery
gptkb:IEEE
|
|
gptkbp:nationality
|
gptkb:American
|
|
gptkbp:notablePublication
|
"Finding the k shortest paths"
"The traveling salesman problem for cubic graphs"
"Diameter and treewidth in minor-closed graph families"
"Sparsification—a technique for speeding up dynamic graph algorithms"
|
|
gptkbp:notableStudent
|
gptkb:Michael_T._Goodrich
gptkb:Sariel_Har-Peled
|
|
gptkbp:notableWork
|
gptkb:algorithmic_graph_theory
gptkb:geometry
graph algorithms
|
|
gptkbp:occupation
|
gptkb:computer_scientist
gptkb:mathematician
|
|
gptkbp:position
|
gptkb:professor
|
|
gptkbp:thesisTitle
|
Parallel recognition of series-parallel graphs
|
|
gptkbp:thesisYear
|
1989
|
|
gptkbp:undergraduateInstitution
|
gptkb:Harvard_University
|
|
gptkbp:website
|
https://www.ics.uci.edu/~eppstein/
|
|
gptkbp:bfsParent
|
gptkb:Erik_Demaine
gptkb:Richard_M._Karp
|
|
gptkbp:bfsLayer
|
4
|