generated by bibbase.org
  2022 (4)
Treewidth-based algorithms for the small parsimony problem on networks. Scornavacca, C.; and Weller, M. Algorithms Mol. Biol., 17(1): 15. 2022.
link   bibtex  
Embedding Phylogenetic Trees in Networks of Low Treewidth. van Iersel, L.; Jones, M.; and Weller, M. In ESA, volume 244, of LIPIcs, pages 69:1–69:14, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
link   bibtex  
Quantifying Hierarchical Conflicts in Homology Statements. Swenson, K. M.; Elghraoui, A.; Valafar, F.; Mirarab, S.; and Weller, M. In RECOMB-CG, volume 13234, of Lecture Notes in Computer Science, pages 146–167, 2022. Springer
link   bibtex  
Embedding phylogenetic trees in networks of low treewidth. van Iersel, L.; Jones, M.; and Weller, M. CoRR, abs/2207.00574. 2022.
link   bibtex  
  2021 (3)
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. Davot, T.; Chateau, A.; Giroudeau, R.; Weller, M.; and Tabary, D. Algorithmica, 83(7): 2063–2095. 2021.
link   bibtex  
Tree Containment With Soft Polytomies. Bentert, M.; and Weller, M. J. Graph Algorithms Appl., 25(1): 417–436. 2021.
link   bibtex  
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks. Scornavacca, C.; and Weller, M. In WABI, volume 201, of LIPIcs, pages 6:1–6:21, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
link   bibtex  
  2020 (3)
A Timecop's Work Is Harder Than You Think. Morawietz, N.; Rehs, C.; and Weller, M. In MFCS, volume 170, of LIPIcs, pages 71:1–71:14, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
link   bibtex  
Linearizing Genomes: Exact Methods and Local Search. Davot, T.; Chateau, A.; Giroudeau, R.; and Weller, M. In SOFSEM, volume 12011, of Lecture Notes in Computer Science, pages 505–518, 2020. Springer
link   bibtex  
Scanning Phylogenetic Networks Is NP-hard. Berry, V.; Scornavacca, C.; and Weller, M. In SOFSEM, volume 12011, of Lecture Notes in Computer Science, pages 519–530, 2020. Springer
link   bibtex  
  2019 (5)
