The following pages link to André Nichterlein (Q249102):
Displaying 27 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes (Q823870) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Kernelization lower bounds for finding constant-size subgraphs (Q1670739) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- Pattern-guided \(k\)-anonymity (Q1736590) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236) (← links)
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems (Q4598161) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs (Q4634393) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (Q5009617) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5091028) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5131226) (← links)
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs (Q5246711) (← 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)
- Covering many (or few) edges with \(k\) vertices in sparse graphs (Q6490988) (← links)
