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. ...

This thesis is a study on the existence of algorithms for NP-hard problems in the interval of algorithmic complexity between linear and logarithmic space. In the early days, much research was conducted on the existence of ...

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 ...

A Dold manifold is defined as the quotient space Sm × CP n /∼, where (s, L) ∼ (−s, L̄). These manifolds were first introduced by Albrecht Dold in 1956 to construct generators in odd dimensions for Thom’s unoriented cobordism ...

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 ...