Mathias Weller
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
30
Venues
14
Active years
2009–2026
Best venue rank
C
Where they publish
Papers
30 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SOFSEM | Exploiting Low Scanwidth to Resolve Soft Polytomies. | Sebastian Bruchhold, Mathias Weller |
| 2025 | WABI | Average-Tree Phylogenetic Diversity of Networks. | Leo van Iersel, Mark Jones, Jannik Schestag, Cline Scornavacca, Mathias Weller |
| 2022 | ESA | Embedding Phylogenetic Trees in Networks of Low Treewidth. | Leo van Iersel, Mark Jones, Mathias Weller |
| 2021 | WABI | Treewidth-Based Algorithms for the Small Parsimony Problem on Networks. | Cline Scornavacca, Mathias Weller |
| 2020 | MFCS | A Timecop's Work Is Harder Than You Think. | Nils Morawietz, Carolin Rehs, Mathias Weller |
| 2020 | SOFSEM | Scanning Phylogenetic Networks Is NP-hard. | Vincent Berry, Cline Scornavacca, Mathias Weller |
| 2020 | SOFSEM | Linearizing Genomes: Exact Methods and Local Search. | Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller |
| 2019 | IWOCA | Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. | Pierre Cazals, Benot Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller |
| 2018 | COCOA | New Results About the Linearization of Scaffolds Sharing Repeated Contigs. | Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau |
| 2018 | RECOMB | On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. | Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller |
| 2018 | RECOMB | Linear-Time Tree Containment in Phylogenetic Networks. | Mathias Weller |
| 2017 | COCOA | New Insights for Power Edge Set Problem. | Benot Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller |
| 2017 | COCOA | On the Linearization of Scaffolds Sharing Repeated Contigs. | Mathias Weller, Annie Chateau, Rodolphe Giroudeau |
| 2017 | IWOCA | Improved Complexity for Power Edge Set Problem. | Benot Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller |
| 2017 | SPIRE | Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). | Cdric Chauve, Mark Jones, Manuel Lafond, Cline Scornavacca, Mathias Weller |
| 2016 | COCOA | Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. | Clment Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau |
| 2016 | COCOA | On Residual Approximation in Solution Extension Problems. | Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude Knig, Valentin Pollet |
| 2015 | COCOA | On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. | Mathias Weller, Annie Chateau, Rodolphe Giroudeau |
| 2015 | CSR | A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. | Nathann Cohen, Daniel Gonalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller |
| 2015 | MFCS | On the Complexity of Hub Labeling (Extended Abstract). | Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller |
| 2013 | ISAAC | Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. | Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Such, Mathias Weller |
| 2012 | ISAAC | Interval Scheduling and Colorful Independent Sets. | Ren van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller |
| 2011 | ISAAC | On the Parameterized Complexity of Consensus Clustering. | Martin Drnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller |
| 2011 | IWOCA | A New View on Rural Postman Based on Eulerian Extension and Matching. | Manuel Sorge, Ren van Bevern, Rolf Niedermeier, Mathias Weller |
| 2011 | WG | From Few Components to an Eulerian Graph by Adding Arcs. | Manuel Sorge, Ren van Bevern, Rolf Niedermeier, Mathias Weller |
| 2010 | CPM | Extended Islands of Tractability for Parsimony Haplotyping. | Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu |
| 2010 | ISAAC | On Tractable Cases of Target Set Selection. | Andr Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller |
| 2010 | TAMC | Two-Layer Planarization Parameterized by Feedback Edge Set. | Johannes Uhlmann, Mathias Weller |
| 2010 | WG | Efficient Algorithms for Eulerian Extension. | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller |
| 2009 | WADS | On Making Directed Graphs Transitive. | Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |