Mathias Weller

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 42

Top Venues

Berlin Institute of Technology (PHD)

Education History

Berlin Institute of Technology

PHD

Publications

Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller
Maximizing Network Phylogenetic Diversity. CoRR (2024)
Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. Algorithmica 85 (2) (2023)
Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller
Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC (2023)
Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller
Finding Degree-Constrained Acyclic Orientations. IPEC (2023)
Céline Scornavacca, Mathias Weller
Treewidth-based algorithms for the small parsimony problem on networks. Algorithms Mol. Biol. 17 (1) (2022)
Tom Davot, Annie Chateau, Rohan Fossé, Rodolphe Giroudeau, Mathias Weller
On a greedy approach for genome scaffolding. Algorithms Mol. Biol. 17 (1) (2022)
Krister M. Swenson, Afif Elghraoui, Faramarz Valafar, Siavash Mirarab, Mathias Weller
Quantifying Hierarchical Conflicts in Homology Statements. RECOMB-CG (2022)
Leo van Iersel, Mark Jones, Mathias Weller
Embedding Phylogenetic Trees in Networks of Low Treewidth. ESA (2022)
Leo van Iersel, Mark Jones, Mathias Weller
Embedding phylogenetic trees in networks of low treewidth. CoRR (2022)
Matthias Bentert, Mathias Weller
Tree Containment With Soft Polytomies. J. Graph Algorithms Appl. 25 (1) (2021)
Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller, Dorine Tabary
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. Algorithmica 83 (7) (2021)
Céline Scornavacca, Mathias Weller
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks. WABI (2021)
Vincent Berry, Céline Scornavacca, Mathias Weller
Scanning Phylogenetic Networks Is NP-hard. SOFSEM (2020)
Nils Morawietz, Carolin Rehs, Mathias Weller
A Timecop's Work Is Harder Than You Think. MFCS (2020)
Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
Linearizing Genomes: Exact Methods and Local Search. SOFSEM (2020)
Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. CoRR (2019)
Mathias Weller
Listing Conflicting Triples in Optimal Time. CoRR (2019)
Pierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. IWOCA (2019)
Laurent Bulteau, Mathias Weller
Parameterized Algorithms in Bioinformatics: An Overview. Algorithms 12 (12) (2019)
Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
New Polynomial-Time Algorithm Around the Scaffolding Problem. AlCoB (2019)
Matthias Bentert, Josef Malík, Mathias Weller
Tree Containment With Soft Polytomies. SWAT (2018)
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller
What Is Known About Vertex Cover Kernelization? Adventures Between Lower Bounds and Higher Altitudes (2018)
Mathias Weller
Linear-Time Tree Containment in Phylogenetic Networks. RECOMB-CG (2018)
Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. RECOMB-CG (2018)
Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Algorithmica 80 (6) (2018)
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller
What is known about Vertex Cover Kernelization? CoRR (2018)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
On residual approximation in solution extension problems. J. Comb. Optim. 36 (4) (2018)
Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
New Results About the Linearization of Scaffolds Sharing Repeated Contigs. COCOA (2018)
Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms (2018)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau
On the Linearization of Scaffolds Sharing Repeated Contigs. COCOA (2) (2017)
Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
New Insights for Power Edge Set Problem. COCOA (1) (2017)
Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. IPEC (2017)
Mathias Weller
Linear-Time Tree Containment in Phylogenetic Networks. CoRR (2017)
Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). SPIRE (2017)
Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
Improved Complexity for Power Edge Set Problem. IWOCA (2017)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. 89 (2017)
Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller
Constructing a Consensus Phylogeny from a Leaf-Removal Distance. CoRR (2017)
Edwin Jacox, Mathias Weller, Eric Tannier, Céline Scornavacca
Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses. Bioinform. 33 (7) (2017)
Steven Kelk, Leo van Iersel, Céline Scornavacca, Mathias Weller
Phylogenetic incongruence through the lens of Monadic Second Order logic. J. Graph Algorithms Appl. 20 (2) (2016)
Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA (2016)
Valentin Garnero, Mathias Weller
Parameterized certificate dispersal and its variants. Theor. Comput. Sci. 622 (2016)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
On Residual Approximation in Solution Extension Problems. COCOA (2016)
Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. 29 (1) (2015)
Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
On the Complexity of Hub Labeling. CoRR (2015)
Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) (2015)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. COCOA (2015)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau
Exact approaches for scaffolding. BMC Bioinform. 16 (S14) (2015)
Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR (2015)
René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
Interval scheduling and colorful independent sets. J. Sched. 18 (5) (2015)
Mathias Weller
Optimal Hub Labeling is NP-complete. CoRR (2014)
Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller
Exploiting a hypergraph model for finding Golomb rulers. Acta Informatica 51 (7) (2014)
Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller
On the parameterized complexity of consensus clustering. Theor. Comput. Sci. 542 (2014)
Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller
Constant Thresholds Can Make Target Set Selection Tractable. Theory Comput. Syst. 55 (1) (2014)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR (2014)
René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
Interval scheduling and colorful independent sets. CoRR (2014)
Johannes Uhlmann, Mathias Weller
Two-Layer Planarization parameterized by feedback edge set. Theor. Comput. Sci. 494 (2013)
Mathias Weller
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number. SEA (2013)
Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. ISAAC (2013)
André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
On tractable cases of Target Set Selection. Soc. Netw. Anal. Min. 3 (2) (2013)
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM J. Discret. Math. 27 (1) (2013)
Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller
Exploiting a Hypergraph Model for Finding Golomb Rulers. ISCO (2012)
René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
Interval Scheduling and Colorful Independent Sets. ISAAC (2012)
Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller
Constant Thresholds Can Make Target Set Selection Tractable. MedAlg (2012)
Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
On making directed graphs transitive. J. Comput. Syst. Sci. 78 (2) (2012)
Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
A new view on Rural Postman based on Eulerian Extension and Matching. J. Discrete Algorithms 16 (2012)
René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC (2011)
Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller
On the Parameterized Complexity of Consensus Clustering. ISAAC (2011)
Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
From Few Components to an Eulerian Graph by Adding Arcs. WG (2011)
Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA (2011)
Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu
Extended Islands of Tractability for Parsimony Haplotyping. CPM (2010)
André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
On Tractable Cases of Target Set Selection. ISAAC (1) (2010)
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
Efficient Algorithms for Eulerian Extension. WG (2010)
Johannes Uhlmann, Mathias Weller
Two-Layer Planarization Parameterized by Feedback Edge Set. TAMC (2010)
Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
On Making Directed Graphs Transitive. WADS (2009)

Mathias Weller.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mathias Weller