Researcher Portfolio

Dr. Kumar, V. S. Anil

Algorithms and Complexity, MPI for Informatics, Max Planck Society

Researcher Profile

Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society

Researcher ID: https://pure.mpg.de/cone/persons/resource/persons44863

External references

WorldCat Search for Kumar, V. S. Anil

Google Scholar Search for Kumar, V. S. Anil

Publications

: Kumar, V. S. A. (2001). Coupling vs. conductance for the Jerrum-Sinclair chain. Random Structures & Algorithms, 18, 1-17. [PubMan] : Krysta, P., & Kumar, V. S. A. (2001). Approximation Algorithms for Minimum Size 2-connectivity Problems. In A. Ferreira, & H. Reichel (Eds.), Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01) (pp. 431-442). Berlin, Germany: Springer. [PubMan] : Kumar, V. S. A., Arya, S., & Hariharan, R. (2000). Hardness of Set Cover with Intersection 1. In U. Montanari, J. D. P. Rolim, & E. Welzl (Eds.), Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00) (pp. 624-635). Berlin, Germany: Springer. [PubMan] : Kumar, V. S. A., & Hariharan, R. (1999). Covering Rectilinear Polygons with Axis-Parallel Rectangles. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99) (pp. 445-454). New York, USA: ACM. [PubMan] : Kumar, V. S. A., & Hariharan, R. (1999). Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99) (pp. 241-251). Los Alamitos, USA: IEEE. [PubMan]