Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. - Venkatesh Radhakrishnan; Harry B. Hunt III; Richard Edwin Stearns (STACS, 1992)

Compact Location Problems. - Venkatesh Radhakrishnan; Sven Oliver Krumke; Madhav V. Marathe; Daniel J. Rosenkrantz; S. S. Ravi (FSTTCS, 1993)

Hierarchical Specified Unit Disk Graphs (Extended Abstract). - Madhav V. Marathe; Venkatesh Radhakrishnan; Harry B. Hunt III; S. S. Ravi (WG, 1993)

A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (ESA, 1994)

Approximation Schemes Using L-Reductions. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (FSTTCS, 1994)

Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). - Madhav V. Marathe; Harry B. Hunt III; Richard Edwin Stearns; Venkatesh Radhakrishnan (STOC, 1994)

Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results. - Madhav V. Marathe; Harry B. Hunt III; Richard Edwin Stearns; Venkatesh Radhakrishnan (Satisfiability Problem: Theory and Applications, 1996)

Compact Location Problems. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz (Theor. Comput. Sci., 1997)

Hierarchically Specified Unit Disk Graphs. - Madhav V. Marathe; Venkatesh Radhakrishnan; Harry B. Hunt III; S. S. Ravi (Theor. Comput. Sci., 1997)

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (J. Algorithms, 1998)

The Complexity of Planar Counting Problems. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; Richard Edwin Stearns (SIAM J. Comput., 1998)

Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. - Madhav V. Marathe; Harry B. Hunt III; Richard Edwin Stearns; Venkatesh Radhakrishnan (SIAM J. Comput., 1998)

Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (Inf. Comput., 2002)

Fine Grain Provenance Using Temporal Databases. - Dieter Gawlick; Venkatesh Radhakrishnan (TaPP, 2011)

A Generic Provenance Middleware for Queries, Updates, and Transactions. - Bahareh Arab; Dieter Gawlick; Venkatesh Radhakrishnan; Hao Guo; Boris Glavic (TAPP, 2014)

Interoperability for Provenance-aware Databases using PROV and JSON. - Xing Niu 002; Boris Glavic; Dieter Gawlick; Zhen Hua Liu; Vasudha Krishnaswamy; Venkatesh Radhakrishnan (TaPP, 2015)

Reenactment for Read-Committed Snapshot Isolation. - Bahareh Sadat Arab; Dieter Gawlick; Vasudha Krishnaswamy; Venkatesh Radhakrishnan; Boris Glavic (CIKM, 2016)

Provenance-Aware Query Optimization. - Xing Niu 002; Raghav Kapoor; Boris Glavic; Dieter Gawlick; Zhen Hua Liu; Venkatesh Radhakrishnan (ICDE, 2017)

Using Reenactment to Retroactively Capture Provenance for Transactions. - Bahareh Sadat Arab; Dieter Gawlick; Vasudha Krishnaswamy; Venkatesh Radhakrishnan; Boris Glavic (IEEE Trans. Knowl. Data Eng., 2018)

Heuristic and Cost-Based Optimization for Diverse Provenance Tasks. - Xing Niu 002; Raghav Kapoor; Boris Glavic; Dieter Gawlick; Zhen Hua Liu; Vasudha Krishnaswamy; Venkatesh Radhakrishnan (IEEE Trans. Knowl. Data Eng., 2019)