Parameterized algorithms, computational social choice, combinatorial games, satisfiability, and graph problems.
Research Area
Theoretical Computer Science
The theory group studies algorithms, complexity, graph problems, algebraic computation, quantum algorithms, computational social choice, and the foundations of efficient computation.
Featured Video
Theoretical computer science at IIT Gandhinagar
Research Themes
What the group works on
Parameterized and exact algorithms Graph algorithms and dynamic graph problems Computational complexity and algebraic computation Quantum algorithms and algebraic/combinatorial problems Computational social choice and games
Faculty
People shaping this area
Graph algorithms, dynamic graphs, shortest paths, and algorithmic graph theory.
Algorithms for algebraic and combinatorial problems, quantum algorithms, and complexity theory.
Computational complexity, algebraic complexity, circuit complexity, and low-level computational models.
Randomized algorithms, sketching, large-scale data algorithms, and algorithmic foundations of machine learning.
Selected Publications
Recent Publications
Finding and counting patterns in sparse graphs
JCSS 2026 - graph algorithms and sparse graph structure.
On the Parameterized Complexity of Diverse SAT
Theoretical Computer Science 2026 - parameterized complexity.
VP, VNP and Algebraic Branching Programs over Min-Plus Semirings
2026 preprint - algebraic complexity over semirings.
Ferry Cover with Connectivity Constraints
FUN 2026 - algorithmic graph covering constraints.
Projects & Outputs
Representative Projects
Approximate Shortest Paths in Graphs
ANRF ARG MATRICS project led by Manoj D Gupta.
Quantum Algorithms for Group Theoretic Problems
ANRF ARG MATRICS project led by Bireswar Das.
On the Role of Multilinearity and Monotonicity in Algebraic Computation
ANRF ARG MATRICS project led by Balagopal Komarath.