| Publication | Date of Publication | Type |
|---|
| Automated design of dynamic programming schemes for RNA folding with pseudoknots | 2024-08-13 | Paper |
The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings
Journal of Computer and System Sciences | 2024-07-01 | Paper |
An algorithmic framework for locally constrained homomorphisms
SIAM Journal on Discrete Mathematics | 2024-05-08 | Paper |
| An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions | 2024-05-06 | Paper |
| Permutation pattern matching for doubly partially ordered patterns | 2024-05-06 | Paper |
| Reordering a tree according to an order on its leaves | 2024-05-06 | Paper |
| scientific article; zbMATH DE number 7803589 (Why is no real title available?) | 2024-02-12 | Paper |
Decomposing subcubic graphs into claws, paths or triangles
Journal of Graph Theory | 2023-10-04 | Paper |
| scientific article; zbMATH DE number 7716293 (Why is no real title available?) | 2023-07-24 | Paper |
| The tree-child network problem for line trees and the shortest common supersequences for permutations | 2023-07-10 | Paper |
| scientific article; zbMATH DE number 7695997 (Why is no real title available?) | 2023-06-14 | Paper |
An algorithmic framework for locally constrained homomorphisms
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
An algorithmic framework for locally constrained homomorphisms
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Sequence graphs realizations and ambiguity in language models | 2023-03-30 | Paper |
On shuffled-square-free words
Theoretical Computer Science | 2023-01-04 | Paper |
Finding a small number of colourful components
(available as arXiv preprint) | 2022-07-18 | Paper |
| Sorting by multi-cut rearrangements | 2022-03-24 | Paper |
| Consensus strings with small maximum distance and small distance sum | 2021-08-04 | Paper |
Your rugby mates don't need to know your colleagues: triadic closure with edge colors
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Aggregation over metric spaces: proposing and voting in elections, budgeting, and legislation
Journal of Artificial Intelligence Research | 2021-05-25 | Paper |
Multi-Player Diffusion Games on Graph Classes
Internet Mathematics | 2021-03-26 | Paper |
Tight hardness results for consensus problems on circular strings and time series
SIAM Journal on Discrete Mathematics | 2020-10-27 | Paper |
| scientific article; zbMATH DE number 7203332 (Why is no real title available?) | 2020-05-25 | Paper |
Consensus strings with small maximum distance and small distance sum
Algorithmica | 2020-04-01 | Paper |
The clever shopper problem
Theory of Computing Systems | 2020-02-27 | Paper |
Your rugby mates don't need to know your colleagues: triadic closure with edge colors
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Recognizing binary shuffle squares is \textsf{NP}-hard
Theoretical Computer Science | 2020-01-16 | Paper |
| Multivariate algorithmics for NP-hard string problems | 2019-07-03 | Paper |
Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Co-clustering under the maximum norm
Algorithms | 2019-03-26 | Paper |
The clever shopper problem
Computer Science – Theory and Applications | 2018-11-28 | Paper |
| Pattern matching for \(k\)-track permutations | 2018-09-06 | Paper |
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Partitioning perfect graphs into stars
Journal of Graph Theory | 2017-07-05 | Paper |
The complexity of finding effectors
Theory of Computing Systems | 2017-03-31 | Paper |
Triangle counting in dynamic graph streams
Algorithmica | 2016-11-01 | Paper |
Computing an evolutionary ordering is hard
(available as arXiv preprint) | 2016-10-17 | Paper |
Decomposing cubic graphs into connected subgraphs of size three
Lecture Notes in Computer Science | 2016-09-02 | Paper |
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets
Journal of Discrete Algorithms | 2016-07-15 | Paper |
Fixed-parameter algorithms for scaffold filling
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Multi-player diffusion games on graph classes
Lecture Notes in Computer Science | 2015-09-30 | Paper |
The complexity of finding effectors
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Co-clustering under the maximum norm
Algorithms and Computation | 2015-09-11 | Paper |
Co-clustering under the maximum norm
Algorithms and Computation | 2015-09-11 | Paper |
Pancake flipping is hard
Journal of Computer and System Sciences | 2015-08-31 | Paper |
Combinatorial voter control in elections
Theoretical Computer Science | 2015-06-01 | Paper |
Fixed-parameter algorithms for scaffold filling
Theoretical Computer Science | 2015-01-28 | Paper |
Some algorithmic results for [2-sumset covers]
Information Processing Letters | 2014-10-07 | Paper |
Star partitions of perfect graphs
Lecture Notes in Computer Science | 2014-07-01 | Paper |
Reversal distances for strings with few blocks or small alphabets
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Maximal strip recovery problem with gaps: hardness and approximation algorithms
Journal of Discrete Algorithms | 2014-02-03 | Paper |
Revisiting the minimum breakpoint linearization problem
Theoretical Computer Science | 2014-01-10 | Paper |
Sorting by transpositions is difficult
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Pancake flipping is hard
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Hardness of longest common subsequence for sequences with bounded run-lengths
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Tractability and approximability of maximal strip recovery
Theoretical Computer Science | 2012-08-08 | Paper |
Sorting by transpositions is difficult
Lecture Notes in Computer Science | 2011-07-06 | Paper |
Tractability and approximability of maximal strip recovery
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Revisiting the minimum breakpoint linearization problem
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Maximal strip recovery problem with gaps: hardness and approximation algorithms
Algorithms and Computation | 2009-12-17 | Paper |
