Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Roy, Sambuddha"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved algorithms for resource allocation under varying capacity
Venkatesan T. Chakaravarthy
,
Anamitra R. Choudhury
,
Shalmoli Gupta
,
Sambuddha Roy
,
Yogish Sabharwal
Lecture Notes in Computer Science
8737
, 2014, pp. 222-234
Distributed and parallel algorithms for set cover problems with small neighborhood covers
Archita Agarwal
,
Venkatesan T. Chakaravarthy
,
Anamitra R. Choudhury
,
Sambuddha Roy
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 249-261
Knapsack cover subject to a matroid constraint
Venkatesan T. Chakaravarthy
,
Anamitra Roy Choudhury
,
Sivaramakrishnan R. Natarajan
,
Sambuddha Roy
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 275-286
Density functions subject to a co-matroid constraint
Venkatesan T. Chakaravarthy
,
Natwar Modani
,
Sivaramakrishnan R. Natarajan
,
Sambuddha Roy
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 236-248
Scheduling resources for executing a partial set of jobs
Venkatesan T. Chakaravarthy
,
Arindam Pal
,
Sambuddha Roy
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 199-210
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Eric Allender
,
Michal Koucký
,
Detlef Ronneburger
,
Sambuddha Roy
Journal of Computer and System Sciences
77
(1), 2011, pp. 14-40
Resource allocation for covering time varying demands
Venkatesan T. Chakaravarthy
,
Amit Kumar
,
Sambuddha Roy
,
Yogish Sabharwal
Lecture Notes in Computer Science
6942
, 2011, pp. 543-554
Contact center scheduling with strict resource requirements
Aman Dhesi
,
Pranav Gupta
,
Amit Kumar
,
Gyana R. Parija
,
Sambuddha Roy
Lecture Notes in Computer Science
6655
, 2011, pp. 156-169
Finding independent sets in unions of perfect graphs
Venkatesan T. Chakaravarthy
,
Vinayaka Pandit
,
Sambuddha Roy
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 251-259
Deterministically isolating a perfect matching in bipartite planar graphs
Samir Datta
,
Raghav Kulkarni
,
Sambuddha Roy
Theory of Computing Systems
47
(3), 2010, pp. 737-757
Planar and grid graph reachability problems
Eric Allender
,
David A. Mix Barrington
,
Tanmoy Chakraborty
,
Samir Datta
,
Sambuddha Roy
Theory of Computing Systems
45
(4), 2009, pp. 675-723
Approximating decision trees with multiway branches
Venkatesan T. Chakaravarthy
,
Vinayaka Pandit
,
Sambuddha Roy
,
Yogish Sabharwal
Lecture Notes in Computer Science
5555
, 2009, pp. 210-221
Approximating maximum weight
K
-colorable subgraphs in chordal graphs
Venkatesan T. Chakaravarthy
,
Sambuddha Roy
Information Processing Letters
109
(7), 2009, pp. 365-368
Arthur and Merlin as oracles
Venkatesan T. Chakaravarthy
,
Sambuddha Roy
Lecture Notes in Computer Science
5162
, 2008, pp. 229-240
Finding irrefutable certificates for
S^p_2
via Arthur and Merlin
Venkatesan T. Chakaravarthy
,
Sambuddha Roy
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 157-168
Deterministically isolating a perfect matching in bipartite planar graphs
Samir Datta
,
Raghav Kulkarni
,
Sambuddha Roy
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 229-240
Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
Sambuddha Roy
,
William Steiger
Graphs and Combinatorics
23
(S1), 2007, pp. 331-341
Oblivious symmetric alternation
Venkatesan T. Chakaravarthy
,
Sambuddha Roy
Lecture Notes in Computer Science
3884
, 2006, pp. 230-241
The directed planar reachability problem
Eric Allender
,
Samir Datta
,
Sambuddha Roy
Lecture Notes in Computer Science
3821
, 2005, pp. 238-249
Time-space tradeoffs in the counting hierarchy
Eric Allender
,
Michal Koucký
,
Detlef Ronneburger
,
Sambuddha Roy
,
V. Vinay
Proceedings of the 16th Annual IEEE Conference on Computational Complexity (Chicago, Illinois, June 18-21, 2001)
, 2000, pp. 295-302