David Eppstein

less info

17,450 reputation

153114

bio	website	11011110.livejournal.com
	location	Irvine, CA
	age	48
visits	member for	1 year, 9 months
	seen	11 mins ago
stats	profile views	2,644

I am a professor of computer science at UC Irvine, an administrator on Wikipedia, and moderator for the cs.DS category on arxiv.org. My research interests include graph algorithms, graph drawing, data structures, and computational geometry.

	17,450 reputation	bio	website	11011110.livejournal.com	visits	member for	1 year, 9 months
153114 badges		location	Irvine, CA		seen	11 mins ago

summary answers questions tags badges favorites bounties reputation activity

151 Answers

votes activity newest

72	Are research papers hard to read?
33	Problems Between P and NPC
30	One Stack, Two Queues
28	How are real numbers specified in computation?
26	Geometric problems that are NP-complete in $R^3$ but tractable in $R^2$?

17,450 Reputation

+105	Generating a tower defense maze, aka Finding the K most vital nodes (“nodewise interdiction”) in an unweighted grid-graph
+10	Notable examples of the square root idea in complexity analysis
+20	Are research papers hard to read?
+10	Bounds on sum of squares of node degrees in undirected graphs

8 Questions

votes activity newest

37	Positive topological ordering
32	How many distinct colors are needed to lower-bound the choosability of a graph?
24	Random self-avoiding lattice cycle within a given bounding box
21	Splittable stack
19	Hamiltonicity of k-regular graphs

106 Tags

583 graph-theory × 59	233 cg.comp-geom × 24
519 ds.algorithms × 56	228 graph-algorithms × 27
333 co.combinatorics × 32	128 soft-question × 11
294 cc.complexity-theory × 23	119 np-hardness × 10
238 reference-request × 23	104 research-practice × 7