Skip to main content
David Eppstein's user avatar
David Eppstein's user avatar
David Eppstein's user avatar
David Eppstein
  • Member for 14 years, 1 month
  • Last seen more than a month ago
17 votes

Edit distance in sublinear space

17 votes
Accepted

Combinatorial embedding of a graph

17 votes
Accepted

Approaches to GI inspired by knot problem

17 votes
Accepted

Finding a dual of a graph

16 votes
Accepted

Natural CLIQUE to k-Color reduction

16 votes
Accepted

About generalized planar graphs and generalized outerplanar graphs

16 votes
Accepted

Does this graph class have a name ?

16 votes

For a language to be programmable, is it mandatory that it be based on a context free grammar

16 votes
Accepted

Forbidden minors for bounded genus graphs

16 votes
Accepted

Lattice problems

16 votes
Accepted

How do you decide when you have enough research results to write a paper and to which journal you submit the paper

16 votes

About properties of adjacency matrix when a graph is planar

16 votes

Dijkstra parallelization

16 votes

In the neutral zone between polynomial and sub-exponential

16 votes
Accepted

Are there any heuristic-free NP complete problems?

16 votes
Accepted

Math talk: Theorem about git revision control system?

16 votes

Book for self study of algorithms in group theory

16 votes
Accepted

Are there poly time algorithms to determine if a graph is almost bipartite?

15 votes
Accepted

Classes of graphs with superconstant treewidth

15 votes
Accepted

On Bipartite planar graph (again)

15 votes
Accepted

Finding the largest set of points of limited diameter

15 votes

Edge-partitioning cubic graphs into claws and paths

15 votes
Accepted

Graph families which have polynomial time algorithms for computing the chromatic number

15 votes
Accepted

Algorithm for finding the largest subgraph without a directed triangle

15 votes
Accepted

The complexity of determining if a fixed graph is a minor of another

15 votes
Accepted

Graph embedding which maximizes minimum angle

15 votes
Accepted

Shortest cycle with a specific number of vertices

15 votes

Is it necessary to call matrix multiplication $n$ times to find a claw

15 votes
Accepted

Preferable way to express $O(n2^n)$

14 votes
Accepted

Are regular languages closed under addition?

1 2
3
4 5
15