Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Venkatesan T. Chakaravarthy - MaRDI portal

Venkatesan T. Chakaravarthy

From MaRDI portal
Person:649094

Available identifiers

zbMath Open chakaravarthy.venkatesan-tMaRDI QIDQ649094

List of research outcomes

PublicationDate of PublicationType
Scheduling split intervals with non-uniform demands2021-01-15Paper
Set cover problems with small neighborhood covers2019-09-05Paper
Improved algorithms for resource allocation under varying capacity2018-11-07Paper
Replica placement on bounded treewidth graphs2017-09-22Paper
Replica Placement on Directed Acyclic Graphs2017-04-25Paper
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers2017-02-21Paper
Replica Placement via Capacitated Vertex Cover2017-02-21Paper
Knapsack Cover Subject to a Matroid Constraint2017-02-21Paper
Scheduling Resources for Executing a Partial Set of Jobs2017-01-26Paper
Density Functions subject to a Co-Matroid Constraint.2017-01-26Paper
New results on the computability and complexity of points--to analysis2015-09-11Paper
Fast Algorithms for Constrained Graph Density Problems2015-02-27Paper
Distributed algorithms for scheduling on line and tree networks2014-12-05Paper
Improved Algorithms for Resource Allocation under Varying Capacity2014-10-08Paper
Decision trees for entity identification2014-09-09Paper
https://portal.mardi4nfdi.de/entity/Q49107162013-03-19Paper
Efficient decentralized algorithms for the distributed trigger counting problem2012-12-07Paper
A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints2012-08-29Paper
Finding Independent Sets in Unions of Perfect Graphs2012-08-29Paper
Arthur and Merlin as oracles2011-11-30Paper
Resource Allocation for Covering Time Varying Demands2011-09-16Paper
Scheduling Resources for Throughput Maximization2011-08-17Paper
Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs2010-06-16Paper
Approximating Decision Trees with Multiway Branches2009-07-14Paper
Arthur and Merlin as Oracles2009-02-03Paper
Oblivious Symmetric Alternation2008-03-19Paper
STACS 20042007-10-01Paper
Time-space tradeoff in derandomizing probabilistic logspace2006-10-25Paper
On zero error algorithms having oracle access to one query2006-08-14Paper
Computing and Combinatorics2006-01-11Paper
Competing provers yield improved Karp-Lipton collapse results2005-05-04Paper
https://portal.mardi4nfdi.de/entity/Q47376902004-08-11Paper
On the non-approximability of points-to analysis2003-09-01Paper
https://portal.mardi4nfdi.de/entity/Q44186792003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44145412003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q42216141999-04-11Paper
https://portal.mardi4nfdi.de/entity/Q43556811997-11-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Venkatesan T. Chakaravarthy