IIIT-Delhi Institutional Repository

Browsing by Subject "Parameterized Complexity"

Browsing by Subject "Parameterized Complexity"

Sort by: Order: Results:

  • Tomer, Ashwin; Majumdar, Diptapriyo (Advisor) (IIIT-Delhi, 2023-11-29)
    This paper presents significant contributions to the study of the Minimum Eccentricity Shortest Path (MESP) problem in graph theory, with a focus on polynomial kernelization, structural parameters, and special graph classes. ...
  • Sakhuja, Raghav; Majumdar, Diptapriyo (Advisor) (IIIT-Delhi, 2023-11-24)
    Given an undirected graph G = (V,E), an s-club is a vertex subset S ⊆ V (G) such that G[S] has diameter at most s. Formally, an s-Club problem asks if the input graph has an s-club with at least k vertices. There have been ...

Search Repository

Browse

My Account