Parameterized Algorithms in Bioinformatics: An Overview. Bulteau, L.; and Weller, M. Algorithms, 12(12): 256. 2019.
link   bibtex  
New Polynomial-Time Algorithm Around the Scaffolding Problem. Davot, T.; Chateau, A.; Giroudeau, R.; and Weller, M. In AlCoB, volume 11488, of Lecture Notes in Computer Science, pages 25–38, 2019. Springer
link   bibtex  
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. Cazals, P.; Darties, B.; Chateau, A.; Giroudeau, R.; and Weller, M. In IWOCA, volume 11638, of Lecture Notes in Computer Science, pages 122–135, 2019. Springer
link   bibtex  
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. Froese, V.; Jain, B. J.; Rymar, M.; and Weller, M. CoRR, abs/1903.03003. 2019.
link   bibtex  
Listing Conflicting Triples in Optimal Time. Weller, M. CoRR, abs/1911.11048. 2019.
link   bibtex  
  2018 (9)
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Weller, M.; Chateau, A.; Dallard, C.; and Giroudeau, R. Algorithmica, 80(6): 1771–1803. 2018.
link   bibtex  
On residual approximation in solution extension problems. Weller, M.; Chateau, A.; Giroudeau, R.; König, J.; and Pollet, V. J. Comb. Optim., 36(4): 1195–1220. 2018.
link   bibtex  
Complexity and lowers bounds for Power Edge Set Problem. Darties, B.; Champseix, N.; Chateau, A.; Giroudeau, R.; and Weller, M. J. Discrete Algorithms, 52-53: 70–91. 2018.
link   bibtex  
What Is Known About Vertex Cover Kernelization?. Fellows, M. R.; Jaffke, L.; Király, A. I.; Rosamond, F. A.; and Weller, M. In Adventures Between Lower Bounds and Higher Altitudes, volume 11011, of Lecture Notes in Computer Science, pages 330–356, 2018. Springer
link   bibtex  
New Results About the Linearization of Scaffolds Sharing Repeated Contigs. Tabary, D.; Davot, T.; Weller, M.; Chateau, A.; and Giroudeau, R. In COCOA, volume 11346, of Lecture Notes in Computer Science, pages 94–107, 2018. Springer
link   bibtex  
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. Davot, T.; Chateau, A.; Giroudeau, R.; and Weller, M. In RECOMB-CG, volume 11183, of Lecture Notes in Computer Science, pages 91–107, 2018. Springer
link   bibtex  
Linear-Time Tree Containment in Phylogenetic Networks. Weller, M. In RECOMB-CG, volume 11183, of Lecture Notes in Computer Science, pages 309–323, 2018. Springer
link   bibtex  
Tree Containment With Soft Polytomies. Bentert, M.; Malík, J.; and Weller, M. In SWAT, volume 101, of LIPIcs, pages 9:1–9:14, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
link   bibtex  
What is known about Vertex Cover Kernelization?. Fellows, M. R.; Jaffke, L.; Király, A. I.; Rosamond, F. A.; and Weller, M. CoRR, abs/1811.09429. 2018.
link   bibtex  
  2017 (9)
Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses. Jacox, E.; Weller, M.; Tannier, E.; and Scornavacca, C. Bioinform., 33(7): 980–987. 2017.
link   bibtex  
A polynomial-time algorithm for Outerplanar Diameter Improvement. Cohen, N.; Gonçalves, D.; Kim, E. J.; Paul, C.; Sau, I.; Thilikos, D. M.; and Weller, M. J. Comput. Syst. Sci., 89: 315–327. 2017.
link   bibtex  
New Insights for Power Edge Set Problem. Darties, B.; Chateau, A.; Giroudeau, R.; and Weller, M. In COCOA (1), volume 10627, of Lecture Notes in Computer Science, pages 180–194, 2017. Springer
link   bibtex  
On the Linearization of Scaffolds Sharing Repeated Contigs. Weller, M.; Chateau, A.; and Giroudeau, R. In COCOA (2), volume 10628, of Lecture Notes in Computer Science, pages 509–517, 2017. Springer
link   bibtex  
Improved Complexity for Power Edge Set Problem. Darties, B.; Chateau, A.; Giroudeau, R.; and Weller, M. In IWOCA, volume 10765, of Lecture Notes in Computer Science, pages 128–141, 2017. Springer
link   bibtex  
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. Dell, H.; Komusiewicz, C.; Talmon, N.; and Weller, M. In IPEC, volume 89, of LIPIcs, pages 30:1–30:12, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
link   bibtex  
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). Chauve, C.; Jones, M.; Lafond, M.; Scornavacca, C.; and Weller, M. In SPIRE, volume 10508, of Lecture Notes in Computer Science, pages 129–143, 2017. Springer
link   bibtex  
Linear-Time Tree Containment in Phylogenetic Networks. Weller, M. CoRR, abs/1702.06364. 2017.
link   bibtex  
Constructing a Consensus Phylogeny from a Leaf-Removal Distance. Chauve, C.; Jones, M.; Lafond, M.; Scornavacca, C.; and Weller, M. CoRR, abs/1705.05295. 2017.
link   bibtex  
  2016 (4)
Phylogenetic incongruence through the lens of Monadic Second Order logic. Kelk, S.; van Iersel, L.; Scornavacca, C.; and Weller, M. J. Graph Algorithms Appl., 20(2): 189–215. 2016.
link   bibtex  
Parameterized certificate dispersal and its variants. Garnero, V.; and Weller, M. Theor. Comput. Sci., 622: 66–78. 2016.
link   bibtex  
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. Dallard, C.; Weller, M.; Chateau, A.; and Giroudeau, R. In COCOA, volume 10043, of Lecture Notes in Computer Science, pages 294–308, 2016. Springer
link   bibtex  
On Residual Approximation in Solution Extension Problems. Weller, M.; Chateau, A.; Giroudeau, R.; König, J.; and Pollet, V. In COCOA, volume 10043, of Lecture Notes in Computer Science, pages 463–476, 2016. Springer
link   bibtex  
  2015 (6)
