Skip to main content

17 Result(s)

within Sambuddha Roy Remove this filter

and

  1. No Access

    Article

    Botnet traffic identification using neural networks

    Advancement of information and communication techniques have led to share big amount of information which is increasing day by day through online activities and creating new added value over the internet servi...

    Rajib Biswas, Sambuddha Roy in Multimedia Tools and Applications (2021)

  2. No Access

    Chapter and Conference Paper

    Fast Algorithms for Constrained Graph Density Problems

    We consider the question of finding communities in large social networks. In literature and practice, “communities” refer to a well-connected subgraph of the entire network. For instance, the notion of graph dens...

    Venkatesan Chakaravarthy, Neelima Gupta… in WALCOM: Algorithms and Computation (2015)

  3. No Access

    Chapter and Conference Paper

    Improved Algorithms for Resource Allocation under Varying Capacity

    We consider the problem of scheduling a set of jobs on a system that offers certain resource, wherein the amount of resource offered varies over time. For each job, the input specifies a set of possible schedu...

    Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta… in Algorithms - ESA 2014 (2014)

  4. No Access

    Chapter and Conference Paper

    Approximation Algorithms for the Partition Vertex Cover Problem

    We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a cost function c: V → ℤ + , a partition P 1, …, P ...

    Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar… in WALCOM: Algorithms and Computation (2013)

  5. Chapter and Conference Paper

    Scheduling Jobs with Multiple Non-uniform Tasks

    This paper considers the problem of maximizing the throughput of jobs wherein each job consists of multiple tasks. Consider a system offering a uniform capacity of a resource (say unit bandwidth). We are given...

    Venkatesan T. Chakaravarthy, Anamitra Roy Choudhury… in Euro-Par 2013 Parallel Processing (2013)

    Download PDF (213 KB)

  6. No Access

    Article

    Arthur and Merlin as Oracles

    We study some problems solvable in deterministic polynomial time given oracle access to the (promise version of) Arthur–Merlin class. Our main results are the following:

    Venkatesan T. Chakaravarthy, Sambuddha Roy in computational complexity (2011)

  7. No Access

    Chapter and Conference Paper

    Resource Allocation for Covering Time Varying Demands

    We consider the problem of allocating resources to satisfy demand requirements varying over time. The input specifies a demand for each timeslot. Each resource is specified by a start-time, end-time, an associ...

    Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy… in Algorithms – ESA 2011 (2011)

  8. No Access

    Chapter and Conference Paper

    Contact Center Scheduling with Strict Resource Requirements

    Consider the following problem which often arises in contact center scheduling scenarios. We are given a set of employees where each employee can be deployed for shifts consisting of L consecutive time units. Fur...

    Aman Dhesi, Pranav Gupta, Amit Kumar… in Integer Programming and Combinatoral Optim… (2011)

  9. No Access

    Chapter and Conference Paper

    Scheduling Resources for Throughput Maximization

    We consider the problem of scheduling a set of resources over time. Each resource is specified by a set of time intervals (and the associated amount of resource available), and we can choose to schedule it in ...

    Venkatesan T. Chakaravarthy, Amit Kumar… in Approximation, Randomization, and Combinat… (2011)

  10. No Access

    Article

    Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs

    We present a deterministic Logspace procedure, which, given a bipartite planar graph on n vertices, assigns O(log n) bits long weights to its edges so that the minimum weight perfect matching in the graph becomes...

    Samir Datta, Raghav Kulkarni, Sambuddha Roy in Theory of Computing Systems (2010)

  11. No Access

    Article

    Planar and Grid Graph Reachability Problems

    We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for \(\mathsf{NL}\) ...

    Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty… in Theory of Computing Systems (2009)

  12. No Access

    Article

    Space-Efficient Counting in Graphs on Surfaces

    We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the modular setting. We exhibit the pro...

    Mark Braverman, Raghav Kulkarni, Sambuddha Roy in computational complexity (2009)

  13. No Access

    Chapter and Conference Paper

    Approximating Decision Trees with Multiway Branches

    We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fixed set of attributes. The goal...

    Venkatesan T. Chakaravarthy, Vinayaka Pandit… in Automata, Languages and Programming (2009)

  14. No Access

    Chapter and Conference Paper

    Arthur and Merlin as Oracles

    We study some problems solvable in deterministic polynomial time given oracle access to the promise version of the Arthur-Merlin class AM. The main result is that

    Venkatesan T. Chakaravarthy, Sambuddha Roy in Mathematical Foundations of Computer Scien… (2008)

  15. No Access

    Article

    Some Combinatorial and Algorithmic Applications of the Borsuk–Ulam Theorem

    The Borsuk–Ulam theorem has many applications in algebraic topology, algebraic geomtry, and combinatorics. Here we study some combinatorial consequences, typically asserting the existence of a certain combinat...

    Sambuddha Roy, William Steiger in Graphs and Combinatorics (2007)

  16. No Access

    Chapter and Conference Paper

    Oblivious Symmetric Alternation

    We introduce a new class \(\rm {O}^p_2\) as a subclass of the symmetric alternation class

    Venkatesan T. Chakaravarthy, Sambuddha Roy in STACS 2006 (2006)

  17. No Access

    Chapter and Conference Paper

    The Directed Planar Reachability Problem

    We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is logspace-reducible to its complemen...

    Eric Allender, Samir Datta, Sambuddha Roy in FSTTCS 2005: Foundations of Software Techn… (2005)