Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
David Arthur Eppstein (born 1963) is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine, known for his work in computational geometry, graph algorithms, and recreational mathematics. Eppstein is also a Wikipedia editor and an administrator on the English Wikipedia.
Research, Career, Art & Science
Explore the main themes, entities and connections around David Eppstein. Start with the topic map, then use the sections below for research and deeper semantic analysis.
Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.
High-confidence facts extracted from structured source data. Use them as anchors for further research.
Browse the full topic structure. Each item opens a new analysis centered on that subject.
Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.
See the strongest relationship patterns around the current topic before diving into the raw triples.
Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.
eppstein doi isbn david computer science university graph algorithms 10 symposium wikipedia irvine geometry mathematics pdf also editor california computational
| Subject | Predicate | Object | Confidence | Src |
|---|---|---|---|---|
| David Eppstein | Alma mater | Stanford University | 1.00 | infobox |
| David Eppstein | Alma mater | Columbia University | 1.00 | infobox |
| David Eppstein | Born | David Arthur Eppstein 1963 (age 62–63) Windsor, England | 1.00 | infobox |
| David Eppstein | Citizenship | United States | 1.00 | infobox |
| David Eppstein | Doctoral advisor | Zvi Galil | 1.00 | infobox |
| David Eppstein | Fields | Computational geometry | 1.00 | infobox |
| David Eppstein | Fields | Graph algorithms | 1.00 | infobox |
| David Eppstein | Thesis | Efficient algorithms for sequence analysis with concave and convex gap costs (1989) | 1.00 | infobox |
| David Eppstein | Website | 11011110.github.io/blog | 1.00 | infobox |
| David Eppstein | Workplaces | University of California, Irvine | 1.00 | infobox |
| finite element meshing | instance of | He has published also in application areas | 0.80 | text |
| which is used in engineering design | instance of | He has published also in application areas | 0.80 | text |
These clusters group vocabulary that occurs around closely connected concepts in the source material.
Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.