| Publication | Date of Publication | Type |
|---|
| Structural parameters for Steiner orientation | 2026-10-01 | Paper |
| Minimum clique bicoloring | 2026-09-29 | Paper |
Shortest longest-path graph orientations Journal of Combinatorial Optimization | 2026-09-15 | Paper |
| On the complexity of minimising the moving distance for dispersing objects | 2026-08-11 | Paper |
| Approximability of longest run subsequence and complementary minimization problems | 2026-07-22 | Paper |
Faster winner determination algorithms for (colored) Arc Kayles Journal of Computer and System Sciences | 2025-12-11 | Paper |
Sequentially swapping tokens: further on graph classes Journal of Computer and System Sciences | 2025-09-29 | Paper |
Reallocation problems with minimum completion time Algorithmica | 2025-08-29 | Paper |
| Shortest beer path queries based on graph decomposition | 2025-07-24 | Paper |
| Algorithms for optimally shifting intervals under intersection graph models | 2025-04-29 | Paper |
Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs Journal of Combinatorial Optimization | 2025-04-28 | Paper |
| Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints | 2025-02-28 | Paper |
Computational complexity of \textsc{Turning Tiles} International Journal of Game Theory | 2025-01-30 | Paper |
An improved spectral lower bound of treewidth Information Processing Letters | 2025-01-14 | Paper |
Battle Sheep is PSPACE-complete (available as arXiv preprint) | 2025-01-01 | Paper |
Finding a HIST: Chordality, Structural Parameters, and Diameter (available as arXiv preprint) | 2025-01-01 | Paper |
Structural parameterizations of vertex integrity Theoretical Computer Science | 2024-12-12 | Paper |
| Approximation algorithms for the longest run subsequence problem | 2024-10-21 | Paper |
| Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs | 2024-09-16 | Paper |
| Shortest longest-path graph orientations | 2024-08-22 | Paper |
| Structural parameterizations of vertex integrity (best paper) | 2024-07-19 | Paper |
Polynomial-time equivalences and refined algorithms for longest common subsequence variants Discrete Applied Mathematics | 2024-05-29 | Paper |
On the complexity of finding a spanning even tree in a graph (available as arXiv preprint) | 2024-01-01 | Paper |
Independent set reconfiguration parameterized by modular-width Algorithmica | 2020-09-03 | Paper |
Independent set reconfiguration parameterized by modular-width Lecture Notes in Computer Science | 2020-02-24 | Paper |
Best fitting fixed-length substring patterns for a set of strings Lecture Notes in Computer Science | 2006-01-11 | Paper |
A decomposability index in logical analysis of data Discrete Applied Mathematics | 2004-08-19 | Paper |
An index for the data size to extract decomposable structures in LAD Lecture Notes in Computer Science | 2004-08-04 | Paper |
Interior and exterior functions of positive Boolean functions. Discrete Applied Mathematics | 2003-09-22 | Paper |
Logical analysis of data with decomposable structures. Theoretical Computer Science | 2003-01-21 | Paper |
Logical analysis of data with decomposable structures Lecture Notes in Computer Science | 2002-07-22 | Paper |