Mathias Weller

Orcid: 0000-0002-9653-3690

Affiliations:

Gustave Eiffel University, Marne-la-Vallée, France

According to our database¹, Mathias Weller authored at least 61 papers between 2009 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

When Many Trees Go to War.

[BibT_eX]

[DOI]

Mathias Weller

Norbert Zeh

CoRR, August, 2025

Average-Tree Phylogenetic Diversity of Networks.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Algorithms for Bioinformatics, 2025

Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 22nd RECOMB International Workshop, 2025

2024

Maximizing Network Phylogenetic Diversity.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series.

[BibT_eX]

[DOI]

Algorithmica, February, 2023

Finding Degree-Constrained Acyclic Orientations.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Graph Clustering Problems Under the Lens of Parameterized Local Search.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

On a greedy approach for genome scaffolding.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2022

Quantifying Hierarchical Conflicts in Homology Statements.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 19th International Conference, 2022

Embedding Phylogenetic Trees in Networks of Low Treewidth.

[BibT_eX]

[DOI]

Leo van Iersel

Mark Jones

Mathias Weller

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Tree Containment With Soft Polytomies.

[BibT_eX]

[DOI]

Matthias Bentert

Mathias Weller

J. Graph Algorithms Appl., 2021

Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds.

[BibT_eX]

[DOI]

Algorithmica, 2021

Treewidth-Based Algorithms for the Small Parsimony Problem on Networks.

[BibT_eX]

[DOI]

Céline Scornavacca

Mathias Weller

Proceedings of the 21st International Workshop on Algorithms in Bioinformatics, 2021

2020

Linearizing Genomes: Exact Methods and Local Search.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Scanning Phylogenetic Networks Is NP-hard.

[BibT_eX]

[DOI]

Vincent Berry

Céline Scornavacca

Mathias Weller

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

A Timecop's Work Is Harder Than You Think.

[BibT_eX]

[DOI]

Nils Morawietz

Carolin Rehs

Mathias Weller

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Listing Conflicting Triples in Optimal Time.

[BibT_eX]

[DOI]

Mathias Weller

CoRR, 2019

Parameterized Algorithms in Bioinformatics: An Overview.

[BibT_eX]

[DOI]

Laurent Bulteau

Mathias Weller

Algorithms, 2019

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

New Polynomial-Time Algorithm Around the Scaffolding Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2018

Complexity and lowers bounds for Power Edge Set Problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases.

[BibT_eX]

[DOI]

Algorithmica, 2018

Tree Containment With Soft Polytomies.

[BibT_eX]

[DOI]

Matthias Bentert

Josef Malík

Mathias Weller

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Linear-Time Tree Containment in Phylogenetic Networks.

[BibT_eX]

[DOI]

Mathias Weller

Proceedings of the Comparative Genomics - 16th International Conference, 2018

On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 16th International Conference, 2018

New Results About the Linearization of Scaffolds Sharing Repeated Contigs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

What Is Known About Vertex Cover Kernelization?

[BibT_eX]

[DOI]

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance.

[BibT_eX]

[DOI]

CoRR, 2017

Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses.

[BibT_eX]

[DOI]

Bioinform., 2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration.

[BibT_eX]

[DOI]

Holger Dell

Christian Komusiewicz

Nimrod Talmon

Mathias Weller

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Improved Complexity for Power Edge Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

On the Linearization of Scaffolds Sharing Repeated Contigs.

[BibT_eX]

[DOI]

Mathias Weller

Annie Chateau

Rodolphe Giroudeau

Proceedings of the Combinatorial Optimization and Applications, 2017

New Insights for Power Edge Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Parameterized certificate dispersal and its variants.

[BibT_eX]

[DOI]

Valentin Garnero

Mathias Weller

Theor. Comput. Sci., 2016

Phylogenetic incongruence through the lens of Monadic Second Order logic.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2016

On Residual Approximation in Solution Extension Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Exact approaches for scaffolding.

[BibT_eX]

[DOI]

Mathias Weller

Annie Chateau

Rodolphe Giroudeau

BMC Bioinform., December, 2015

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.

[BibT_eX]

[DOI]

Jiehua Chen

Christian Komusiewicz

SIAM J. Discret. Math., 2015

On the Complexity of Hub Labeling.

[BibT_eX]

[DOI]

CoRR, 2015

On the Complexity of Hub Labeling (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

A Polynomial-Time Algorithm for Outerplanar Diameter Improvement.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Mathias Weller

Proceedings of the Computer Science - Theory and Applications, 2015

On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs.

[BibT_eX]

[DOI]

Mathias Weller

Annie Chateau

Rodolphe Giroudeau

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Optimal Hub Labeling is NP-complete.

[BibT_eX]

[DOI]

Mathias Weller

CoRR, 2014

2013

Aspects of preprocessing applied to combinatorial graph problems.

[BibT_eX]

[DOI]

Mathias Weller

PhD thesis, 2013

Efficient Algorithms for Eulerian Extension and Rural Postman.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number.

[BibT_eX]

[DOI]

Mathias Weller

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.

[BibT_eX]

[DOI]

Jiehua Chen

Christian Komusiewicz

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Constant Thresholds Can Make Target Set Selection Tractable.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Algorithms, 2012

Exploiting a Hypergraph Model for Finding Golomb Rulers.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Interval Scheduling and Colorful Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

From Few Components to an Eulerian Graph by Adding Arcs.

[BibT_eX]

[DOI]

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

Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

A New View on Rural Postman Based on Eulerian Extension and Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

On the Parameterized Complexity of Consensus Clustering.

[BibT_eX]

[DOI]

Martin Dörnfelder

Jiong Guo

Christian Komusiewicz

Mathias Weller

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Efficient Algorithms for Eulerian Extension.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Two-Layer Planarization Parameterized by Feedback Edge Set.

[BibT_eX]

[DOI]

Johannes Uhlmann

Mathias Weller

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Tractable Cases of Target Set Selection.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Extended Islands of Tractability for Parsimony Haplotyping.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

On Making Directed Graphs Transitive.

[BibT_eX]

[DOI]

Mathias Weller

Christian Komusiewicz

Rolf Niedermeier

Johannes Uhlmann

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Mathias Weller

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...