Laurent Bulteau

Vincent Jugé

Theor. Comput. Sci., 2023

The Problem of Discovery in Version Control Systems.

[BibT_eX]

[DOI]

Pierre-Yves David

Florian Horn

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

2-Dimensional Euclidean Preferences.

[BibT_eX]

[DOI]

Jiehua Chen

CoRR, 2022

Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics.

[BibT_eX]

[DOI]

Bertrand Marchand

Yann Ponty

Algorithms Mol. Biol., 2022

An Algorithmic Framework for Locally Constrained Homomorphisms.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Better Collective Decisions via Uncertainty Reduction.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Reordering a Tree According to an Order on Its Leaves.

[BibT_eX]

[DOI]

Philippe Gambette

Olga Seminck

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Permutation Pattern Matching for Doubly Partially Ordered Patterns.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Sorting Signed Permutations by Intergenic Reversals.

[BibT_eX]

[DOI]

Andre Rodrigues Oliveira

IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Decomposing subcubic graphs into claws, paths or triangles.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Your rugby mates don't need to know your colleagues: Triadic closure with edge colors.

[BibT_eX]

[DOI]

Niels Grüttemeier

Manuel Sorge

J. Comput. Syst. Sci., 2021

Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

Efficient, robust and effective rank aggregation for massive biological datasets.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2021

Parameterized String Equations.

[BibT_eX]

[DOI]

Michael R. Fellows

Frances A. Rosamond

CoRR, 2021

Sorting by Multi-Cut Rearrangements.

[BibT_eX]

[DOI]

Géraldine Jean

Algorithms, 2021

Justified Representation for Perpetual Voting.

[BibT_eX]

[DOI]

IEEE Access, 2021

A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics.

[BibT_eX]

[DOI]

Bertrand Marchand

Yann Ponty

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Disorders and Permutations.

[BibT_eX]

[DOI]

Samuele Giraudo

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

Sequence Graphs Realizations and Ambiguity in Language Models.

[BibT_eX]

[DOI]

Sammy Khalife

Yann Ponty

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Partition Aggregation for Participatory Budgeting.

[BibT_eX]

[DOI]

Pallavi Jain

Nimrod Talmon

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Recognizing binary shuffle squares is NP-hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.

[BibT_eX]

[DOI]

Vincent Froese

Rolf Niedermeier

SIAM J. Discret. Math., 2020

The Clever Shopper Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Consensus Strings with Small Maximum Distance and Small Distance Sum.

[BibT_eX]

[DOI]

Markus L. Schmid

Algorithmica, 2020

2019

Parameterized Algorithms in Bioinformatics: An Overview.

[BibT_eX]

[DOI]

Mathias Weller

Algorithms, 2019

Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on eScience, 2019

Finding a Small Number of Colourful Components.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Hardness of Consensus Problems for Circular Strings and Time Series Averaging.

[BibT_eX]

[DOI]

Vincent Froese

Rolf Niedermeier

CoRR, 2018

Pattern Matching for k-Track Permutations.

[BibT_eX]

[DOI]

Romeo Rizzi

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

The Clever Shopper Problem.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2018

2017

The Complexity of Finding Effectors.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Partitioning Perfect Graphs into Stars.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Consensus Patterns parameterized by input string length is W[1]-hard.

[BibT_eX]

[DOI]

CoRR, 2017

Beyond Adjacency Maximization: Scaffold Filling for New String Distances.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

(Prefix) reversal distance for (signed) strings with few blocks or small alphabets.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Multi-Player Diffusion Games on Graph Classes.

[BibT_eX]

[DOI]

Vincent Froese

Nimrod Talmon

Internet Math., 2016

Genome rearrangements with indels in intergenes restrict the scenario space.

[BibT_eX]

[DOI]

Eric Tannier

BMC Bioinform., 2016

Co-Clustering under the Maximum Norm.

[BibT_eX]

[DOI]

Algorithms, 2016

Triangle Counting in Dynamic Graph Streams.

[BibT_eX]

[DOI]

Algorithmica, 2016

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width.

[BibT_eX]

[DOI]

René van Bevern

Robert Bredereck

Nimrod Talmon

Gerhard J. Woeginger

Proceedings of the Discrete Optimization and Operations Research, 2016

Decomposing Cubic Graphs into Connected Subgraphs of Size Three.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Combinatorial voter control in elections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Fixed-parameter algorithms for scaffold filling.

[BibT_eX]

[DOI]

Anna Paola Carrieri

Riccardo Dondi

Theor. Comput. Sci., 2015

Pancake Flipping is hard.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Some algorithmic results for [2]-sumset covers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Computing an Evolutionary Ordering is Hard.

[BibT_eX]

[DOI]

Gustavo Sacomoto

Blerina Sinaimeri

Electron. Notes Discret. Math., 2015

2014

Multivariate Algorithmics for NP-Hard String Problems.

[BibT_eX]

[DOI]

Falk Hüffner

Rolf Niedermeier

Bull. EATCS, 2014

Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Star Partitions of Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Reversal Distances for Strings with Few Blocks or Small Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Algorithmic Aspects of Genome Rearrangements. (Ordres et désordres dans l'algorithmique du génome).

[BibT_eX]

[DOI]

PhD thesis, 2013

Revisiting the Minimum Breakpoint Linearization Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Inapproximability of (1, 2)-Exemplar Distance.

[BibT_eX]

[DOI]

Minghui Jiang

IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Maximal strip recovery problem with gaps: Hardness and approximation algorithms.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

2012

Tractability and approximability of maximal strip recovery.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Sorting by Transpositions Is Difficult.

[BibT_eX]

[DOI]