E-LIB Suche - Ergebnisse für: Nichterlein, André

1

Fast Parameterized Preprocessing for Polynomial-Time Solvab..:

Himmel, Anne-Sophie ; Mertzios, George B. ; Nichterlein, André.
Communications of the ACM. 67 (2024) 4 - p. 70-79 , 2024

Link: https://doi.org/10.1145/..

2

Towards Classifying the Polynomial-Time Solvability of Temp..:

Rymar, Maciej ; Molter, Hendrik ; Nichterlein, André.
Journal of Graph Algorithms and Applications. 27 (2023) 3 - p. 173-194 , 2023

Link: https://doi.org/10.7155/..

3

Polynomial-time data reduction for weighted problems beyond..:

Bentert, Matthias ; van Bevern, René ; Fluschnik, Till..
Discrete Applied Mathematics. 328 (2023) - p. 117-133 , 2023

Link: https://doi.org/10.1016/..

4

Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint ..:

Bentert, Matthias ; Nichterlein, André ; Renken, Malte.
SIAM Journal on Discrete Mathematics. 37 (2023) 3 - p. 1674-1703 , 2023

Link: https://doi.org/10.1137/..

5

Parameterized Algorithms for Power-Efficiently Connecting W..:

Bentert, Matthias ; van Bevern, René ; Nichterlein, André..
INFORMS Journal on Computing. 34 (2022) 1 - p. 55-75 , 2022

Link: https://doi.org/10.1287/..

6

Parameterized Complexity of Diameter:

Bentert, Matthias ; Nichterlein, André
Algorithmica. 85 (2022) 2 - p. 325-351 , 2022

Link: https://doi.org/10.1007/..

7

Correction to: Parameterized Complexity of Min-Power Asymme..:

Bentert, Matthias ; Haag, Roman ; Hofer, Christian..
Theory of Computing Systems. 65 (2021) 7 - p. 1141-1142 , 2021

Link: https://doi.org/10.1007/..

8

Detecting and enumerating small induced subgraphs in c-clos..:

Koana, Tomohiro ; Nichterlein, André
Discrete Applied Mathematics. 302 (2021) - p. 198-207 , 2021

Link: https://doi.org/10.1016/..

9

Combining Clickstream Analyses and Graph-Modeled Data Clust..:

Ulitzsch, Esther ; He, Qiwei ; Ulitzsch, Vincent...
Psychometrika. 86 (2021) 1 - p. 190-214 , 2021

Link: https://doi.org/10.1007/..

10

Combining Clickstream Analyses and Graph-Modeled Data Clust..:

Ulitzsch, Esther ; He, Qiwei ; Ulitzsch, Vincent...
Psychometrika. 86 (2021) 1 - p. 190-214 , 2021

Link: https://doi.org/10.1007/..

11

Data Reduction for Maximum Matching on Real-World Graphs: T..:

Koana, Tomohiro ; Korenwein, Viatcheslav ; Nichterlein, André..
ACM Journal of Experimental Algorithmics. 26 (2021) - p. 1-30 , 2021

Link: https://doi.org/10.1145/..

12

On 2-Clubs in Graph-Based Data Clustering: Theory and Algor..:

Figiel, Aleksander ; Himmel, Anne-Sophie ; Nichterlein, André.
Journal of Graph Algorithms and Applications. 25 (2021) 1 - p. 521-547 , 2021

Link: https://doi.org/10.7155/..

13

Data Reduction for Maximum Matching on Real-World Graphs ..:

Koana, Tomohiro ; Korenwein, Viatcheslav ; Nichterlein, André..
Journal of Experimental Algorithmics (JEA). 26 (2021) 1 - p. 1-30 , 2021

Link: https://dl.acm.org/doi/1..

14

Parameterized Complexity of Min-Power Asymmetric Connectivi..:

Bentert, Matthias ; Haag, Roman ; Hofer, Christian..
Theory of Computing Systems. 64 (2020) 7 - p. 1158-1182 , 2020

Link: https://doi.org/10.1007/..

15

An Adaptive Version of Brandes' Algorithm for Betweenness C..:

Bentert, Matthias ; Dittmann, Alexander ; Kellerhals, Leon..
Journal of Graph Algorithms and Applications. 24 (2020) 3 - p. 483-522 , 2020

Link: https://doi.org/10.7155/..