Browsing by Subject Parameterized Complexity

Jump to a point in the index:
Showing results 1 to 11 of 11
Issue DateTitleAuthor(s)
May-2018Parameterized Complexity of Minimum k Union ProblemMAITY, SOUMEN; KABRA, ADITYA; Dept. of Mathematics; 20131108
Apr-2019ProbleMS on Temporal GraphsMAITY, SOUMEN; Saurabh, Saket; V M, VISHNU VARDHAN; Dept. of Mathematics; 20141100
May-2019Parameterized Complexity of Fair Feedback Vertex Set ProblemMAITY, SOUMEN; Saurabh, Saket; MULUK, KOMAL; Dept. of Mathematics; 20141179
Mar-2022On the Harmless Set Problem Parameterized by TreewidthGAIKWAD, AJINKYA; MAITY, SOUMEN; Mutzel, Petra; Rahman, Md. Saidur; Slamin; Dept. of Mathematics
Apr-2022Parameterized Algorithms for Graph ProblemsMAITY, SOUMEN; MALLYA, VAIKUNT; Dept. of Mathematics; 20151189
Jul-2024Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by TreewidthFoucaud, Florent; Galby, Esther; Khazaliya, Liana; Li, Shaohua; Inerney, Fionn Mc; Sharma, Roohani; TALE, PRAFULLKUMAR; Dept. of Mathematics
Feb-2025Metric Dimension and Geodetic Set Parameterized by Vertex CoverFoucaud, Florent; Galby, Esther; Khazaliya, Liana; Li, Shaohua; Inerney, Fionn Mc; Sharma, Roohani; TALE, PRAFULLKUMAR; Dept. of Mathematics
Feb-2025MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle TransversalGAIKWAD, AJINKYA; KUMAR, HITENDRA; MAITY, SOUMEN; Saurabh, Saket; Sharma, Roohani; Dept. of Mathematics
Jan-2026The Parameterized Complexity of Graph Editing & MaxMin ProblemsMAITY, SOUMEN; KUMAR, HITENDRA; Dept. of Mathematics; 20172025
Feb-2026Algorithms and Hardness for Geodetic Set on Tree-Like DigraphsFoucaud, Florent; Ghareghani, Narges; Lorieau, Lucas; Mohammad-Noori, Morteza; Oskuei, Rasa Parvini; TALE, PRAFULLKUMAR; Dept. of Mathematics
Feb-2026Parameterized Algorithms for Locally Minimal Defensive AllianceGAIKWAD, AJINKYA; MAITY, SOUMEN; Saurabh, Saket; Dept. of Mathematics