Extended Islands of Tractability for Parsimony Haplotyping. - Rudolf Fleischer; Jiong Guo; Rolf Niedermeier; Johannes Uhlmann; Yihui Wang; Mathias Weller; Xi Wu 001 (CPM, 2010)

Efficient Algorithms for Eulerian Extension. - Frederic Dorn; Hannes Moser; Rolf Niedermeier; Mathias Weller (WG, 2010)

Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. - René van Bevern; Sepp Hartung; Frank Kammer; Rolf Niedermeier; Mathias Weller (IPEC, 2011)

From Few Components to an Eulerian Graph by Adding Arcs. - Manuel Sorge; René van Bevern; Rolf Niedermeier; Mathias Weller (WG, 2011)

On making directed graphs transitive. - Mathias Weller; Christian Komusiewicz; Rolf Niedermeier; Johannes Uhlmann (J. Comput. Syst. Sci., 2012)

A new view on Rural Postman based on Eulerian Extension and Matching. - Manuel Sorge; René van Bevern; Rolf Niedermeier; Mathias Weller (J. Discrete Algorithms, 2012)

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. - Jiehua Chen 001; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Ondrej Suchý 001; Mathias Weller (ISAAC, 2013)

An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number. - Mathias Weller (SEA, 2013)

Efficient Algorithms for Eulerian Extension and Rural Postman. - Frederic Dorn; Hannes Moser; Rolf Niedermeier; Mathias Weller (SIAM J. Discret. Math., 2013)

On tractable cases of Target Set Selection. - André Nichterlein; Rolf Niedermeier; Johannes Uhlmann; Mathias Weller (Soc. Netw. Anal. Min., 2013)

Two-Layer Planarization parameterized by feedback edge set. - Johannes Uhlmann; Mathias Weller (Theor. Comput. Sci., 2013)

Aspects of preprocessing applied to combinatorial graph problems. - Mathias Weller (2013)

Exploiting a hypergraph model for finding Golomb rulers. - Manuel Sorge; Hannes Moser; Rolf Niedermeier; Mathias Weller (Acta Informatica, 2014)

Optimal Hub Labeling is NP-complete. - Mathias Weller (CoRR, 2014)

Constant Thresholds Can Make Target Set Selection Tractable. - Morgan Chopin; André Nichterlein; Rolf Niedermeier; Mathias Weller (Theory Comput. Syst., 2014)

On the parameterized complexity of consensus clustering. - Martin Dörnfelder; Jiong Guo; Christian Komusiewicz; Mathias Weller (Theor. Comput. Sci., 2014)

On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. - Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA, 2015)

On the Complexity of Hub Labeling (Extended Abstract). - Maxim A. Babenko; Andrew V. Goldberg; Haim Kaplan; Ruslan Savchenko; Mathias Weller (MFCS (2), 2015)

On the Complexity of Hub Labeling. - Maxim A. Babenko; Andrew V. Goldberg; Haim Kaplan; Ruslan Savchenko; Mathias Weller (CoRR, 2015)

Interval scheduling and colorful independent sets. - René van Bevern; Matthias Mnich; Rolf Niedermeier; Mathias Weller (J. Sched., 2015)

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. - Jiehua Chen 001; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Ondrej Suchý 001; Mathias Weller (SIAM J. Discret. Math., 2015)

Exact approaches for scaffolding. - Mathias Weller; Annie Chateau; Rodolphe Giroudeau (BMC Bioinform., 2015)

Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. - Clément Dallard; Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA, 2016)

Phylogenetic incongruence through the lens of Monadic Second Order logic. - Steven Kelk; Leo van Iersel; Céline Scornavacca; Mathias Weller (J. Graph Algorithms Appl., 2016)

Parameterized certificate dispersal and its variants. - Valentin Garnero; Mathias Weller (Theor. Comput. Sci., 2016)

New Insights for Power Edge Set Problem. - Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (COCOA (1), 2017)

On the Linearization of Scaffolds Sharing Repeated Contigs. - Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA (2), 2017)

Improved Complexity for Power Edge Set Problem. - Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (IWOCA, 2017)

The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. - Holger Dell; Christian Komusiewicz; Nimrod Talmon; Mathias Weller (IPEC, 2017)

Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). - Cédric Chauve; Mark Jones 001; Manuel Lafond; Céline Scornavacca; Mathias Weller (SPIRE, 2017)

Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses. - Edwin Jacox; Mathias Weller; Eric Tannier; Céline Scornavacca (Bioinform., 2017)

