( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Eliminating Crossings in Ordered Graphs

, , , , , , и . Proc. 19th Scand. Symp. Algorithm Theory (SWAT'24), том из LIPIcs, Schloss Dagstuhl -- Leibniz-Institut für Informatik, (2024)To appear..

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.

Naman Sharma

P-O Fit and Employee's Turnover Intentions: Examining the Mediation of Employee Engagement in Indian IT Sector.. Int. J. Hum. Cap. Inf. Technol. Prof., 10 (2): 51-60 (2019)

Krishna Sharma

Anuradha Sharma

Tripti Sharma

Rahul Sharma

 

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

Balanced Substructures in Bicolored Graphs., , , и . CoRR, (2024)Kernels for Deletion to Classes of Acyclic Digraphs., , , и . ISAAC, том 64 из LIPIcs, стр. 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Parameterized Complexity of Deletion to ℋ-Free Strong Components., , , и . MFCS, том 170 из LIPIcs, стр. 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Balanced Judicious Bipartition is Fixed-Parameter Tractable., , , и . FSTTCS, том 93 из LIPIcs, стр. 40:40-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Kernelizing Buttons and Scissors., , , и . CCCG, стр. 279-286. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces, , , , , , , , и . Proc. 51st International Colloquium on Automata, Languages and Programming (ICALP'24), (2024)On the Parameterized Complexity of Deletion to H-free Strong Components., , , и . CoRR, (2020)Balanced Judicious Partition is Fixed-Parameter Tractable., , , и . CoRR, (2017)Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331)., , , , , , , , , и 19 other автор(ы). Dagstuhl Reports, 13 (8): 1-45 (2023)A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs., , и . Algorithmica, 83 (6): 1861-1884 (2021)