( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Kernelization of Cycle Packing with Relaxed Disjointness Constraints.

, , , , и . SIAM J. Discret. Math., 32 (3): 1619-1643 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Sudipta Majumdar

Rupak Majumdar

Amitabha Majumdar

Marcus Majumdar

Taradas Majumdar

 

Другие публикации лиц с тем же именем

Valued Authorization Policy Existence Problem: Theory and Experiments., , , , и . CoRR, (2021)Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover., , , и . CoRR, (2024)FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters., и . FAW, том 10336 из Lecture Notes in Computer Science, стр. 209-220. Springer, (2017)Parameterized Complexity of Deletion to Scattered Graph Classes., , и . IPEC, том 180 из LIPIcs, стр. 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Exact and Parameterized Algorithms for (k, i)-Coloring., , , и . CALDAM, том 10156 из Lecture Notes in Computer Science, стр. 281-293. Springer, (2017)Kernelization of Cycle Packing with Relaxed Disjointness Constraints., , , , и . ICALP, том 55 из LIPIcs, стр. 26:1-26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized Pre-coloring Extension and List Coloring Problems., , , и . CoRR, (2019)Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems., , и . CoRR, (2023)p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms., , , , и . CoRR, (2020)Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels., , и . CoRR, (2017)