Louis Ibarra

I work in the areas of dynamic graph algorithms, parallel algorithms, computational biology, and data structures.  (You can read about computational biology and bioinformatics here.)  I'm part of the Theoretical Computer Science Group at DePaul University.

I completed post-doctoral fellowships with Pavol Hell at Simon Fraser University and with Jing Huang at the University of Victoria in 2001-2002.

I received my Ph.D. in Computer Science from the University of Victoria in 2001.  My thesis was Dynamic algorithms for chordal and interval graphs and my advisor was Valerie King.

Journal articles under review

• A fully dynamic graph algorithm for recognizing proper interval graphs. L. Ibarra. Submitted 2008. Download PDF. Download PS.  Abridged version presented at 3^rd International Workshop on Algorithms and Computation (WALCOM 2009), Kolkata, India, 18–20 February 2009.

Journal articles

• A simple algorithm to find Hamiltonian cycles in proper interval graphs. L. Ibarra. Accepted by Information Processing Letters, 2009. Download PDF. Download PS.
   
• A fully dynamic graph algorithm for recognizing interval graphs. L. Ibarra. Accepted by Algorithmica, 2009. Download PDF. Download PS.
   
• The clique-separator graph for chordal graphs. L. Ibarra. Discrete Applied Mathematics, 157, 1737-1749, 2009. Download PDF. Also available through ScienceDirect here.
   
• Fully dynamic algorithms for chordal graphs and split graphs. L. Ibarra. ACM Transactions on Algorithms, 4 (4), 40:1–20, 2008. Download PDF. Download PS. Preliminary version appeared in 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 923-924, 1999.
   
• Recognizing and representing proper interval graphs in parallel using merging and sorting. J. Bang-Jensen, J. Huang, and L. Ibarra. Discrete Applied Mathematics, 155(5), 442–456, 2007. Download PDF. Download PS.
   
• Generating and characterizing the perfect elimination orderings of a chordal graph. L. S. Chandran, L. Ibarra, F. Ruskey, and J. Sawada. Theoretical Computer Science, 307(2), 303–317, 2003. Download PDF. Download PS.
  
  
• Finding pattern matchings in permutations. L. Ibarra. Information Processing Letters, 61(6), 293-295, 1997. Download PDF. Download PS.
   
• Tree open ear decomposition in parallel graph algorithms. L. Ibarra and D. Richards. Parallel Processing Letters, 5(2), 129-138, 1995.
  
  
• Efficient parallel graph algorithms based on open ear decomposition. L. Ibarra and D. Richards. Parallel Computing, 19(8), 1993, 873-886. Also in Mathematical Foundations of Computer Science, Gdansk, Poland, Lecture Notes in Computer Science 711, 506-516, 1993.

Technical report

• Fully dynamic algorithms for bounded genus graphs. M. R. Henzinger, L. Ibarra, and V. King. University of Victoria Technical Report, DCS-261-IR, 1997. Download PDF. Download PS.

Other

I organized Midwest Theory Day on December 4, 2004.

Go to main page.