| Publication | Date of Publication | Type |
|---|
| Recognizing unit multiple interval graphs is hard | 2024-12-04 | Paper |
| Parity permutation pattern matching | 2024-08-13 | Paper |
| Hardness of \textsc{Balanced Mobiles} | 2023-12-22 | Paper |
| Parity permutation pattern matching | 2023-11-24 | Paper |
| Extension of some edge graph problems: standard, parameterized and approximation complexity | 2023-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098785 | 2023-06-14 | Paper |
| Grundy Coloring and friends, half-graphs, bicliques | 2023-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874335 | 2023-02-07 | Paper |
| EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs | 2022-12-08 | Paper |
| On the complexity of \textsc{broadcast domination} and \textsc{Multipacking} in digraphs | 2022-10-13 | Paper |
| Token sliding on split graphs | 2022-07-18 | Paper |
| On the complexity of solution extension of optimization problems | 2022-02-01 | Paper |
| On the complexity of broadcast domination and multipacking in digraphs | 2021-09-02 | Paper |
| Token sliding on split graphs | 2021-08-05 | Paper |
| The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration | 2021-08-04 | Paper |
| Parameterized orientable deletion | 2020-08-25 | Paper |
| QPTAS and subexponential algorithm for maximum clique on disk graphs | 2020-08-18 | Paper |
| Parameterized orientable deletion | 2020-05-21 | Paper |
| Weighted upper edge cover: complexity and approximability | 2020-02-17 | Paper |
| Extension of Vertex Cover and Independent Set in some classes of graphs | 2020-02-06 | Paper |
| Extension of some edge graph problems: standard and parameterized complexity | 2020-01-30 | Paper |
| Grundy Coloring & friends, Half-Graphs, Bicliques | 2020-01-11 | Paper |
| Weighted upper edge cover: complexity and approximability | 2019-10-15 | Paper |
| Correction to: ``Weighted upper edge cover: complexity and approximability | 2019-10-15 | Paper |
| Covering a graph with clubs | 2019-05-24 | Paper |
| Parameterized and approximation complexity of \textsc{Partial VC Dimension} | 2019-03-14 | Paper |
| Finding disjoint paths on edge-colored graphs: more tractability results | 2018-12-06 | Paper |
| Covering with clubs: complexity and approximability | 2018-09-06 | Paper |
| Parameterized complexity and approximation issues for the colorful components problems | 2018-06-18 | Paper |
| Complexity of Grundy coloring and its variants | 2018-05-24 | Paper |
| Designing RNA Secondary Structures is Hard | 2017-10-31 | Paper |
| The graph motif problem parameterized by the structure of the input graph | 2017-09-29 | Paper |
| On the complexity of various parameterizations of common induced subgraph isomorphism | 2017-09-28 | Paper |
| The graph motif problem parameterized by the structure of the input graph | 2017-09-12 | Paper |
| Finding disjoint paths on edge-colored graphs: a multivariate complexity analysis | 2017-02-01 | Paper |
| On the approximability of partial VC dimension | 2017-02-01 | Paper |
| Parameterized exact and approximation algorithms for maximum \(k\)-set cover and related satisfiability problems | 2017-01-19 | Paper |
| A note on edge isoperimetric numbers and regular graphs | 2016-12-14 | Paper |
| Parameterized complexity and approximation issues for the colorful components problems | 2016-08-17 | Paper |
| Complexity of Grundy coloring and its variants | 2015-10-29 | Paper |
| On the complexity of various parameterizations of common induced subgraph isomorphism | 2015-09-15 | Paper |
| Some results on more flexible versions of Graph Motif | 2015-07-20 | 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 |
| Parameterized approximability of maximizing the spread of influence in networks | 2014-07-07 | Paper |
| Complexity insights of the minimum duplication problem | 2014-03-27 | Paper |
| Minimum mosaic inference of a set of recombinants | 2013-07-30 | Paper |
| Parameterized approximability of maximizing the spread of influence in networks | 2013-06-11 | Paper |
| Finding and counting vertex-colored subtrees | 2013-05-16 | Paper |
| Some results on more flexible versions of Graph Motif | 2012-09-10 | Paper |
| An algorithmic view on multi-related-segments: a unifying model for approximate common interval | 2012-07-16 | Paper |
| Complexity insights of the minimum duplication problem | 2012-06-15 | Paper |
| On the parameterized complexity of the repetition free longest common subsequence problem | 2012-05-04 | Paper |
| Algorithmic aspects of heterogeneous biological networks comparison | 2011-08-12 | Paper |
| Finding and counting vertex-colored subtrees | 2010-09-03 | Paper |
| The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated | 2009-02-24 | Paper |
