- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| 11 |      | Louis Ibarra: A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs. WALCOM 2009: 190-201 |
| 10 | | Louis Ibarra: The clique-separator graph for chordal graphs. Discrete Applied Mathematics 157(8): 1737-1749 (2009) |
| 9 | | Louis Ibarra: A simple algorithm to find Hamiltonian cycles in proper interval graphs. Inf. Process. Lett. 109(18): 1105-1108 (2009) |
| 2008 | ||
| 8 | | Louis Ibarra: Fully dynamic algorithms for chordal graphs and split graphs. ACM Transactions on Algorithms 4(4): (2008) |
| 2007 | ||
| 7 | | Jørgen Bang-Jensen, Jing Huang, Louis Ibarra: Recognizing and representing proper interval graphs in parallel using merging and sorting. Discrete Applied Mathematics 155(4): 442-456 (2007) |
| 2003 | ||
| 6 | | L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada: Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307(2): 303-317 (2003) |
| 1999 | ||
| 5 | | Louis Ibarra: Fully Dynamic Algorithms for Chordal Graphs. SODA 1999: 923-924 |
| 1997 | ||
| 4 | | Louis Ibarra: Finding Pattern Matchings for Permutations. Inf. Process. Lett. 61(6): 293-295 (1997) |
| 1995 | ||
| 3 |  | Louis Ibarra, Dana S. Richards: Tree Open Ear Decomposition in Parallel Graph Algorithms. Parallel Processing Letters 5: 129-138 (1995) |
| 1993 | ||
| 2 | | Louis Ibarra, Dana S. Richards: Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. MFCS 1993: 506-516 |
| 1 | | Louis Ibarra, Dana S. Richards: Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. Parallel Computing 19(8): 873-886 (1993) |
| 1 | Jørgen Bang-Jensen | [7] |
| 2 | L. Sunil Chandran | [6] |
| 3 | Jing Huang | [7] |
| 4 | Dana S. Richards | [1] [2] [3] |
| 5 | Frank Ruskey | [6] |
| 6 | Joe Sawada | [6] |