Network profile

a3nm

Reputation

6,946

6.9k
5.8k
4.6k

2018
2019
2020
2021

Top tag

ds.algorithms

Next privilege

10,000 Rep.

Access moderator tools

Badges

Newest

Nice Question

Next badge

329/600

Impact

18 posts edited

15 helpful flags

549 votes cast

54 Bookmarks

Votes Activity Newest Views Added

votes

answer

821

views

On finding a chain decomposition of a Partial Order

Sep 16 '11 at 5:12 Sasho Nikolov 17.8k

votes

answer

217

views

Tree-decomposition with clique interfaces

reference-request graph-theory clique treewidth

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

votes

answers

149

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,095

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

235

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

139

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

answer

167

views

Cayley subgraph isomorphism and complexity of linear subcode decision

graph-theory graph-isomorphism

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

votes

answers

189

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

315

views

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

ds.algorithms complexity machine-models

May 25 at 7:28 David Eppstein 49.2k

votes

answers

130

views

Computing and maintaining the minimum of a set $S$ of integers while allowing updates on $S$

ds.algorithms reference-request lower-bounds sorting ram-model

Nov 8 at 13:39 Louis 360

votes

answers

184

views

Largest “non-disturbing” subset in a graph

graph-algorithms

Apr 12 '19 at 7:29 Egor Skriptunoff 161

votes

answers

162

views

Optimal set union tree

optimization tree binary-trees set-system

Oct 14 '18 at 15:57 AmeerJ 605

votes

answers

112

views

Counting matchings on 3-regular bipartite graphs

counting-complexity matching bipartite-graphs

Jul 9 '19 at 23:38 M.Monet 971

votes

answers

185

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,946

votes

answer

201

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 13.2k

votes

answers

227

views

Can relativization change the direction of separation?

cc.complexity-theory relativization

Jan 30 '13 at 7:47 Kaveh 21k

votes

answer

190

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 971

votes

answers

333

views

A variant of #POSITIVE-2-DNF

reference-request counting-complexity

Aug 9 '19 at 19:04 M.Monet 971

votes

answers

193

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

answers

223

views

Grouping a set of rectangles in larger rectangular regions

cg.comp-geom clustering

May 22 '13 at 16:10 rivu 131

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

552

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

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. 982

vote

answer

118

views

Face-splitting product of two Vandermonde matrices: When is is invertible?

linear-algebra matrix-product

Oct 7 at 16:00 J.G 655

Prev 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

54 Bookmarks

On finding a chain decomposition of a Partial Order

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?

Cayley subgraph isomorphism and complexity of linear subcode decision

Tree search guided by a probabilistic oracle

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

Computing and maintaining the minimum of a set $S$ of integers while allowing updates on $S$

Largest “non-disturbing” subset in a graph

Optimal set union tree

Counting matchings on 3-regular bipartite graphs

NP-completeness of a specific topological sorting problem

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

Can relativization change the direction of separation?

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?

Grouping a set of rectangles in larger rectangular regions

Upper bound to number of closed itemsets

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

Points of a finite set wihtin a ball

Face-splitting product of two Vandermonde matrices: When is is invertible?