( en | de | ru )

 

Disambiguation of "Nichterlein, André"

Author of the publication

copydeleteadd this publication to your clipboard
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.

, , , , and . ISAAC, volume 123 of LIPIcs, page 36:1-36:13. 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. You can also use the button next to the name to display some publications already assigned to the person.

André Nichterlein

Arno Nichterlein

Gertrud Nichterlein

Senta Nichterlein

Ralf Nichterlein

 

Other publications of authors with the same name

Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints., , , and . COMPLEX NETWORKS (2), volume 882 of Studies in Computational Intelligence, page 494-506. Springer, (2019)Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality., , , and . WG, volume 12911 of Lecture Notes in Computer Science, page 219-231. Springer, (2021)Destroying Densest Subgraphs Is Hard., , and . SWAT, volume 294 of LIPIcs, page 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)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)Parameterized Complexity of Diameter., and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 50-61. Springer, (2019)There and Back Again: On Applying Data Reduction Rules by Undoing Others., , , and . ESA, volume 244 of LIPIcs, page 53:1-53:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering., , , and . CIAC, volume 12701 of Lecture Notes in Computer Science, page 216-230. Springer, (2021)Graph Clustering Problems Under the Lens of Parameterized Local Search., , , and . IPEC, volume 285 of LIPIcs, page 20:1-20:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)