14 citations · 15 across the 2 of their papers we have counts for
3 papers
math.CO2016★ 14 cited
A generalization of the Grid Theorem
Jim Geelen, Benson Joeris
A graph has tree-width at most if it can be obtained from a set of graphs each with at most vertices by a sequence of clique sums. We refine this definition by, for each…
cs.CG2015★ 1 cited
Geometric Spanning Cycles in Bichromatic Point Sets
Benson Joeris, Isabel Urrutia, Jorge Urrutia
Given a set of points in the plane each colored either red or blue, we find non-self-intersecting geometric spanning cycles of the red points and of the blue points such that each…
cs.DS2013
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs
Benson Joeris, Nathan Lindzey, Ross M. McConnell +1
A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented digraph is a…