![]() |
Blakemore Regents Professor of Computer Science
The University of Texas at Austin
Ph.D. Princeton University
You can access copies of recent papers of mine.
A complete listing of my publications is available in my vita.
[vita in Adobe pdf]
Vignesh Manoharan, ``Distributed Fault Tolerant Distance Computation in Graphs: Algorithms and Lower Bounds'', Ph.D., University of Texas at Austin, December 2026.
Udit Agarwal, ``Algorithms, Parallelism and Fine-Grained Complexity for Shortest Path Problems in Sparse Graphs'', Ph.D., University of Texas at Austin, December 2019.
Matteo Pontecorvi, ``Algorithms for Dynamic and Distributed Networks: Shortest Paths, Betweenness Centrality and Related Problems'', Ph.D., University of Texas at Austin, December 2017.
Rezaul Alam Chowdhury, ``Cache-efficient Algorithms and Data Structures: Theory and Experimental Evaluation,'' Ph.D., University of Texas at Austin, August 2007.
Dan Fernholz, ``Sparse Random Graphs: Methods, Structure, and Heuristics,'' Ph.D., University of Texas at Austin, December 2007.
Ganeshkumar Ganapathy, ``Algorithms and Heuristics for Combinatorial Optimization in Phylogeny,'' Ph.D., University of Texas at Austin, August 2006.
Seth Pettie, ``On the Shortest Path and Minimum Spanning Tree Problems,'' Ph.D., University of Texas at Austin, August 2003.
Chung Keung Poon, Postdoctoral Associate, September 1995 to August 1996.
Philip D. MacKenzie , Postdoctoral Associate, September 1992 to August 1994. Co-supervised by Greg Plaxton.
Tsan-sheng Hsu , ``Graph Augmentation and Related Problems: Theory and Practice,'' Ph.D., University of Texas at Austin, December 1993.
Pierre Kelsen , ``Efficient Computation of Extremal Structures in Graphs and Hypergraphs,'' Ph.D., University of Illinois at Urbana-Champaign, Summer 1992.
Arkady Kanevsky, ``Vertex Connectivity of Graphs: Algorithms and Bounds,'' Ph.D., University of Illinois at Urbana-Champaign, Summer 1988.
FALL 2020: CS388G: Algorithms: Techniques and Theory
SPRING 2020: CS331H: Algorithms and Complexity (Honors)
FALL 2019: CS388G: Algorithms: Techniques and Theory
SPRING 2019: CS331: Algorithms and Complexity
FALL 2018:: CS388G: Algorithms: Techniques and Theory
SPRING 2018: CS331H: Algorithms and Complexity (Honors)
SPRING 2017: CS331: Algorithms and Complexity
FALL 2016: CS388P: Parallel Algorithms
| Email: | vlr "at" cs "dot" utexas "dot" edu |
|---|---|
| Phone: | (512) 471-7316 |
| Fax: | (512) 471-8885 |
| Postal: |
Department of Computer Science 2317 Speedway, Stop D9500 The University of Texas at Austin Austin, TX 78712-1188 |