An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. - Andrew R. Curtis; Clemente Izurieta; Benson L. Joeris; Scott M. Lundberg; Ross M. McConnell (WG, 2006)

O(m logn) Split Decomposition of Strongly Connected Graphs. - Benson L. Joeris; Scott M. Lundberg; Ross M. McConnell (Graph Theory, Computational Intelligence and Thought, 2009)

An implicit representation of chordal comparability graphs in linear time. - Andrew R. Curtis; Clemente Izurieta; Benson L. Joeris; Scott M. Lundberg; Ross M. McConnell (Discret. Appl. Math., 2010)

O(mlogn) split decomposition of strongly-connected graphs. - Benson L. Joeris; Scott M. Lundberg; Ross M. McConnell (Discret. Appl. Math., 2010)

Linear-Time Recognition of Helly Circular-Arc Models and Graphs. - Benson L. Joeris; Min Chih Lin; Ross M. McConnell; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Algorithmica, 2011)

Monitoring the Plane with Rotating Radars. - Jurek Czyzowicz; Stefan Dobrev; Benson L. Joeris; Evangelos Kranakis; Danny Krizanc; Ján Manuch; Oscar Morales-Ponce; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (Graphs Comb., 2015)

Geometric Spanning Cycles in Bichromatic Point Sets. - Benson L. Joeris; Isabel Urrutia; Jorge Urrutia (Graphs Comb., 2015)

Simple DFS on the complement of a graph and on partially complemented digraphs. - Benson L. Joeris; Nathan Lindzey; Ross M. McConnell; Nissa Osheim (Inf. Process. Lett., 2017)