vix.ing · top · new · best · stats · spec

Tale, Prafullkumar

  1. Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
    2022/06/30 by Galby, Esther, Khazaliya, Liana, Inerney, Fionn Mc +2 · 3 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  2. Metric Dimension and Geodetic Set Parameterized by Vertex Cover
    2024/05/02 by Foucaud, Florent, Galby, Esther, Khazaliya, Liana +4 · 4 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  3. Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
    2023/07/16 by Foucaud, Florent, Galby, Esther, Khazaliya, Liana +4 · 4 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  4. On the Parameterized Complexity Of Grid Contraction
    2020/08/18 by Saket Saurabh, Uéverton S. Souza, Saurabh, Saket +3 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Coding theory and cryptography #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Interconnection Networks and Systems
  5. On the Parameterized Complexity of Maximum Degree Contraction Problem
    2020/09/24 by Saurabh, Saket, Tale, Prafullkumar · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  6. Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
    2024/02/13 by Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo +1 · 3 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  7. Romeo and Juliet Meeting in Forest Like Regions
    2022/10/05 by Misra, Neeldhara, Mulpuri, Manas, Tale, Prafullkumar +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  8. On the Parameterized Complexity of Contraction to Generalization of\n Trees
    2017/08/02 by Akanksha Agrawal, Agrawal, Akanksha, Saket Saurabh +3 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
  9. Conflict and Fairness in Resource Allocation
    2024/03/07 by Bandopadhyay, Susobhan, Banik, Aritra, Gupta, Sushmita +4 · 1 citation
    #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  10. Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
    2025/04/24 by Tale, Prafullkumar · 3 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  11. The Parameterized Complexity of Computing the VC-Dimension
    2025/10/20 by Foucaud, Florent, Gahlawat, Harmender, Inerney, Fionn Mc +1 · 1 citation
    #Artificial Intelligence (cs.AI) #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG)