Network profile

a3nm

Reputation

6,664

6.7k
5.3k
4k

2017
2018
2019
2020

Top tag

ds.algorithms

Next privilege

10,000 Rep.

Access moderator tools

Badges

Newest

Tag Editor

Next badge

51/100

Impact

18 posts edited

15 helpful flags

492 votes cast

51 Bookmarks

Votes Activity Newest Views Added

votes

answer

198

views

Tree-decomposition with clique interfaces

Mar 16 '16 at 17:54 David Eppstein 48.3k

votes

answers

147

views

Lower bound for the maximal vectors problem

ds.algorithms reference-request cg.comp-geom optimization

Feb 6 '14 at 17:52 Joseph Stack 1,085

votes

answers

views

Complexity of computing the simplicial width of a graph

reference-request graph-theory clique treewidth

Nov 29 '16 at 13:40 Community♦ 1

votes

answer

225

views

How fast can we find and disconnect roots in a forest?

ds.data-structures lower-bounds tree

May 21 '18 at 4:45 Dmitri Urbanowicz 378

votes

answers

138

views

Has what I am calling “helpfulness” here been studied?

reference-request circuit-complexity boolean-functions

Mar 15 '18 at 20:38 Samuel Schlesinger 1,592

votes

answers

187

views

Tree search guided by a probabilistic oracle

ds.algorithms pr.probability tree search-problem

Aug 15 '12 at 12:44 Foo Barrigno 239

votes

answers

293

views

On the complexity of a “list” datastructure in the RAM model

ds.algorithms complexity machine-models

May 25 at 7:28 David Eppstein 48.3k

votes

answers

183

views

Largest “non-disturbing” subset in a graph

graph-algorithms

Apr 12 '19 at 7:29 Egor Skriptunoff 161

votes

answers

157

views

Optimal set union tree

optimization tree binary-trees set-system

Oct 14 '18 at 15:57 AmeerJ 577

votes

answers

100

views

Counting matchings on 3-regular bipartite graphs

counting-complexity matching bipartite-graphs

Jul 9 at 23:38 M.Monet 922

votes

answer

162

views

Cayley subgraph isomorphism and complexity of linear subcode decision

graph-theory graph-isomorphism

Oct 15 '13 at 17:58 Joshua Grochow 32.8k

votes

answers

224

views

Can relativization change the direction of separation?

cc.complexity-theory relativization

Jan 30 '13 at 7:47 Kaveh 20.8k

votes

answers

180

views

NP-completeness of a specific topological sorting problem

cc.complexity-theory np-hardness directed-acyclic-graph partial-order topological-sorting

May 15 at 15:46 a3nm 6,664

votes

answer

191

views

How hard is it to determine the chromatic number of a unit distance graph?

cc.complexity-theory graph-theory np-hardness planar-graphs

May 18 '18 at 20:54 domotorp 12.9k

votes

answer

182

views

Möbius values of CNF and DNF lattices of a monotone Boolean function

boolean-functions combinatorics lattice

Apr 1 '19 at 20:09 M.Monet 922

votes

answers

329

views

A variant of #POSITIVE-2-DNF

reference-request counting-complexity

Aug 9 at 19:04 M.Monet 922

votes

answers

169

views

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

cc.complexity-theory counting-complexity

Jan 22 '19 at 12:42 Victor 165

votes

answer

103

views

Upper bound to number of closed itemsets

co.combinatorics upper-bounds data-mining

May 7 '14 at 0:44 Magic Banana 31

votes

answers

539

views

Has this formulation of pursuit evasion been researched? Similar to Helicopter Cops and Robbers Game

graph-theory graph-algorithms

Jun 3 '15 at 20:18 Edvin 31

votes

answers

221

views

Grouping a set of rectangles in larger rectangular regions

cg.comp-geom clustering

May 22 '13 at 16:10 rivu 131

vote

answers

views

Points of a finite set wihtin a ball

ds.data-structures computational-geometry metric-spaces

Dec 25 '18 at 8:40 C.P. 972

Prev 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

51 Bookmarks

Tree-decomposition with clique interfaces

Lower bound for the maximal vectors problem

Complexity of computing the simplicial width of a graph

How fast can we find and disconnect roots in a forest?

Has what I am calling “helpfulness” here been studied?

Tree search guided by a probabilistic oracle

On the complexity of a “list” datastructure in the RAM model

Largest “non-disturbing” subset in a graph

Optimal set union tree

Counting matchings on 3-regular bipartite graphs

Cayley subgraph isomorphism and complexity of linear subcode decision

Can relativization change the direction of separation?

NP-completeness of a specific topological sorting problem

How hard is it to determine the chromatic number of a unit distance graph?

Möbius values of CNF and DNF lattices of a monotone Boolean function

A variant of #POSITIVE-2-DNF

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

Upper bound to number of closed itemsets

Has this formulation of pursuit evasion been researched? Similar to Helicopter Cops and Robbers Game

Grouping a set of rectangles in larger rectangular regions

Points of a finite set wihtin a ball