Louis Ibarra

14 papers A* 1B 2Journal 10
YearRankTypeTitle / Venue / Authors
2017 J jnl
Computing the clique-separator graph for an interval graph in linear time.
Inf. Process. Lett.
Louis Ibarra
2010 J jnl
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs.
Algorithmica
Louis Ibarra
2009 B conf
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs.
WALCOM
Louis Ibarra
2009 J jnl
A simple algorithm to find Hamiltonian cycles in proper interval graphs.
Inf. Process. Lett.
Louis Ibarra
2009 J jnl
The clique-separator graph for chordal graphs.
Discret. Appl. Math.
Louis Ibarra
2008 J jnl
Fully dynamic algorithms for chordal graphs and split graphs.
ACM Trans. Algorithms
Louis Ibarra
2007 J jnl
Recognizing and representing proper interval graphs in parallel using merging and sorting.
Discret. Appl. Math.
Jørgen Bang-Jensen, Jing Huang, Louis Ibarra
2003 J jnl
Generating and characterizing the perfect elimination orderings of a chordal graph.
Theor. Comput. Sci.
L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada
2001 — —
Dynamic algorithms for chordal and interval graphs.
Louis Ibarra
1999 A* conf
Fully Dynamic Algorithms for Chordal Graphs.
SODA
Louis Ibarra
1997 J jnl
Finding Pattern Matchings for Permutations.
Inf. Process. Lett.
Louis Ibarra
1995 J jnl
Tree Open Ear Decomposition in Parallel Graph Algorithms.
Parallel Process. Lett.
Louis Ibarra, Dana S. Richards
1993 B conf
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.
MFCS
Louis Ibarra, Dana S. Richards
1993 J jnl
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.
Parallel Comput.
Louis Ibarra, Dana S. Richards