User:David Eppstein

Wikipedia editor (n.) Someone who will not leave a burning building until you show them the newspaper article documenting how many people were killed by the fire.

About me

I'm a computer science professor at UC Irvine, in Orange County, California. See [http://www.ics.uci.edu/~eppstein/ my home page], [https://mathstodon.xyz/@11011110 Mastodon account], [https://11011110.github.io/blog/ blog], or even my Wikipedia article for more about me.

Much of my Wikipedia editing is on mathematics articles, but I've also edited articles on computer science, academic biography, the arts, and California geography, among many other topics. I've also contributed many diagrams and photographs to Wikipedia and Wikimedia Commons.

As an employee of a public university I believe that public outreach is part of my job description, and in that sense that my edits here to subjects within my professional expertise are paid edits. However, the topics and content of my editing here are wide-ranging and entirely self-directed. I neither participate in, nor condone, paid edits for specific articles or specific content.

width="75%"

|{{userpage}}

Wikibooks

Click on the titles, not on the cover images!

border=0 align=center cellspacing=20
{{pp-book-cover

|title=Graph Algorithms

|subtitle=

|cover-image=Cube-maximal-independence.svg

|cover-color=#76b3df

}}

| {{pp-book-cover

|title=Graph Drawing

|subtitle=

|cover-image=3-crossing Heawood graph.svg

|cover-color=#76b3df

}}

| {{pp-book-cover

|title=Fundamental Data Structures

|subtitle=

|cover-image=Cartesian tree.svg

|cover-color=#76b3df

}}

| {{pp-book-cover

|title=Matroid Theory

|subtitle=

|cover-image=Möbius–Kantor configuration symmetric.svg

|cover-color=#76b3df

}}

| {{pp-book-cover

|title=Perfect Graphs

|subtitle=

|cover-image=Turan 13-4.svg

|cover-color=#76b3df

}}

[[/DYK|Did you know?]]

(Older entries)

{{-}}

Good articles

