| Publication | Date of Publication | Type |
|---|
| Effective data reduction for strongly stable matching in very sparse graphs | 2025-01-14 | Paper |
| Correlating theory and practice in finding clubs and plexes | 2025-01-06 | Paper |
| Degree-constrained editing of small-degree graphs | 2024-11-05 | Paper |
| Parameterized lower bounds for problems in P via fine-grained cross-compositions | 2024-10-08 | Paper |
| Covering many (or few) edges with \(k\) vertices in sparse graphs | 2024-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192494 | 2024-02-12 | Paper |
| Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths | 2023-08-11 | Paper |
| Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality | 2023-07-03 | Paper |
| On 2-clubs in graph-based data clustering: theory and algorithm engineering | 2023-03-22 | Paper |
| Polynomial-time data reduction for weighted problems beyond additive goal functions | 2023-02-22 | Paper |
| Parameterized complexity of diameter | 2023-02-16 | Paper |
| Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks | 2022-12-09 | Paper |
| Data Reduction for Maximum Matching on Real-World Graphs | 2022-09-06 | Paper |
| Parameterized Dynamic Cluster Editing | 2022-07-21 | Paper |
| An Adaptive Version of Brandes' Algorithm for Betweenness Centrality | 2022-07-21 | Paper |
| Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments | 2022-06-28 | Paper |
| On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering | 2022-06-28 | Paper |
| Towards classifying the polynomial-time solvability of temporal betweenness centrality | 2022-06-08 | Paper |
| Combining clickstream analyses and graph-modeled data clustering for identifying common response processes | 2021-12-16 | Paper |
| Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments | 2021-08-04 | Paper |
| Detecting and enumerating small induced subgraphs in \(c\)-closed graphs | 2021-08-02 | Paper |
| Parameterized complexity of min-power asymmetric connectivity | 2021-06-11 | Paper |
| Parameterized dynamic cluster editing | 2021-02-01 | Paper |
| The power of linear-time data reduction for maximum matching | 2020-11-11 | Paper |
| An Adaptive Version of Brandes' Algorithm for Betweenness Centrality | 2020-11-05 | Paper |
| The Power of Linear-Time Data Reduction for Maximum Matching | 2020-05-26 | Paper |
| Parameterized complexity of min-power asymmetric connectivity | 2020-02-25 | Paper |
| Parameterized complexity of diameter | 2020-02-06 | Paper |
| Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions | 2019-10-01 | Paper |
| Parameterized aspects of triangle enumeration | 2019-06-25 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2019-05-07 | Paper |
| A parameterized algorithmics framework for degree sequence completion problems in directed graphs | 2019-04-25 | Paper |
| Pattern-guided \(k\)-anonymity | 2019-03-26 | Paper |
| A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths | 2019-03-06 | Paper |
| Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments | 2019-02-11 | Paper |
| A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs | 2018-12-05 | Paper |
| Constant-factor approximations for capacitated arc routing without triangle inequality | 2018-09-28 | Paper |
| Kernelization lower bounds for finding constant-size subgraphs | 2018-09-06 | Paper |
| A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs | 2018-04-10 | Paper |
| Fractals for Kernelization Lower Bounds | 2018-03-26 | Paper |
| Finding Points in General Position | 2018-02-22 | Paper |
| Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems | 2017-12-19 | Paper |
| Parameterized aspects of triangle enumeration | 2017-11-22 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2017-09-22 | Paper |
| Fixed-parameter algorithms for DAG partitioning | 2017-02-06 | Paper |
| Prices matter for the parameterized complexity of shift bribery | 2016-11-18 | Paper |
| Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics | 2016-10-21 | Paper |
| Win-win kernelization for degree sequence completion problems | 2016-06-13 | Paper |
| Finding large degree-anonymous subgraphs is hard | 2016-02-26 | Paper |
| The complexity of degree anonymization by vertex addition | 2015-12-08 | Paper |
| Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes | 2015-10-30 | Paper |
| NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs | 2015-10-30 | Paper |
| A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths | 2015-09-21 | Paper |
| Parameterized Inapproximability of Degree Anonymization | 2015-09-15 | Paper |
| A refined complexity analysis of degree anonymization in graphs | 2015-06-09 | Paper |
| Using patterns to form homogeneous teams | 2015-05-26 | Paper |
| The Complexity of Degree Anonymization by Vertex Addition | 2015-05-20 | Paper |
| On structural parameterizations for the 2-club problem | 2015-04-28 | Paper |
| Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs | 2015-04-22 | Paper |
| Parameterized Inapproximability of Target Set Selection and Generalizations | 2015-02-25 | Paper |
| Parameterized Inapproximability of Target Set Selection and Generalizations | 2015-02-24 | Paper |
| Constant thresholds can make target set selection tractable | 2015-02-05 | Paper |
| On structural parameterizations for the 2-club problem | 2014-11-04 | Paper |
| Win-Win Kernelization for Degree Sequence Completion Problems | 2014-09-02 | Paper |
| Parameterized approximability of maximizing the spread of influence in networks | 2014-07-07 | Paper |
| Pattern-Guided k-Anonymity | 2014-04-03 | Paper |
| The effect of homogeneity on the computational complexity of combinatorial data anonymization | 2014-02-19 | Paper |
| The Complexity of Finding a Large Subgraph under Anonymity Constraints | 2014-01-14 | Paper |
| A Refined Complexity Analysis of Degree Anonymization in Graphs | 2013-08-07 | Paper |
| Parameterized Approximability of Maximizing the Spread of Influence in Networks | 2013-06-11 | Paper |
| Parameterized Complexity of DAG Partitioning | 2013-06-07 | Paper |
| Constant Thresholds Can Make Target Set Selection Tractable | 2013-04-19 | Paper |
| Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs | 2013-01-07 | Paper |
| NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs | 2012-08-14 | Paper |
| Aspects of a multivariate complexity analysis for rectangle tiling | 2012-04-05 | Paper |
| The Effect of Homogeneity on the Complexity of k-Anonymity | 2011-08-19 | Paper |
| Pattern-Guided Data Anonymization and Clustering | 2011-08-17 | Paper |
| On Tractable Cases of Target Set Selection | 2010-12-09 | Paper |
