Ramakrishna Thurimella

Available identifiers

Publication	Date of Publication	Type
Successive approximation in parallel graph algorithms	2022-08-16	Paper
Approximation algorithms for graph augmentation	2019-12-04	Paper
https://portal.mardi4nfdi.de/entity/Q4636000	2018-04-23	Paper
Sub-linear distributed algorithms for sparse certificates and biconnected components	2017-09-29	Paper
Approximation algorithms for data placement on parallel disks	2014-11-18	Paper
Identifying algorithmic vulnerabilities through simulated annealing	2012-11-30	Paper
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching	2000-10-18	Paper
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation	2000-10-17	Paper
https://portal.mardi4nfdi.de/entity/Q4952620	2000-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4228452	1999-05-18	Paper
Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components	1997-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q4893453	1996-11-20	Paper
On computing connected components of line segments	1995-01-01	Paper
Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima	1994-08-14	Paper
Finding Triconnected Components by Local Replacement	1993-09-01	Paper
Approximation Algorithms for Graph Augmentation	1993-05-16	Paper
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity	1993-05-16	Paper
Successive approximation in parallel graph algorithms	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3798261	1988-01-01	Paper

This page was built for person: Ramakrishna Thurimella