{{div col|colwidth=15em}}

  • {{annotated link|17-animal inheritance puzzle}}
  • {{annotated link|Alexandrov's theorem on polyhedra}}
  • {{annotated link|antiparallelogram}}
  • {{annotated link|arc diagram}}
  • {{annotated link|arrangement of lines}}
  • {{annotated link|Mark Barr}}
  • {{annotated link|Beckman–Quarles theorem}}
  • {{annotated link|binary logarithm}}
  • {{annotated link|binary tiling}}
  • {{annotated link|BIT predicate}}
  • {{annotated link|book embedding}}
  • {{annotated link|Borromean rings}}
  • {{annotated link|bucket queue}}
  • {{annotated link|Cairo pentagonal tiling}}
  • {{annotated link|Cantor's isomorphism theorem}}
  • {{annotated link|Cartesian tree}}
  • {{annotated link|clique problem}}
  • {{annotated link|component (graph theory)}}
  • {{annotated link|constructible number}}
  • {{annotated link|convex curve}}
  • {{annotated link|convex hull}}
  • {{annotated link|cop-win graph}}
  • {{annotated link|curve of constant width}}
  • {{annotated link|curve-shortening flow}}
  • {{annotated link|De Bruijn–Erdős theorem (graph theory)}}
  • {{annotated link|De quinque corporibus regularibus|De quinque corporibus regularibus}}
  • {{annotated link|Descartes' theorem}}
  • {{annotated link|Dehn invariant}}
  • {{annotated link|directed acyclic graph}}
  • {{annotated link|double bubble theorem}}
  • {{annotated link|Doyle spiral}}
  • {{annotated link|dual graph}}
  • {{annotated link|dyadic rational}}
  • {{annotated link|Earth–Moon problem}}
  • {{annotated link|Erdős–Anning theorem}}
  • {{annotated link|Erdős–Ko–Rado theorem}}
  • {{annotated link|Erdős–Straus conjecture}}
  • {{annotated link|Euclid–Euler theorem}}
  • {{annotated link|Euclidean distance}}
  • {{annotated link|Euclidean minimum spanning tree}}
  • {{annotated link|factorial}}
  • {{annotated link|farthest-first traversal}}
  • {{annotated link|feedback arc set}}
  • {{annotated link|Fermat's right triangle theorem}}
  • {{annotated link|Fibonacci nim}}
  • {{annotated link|free abelian group}}
  • {{annotated link|Gale–Shapley algorithm}}
  • {{annotated link|Garden of Eden (cellular automaton)}}
  • {{annotated link|Andrew M. Gleason}}
  • {{annotated link|Ronald Graham}}
  • {{annotated link|grid bracing}}
  • {{annotated link|Halin graph}}
  • {{annotated link|handshaking lemma}}
  • {{annotated link|harmonic series (mathematics)}}
  • {{annotated link|Heilbronn triangle problem}}
  • {{annotated link|C. Doris Hellman}}
  • {{annotated link|Herschel graph}}
  • {{annotated link|hyperbolic spiral}}
  • {{annotated link|icosian game}}
  • {{annotated link|ideal polyhedron}}
  • {{annotated link|infinity symbol}}
  • {{annotated link|integer sorting}}
  • {{annotated link|isosceles triangle}}
  • {{annotated link|Vojtěch Jarník}}
  • {{annotated link|Jessen's icosahedron}}
  • {{annotated link|Kawasaki's theorem}}
  • {{annotated link|Keller's conjecture}}
  • {{annotated link|Kepler triangle}}
  • {{annotated link|kite (geometry)}}
  • {{annotated link|Harry R. Lewis}}
  • {{annotated link|Laves graph}}
  • {{annotated link|linear probing}}
  • {{annotated link|logic of graphs}}
  • {{annotated link|Malfatti circles}}
  • {{annotated link|midsphere}}
  • {{annotated link|Möbius strip}}
  • {{annotated link|mutilated chessboard problem}}
  • {{annotated link|nearest-neighbor chain algorithm}}
  • {{annotated link|no-three-in-line problem}}
  • {{annotated link|opaque set}}
  • {{annotated link|ordered Bell number}}
  • {{annotated link|paper fortune teller}}
  • {{annotated link|perfect graph}}
  • {{annotated link|Pick's theorem}}
  • {{annotated link|polygonalization}}
  • {{annotated link|prime number}}
  • {{annotated link|Prince Rupert's cube}}
  • {{annotated link|pseudoforest}}
  • {{annotated link|Pythagorean tiling}}
  • {{annotated link|quadrisecant}}
  • {{annotated link|Rado graph}}
  • {{annotated link|random binary tree}}
  • {{annotated link|regular number}}
  • {{annotated link|Reuleaux triangle}}
  • {{annotated link|reversible cellular automaton}}
  • {{annotated link|rook's graph}}
  • {{annotated link|Klaus Roth}}
  • {{annotated link|Rule 90}}
  • {{annotated link|Rule 184}}
  • {{annotated link|Schönhardt polyhedron}}
  • {{annotated link|Schwarz lantern}}
  • {{annotated link|selection algorithm}}
  • {{annotated link|Shapley–Folkman lemma}}
  • {{annotated link|simple polygon}}
  • {{annotated link|small set expansion hypothesis}}
  • {{annotated link|snark (graph theory)}}
  • {{annotated link|square-difference-free set}}
  • {{annotated link|square pyramidal number}}
  • {{annotated link|squaring the circle}}
  • {{annotated link|Stars (M. C. Escher)}}
  • {{annotated link|Steinitz's theorem}}
  • {{annotated link|Carl Størmer}}
  • {{annotated link|Sylvester–Gallai theorem}}
  • {{annotated link|Sylvester's sequence}}
  • {{annotated link|telephone number (mathematics)}}
  • {{annotated link|Theil–Sen estimator}}
  • {{annotated link|three-gap theorem}}
  • {{annotated link|three utilities problem}}
  • {{annotated link|triaugmented triangular prism}}
  • {{annotated link|Turán's brick factory problem}}
  • {{annotated link|2-satisfiability}}
  • {{annotated link|unit distance graph}}
  • {{annotated link|unit fraction}}
  • {{annotated link|universal vertex}}
  • {{annotated link|Viète's formula}}
  • {{annotated link|well-covered graph}}
  • {{annotated link|widest path problem‎}}
  • {{annotated link|witch of Agnesi}}
  • {{annotated link|X + Y sorting|{{math|X + Y}} sorting}}
  • {{annotated link|YBC 7289}}
  • {{annotated link|Znám's problem}}

{{div col end}}

See also

[[Boxicity]]

{{administrator}}

{{User WP Math}}

{{User WP CS}}

{{User:Mdebets/Templates/WikiProject Academic Journals}}

{{User WikiProject Women in Red}}

{{clear}}

{{User teacher university}}

{{User OC}}

{{User singular they:Yes}}

{{user comma-splice}}

{{clear}}

{{Adminbox}}

{{User:Fluence/(006) User Wikipedia|August 2006}}

{{User:Willscrlt/UBX/UbxWikicommonsUser|David Eppstein|images}}

{{DEFAULTSORT:Eppstein, David}}

Category:Wikipedian mathematicians

Category:Wikipedian computer scientists

Category:Wikipedians who have access to JSTOR