The following pages link to André Nichterlein (Q249102):
Displayed 50 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)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- Using patterns to form homogeneous teams (Q2346970) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
- Towards classifying the polynomial-time solvability of temporal betweenness centrality (Q2672438) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- The Complexity of Finding a Large Subgraph under Anonymity Constraints (Q2872080) (← links)
- Parameterized Inapproximability of Degree Anonymization (Q2946009) (← links)
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
- On Tractable Cases of Target Set Selection (Q3060749) (← links)
- Pattern-Guided Data Anonymization and Clustering (Q3088038) (← links)
- The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)
- Win-Win Kernelization for Degree Sequence Completion Problems (Q3188894) (← links)
- Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes (Q3449838) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems (Q4598161) (← links)
- Finding Points in General Position (Q4605338) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← 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)
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs (Q4899256) (← links)
- Constant Thresholds Can Make Target Set Selection Tractable (Q4916038) (← links)
- Parameterized Complexity of DAG Partitioning (Q4924637) (← links)
- Parameterized Approximability of Maximizing the Spread of Influence in Networks (Q4925269) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (Q5009617) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← 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)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)