| Publication | Date of Publication | Type |
|---|
Fair short paths in vertex-colored graphs Theoretical Computer Science | 2026-09-29 | Paper |
Temporal connectivity: coping with foreseen and unforeseen delays Discrete Applied Mathematics | 2026-07-02 | Paper |
Stable marriage with multi-modal preferences Journal of Computer and System Sciences | 2026-06-11 | Paper |
| Binary matrix completion under diameter constraints | 2026-04-21 | Paper |
Adapting stable matchings to evolving preferences Games and Economic Behavior | 2026-03-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 |
Drawing a map of elections Artificial Intelligence | 2025-05-30 | Paper |
Fairness in repetitive scheduling European Journal of Operational Research | 2025-05-20 | Paper |
| Parameterized lower bounds for problems in P via fine-grained cross-compositions | 2024-10-08 | Paper |
The role of twins in computing planar supports of hypergraphs Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| Deepening the (parameterized) complexity analysis of incremental stable matching problems | 2024-08-06 | Paper |
| Most classic problems remain NP-hard on relative neighborhood graphs and their relatives | 2024-05-27 | Paper |
| An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions | 2024-05-06 | Paper |
| Delay-robust routes in temporal graphs | 2024-04-23 | Paper |
Approximating sparse quadratic programs Theoretical Computer Science | 2024-01-02 | Paper |
| Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs | 2023-11-14 | Paper |
A multivariate complexity analysis of the material consumption scheduling problem Journal of Scheduling | 2023-08-28 | Paper |
Computing maximum matchings in temporal graphs Journal of Computer and System Sciences | 2023-07-10 | Paper |
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality Journal of Graph Algorithms and Applications | 2023-07-03 | Paper |
Multistage \(s-t\) path: confronting similarity with dissimilarity Algorithmica | 2023-06-28 | Paper |
Equitable scheduling on a single machine Journal of Scheduling | 2023-06-27 | Paper |
Equitable scheduling on a single machine Journal of Scheduling | 2023-06-27 | Paper |
Temporal interval cliques and independent sets Theoretical Computer Science | 2023-05-23 | Paper |
On finding separators in temporal split and permutation graphs Journal of Computer and System Sciences | 2023-04-21 | Paper |
| On 2-clubs in graph-based data clustering: theory and algorithm engineering | 2023-03-22 | Paper |
Multidimensional stable roommates with master list (available as arXiv preprint) | 2023-03-21 | Paper |
Polynomial-time data reduction for weighted problems beyond additive goal functions Discrete Applied Mathematics | 2023-02-22 | Paper |
Computing maximum matchings in temporal graphs. (available as arXiv preprint) | 2023-02-07 | Paper |
Parameterized Algorithms for Matrix Completion with Radius Constraints. (available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651119 (Why is no real title available?) (available as arXiv preprint) | 2023-02-07 | Paper |
| Multistage Vertex Cover | 2023-02-03 | Paper |
| Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters | 2023-02-03 | Paper |
| Recursively divisible problems | 2023-01-25 | Paper |
The complexity of binary matrix completion under diameter constraints Journal of Computer and System Sciences | 2023-01-09 | Paper |
| Bribery and control in stable marriage | 2022-12-21 | Paper |
Line-up elections: parallel voting with shared candidate pool (available as arXiv preprint) | 2022-12-21 | Paper |
Feedback edge sets in temporal graphs Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
PRAM's towards realistic parallelism: BRAM's Fundamentals of Computation Theory | 2022-12-09 | Paper |
Towards optimal locality in mesh-indexings Fundamentals of Computation Theory | 2022-12-09 | Paper |
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks Algorithms for Sensor Systems | 2022-12-09 | Paper |
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters Information and Computation | 2022-12-08 | Paper |
The complexity of gerrymandering over graphs: paths and trees Discrete Applied Mathematics | 2022-11-11 | Paper |
As Time Goes By: Reflections on Treewidth for Temporal Graphs Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality Journal of Artificial Intelligence Research | 2022-10-06 | Paper |
The structural complexity landscape of finding balance-fair shortest paths Theoretical Computer Science | 2022-09-27 | Paper |
Complexity of shift bribery in committee elections ACM Transactions on Computation Theory | 2022-09-24 | 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 |
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments INFORMS Journal on Computing | 2022-06-28 | Paper |
On 2-clubs in graph-based data clustering: theory and algorithm engineering Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
Towards classifying the polynomial-time solvability of temporal betweenness centrality (available as arXiv preprint) | 2022-06-08 | Paper |
The complexity of gerrymandering over graphs: paths and trees Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
On finding separators in temporal split and permutation graphs Fundamentals of Computation Theory | 2022-05-20 | Paper |
Multistage vertex cover Theory of Computing Systems | 2022-05-09 | Paper |
Envy-free allocations respecting social networks Artificial Intelligence | 2022-04-11 | Paper |
| Temporal connectivity: coping with foreseen and unforeseen delays | 2022-01-01 | Paper |
| Temporal unit interval independent sets | 2022-01-01 | Paper |
Combining clickstream analyses and graph-modeled data clustering for identifying common response processes Psychometrika | 2021-12-16 | Paper |
Feedback edge sets in temporal graphs Discrete Applied Mathematics | 2021-12-07 | Paper |
Bribery and control in stable marriage Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
Robustness among multiwinner voting rules Artificial Intelligence | 2021-08-16 | Paper |
The complexity of finding small separators in temporal graphs (available as arXiv preprint) | 2021-08-04 | Paper |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (available as arXiv preprint) | 2021-08-04 | Paper |
| Interference-free Walks in Time: Temporally Disjoint Paths | 2021-05-18 | Paper |
Multistage graph problems on a global budget Theoretical Computer Science | 2021-05-10 | Paper |
Parameterized dynamic cluster editing Algorithmica | 2021-02-01 | Paper |
Interference-free Walks in Time: Temporally Disjoint Paths (available as arXiv preprint) | 2021-01-01 | Paper |
| Weighted tournament solutions | 2020-11-12 | 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 |
Tight hardness results for consensus problems on circular strings and time series SIAM Journal on Discrete Mathematics | 2020-10-27 | Paper |
Diminishable parameterized problems and strict polynomial kernelization Computability | 2020-09-08 | Paper |
| The Power of Linear-Time Data Reduction for Maximum Matching | 2020-05-26 | Paper |
Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting Theoretical Computer Science | 2020-03-12 | Paper |
Efficient algorithms for measuring the funnel-likeness of DAGs Journal of Combinatorial Optimization | 2020-02-03 | Paper |
Temporal graph classes: a view through temporal separators Theoretical Computer Science | 2020-01-16 | Paper |
The complexity of finding small separators in temporal graphs Journal of Computer and System Sciences | 2019-11-29 | Paper |
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review Journal of Scheduling | 2019-10-08 | Paper |
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions (available as arXiv preprint) | 2019-10-01 | Paper |
Data reduction, exact, and heuristic algorithms for clique cover 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
The parameterized complexity of the minimum shared edges problem Journal of Computer and System Sciences | 2019-08-30 | Paper |
| Multivariate algorithmics for NP-hard string problems | 2019-07-03 | 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 |
The parameterized complexity of the rainbow subgraph problem Algorithms | 2019-03-26 | Paper |
Co-clustering under the maximum norm 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 |
Temporal graph classes: a view through temporal separators Lecture Notes in Computer Science | 2018-11-22 | Paper |
Stable roommate with narcissistic, single-peaked, and single-crossing preferences (available as arXiv preprint) | 2018-10-25 | Paper |
Diminishable parameterized problems and strict polynomial kernelization (available as arXiv preprint) | 2018-09-06 | Paper |
Efficient algorithms for measuring the funnel-likeness of DAGs Lecture Notes in Computer Science | 2018-08-17 | Paper |
h-Index Manipulation by Undoing Merges (available as arXiv preprint) | 2018-07-12 | 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 |