David Rolnick

activity

20142025

most citedA Multi-Pass Approach to Large-Scale Connectomics

40 citations · 77 across the 21 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2014

On the growth of Stanley sequences

David Rolnick, Praveen S. Venkataramana

A set is said to be \emph{3-free} if no three elements form an arithmetic progression. Given a 3-free set $A$ of integers $0 = a_{0} < a_{1} < \dots < a_{t}$ , the \emph{Stanley sequence} $S(A)=…

math.CO2014★ 3 cited

On the classification of Stanley sequences

David Rolnick

An integer sequence is said to be 3-free if no three elements form an arithmetic progression. Following the greedy algorithm, the Stanley sequence $S (a_{0}, a_{1}, \dots, a_{k})$ is define…

math.CO2014

Acyclic Subgraphs of Planar Digraphs

Noah Golowich, David Rolnick

An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on $n$ vertices without directed 2-cyc…