Advisor

Sort by: Order: Results:

  • DARSAN, T I (27-05)
    The first part of the thesis is mainly a literature study of the book, ”Exact Exponential Algorithms” by Fomin and Krastch. We explain different techniques to solve computational problems through exact algorithms. The ...
  • GUPTA, RUCHI (2011-05)
    There has been a lot of research on covering arrays in the last two decades and most of it includes construction, application and generalization of covering arrays. The main focus of this thesis is the group construction ...
  • CHAUHAN, GAURAV (2011-05)
    This thesis contains some results for permutation polynomials over finite fields. In this thesis is contained the synopsis of known results and some knew classes of permutation polynomials over finite fields have been provided.
  • SINGH, VASUMITRA (2013-05)
  • PALIWAL, ANKUR (2013-05)
  • BASU, SOURAJIT (2014-05)
    The project we have undertaken concerns extremal combinatorics. Two core concepts in extremal set theory are intersecting families and shadows. A family of subsets of a given set X whose members have size k and pair ...
  • CHANDRASEKHARAN, RESHMA (2015-05)
    A covering array of size n, strength t, degree k and order g is a k n array on a set of g symbols with the property that in each t n subarray, every t 1 column appears at least once. Covering arrays have been studied for ...
  • KABRA, ADITYA (2018-05)
    Parameterized Complexity offers an alternative perspective to deal with NP-hard problems. For certain problems, when some additional structure (parameter) of the problem is given, there exists efficient algorithms which ...
  • JOSHI, CHINMAY (2019-04)
    Given a graph G = (V,E) with n vertices and a positive integer s ≤ n, we want to find a set S ⊆ V of size s such that |N[S]| is minimum, where N[S] denotes closed neighbourhood of S. We call this problem as the minimum ...
  • GUNDA, SPOORTHY (2019-04)
    We study a few graph contraction problems Chordal Contraction, Clique Contraction and Split Contraction, from the viewpoint of Lossy Kernelization, which is a recently introduced framework to study NP-hard problems. ...
  • V M, VISHNU VARDHAN (2019-04)
    The idea of temporal graphs can be thought of as a recent addition to the extensively researched concept of graph theory. The advent of cheap wireless communication devices and need of efficient communication protocols, ...
  • MULUK, KOMAL (2019-05)
    Feedback Vertex Set (FVS) problem is a well known NP-complete problem in computational complexity theory. This is a vertex deletion problem in which given a graph G=(V,E) and an integer k, we are asked to find a subset ...
  • MALLYA, VAIKUNT (2022-04)
    The fixed parameter approach to a problem is a technique of designing an algorithm to solve combinatorially hard problems. A parameterized problem has an input instance x as well as a parameter k which is sufficiently small ...
  • KARRA, MOHAN (2023-01)
    In this thesis, we study the theory of parametrized complexity and examine parameterized complexity of the Hiding Leader problem. We discuss standard tools and techniques for showing the fixed-parameter tractability of ...
  • NEVE, MIHIR (2023-04)
    In this thesis, we take a closer look at the Erdos-Hajnal Conjecture. A Graph $H$ is said to have the Erdos-Hajnal (EH) property if, for some constant $\gamma(H) > 0$, every sufficiently large $H$-free graph $G$ has a ...
  • RACHURI, ANIRUDH RAGHAVA (2023-05)
    Numerous computational problems on graphs remain computationally intractable and are termed NP-complete problems. In this thesis, we study one of the ways to tackle this issue: we restrict the input graphs by specifying ...
  • E S, AJAYKRISHNAN (2023-05)
    A knot K in a directed graph D = (V, E) is a strongly connected subgraph of D with at least two vertices, such that there is no arc (u, v) of D with u in V (K) and v not in V (K). Given a directed graph D = (V, E), we study ...

Search Repository


Advanced Search

Browse

My Account