Mathias Weller

82 papers A 1B 16C 12Misc 1Journal 39Unranked 12

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