default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathias Weller
Person information
- affiliation: Gustave Eiffel University, Marne-la-Vallée, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller:
Maximizing Network Phylogenetic Diversity. CoRR abs/2405.01091 (2024)- 2023
- [j24]Vincent Froese
, Brijnesh J. Jain, Maciej Rymar, Mathias Weller:
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. Algorithmica 85(2): 492-508 (2023) - [c39]Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller:
Finding Degree-Constrained Acyclic Orientations. IPEC 2023: 19:1-19:14 - [c38]Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller:
Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC 2023: 20:1-20:19 - 2022
- [j23]Céline Scornavacca, Mathias Weller:
Treewidth-based algorithms for the small parsimony problem on networks. Algorithms Mol. Biol. 17(1): 15 (2022) - [j22]Tom Davot, Annie Chateau, Rohan Fossé, Rodolphe Giroudeau, Mathias Weller:
On a greedy approach for genome scaffolding. Algorithms Mol. Biol. 17(1): 16 (2022) - [c37]Leo van Iersel, Mark Jones, Mathias Weller:
Embedding Phylogenetic Trees in Networks of Low Treewidth. ESA 2022: 69:1-69:14 - [c36]Krister M. Swenson, Afif Elghraoui, Faramarz Valafar, Siavash Mirarab, Mathias Weller:
Quantifying Hierarchical Conflicts in Homology Statements. RECOMB-CG 2022: 146-167 - [i10]Leo van Iersel, Mark Jones, Mathias Weller:
Embedding phylogenetic trees in networks of low treewidth. CoRR abs/2207.00574 (2022) - 2021
- [j21]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): 2063-2095 (2021) - [j20]Matthias Bentert, Mathias Weller:
Tree Containment With Soft Polytomies. J. Graph Algorithms Appl. 25(1): 417-436 (2021) - [c35]Céline Scornavacca, Mathias Weller:
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks. WABI 2021: 6:1-6:21 - 2020
- [c34]Nils Morawietz, Carolin Rehs, Mathias Weller:
A Timecop's Work Is Harder Than You Think. MFCS 2020: 71:1-71:14 - [c33]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Linearizing Genomes: Exact Methods and Local Search. SOFSEM 2020: 505-518 - [c32]Vincent Berry, Céline Scornavacca, Mathias Weller:
Scanning Phylogenetic Networks Is NP-hard. SOFSEM 2020: 519-530
2010 – 2019
- 2019
- [j19]Laurent Bulteau, Mathias Weller:
Parameterized Algorithms in Bioinformatics: An Overview. Algorithms 12(12): 256 (2019) - [c31]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
New Polynomial-Time Algorithm Around the Scaffolding Problem. AlCoB 2019: 25-38 - [c30]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: 122-135 - [i9]Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller:
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. CoRR abs/1903.03003 (2019) - [i8]Mathias Weller:
Listing Conflicting Triples in Optimal Time. CoRR abs/1911.11048 (2019) - 2018
- [j18]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): 1771-1803 (2018) - [j17]Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On residual approximation in solution extension problems. J. Comb. Optim. 36(4): 1195-1220 (2018) - [j16]Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms 52-53: 70-91 (2018) - [c29]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: 330-356 - [c28]Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
New Results About the Linearization of Scaffolds Sharing Repeated Contigs. COCOA 2018: 94-107 - [c27]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. RECOMB-CG 2018: 91-107 - [c26]Mathias Weller:
Linear-Time Tree Containment in Phylogenetic Networks. RECOMB-CG 2018: 309-323 - [c25]Matthias Bentert, Josef Malík, Mathias Weller:
Tree Containment With Soft Polytomies. SWAT 2018: 9:1-9:14 - [i7]Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller:
What is known about Vertex Cover Kernelization? CoRR abs/1811.09429 (2018) - 2017
- [j15]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): 980-987 (2017) - [j14]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: 315-327 (2017) - [c24]Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
New Insights for Power Edge Set Problem. COCOA (1) 2017: 180-194 - [c23]Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
On the Linearization of Scaffolds Sharing Repeated Contigs. COCOA (2) 2017: 509-517 - [c22]Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Improved Complexity for Power Edge Set Problem. IWOCA 2017: 128-141 - [c21]Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller:
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. IPEC 2017: 30:1-30:12 - [c20]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: 129-143 - [i6]Mathias Weller:
Linear-Time Tree Containment in Phylogenetic Networks. CoRR abs/1702.06364 (2017) - [i5]Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller:
Constructing a Consensus Phylogeny from a Leaf-Removal Distance. CoRR abs/1705.05295 (2017) - 2016
- [j13]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): 189-215 (2016) - [j12]Valentin Garnero, Mathias Weller:
Parameterized certificate dispersal and its variants. Theor. Comput. Sci. 622: 66-78 (2016) - [c19]Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA 2016: 294-308 - [c18]Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On Residual Approximation in Solution Extension Problems. COCOA 2016: 463-476 - 2015
- [j11]Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
Exact approaches for scaffolding. BMC Bioinform. 16(S14): S2 (2015) - [j10]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval scheduling and colorful independent sets. J. Sched. 18(5): 449-469 (2015) - [j9]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): 1-25 (2015) - [c17]Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. COCOA 2015: 409-423 - [c16]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: 123-142 - [c15]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) 2015: 62-74 - [i4]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling. CoRR abs/1501.02492 (2015) - 2014
- [j8]Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Exploiting a hypergraph model for finding Golomb rulers. Acta Informatica 51(7): 449-471 (2014) - [j7]Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller:
Constant Thresholds Can Make Target Set Selection Tractable. Theory Comput. Syst. 55(1): 61-83 (2014) - [j6]Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller:
On the parameterized complexity of consensus clustering. Theor. Comput. Sci. 542: 71-82 (2014) - [i3]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval scheduling and colorful independent sets. CoRR abs/1402.0851 (2014) - [i2]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 abs/1403.5702 (2014) - [i1]Mathias Weller:
Optimal Hub Labeling is NP-complete. CoRR abs/1407.8373 (2014) - 2013
- [b1]Mathias Weller:
Aspects of preprocessing applied to combinatorial graph problems. Berlin Institute of Technology, 2013, ISBN 978-3-7983-2508-1, pp. 1-183 - [j5]Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM J. Discret. Math. 27(1): 75-94 (2013) - [j4]André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller:
On tractable cases of Target Set Selection. Soc. Netw. Anal. Min. 3(2): 233-256 (2013) - [j3]Johannes Uhlmann, Mathias Weller:
Two-Layer Planarization parameterized by feedback edge set. Theor. Comput. Sci. 494: 99-111 (2013) - [c14]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: 361-371 - [c13]Mathias Weller:
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number. SEA 2013: 337-353 - 2012
- [j2]Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
On making directed graphs transitive. J. Comput. Syst. Sci. 78(2): 559-574 (2012) - [j1]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: 12-33 (2012) - [c12]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval Scheduling and Colorful Independent Sets. ISAAC 2012: 247-256 - [c11]Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Exploiting a Hypergraph Model for Finding Golomb Rulers. ISCO 2012: 368-379 - [c10]Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller:
Constant Thresholds Can Make Target Set Selection Tractable. MedAlg 2012: 120-133 - 2011
- [c9]Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller:
On the Parameterized Complexity of Consensus Clustering. ISAAC 2011: 624-633 - [c8]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA 2011: 310-323 - [c7]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: 194-206 - [c6]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
From Few Components to an Eulerian Graph by Adding Arcs. WG 2011: 307-318 - 2010
- [c5]Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu:
Extended Islands of Tractability for Parsimony Haplotyping. CPM 2010: 214-226 - [c4]André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller:
On Tractable Cases of Target Set Selection. ISAAC (1) 2010: 378-389 - [c3]Johannes Uhlmann, Mathias Weller:
Two-Layer Planarization Parameterized by Feedback Edge Set. TAMC 2010: 431-442 - [c2]Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Efficient Algorithms for Eulerian Extension. WG 2010: 100-111
2000 – 2009
- 2009
- [c1]Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
On Making Directed Graphs Transitive. WADS 2009: 542-553
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
