Kernelization of ARC DISJOINT CYCLE PACKING in α-Bounded Digraphs

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

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting

von Lokshtanov, Daniel
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 1 of 4 (2021)

Strong Connectivity Augmentation is FPT

von Klinkby, Kristine Vitting
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 1 of 4 (2021)

Parameterized and exact computation : 5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 ; proceedings

Veröffentlicht 2010

A Constant Factor Approximation for Navigating through Connected Obstacles in the Plane

von Kumar, Neeraj
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 2 of 4 (2021)

Output Sensitive Fault Tolerant Maximum Matching

von Banerjee, Niranka
Veröffentlicht in International Computer Science Symposium (17. : 2022 : Online) Computer science - theory and applications (2022)

Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis

von Gupta, Sushmita
Veröffentlicht in Mathematical programming and game theory (2018)

Parameterized Algorithms for Finding Highly Connected Solution

von Abhinav, Ankit
Veröffentlicht in International Computer Science Symposium (17. : 2022 : Online) Computer science - theory and applications (2022)

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)

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs

von Golovach, Petr A.
Veröffentlicht in International Computer Science Symposium (17. : 2022 : Online) Computer science - theory and applications (2022)

Kernelization : theory of parameterized preprocessing

von Fomin, Fedor V.
Veröffentlicht 2019

Kernelization : theory of parameterized preprocessing

von Fomin, Fedor V.
Veröffentlicht 2019

Fixed Parameter Tractability of Graph Deletion Problems over Data Streams

von Bishnu, Arijit
Veröffentlicht in COCOON (26. : 2020 : Online) Computing and combinatorics (2020)

Gehrlein Stable Committee wıth Multi-modal Preferences

von Gupta, Sushmita
Veröffentlicht in SAGT (15. : 2022 : Colchester) Algorithmic game theory (2022)

Parameterized Algorithms for Eccentricity Shortest Path Problem

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

Parameterized Complexity of MAXIMUM EDGE COLORABLE SUBGRAPH

von Agrawal, Akanksha
Veröffentlicht in COCOON (26. : 2020 : Online) Computing and combinatorics (2020)

Subexponential Parameterized Algorithms on Disk Graphs

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

A Framework for Approximation Schemes on Disk Graphs

von Lokshtanov, Daniel
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 3 of 7 (2023)

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms

von Gupta, Sushmita
Veröffentlicht in SAGT (14. : 2021 : Aarhus) Algorithmic Game Theory (2021)