Interval scheduling and colorful independent sets. van Bevern, R.; Mnich, M.; Niedermeier, R.; and Weller, M. J. Sched., 18(5): 449–469. 2015.
link   bibtex  
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. Chen, J.; Komusiewicz, C.; Niedermeier, R.; Sorge, M.; Suchý, O.; and Weller, M. SIAM J. Discret. Math., 29(1): 1–25. 2015.
link   bibtex  
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. Weller, M.; Chateau, A.; and Giroudeau, R. In COCOA, volume 9486, of Lecture Notes in Computer Science, pages 409–423, 2015. Springer
link   bibtex  
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. Cohen, N.; Gonçalves, D.; Kim, E.; Paul, C.; Sau, I.; Thilikos, D. M.; and Weller, M. In CSR, volume 9139, of Lecture Notes in Computer Science, pages 123–142, 2015. Springer
link   bibtex  
On the Complexity of Hub Labeling (Extended Abstract). Babenko, M. A.; Goldberg, A. V.; Kaplan, H.; Savchenko, R.; and Weller, M. In MFCS (2), volume 9235, of Lecture Notes in Computer Science, pages 62–74, 2015. Springer
link   bibtex  
On the Complexity of Hub Labeling. Babenko, M. A.; Goldberg, A. V.; Kaplan, H.; Savchenko, R.; and Weller, M. CoRR, abs/1501.02492. 2015.
link   bibtex  
  2014 (6)
Exploiting a hypergraph model for finding Golomb rulers. Sorge, M.; Moser, H.; Niedermeier, R.; and Weller, M. Acta Informatica, 51(7): 449–471. 2014.
link   bibtex  
Constant Thresholds Can Make Target Set Selection Tractable. Chopin, M.; Nichterlein, A.; Niedermeier, R.; and Weller, M. Theory Comput. Syst., 55(1): 61–83. 2014.
link   bibtex  
On the parameterized complexity of consensus clustering. Dörnfelder, M.; Guo, J.; Komusiewicz, C.; and Weller, M. Theor. Comput. Sci., 542: 71–82. 2014.
link   bibtex  
Interval scheduling and colorful independent sets. van Bevern, R.; Mnich, M.; Niedermeier, R.; and Weller, M. CoRR, abs/1402.0851. 2014.
link   bibtex  
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. Cohen, N.; Gonçalves, D.; Kim, E. J.; Paul, C.; Sau, I.; Thilikos, D. M.; and Weller, M. CoRR, abs/1403.5702. 2014.
link   bibtex  
Optimal Hub Labeling is NP-complete. Weller, M. CoRR, abs/1407.8373. 2014.
link   bibtex  
  2013 (6)
Aspects of preprocessing applied to combinatorial graph problems. Weller, M. Ph.D. Thesis, Berlin Institute of Technology, 2013.
link   bibtex  
Efficient Algorithms for Eulerian Extension and Rural Postman. Dorn, F.; Moser, H.; Niedermeier, R.; and Weller, M. SIAM J. Discret. Math., 27(1): 75–94. 2013.
link   bibtex  
On tractable cases of Target Set Selection. Nichterlein, A.; Niedermeier, R.; Uhlmann, J.; and Weller, M. Soc. Netw. Anal. Min., 3(2): 233–256. 2013.
link   bibtex  
Two-Layer Planarization parameterized by feedback edge set. Uhlmann, J.; and Weller, M. Theor. Comput. Sci., 494: 99–111. 2013.
link   bibtex  
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. Chen, J.; Komusiewicz, C.; Niedermeier, R.; Sorge, M.; Suchý, O.; and Weller, M. In ISAAC, volume 8283, of Lecture Notes in Computer Science, pages 361–371, 2013. Springer
link   bibtex  
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number. Weller, M. In SEA, volume 7933, of Lecture Notes in Computer Science, pages 337–353, 2013. Springer
link   bibtex  
  2012 (5)
