Badge
| Enlightened | First to answer and accepted with score of 10 or more. This badge can be awarded multiple times. |
David Eppstein earned this badge 47 times |
feb 15 at 23:03
Shortest cycle with a specific number of vertices
jan 12 at 0:12
Minimum spanning tree over all vertex matchings
jan 11 at 12:16
Golden ratio or Pi in the running time
dec 5 at 2:34
Does this graph class have a name ?
nov 25 at 4:35
Is there a problem that is easy for cubic graph but hard for graphs with maximum degree 3?
nov 6 at 19:58
Fast deletion / contraction in combinatorial embedding
sep 14 at 20:55
Combinatorial embedding of a graph
jun 10 '12 at 1:01
Finding a dual of a graph
jun 2 '12 at 16:27
Generating a tower defense maze, aka Finding the K most vital nodes (“nodewise interdiction”) in an unweighted grid-graph
may 3 '12 at 5:19
Drawing graphs with few “sharp” vertices?
mar 15 '12 at 17:11
Can regular maps, no matter their complexity, be topologically transformed into circular maps or rectangular maps?
mar 11 '12 at 11:04
Drawing graphs of bounded crossing number
jan 23 '12 at 1:30
Graph embedding which maximizes minimum angle
dec 21 '11 at 17:20
A probabilistic set with no false positives?
nov 11 '11 at 20:46
How to make a paper stronger?
nov 10 '11 at 3:32
How to determine whether there is exactly one simple path between two nodes in a graph
nov 9 '11 at 20:31
Forbidden minors for bounded genus graphs
oct 20 '11 at 20:59
Approximate graph colouring with a promised upper bound on maximum independent set
oct 18 '11 at 18:21
Is there any problem in $\mathsf{\Sigma^P_2}$ which is solvable in bounded tree width graphs?
oct 13 '11 at 15:47
Partition a graph into node-disjoint cycles
oct 1 '11 at 22:08
Computing integer points on the circumference of a given circle
sep 29 '11 at 17:16
The number of cliques in a graph: the Moon and Moser 1965 result
sep 13 '11 at 6:49
Counting words accepted by a regular grammar
sep 12 '11 at 15:43
Time complexity of Bellman-Held-Karp algorithm for TSP, take 2
aug 26 '11 at 4:53
The complexity of determining if a fixed graph is a minor of another
aug 4 '11 at 22:44
Is any chordal graph an incomparability graph?
jun 18 '11 at 18:04
Lattice problems
may 12 '11 at 7:11
Where is the error in the following P != NP pseudo-proof ?
mar 30 '11 at 21:53
Algorithm for finding the largest subgraph without a directed triangle
mar 30 '11 at 19:18
Size of BSP tree for a simple polygon?
mar 14 '11 at 1:06
On Bipartite planar graph (again)
feb 10 '11 at 8:23
Max Non-overlapping Path in Weighted Graph
jan 12 '11 at 23:45
Do “outer-bounded-genus” graphs have constant treewidth?
dec 7 '10 at 15:16
Process on finite points in a line
dec 6 '10 at 9:54
Finding the largest set of points of limited diameter
dec 5 '10 at 8:28
For a Planar Graph, Find the Algorithm that Constructs A Cycle Basis, with each Edge Shared by At Most 2 Cycles
dec 1 '10 at 21:29
On 1-dimensional cellular automata
nov 22 '10 at 19:39
Upper bounds on the length of longest simple path in non-Hamiltonian graph?
nov 9 '10 at 12:36
One Stack, Two Queues
oct 23 '10 at 7:25
polygonal triangulation and 3-colorability
sep 8 '10 at 14:39
Polynomial Time Algorithm for Graph Isomorphism Testing
sep 1 '10 at 6:35
Is the lower bound proof in this paper correct?
aug 30 '10 at 11:59
Construction of graphs where every pair of vertices have an unique common neighbor
aug 17 '10 at 10:29
How large a treewidth can a tree plus half the edges have?
