Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. - Louis Ibarra; Dana S. Richards (Parallel Comput., 1993)

Tree Open Ear Decomposition in Parallel Graph Algorithms. - Louis Ibarra; Dana S. Richards (Parallel Process. Lett., 1995)

Finding Pattern Matchings for Permutations. - Louis Ibarra (Inf. Process. Lett., 1997)

Fully Dynamic Algorithms for Chordal Graphs. - Louis Ibarra (SODA, 1999)

Dynamic algorithms for chordal and interval graphs. - Louis Ibarra (2001)

Generating and characterizing the perfect elimination orderings of a chordal graph. - L. Sunil Chandran; Louis Ibarra; Frank Ruskey; Joe Sawada (Theor. Comput. Sci., 2003)

Recognizing and representing proper interval graphs in parallel using merging and sorting. - Jørgen Bang-Jensen; Jing Huang 007; Louis Ibarra (Discret. Appl. Math., 2007)

Fully dynamic algorithms for chordal graphs and split graphs. - Louis Ibarra (ACM Trans. Algorithms, 2008)

A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs. - Louis Ibarra (WALCOM, 2009)

The clique-separator graph for chordal graphs. - Louis Ibarra (Discret. Appl. Math., 2009)

A simple algorithm to find Hamiltonian cycles in proper interval graphs. - Louis Ibarra (Inf. Process. Lett., 2009)

A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs. - Louis Ibarra (Algorithmica, 2010)

Computing the clique-separator graph for an interval graph in linear time. - Louis Ibarra (Inf. Process. Lett., 2017)