On making directed graphs transitive. Weller, M.; Komusiewicz, C.; Niedermeier, R.; and Uhlmann, J. J. Comput. Syst. Sci., 78(2): 559–574. 2012.
link   bibtex  
A new view on Rural Postman based on Eulerian Extension and Matching. Sorge, M.; van Bevern, R.; Niedermeier, R.; and Weller, M. J. Discrete Algorithms, 16: 12–33. 2012.
link   bibtex  
Interval Scheduling and Colorful Independent Sets. van Bevern, R.; Mnich, M.; Niedermeier, R.; and Weller, M. In ISAAC, volume 7676, of Lecture Notes in Computer Science, pages 247–256, 2012. Springer
link   bibtex  
Exploiting a Hypergraph Model for Finding Golomb Rulers. Sorge, M.; Moser, H.; Niedermeier, R.; and Weller, M. In ISCO, volume 7422, of Lecture Notes in Computer Science, pages 368–379, 2012. Springer
link   bibtex  
Constant Thresholds Can Make Target Set Selection Tractable. Chopin, M.; Nichterlein, A.; Niedermeier, R.; and Weller, M. In MedAlg, volume 7659, of Lecture Notes in Computer Science, pages 120–133, 2012. Springer
link   bibtex  
  2011 (4)
On the Parameterized Complexity of Consensus Clustering. Dörnfelder, M.; Guo, J.; Komusiewicz, C.; and Weller, M. In ISAAC, volume 7074, of Lecture Notes in Computer Science, pages 624–633, 2011. Springer
link   bibtex  
A New View on Rural Postman Based on Eulerian Extension and Matching. Sorge, M.; van Bevern, R.; Niedermeier, R.; and Weller, M. In IWOCA, volume 7056, of Lecture Notes in Computer Science, pages 310–323, 2011. Springer
link   bibtex  
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. van Bevern, R.; Hartung, S.; Kammer, F.; Niedermeier, R.; and Weller, M. In IPEC, volume 7112, of Lecture Notes in Computer Science, pages 194–206, 2011. Springer
link   bibtex  
From Few Components to an Eulerian Graph by Adding Arcs. Sorge, M.; van Bevern, R.; Niedermeier, R.; and Weller, M. In WG, volume 6986, of Lecture Notes in Computer Science, pages 307–318, 2011. Springer
link   bibtex  
  2010 (4)
Extended Islands of Tractability for Parsimony Haplotyping. Fleischer, R.; Guo, J.; Niedermeier, R.; Uhlmann, J.; Wang, Y.; Weller, M.; and Wu, X. In CPM, volume 6129, of Lecture Notes in Computer Science, pages 214–226, 2010. Springer
link   bibtex  
On Tractable Cases of Target Set Selection. Nichterlein, A.; Niedermeier, R.; Uhlmann, J.; and Weller, M. In ISAAC (1), volume 6506, of Lecture Notes in Computer Science, pages 378–389, 2010. Springer
link   bibtex  
Two-Layer Planarization Parameterized by Feedback Edge Set. Uhlmann, J.; and Weller, M. In TAMC, volume 6108, of Lecture Notes in Computer Science, pages 431–442, 2010. Springer
link   bibtex  
Efficient Algorithms for Eulerian Extension. Dorn, F.; Moser, H.; Niedermeier, R.; and Weller, M. In WG, volume 6410, of Lecture Notes in Computer Science, pages 100–111, 2010.
link   bibtex  
  2009 (1)
On Making Directed Graphs Transitive. Weller, M.; Komusiewicz, C.; Niedermeier, R.; and Uhlmann, J. In WADS, volume 5664, of Lecture Notes in Computer Science, pages 542–553, 2009. Springer
link   bibtex