Benson L. Joeris

According to our database, Benson L. Joeris authored at least 8 papers between 2006 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

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

2015

Geometric Spanning Cycles in Bichromatic Point Sets.

Benson L. Joeris, Isabel Urrutia, Jorge Urrutia

Graphs Comb., 2015

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

2011

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

2010

O(mlogn) split decomposition of strongly-connected graphs.

Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell

Discret. Appl. Math., 2010

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

2009

<i>O</i>(<i>m</i> log<i>n</i>) Split Decomposition of Strongly Connected Graphs.

Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell

Proceedings of the Graph Theory, 2009

2006

An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time.

Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006