| Publication | Date of Publication | Type |
|---|
| Using a geometric Lens to find k disjoint shortest paths | 2026-05-12 | Paper |
Graph clustering problems under the Lens of parameterized local search
Journal of Computer and System Sciences | 2026-05-08 | Paper |
| Destroying densest subgraphs is hard | 2025-12-02 | Paper |
| On the computational complexity of graph reconstruction | 2025-11-11 | Paper |
| Graph clustering problems under the Lens of parameterized local search | 2025-09-24 | Paper |
| Applying a cut-based data reduction rule for weighted cluster editing in polynomial time | 2025-06-23 | Paper |
| There and back again: on applying data reduction rules by undoing others | 2025-06-19 | Paper |
Destroying densest subgraphs is hard
Journal of Computer and System Sciences | 2025-03-26 | Paper |
On the hardness of problems around s-clubs on split graphs
Discrete Applied Mathematics | 2025-02-11 | Paper |
Effective data reduction for strongly stable matching in very sparse graphs
Information Processing Letters | 2025-01-14 | Paper |
| Correlating theory and practice in finding clubs and plexes | 2025-01-06 | Paper |
Degree-constrained editing of small-degree graphs
Foundations of Computing | 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 |
| The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing | 2024-02-12 | Paper |
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths
SIAM Journal on Discrete Mathematics | 2023-08-11 | Paper |
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
Journal of Graph Algorithms and Applications | 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
Discrete Applied Mathematics | 2023-02-22 | Paper |
Parameterized complexity of diameter
Algorithmica | 2023-02-16 | Paper |
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
Algorithms for Sensor Systems | 2022-12-09 | Paper |
Data Reduction for Maximum Matching on Real-World Graphs
ACM Journal of Experimental Algorithmics | 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 |
On 2-clubs in graph-based data clustering: theory and algorithm engineering
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
INFORMS Journal on Computing | 2022-06-28 | Paper |
Towards classifying the polynomial-time solvability of temporal betweenness centrality
(available as arXiv preprint) | 2022-06-08 | Paper |
Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
Psychometrika | 2021-12-16 | Paper |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
(available as arXiv preprint) | 2021-08-04 | Paper |
Detecting and enumerating small induced subgraphs in c-closed graphs
Discrete Applied Mathematics | 2021-08-02 | Paper |
Parameterized complexity of min-power asymmetric connectivity
Theory of Computing Systems | 2021-06-11 | Paper |
Parameterized dynamic cluster editing
Algorithmica | 2021-02-01 | Paper |
The power of linear-time data reduction for maximum matching
Algorithmica | 2020-11-11 | Paper |
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
Journal of Graph Algorithms and Applications | 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
Lecture Notes in Computer Science | 2020-02-25 | Paper |
Parameterized complexity of diameter
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions
(available as arXiv preprint) | 2019-10-01 | Paper |
Parameterized aspects of triangle enumeration
Journal of Computer and System Sciences | 2019-06-25 | Paper |
When can graph hyperbolicity be computed in linear time?
Algorithmica | 2019-05-07 | Paper |
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
Algorithmica | 2019-04-25 | Paper |
Pattern-guided k-anonymity
Algorithms | 2019-03-26 | Paper |
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
Networks | 2019-03-06 | Paper |
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
European Journal of Operational Research | 2019-02-11 | Paper |
A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
SIAM Journal on Discrete Mathematics | 2018-12-05 | Paper |
Constant-factor approximations for capacitated arc routing without triangle inequality
Operations Research Letters | 2018-09-28 | Paper |
| Kernelization lower bounds for finding constant-size subgraphs | 2018-09-06 | Paper |
Kernelization lower bounds for finding constant-size subgraphs
(available as arXiv preprint) | 2018-09-06 | Paper |
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
(available as arXiv preprint) | 2018-04-10 | Paper |
Fractals for kernelization lower bounds
SIAM Journal on Discrete Mathematics | 2018-03-26 | Paper |
Finding points in general position
International Journal of Computational Geometry & Applications | 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
Lecture Notes in Computer Science | 2017-11-22 | Paper |
When can graph hyperbolicity be computed in linear time?
Lecture Notes in Computer Science | 2017-09-22 | Paper |
When can graph hyperbolicity be computed in linear time?
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Fixed-parameter algorithms for DAG partitioning
Discrete Applied Mathematics | 2017-02-06 | Paper |
Prices matter for the parameterized complexity of shift bribery
Information and Computation | 2016-11-18 | Paper |
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Win-win kernelization for degree sequence completion problems
Journal of Computer and System Sciences | 2016-06-13 | Paper |
Finding large degree-anonymous subgraphs is hard
Theoretical Computer Science | 2016-02-26 | Paper |
The complexity of degree anonymization by vertex addition
Theoretical Computer Science | 2015-12-08 | Paper |
Editing graphs into few cliques: complexity, approximation, and kernelization schemes
Lecture Notes in Computer Science | 2015-10-30 | Paper |
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs
SIAM Journal on Discrete Mathematics | 2015-10-30 | Paper |
A refined complexity analysis of finding the most vital edges for undirected shortest paths
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Parameterized inapproximability of degree anonymization
Parameterized and Exact Computation | 2015-09-15 | Paper |
A refined complexity analysis of degree anonymization in graphs
Information and Computation | 2015-06-09 | Paper |
Using patterns to form homogeneous teams
Algorithmica | 2015-05-26 | Paper |
The complexity of degree anonymization by vertex addition
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
On structural parameterizations for the 2-club problem
Discrete Applied Mathematics | 2015-04-28 | Paper |
Parameterized algorithmics and computational experiments for finding 2-clubs
Journal of Graph Algorithms and Applications | 2015-04-22 | Paper |
Parameterized inapproximability of target set selection and generalizations
Language, Life, Limits | 2015-02-25 | Paper |
Parameterized inapproximability of target set selection and generalizations
Computability | 2015-02-24 | Paper |
Constant thresholds can make target set selection tractable
Theory of Computing Systems | 2015-02-05 | Paper |
On structural parameterizations for the 2-club problem
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Win-win kernelization for degree sequence completion problems
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Parameterized approximability of maximizing the spread of influence in networks
Journal of Discrete Algorithms | 2014-07-07 | Paper |
Pattern-guided \(k\)-anonymity
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
The effect of homogeneity on the computational complexity of combinatorial data anonymization
Data Mining and Knowledge Discovery | 2014-02-19 | Paper |
The Complexity of Finding a Large Subgraph under Anonymity Constraints
Algorithms and Computation | 2014-01-14 | Paper |
A refined complexity analysis of degree anonymization in graphs
Automata, Languages, and Programming | 2013-08-07 | Paper |
Parameterized approximability of maximizing the spread of influence in networks
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Parameterized complexity of DAG partitioning
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Constant thresholds can make target set selection tractable
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
Parameterized and Exact Computation | 2013-01-07 | Paper |
NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Aspects of a multivariate complexity analysis for rectangle tiling
Operations Research Letters | 2012-04-05 | Paper |
The effect of homogeneity on the complexity of \(k\)-anonymity
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Pattern-Guided Data Anonymization and Clustering
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
On tractable cases of target set selection
Algorithms and Computation | 2010-12-09 | Paper |
