The following pages link to André Nichterlein (Q249102):
Displaying 24 items.
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5131226) (← links)
- Parameterized Inapproximability of Target Set Selection and Generalizations (Q5175620) (← links)
- Parameterized Inapproximability of Target Set Selection and Generalizations (Q5175873) (← links)
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs (Q5246711) (← links)
- The Complexity of Degree Anonymization by Vertex Addition (Q5251633) (← links)
- A Refined Complexity Analysis of Degree Anonymization in Graphs (Q5327468) (← links)
- Pattern-Guided k-Anonymity (Q5405946) (← links)
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
- Parameterized complexity of min-power asymmetric connectivity (Q5918282) (← links)
- Parameterized complexity of diameter (Q5919396) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5920105) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality (Q6107024) (← links)
- Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths (Q6171262) (← links)
- (Q6192494) (← links)
- Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions (Q6326311) (← links)
- Covering many (or few) edges with \(k\) vertices in sparse graphs (Q6490988) (← links)
- Parameterized lower bounds for problems in P via fine-grained cross-compositions (Q6615143) (← links)
- Degree-constrained editing of small-degree graphs (Q6633493) (← links)
- Correlating theory and practice in finding clubs and plexes (Q6656999) (← links)
- Effective data reduction for strongly stable matching in very sparse graphs (Q6663523) (← links)
