Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more
Gamow's user avatar
Gamow's user avatar
Gamow's user avatar
Gamow
  • Member for 9 years, 4 months
  • Last seen more than 2 years ago
2 votes

Partition a graph into two clusters

4 votes

Graph classes where giving a q-clique edge cover makes testing for q-colouring easy

1 vote
Accepted

Set cover where consecutive sets differ by at most one item

1 vote
Accepted

Maximum weight matching with classes of edges in a multi-edge bipartite graph

1 vote
Accepted

How hard is deciding the existence of a polygonization with prescribed perimeter?

7 votes
Accepted

How can I find the PhD thesis of C.A. Ellis?

5 votes
Accepted

Complexity of computing the union of H-polytopes in three dimensions

13 votes

Why do TCS papers have author names in alphabetical order of their surnames?

4 votes

Disjoint subsets problem complexity

22 votes

Algorithm for finding a 3-cycle cover

10 votes
Accepted

Is the maximum independent set in cubic planar graphs NP-complete?

9 votes

How to efficiently find a loop between two nodes in a directed graph?

6 votes
Accepted

Minimal number of hyperplanes needed to separate sets of points from one other set

7 votes
Accepted

Are there common names for the subtiers of PTIME?

8 votes

"Relatives" of the shortest path problem

5 votes
Accepted

Satisfiability problems with restricted (not bounded) number of occurrences per variable

9 votes
Accepted

Lower bound on pebbling numbers

2 votes
Accepted

Complexity of existence of simple polygonalization with prescribed area?

6 votes
Accepted

Complexity of Finding Largest Set of Intersecting Convex Polytopes

4 votes
Accepted

Minimizing a convex piece-wise linear function of short $(\max, +)$ circuit length

2 votes
Accepted

Complexity status of the Edge Deletion problem to bounded degree graphs

3 votes
Accepted

3 dimensional matching shortest solution NP-hard?

3 votes

A partition problem in which some numbers may be cut

3 votes
Accepted

Is S-T CONNECTEDNESS #P-complete on instances when all s-t paths are of the same length?

1 vote

NP-hard problems on the class of caterpillars

4 votes
Accepted

Minimum relevant variables in linear system - additive approximation

20 votes
Accepted

Is there a counterexample to this work?

11 votes
Accepted

Does Max Planar 3-SAT admit a PTAS?

27 votes
Accepted

Number of words of length n in a context-free language

4 votes

A least sized partition of a set under a distance metric