
Rahul Muthu
(20090915)
An acyclic edge colouring of a graph is an assignment of colours to its edges in such a way that incident edges get distinct colours, and the edges of any cycle use atleast three distinct colours. The latter condition is ...

Narayanan, N.
(, 20100209)
Three graph colouring problems are studied in this thesis with the main focus on 'acyclic edge colouring problem'. The first part of this thesis deals with some classes of graphs and improved upper bounds are obtained. ...

Nitin Saurabh
(, 20170111)


Diptapriyo Majumdar
(, 20181112)
In this thesis, we design some classical and lossy kernels for structural parameterizations of some Packing, Covering, and Connectivity problems. Additionally, we provide some hardness results.
Cycle Packing in undirected ...

Vijayaraghavan, T. C.
(20090916)
In this thesis the results showing a finer classification of the complexity of several algebraic problems that have efficient polynomial time algorithms are obtained. The problems based on Group theory and Linear Algebra ...

Prajakta Nimbhorkar
(20110819)
The focus of this thesis is on the complexity analysis of some computational problems in restricted graphclasses. The problems considered include graph isomorphism, various path problems like reachability, shortest path, ...

Yadu Vasudev
(, 20150326)

Jayalal Sarma, M. N.
(20090918)
This thesis studies some combinatorial, topological and linear algebraic parameters associated with Boolean and arithmetic circuits. It is divided into two parts, the first describes a study of combinations of graph ...

Kurur, Piyush P.
(20090923)
This thesis studies the Graph Isomorphism and problems that arise in Galois theory. It is targeted to use structural properties of permutation groups together with other algebraic techniques to prove complexity upper ...

Soumya Paul
(, 20120705)
The aim of this work is to study large games: games with a large number
of players and/or with a large temporal, spatial or logical structure, using
techniques from automata theory, logic and game theory. It is argued ...

Madhusudan, P.
(20090828)
This thesis studies the problem of automated synthesis of controllers and systems against formal specifications. The two central aims are to study these control problems for branching time specifications and to study them ...

Amaldev Manuel
(, 20120705)
This thesis takes shape in the ongoing study of automata and logics for data words  finite words labelled with elements from an infinite alphabet. The notion of data words is a natural way for modelling unboundedness ...

Vinodchandran, N.V.
(, 20090819)
The main contribution of this thesis is in proving upper bounds on the counting complexity of some computational problems that arise from group theory. It consists of two parts. The first part concentrates on studying the ...

Ramanathan Thinniyam Srinivasan
(, )

Fahad, P
(20151231)
This thesis studies algorithms mainly in the parameterized complexity framework.
The thesis has three conceptual parts, (i) efficient computation of representative
families, and its application in FPT and exact algorithms, ...

Saket Saurabh
(20090917)
The class of NPhard combinatorial optimization problems, need to be solved exactly for various applications in theory and practice, brings the need for exact algorithms. Parameterized complexity is an exact algorithmic ...

Limaye, Nutan
(, 20100413)
The Complexity classes contained in LogCFL is explored in this thesis by drawing connections to Language theory. Many depth reduction techniques involved in this process are studied along the way. The two factor2 ...

Aravind, N. R.
(20110825)
This thesis deals mainly with two related coloring problems  forbidden subgraph
colorings and oriented colorings. The former deals with proper colorings of vertices or edges of a graph with constraints on the union of ...

Suresh, S. P.
(20090909)
One of the central problems in the automatic verification of security protocols is that of verifying whether a given protocol leaks secrets or not. It identifies syntactic subclasses of protocols for which the secrecy ...