( en | de | ru )

 

Disambiguation of "Nichterlein, André"

Author of the publication

copydeleteadd this publication to your clipboard
Combating Collusion Rings Is Hard but Possible.

, , and . AAAI, page 4843-4850. AAAI Press, (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

André Nichterlein

Gertrud Nichterlein

Arno Nichterlein

Senta Nichterlein

Ralf Nichterlein

 

Other publications of authors with the same name

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