#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2013

2018

- This year (1)
- Last 5 years (9)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nathan Lindzey, Ross M. McConnell
- SIAM J. Discrete Math.
- 2016

Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a lineartime algorithm to find one in any graph that is not an interval graph.â€¦ (More)

- Nathan Lindzey, Ross M. McConnell
- WG
- 2013

Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a lineartime algorithm to find one in any graph that is not an interval graph.â€¦ (More)

- Petr A. Golovach, Pinar Heggernes, +4 authors Jayme Luiz Szwarcfiter
- Discrete Applied Mathematics
- 2017

A graph G = (V,E) is a threshold tolerance graph if each vertex v âˆˆ V can be assigned a weight wv and a tolerance tv such that two vertices x, y âˆˆ V are adjacent if wx +wy â‰¥ min(tx, ty). Currently,â€¦ (More)

- Nathan Lindzey
- Eur. J. Comb.
- 2017

A perfect matching of a complete graph K2n is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if F is family ofâ€¦ (More)

- Nathan Lindzey
- IWOCA
- 2014

Given a graph G, a vertex switch of v âˆˆ V (G) results in a new graph where neighbors of v become nonneighbors and vice versa. This operation gives rise to an equivalence relation over the set ofâ€¦ (More)

A graph G = (V,E) is a threshold tolerance graph if each vertex v âˆˆ V can be assigned a weight wv and a tolerance tv such that two vertices x, y âˆˆ V are adjacent if wx +wy â‰¥ min(tx, ty). Currently,â€¦ (More)

- Nathan Lindzey, Ross M. McConnell
- ArXiv
- 2013

Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a lineartime algorithm to find one in any graph that is not an interval graph.â€¦ (More)

- Radu Curticapean, Nathan Lindzey, Jesper Nederlof
- SODA
- 2018

For even k âˆˆ N, the matchings connectivity matrix Mk is a binary matrix indexed by perfect matchings on k vertices; the entry at (M,M â€²) is 1 iff M âˆªM â€² forms a single cycle. Cygan et al. (STOC 2013)â€¦ (More)

- Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim
- Inf. Process. Lett.
- 2017

A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. Given a digraph G, a partially complemented digraph GÌƒ is a digraphâ€¦ (More)

- â€¹
- 1
- â€º