( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs.

, , и . SIAM J. Discret. Math., 32 (4): 2820-2835 (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.

André Nichterlein

Arno Nichterlein

Gertrud Nichterlein

Senta Nichterlein

Ralf Nichterlein

 

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

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs., , , , , и . Algorithmica, 81 (4): 1584-1614 (2019)Fractals for Kernelization Lower Bounds., , , и . SIAM J. Discret. Math., 32 (1): 656-681 (2018)Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions., , и . STACS, том 254 из LIPIcs, стр. 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time., , , и . IPEC, том 249 из LIPIcs, стр. 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing., , , и . IPEC, том 214 из LIPIcs, стр. 26:1-26:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs., , и . SIAM J. Discret. Math., 32 (4): 2820-2835 (2018)When Can Graph Hyperbolicity be Computed in Linear Time?, , , , , и . Algorithmica, 81 (5): 2016-2045 (2019)Parameterized Complexity of Min-Power Asymmetric Connectivity., , , , и . IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 85-96. Springer, (2019)Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments., , , , и . ACM J. Exp. Algorithmics, (2021)Parameterized Complexity of Diameter., и . Algorithmica, 85 (2): 325-351 (февраля 2023)