V. Radhakrishnan

zbMath Openradhakrishnan.venkateshMaRDI QIDQ1269903

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Hierarchically specified unit disk graphs Graph-Theoretic Concepts in Computer Science	2024-01-05	Paper
Efficient algorithms for solving systems of linear equations and path problems STACS 92	2022-08-18	Paper
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version) Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94	2016-09-01	Paper
scientific article; zbMATH DE number 2077132 (Why is no real title available?)	2004-07-01	Paper
Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. Information and Computation	2003-01-14	Paper
Efficient algorithms for \(\delta\)-near-planar graph and algebraic problems	2001-09-18	Paper
Hierarchically specified unit disk graphs Theoretical Computer Science	1998-10-22	Paper
The Complexity of Planar Counting Problems SIAM Journal on Computing	1998-09-20	Paper
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems SIAM Journal on Computing	1998-09-20	Paper
Compact location problems Theoretical Computer Science	1998-07-22	Paper
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs Journal of Algorithms	1998-04-26	Paper
scientific article; zbMATH DE number 1113995 (Why is no real title available?)	1998-03-02	Paper

Research outcomes over time

This page was built for person: V. Radhakrishnan