Skip to main content
user13136's user avatar
user13136's user avatar
user13136's user avatar
user13136
  • Member for 11 years, 5 months
  • Last seen more than 2 years ago
11 votes

Parameterized complexity from P to NP-hard and back again

8 votes

Parameterized complexity from P to NP-hard and back again

8 votes
Accepted

Terminology for complete k-partite graph where k is not fixed

18 votes

Nontrivial membership in NP

2 votes

Independent Node Degree in Undirected Graphs

21 votes
Accepted

Graphs in which every minimal separator is an independent set

25 votes

Concise introduction to algorithms for mathematicians

17 votes

variations of SAT

8 votes

Completeness spanning trees

13 votes

About generalized planar graphs and generalized outerplanar graphs

17 votes

Is clique-width preserved under edge contractions?

8 votes

NP-hard problems on trees

6 votes

Funny TCS-related papers etc?

9 votes
Accepted

Does a chordal graph where the size of minimal separators is constrained have name?

11 votes

Parameterized complexity from P to NP-hard and back again

11 votes

graphs where vertex coloring is in P but independent set is NP complete

8 votes

Graphs for maximum number of min cuts?