( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS.

, , , , и . ICALP, том 107 из LIPIcs, стр. 110:1-110:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Anuradha Sharma

Tripti Sharma

Krishna Sharma

Rahul Sharma

Rahul Sharma

 

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

Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number., , , и . FSTTCS, том 122 из LIPIcs, стр. 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity., , , и . IPEC, том 285 из LIPIcs, стр. 5:1-5:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms., , , , и . SODA, стр. 2785-2800. SIAM, (2018)Domination and Cut Problems on Chordal Graphs with Bounded Leafage., , , , и . Algorithmica, 86 (5): 1428-1474 (мая 2024)A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs., , и . Algorithmica, 83 (6): 1861-1884 (2021)Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number., , , и . Algorithmica, 85 (7): 2065-2086 (июля 2023)On weighted graph separation problems and flow-augmentation., , , и . CoRR, (2022)b-Coloring Parameterized by Pathwidth is XNLP-complete., , и . CoRR, (2022)Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations., , , , и . SODA, стр. 314-345. SIAM, (2024)Quick Separation in Chordal and Split Graphs., , , , и . MFCS, том 170 из LIPIcs, стр. 70:1-70:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)