Constructing a Consensus Phylogeny from a Leaf-Removal Distance. - Cédric Chauve; Mark Jones 001; Manuel Lafond; Céline Scornavacca; Mathias Weller (CoRR, 2017)

A polynomial-time algorithm for Outerplanar Diameter Improvement. - Nathann Cohen; Daniel Gonçalves 001; Eun Jung Kim 002; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos; Mathias Weller (J. Comput. Syst. Sci., 2017)

What Is Known About Vertex Cover Kernelization? - Michael R. Fellows; Lars Jaffke; Aliz Izabella Király; Frances A. Rosamond; Mathias Weller (Adventures Between Lower Bounds and Higher Altitudes, 2018)

New Results About the Linearization of Scaffolds Sharing Repeated Contigs. - Dorine Tabary; Tom Davot; Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA, 2018)

On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (RECOMB-CG, 2018)

Linear-Time Tree Containment in Phylogenetic Networks. - Mathias Weller (RECOMB-CG, 2018)

Tree Containment With Soft Polytomies. - Matthias Bentert; Josef Malík; Mathias Weller (SWAT, 2018)

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. - Mathias Weller; Annie Chateau; Clément Dallard; Rodolphe Giroudeau (Algorithmica, 2018)

On residual approximation in solution extension problems. - Mathias Weller; Annie Chateau; Rodolphe Giroudeau; Jean-Claude König; Valentin Pollet (J. Comb. Optim., 2018)

Complexity and lowers bounds for Power Edge Set Problem. - Benoît Darties; Nicolas Champseix; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (J. Discrete Algorithms, 2018)

New Polynomial-Time Algorithm Around the Scaffolding Problem. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (AlCoB, 2019)

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. - Pierre Cazals; Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (IWOCA, 2019)

Parameterized Algorithms in Bioinformatics: An Overview. - Laurent Bulteau; Mathias Weller (Algorithms, 2019)

Listing Conflicting Triples in Optimal Time. - Mathias Weller (CoRR, 2019)

A Timecop's Work Is Harder Than You Think. - Nils Morawietz; Carolin Rehs; Mathias Weller (MFCS, 2020)

Scanning Phylogenetic Networks Is NP-hard. - Vincent Berry; Céline Scornavacca; Mathias Weller (SOFSEM, 2020)

Linearizing Genomes: Exact Methods and Local Search. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (SOFSEM, 2020)

Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller; Dorine Tabary (Algorithmica, 2021)

Tree Containment With Soft Polytomies. - Matthias Bentert; Mathias Weller (J. Graph Algorithms Appl., 2021)

Quantifying Hierarchical Conflicts in Homology Statements. - Krister M. Swenson; Afif Elghraoui; Faramarz Valafar; Siavash Mirarab; Mathias Weller (RECOMB-CG, 2022)

On a greedy approach for genome scaffolding. - Tom Davot; Annie Chateau; Rohan Fossé; Rodolphe Giroudeau; Mathias Weller (Algorithms Mol. Biol., 2022)

Treewidth-based algorithms for the small parsimony problem on networks. - Céline Scornavacca; Mathias Weller (Algorithms Mol. Biol., 2022)

Graph Clustering Problems Under the Lens of Parameterized Local Search. - Jaroslav Garvardt; Nils Morawietz; André Nichterlein; Mathias Weller (IPEC, 2023)

Finding Degree-Constrained Acyclic Orientations. - Jaroslav Garvardt; Malte Renken; Jannik Schestag; Mathias Weller (IPEC, 2023)

Embedding phylogenetic trees in networks of low treewidth. - Leo van Iersel; Mark Jones 001; Mathias Weller (Discret. Math. Theor. Comput. Sci., 2023)

Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. - Vincent Froese; Brijnesh J. Jain; Maciej Rymar; Mathias Weller (Algorithmica, 2023)

Maximizing Network Phylogenetic Diversity. - Leo van Iersel; Mark Jones 001; Jannik Schestag; Céline Scornavacca; Mathias Weller (CoRR, 2024)

Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond. - Leo van Iersel; Mark Jones 001; Jannik Schestag; Céline Scornavacca; Mathias Weller (RECOMB-CG, 2025)

Average-Tree Phylogenetic Diversity of Networks. - Leo van Iersel; Mark Jones 001; Jannik Schestag; Céline Scornavacca; Mathias Weller (WABI, 2025)