Parameterized Complexity of Fair Feedback Vertex Set Problem.

von Kanesh, Lawqueen
Veröffentlicht in International Computer Science Symposium (15. : 2020 : Online) Computer science - theory and applications (2020)

Odd Cycle Transversal in Mixed Graphs

von Das, Avinandan
Veröffentlicht in WG (47. : 2021 : Online) Graph-Theoretic Concepts in Computer Science (2021)

Identifying and Eliminating Majority Illusion in Social Networks

von Grandi, Umberto
Veröffentlicht in AAAI Conference on Artificial Intelligence (37. : 2023 : Washington, DC; Online) 37th AAAI Conference on Artificial Intelligence (AAAI-23) ; Volume 4, part 2 of 2 (2023)

Parameterized Algorithms for Eccentricity Shortest Path Problem

von Bhyravarapu, Sriram
Veröffentlicht in IWOCA (34. : 2023 : Tai nan) Combinatorial algorithms (2023)

Circumventing Connectivity for Kernelization

von Jain, Pallavi
Veröffentlicht in CIAC (12. : 2021 : Online) Algorithms and Complexity (2021)

Burn and Win

von Ashok, Pradeesha
Veröffentlicht in IWOCA (34. : 2023 : Tai nan) Combinatorial algorithms (2023)

On the Complexity of Singly Connected Vertex Deletion

von Das, Avinandan
Veröffentlicht in IWOCA (31. : 2020 : Online) Combinatorial algorithms (2020)

On the Parameterized Complexity of Minus Domination

von Bhyravarapu, Sriram
Veröffentlicht in SOFSEM (49. : 2024 : Cochem) SOFSEM 2024: theory and practice of computer science (2024)

Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage

von Jain, Pallavi
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 5 of 7 (2023)

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent

von Agrawal, Akanksha
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 3 of 5 (2022)