#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2009

2018

- This year (2)
- Last 5 years (19)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee
- Discrete Mathematics
- 2012

Given a graph G, its triangular line graph is the graph T (G) with vertex set consisting of the edges of G and adjacencies between edges that are incident in G as well as being within a commonâ€¦ (More)

- Derrick Stolee, N. V. Vinodchandran
- 2012 IEEE 27th Conference on Computationalâ€¦
- 2010

This work presents a log-space reduction which compresses an n-vertex directed acyclic graph with m(n) sources embedded on a surface of genus g(n), to a graph with O(m(n) + g(n)) vertices whileâ€¦ (More)

- Christopher Cox, Derrick Stolee
- Discrete Mathematics
- 2016

For a k-uniform hypergraph G with vertex set {1, . . . , n}, the ordered Ramsey number ORt(G) is the least integer N such that every t-coloring of the edges of the complete k-uniform graph on vertexâ€¦ (More)

- Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
- computational complexity
- 2011

We show that two complexity classes introduced about two decades ago are unconditionally equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inputâ€¦ (More)

- Stephen G. Hartke, Derrick Stolee
- ArXiv
- 2013

The Manickam-MiklÃ³s-Singhi Conjecture states that when n â‰¥ 4k, every multiset of n real numbers with nonnegative total sum has at least ( nâˆ’1 kâˆ’1 ) k-subsets with nonnegative sum. We develop aâ€¦ (More)

- Ilkyoo Choi, Bernard LidickÃ½, Derrick Stolee
- Journal of Graph Theory
- 2016

We study choosability with separation which is a constrained version of list coloring of graphs. A (k, d)-list assignment L of a graph G is a function that assigns to each vertex v a list L(v) of atâ€¦ (More)

- Stephen G. Hartke, Derrick Stolee
- Electr. J. Comb.
- 2012

A graph G is uniquely Kr-saturated if it contains no clique with r vertices and if for all edges e in the complement, G + e has a unique clique with r vertices. Previously, few examples of uniquelyâ€¦ (More)

- Derrick Stolee, Chris Bourke, N. V. Vinodchandran
- 2010 IEEE 25th Annual Conference on Computationalâ€¦
- 2010

Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem is equivalent toâ€¦ (More)

- Derrick Stolee
- 2011

Many interesting graph families contain only 2-connected graphs, which have ear decompositions. We develop a technique to generate families of unlabeled 2-connected graphs using ear augmentations andâ€¦ (More)

- Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, Derrick Stolee
- Electr. J. Comb.
- 2010

Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-freeâ€¦ (More)