Louis Ibarra

According to our database, Louis Ibarra authored at least 13 papers between 1993 and 2017.

Collaborative distances:

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

2017

Computing the clique-separator graph for an interval graph in linear time.

Louis Ibarra

Inf. Process. Lett., 2017

2010

A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs.

Louis Ibarra

Algorithmica, 2010

2009

A simple algorithm to find Hamiltonian cycles in proper interval graphs.

Louis Ibarra

Inf. Process. Lett., 2009

The clique-separator graph for chordal graphs.

Louis Ibarra

Discret. Appl. Math., 2009

A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs.

Louis Ibarra

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

Fully dynamic algorithms for chordal graphs and split graphs.

Louis Ibarra

ACM Trans. Algorithms, 2008

2007

Recognizing and representing proper interval graphs in parallel using merging and sorting.

Jørgen Bang-Jensen, Jing Huang, Louis Ibarra

Discret. Appl. Math., 2007

2003

Generating and characterizing the perfect elimination orderings of a chordal graph.

L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada

Theor. Comput. Sci., 2003

2001

Dynamic algorithms for chordal and interval graphs.

Louis Ibarra

PhD thesis, 2001

1999

Fully Dynamic Algorithms for Chordal Graphs.

Louis Ibarra

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1997

Finding Pattern Matchings for Permutations.

Louis Ibarra

Inf. Process. Lett., 1997

1995

Tree Open Ear Decomposition in Parallel Graph Algorithms.

Louis Ibarra, Dana S. Richards

Parallel Process. Lett., 1995

1993

Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.

Louis Ibarra, Dana S. Richards

Parallel Comput., 1993