BibTeX records: Mathias Weller

download as .bib file

@article{DBLP:journals/almob/ScornavaccaW22,
  author    = {C{\'{e}}line Scornavacca and
               Mathias Weller},
  title     = {Treewidth-based algorithms for the small parsimony problem on networks},
  journal   = {Algorithms Mol. Biol.},
  volume    = {17},
  number    = {1},
  pages     = {15},
  year      = {2022},
  url       = {https://doi.org/10.1186/s13015-022-00216-w},
  doi       = {10.1186/s13015-022-00216-w},
  timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/almob/ScornavaccaW22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Iersel0W22,
  author    = {Leo van Iersel and
               Mark Jones and
               Mathias Weller},
  editor    = {Shiri Chechik and
               Gonzalo Navarro and
               Eva Rotenberg and
               Grzegorz Herman},
  title     = {Embedding Phylogenetic Trees in Networks of Low Treewidth},
  booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
               5-9, 2022, Berlin/Potsdam, Germany},
  series    = {LIPIcs},
  volume    = {244},
  pages     = {69:1--69:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2022},
  url       = {https://doi.org/10.4230/LIPIcs.ESA.2022.69},
  doi       = {10.4230/LIPIcs.ESA.2022.69},
  timestamp = {Mon, 26 Sep 2022 17:00:19 +0200},
  biburl    = {https://dblp.org/rec/conf/esa/Iersel0W22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recombcg/SwensonEVMW22,
  author    = {Krister M. Swenson and
               Afif Elghraoui and
               Faramarz Valafar and
               Siavash Mirarab and
               Mathias Weller},
  editor    = {Lingling Jin and
               Dannie Durand},
  title     = {Quantifying Hierarchical Conflicts in Homology Statements},
  booktitle = {Comparative Genomics - 19th International Conference, {RECOMB-CG}
               2022, La Jolla, CA, USA, May 20-21, 2022, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {13234},
  pages     = {146--167},
  publisher = {Springer},
  year      = {2022},
  url       = {https://doi.org/10.1007/978-3-031-06220-9\_9},
  doi       = {10.1007/978-3-031-06220-9\_9},
  timestamp = {Thu, 02 Jun 2022 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/recombcg/SwensonEVMW22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-00574,
  author    = {Leo van Iersel and
               Mark Jones and
               Mathias Weller},
  title     = {Embedding phylogenetic trees in networks of low treewidth},
  journal   = {CoRR},
  volume    = {abs/2207.00574},
  year      = {2022},
  url       = {https://doi.org/10.48550/arXiv.2207.00574},
  doi       = {10.48550/arXiv.2207.00574},
  eprinttype = {arXiv},
  eprint    = {2207.00574},
  timestamp = {Wed, 06 Jul 2022 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2207-00574.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DavotCGWT21,
  author    = {Tom Davot and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller and
               Dorine Tabary},
  title     = {Producing Genomic Sequences after Genome Scaffolding with Ambiguous
               Paths: Complexity, Approximation and Lower Bounds},
  journal   = {Algorithmica},
  volume    = {83},
  number    = {7},
  pages     = {2063--2095},
  year      = {2021},
  url       = {https://doi.org/10.1007/s00453-021-00819-6},
  doi       = {10.1007/s00453-021-00819-6},
  timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/DavotCGWT21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BentertW21,
  author    = {Matthias Bentert and
               Mathias Weller},
  title     = {Tree Containment With Soft Polytomies},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {25},
  number    = {1},
  pages     = {417--436},
  year      = {2021},
  url       = {https://doi.org/10.7155/jgaa.00565},
  doi       = {10.7155/jgaa.00565},
  timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jgaa/BentertW21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/ScornavaccaW21,
  author    = {C{\'{e}}line Scornavacca and
               Mathias Weller},
  editor    = {Alessandra Carbone and
               Mohammed El{-}Kebir},
  title     = {Treewidth-Based Algorithms for the Small Parsimony Problem on Networks},
  booktitle = {21st International Workshop on Algorithms in Bioinformatics, {WABI}
               2021, August 2-4, 2021, Virtual Conference},
  series    = {LIPIcs},
  volume    = {201},
  pages     = {6:1--6:21},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2021},
  url       = {https://doi.org/10.4230/LIPIcs.WABI.2021.6},
  doi       = {10.4230/LIPIcs.WABI.2021.6},
  timestamp = {Thu, 22 Jul 2021 15:39:38 +0200},
  biburl    = {https://dblp.org/rec/conf/wabi/ScornavaccaW21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MorawietzRW20,
  author    = {Nils Morawietz and
               Carolin Rehs and
               Mathias Weller},
  editor    = {Javier Esparza and
               Daniel Kr{\'{a}}l'},
  title     = {A Timecop's Work Is Harder Than You Think},
  booktitle = {45th International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
  series    = {LIPIcs},
  volume    = {170},
  pages     = {71:1--71:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2020},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2020.71},
  doi       = {10.4230/LIPIcs.MFCS.2020.71},
  timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/MorawietzRW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/DavotCGW20,
  author    = {Tom Davot and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  editor    = {Alexander Chatzigeorgiou and
               Riccardo Dondi and
               Herodotos Herodotou and
               Christos A. Kapoutsis and
               Yannis Manolopoulos and
               George A. Papadopoulos and
               Florian Sikora},
  title     = {Linearizing Genomes: Exact Methods and Local Search},
  booktitle = {{SOFSEM} 2020: Theory and Practice of Computer Science - 46th International
               Conference on Current Trends in Theory and Practice of Informatics,
               {SOFSEM} 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {12011},
  pages     = {505--518},
  publisher = {Springer},
  year      = {2020},
  url       = {https://doi.org/10.1007/978-3-030-38919-2\_41},
  doi       = {10.1007/978-3-030-38919-2\_41},
  timestamp = {Tue, 21 Jan 2020 16:23:03 +0100},
  biburl    = {https://dblp.org/rec/conf/sofsem/DavotCGW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BerrySW20,
  author    = {Vincent Berry and
               C{\'{e}}line Scornavacca and
               Mathias Weller},
  editor    = {Alexander Chatzigeorgiou and
               Riccardo Dondi and
               Herodotos Herodotou and
               Christos A. Kapoutsis and
               Yannis Manolopoulos and
               George A. Papadopoulos and
               Florian Sikora},
  title     = {Scanning Phylogenetic Networks Is NP-hard},
  booktitle = {{SOFSEM} 2020: Theory and Practice of Computer Science - 46th International
               Conference on Current Trends in Theory and Practice of Informatics,
               {SOFSEM} 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {12011},
  pages     = {519--530},
  publisher = {Springer},
  year      = {2020},
  url       = {https://doi.org/10.1007/978-3-030-38919-2\_42},
  doi       = {10.1007/978-3-030-38919-2\_42},
  timestamp = {Tue, 21 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/sofsem/BerrySW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BulteauW19,
  author    = {Laurent Bulteau and
               Mathias Weller},
  title     = {Parameterized Algorithms in Bioinformatics: An Overview},
  journal   = {Algorithms},
  volume    = {12},
  number    = {12},
  pages     = {256},
  year      = {2019},
  url       = {https://doi.org/10.3390/a12120256},
  doi       = {10.3390/a12120256},
  timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithms/BulteauW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alcob/DavotCGW19,
  author    = {Tom Davot and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  editor    = {Ian H. Holmes and
               Carlos Mart{\'{\i}}n{-}Vide and
               Miguel A. Vega{-}Rodr{\'{\i}}guez},
  title     = {New Polynomial-Time Algorithm Around the Scaffolding Problem},
  booktitle = {Algorithms for Computational Biology - 6th International Conference,
               AlCoB 2019, Berkeley, CA, USA, May 28-30, 2019, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {11488},
  pages     = {25--38},
  publisher = {Springer},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-18174-1\_2},
  doi       = {10.1007/978-3-030-18174-1\_2},
  timestamp = {Tue, 09 Nov 2021 09:18:33 +0100},
  biburl    = {https://dblp.org/rec/conf/alcob/DavotCGW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/CazalsDCGW19,
  author    = {Pierre Cazals and
               Beno{\^{\i}}t Darties and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  editor    = {Charles J. Colbourn and
               Roberto Grossi and
               Nadia Pisanti},
  title     = {Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs},
  booktitle = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
               Pisa, Italy, July 23-25, 2019, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {11638},
  pages     = {122--135},
  publisher = {Springer},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-25005-8\_11},
  doi       = {10.1007/978-3-030-25005-8\_11},
  timestamp = {Mon, 15 Jul 2019 15:43:10 +0200},
  biburl    = {https://dblp.org/rec/conf/iwoca/CazalsDCGW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-03003,
  author    = {Vincent Froese and
               Brijnesh J. Jain and
               Maciej Rymar and
               Mathias Weller},
  title     = {Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series},
  journal   = {CoRR},
  volume    = {abs/1903.03003},
  year      = {2019},
  url       = {http://arxiv.org/abs/1903.03003},
  eprinttype = {arXiv},
  eprint    = {1903.03003},
  timestamp = {Mon, 06 Sep 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1903-03003.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-11048,
  author    = {Mathias Weller},
  title     = {Listing Conflicting Triples in Optimal Time},
  journal   = {CoRR},
  volume    = {abs/1911.11048},
  year      = {2019},
  url       = {http://arxiv.org/abs/1911.11048},
  eprinttype = {arXiv},
  eprint    = {1911.11048},
  timestamp = {Tue, 03 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1911-11048.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WellerCDG18,
  author    = {Mathias Weller and
               Annie Chateau and
               Cl{\'{e}}ment Dallard and
               Rodolphe Giroudeau},
  title     = {Scaffolding Problems Revisited: Complexity, Approximation and Fixed
               Parameter Tractable Algorithms, and Some Special Cases},
  journal   = {Algorithmica},
  volume    = {80},
  number    = {6},
  pages     = {1771--1803},
  year      = {2018},
  url       = {https://doi.org/10.1007/s00453-018-0405-x},
  doi       = {10.1007/s00453-018-0405-x},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/WellerCDG18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WellerCGKP18,
  author    = {Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau and
               Jean{-}Claude K{\"{o}}nig and
               Valentin Pollet},
  title     = {On residual approximation in solution extension problems},
  journal   = {J. Comb. Optim.},
  volume    = {36},
  number    = {4},
  pages     = {1195--1220},
  year      = {2018},
  url       = {https://doi.org/10.1007/s10878-017-0202-5},
  doi       = {10.1007/s10878-017-0202-5},
  timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jco/WellerCGKP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DartiesCCGW18,
  author    = {Beno{\^{\i}}t Darties and
               Nicolas Champseix and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  title     = {Complexity and lowers bounds for Power Edge Set Problem},
  journal   = {J. Discrete Algorithms},
  volume    = {52-53},
  pages     = {70--91},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.jda.2018.11.006},
  doi       = {10.1016/j.jda.2018.11.006},
  timestamp = {Tue, 07 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jda/DartiesCCGW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/FellowsJKRW18,
  author    = {Michael R. Fellows and
               Lars Jaffke and
               Aliz Izabella Kir{\'{a}}ly and
               Frances A. Rosamond and
               Mathias Weller},
  editor    = {Hans{-}Joachim B{\"{o}}ckenhauer and
               Dennis Komm and
               Walter Unger},
  title     = {What Is Known About Vertex Cover Kernelization?},
  booktitle = {Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated
               to Juraj Hromkovi{\v{c}} on the Occasion of His 60th Birthday},
  series    = {Lecture Notes in Computer Science},
  volume    = {11011},
  pages     = {330--356},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-319-98355-4\_19},
  doi       = {10.1007/978-3-319-98355-4\_19},
  timestamp = {Tue, 14 May 2019 10:00:52 +0200},
  biburl    = {https://dblp.org/rec/conf/birthday/FellowsJKRW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/TabaryDWCG18,
  author    = {Dorine Tabary and
               Tom Davot and
               Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau},
  editor    = {Donghyun Kim and
               R. N. Uma and
               Alexander Zelikovsky},
  title     = {New Results About the Linearization of Scaffolds Sharing Repeated
               Contigs},
  booktitle = {Combinatorial Optimization and Applications - 12th International Conference,
               {COCOA} 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {11346},
  pages     = {94--107},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-030-04651-4\_7},
  doi       = {10.1007/978-3-030-04651-4\_7},
  timestamp = {Tue, 14 May 2019 10:00:52 +0200},
  biburl    = {https://dblp.org/rec/conf/cocoa/TabaryDWCG18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/DavotCGW18,
  author    = {Tom Davot and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  editor    = {Mathieu Blanchette and
               A{\"{\i}}da Ouangraoua},
  title     = {On the Hardness of Approximating Linearization of Scaffolds Sharing
               Repeated Contigs},
  booktitle = {Comparative Genomics - 16th International Conference, {RECOMB-CG}
               2018, Magog-Orford, QC, Canada, October 9-12, 2018, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {11183},
  pages     = {91--107},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-030-00834-5\_5},
  doi       = {10.1007/978-3-030-00834-5\_5},
  timestamp = {Mon, 13 May 2019 09:30:09 +0200},
  biburl    = {https://dblp.org/rec/conf/recomb/DavotCGW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/Weller18,
  author    = {Mathias Weller},
  editor    = {Mathieu Blanchette and
               A{\"{\i}}da Ouangraoua},
  title     = {Linear-Time Tree Containment in Phylogenetic Networks},
  booktitle = {Comparative Genomics - 16th International Conference, {RECOMB-CG}
               2018, Magog-Orford, QC, Canada, October 9-12, 2018, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {11183},
  pages     = {309--323},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-030-00834-5\_18},
  doi       = {10.1007/978-3-030-00834-5\_18},
  timestamp = {Mon, 13 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/recomb/Weller18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BentertMW18,
  author    = {Matthias Bentert and
               Josef Mal{\'{\i}}k and
               Mathias Weller},
  editor    = {David Eppstein},
  title     = {Tree Containment With Soft Polytomies},
  booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
               2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
  series    = {LIPIcs},
  volume    = {101},
  pages     = {9:1--9:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.SWAT.2018.9},
  doi       = {10.4230/LIPIcs.SWAT.2018.9},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/swat/BentertMW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-09429,
  author    = {Michael R. Fellows and
               Lars Jaffke and
               Aliz Izabella Kir{\'{a}}ly and
               Frances A. Rosamond and
               Mathias Weller},
  title     = {What is known about Vertex Cover Kernelization?},
  journal   = {CoRR},
  volume    = {abs/1811.09429},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.09429},
  eprinttype = {arXiv},
  eprint    = {1811.09429},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1811-09429.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/JacoxWTS17,
  author    = {Edwin Jacox and
               Mathias Weller and
               Eric Tannier and
               C{\'{e}}line Scornavacca},
  title     = {Resolution and reconciliation of non-binary gene trees with transfers,
               duplications and losses},
  journal   = {Bioinform.},
  volume    = {33},
  number    = {7},
  pages     = {980--987},
  year      = {2017},
  url       = {https://doi.org/10.1093/bioinformatics/btw778},
  doi       = {10.1093/bioinformatics/btw778},
  timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/bioinformatics/JacoxWTS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CohenGKPSTW17,
  author    = {Nathann Cohen and
               Daniel Gon{\c{c}}alves and
               Eun Jung Kim and
               Christophe Paul and
               Ignasi Sau and
               Dimitrios M. Thilikos and
               Mathias Weller},
  title     = {A polynomial-time algorithm for Outerplanar Diameter Improvement},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {89},
  pages     = {315--327},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.jcss.2017.05.016},
  doi       = {10.1016/j.jcss.2017.05.016},
  timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/CohenGKPSTW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/DartiesCGW17,
  author    = {Beno{\^{\i}}t Darties and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  editor    = {Xiaofeng Gao and
               Hongwei Du and
               Meng Han},
  title     = {New Insights for Power Edge Set Problem},
  booktitle = {Combinatorial Optimization and Applications - 11th International Conference,
               {COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
               Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10627},
  pages     = {180--194},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-71150-8\_17},
  doi       = {10.1007/978-3-319-71150-8\_17},
  timestamp = {Tue, 14 Jun 2022 14:15:49 +0200},
  biburl    = {https://dblp.org/rec/conf/cocoa/DartiesCGW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/WellerCG17,
  author    = {Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau},
  editor    = {Xiaofeng Gao and
               Hongwei Du and
               Meng Han},
  title     = {On the Linearization of Scaffolds Sharing Repeated Contigs},
  booktitle = {Combinatorial Optimization and Applications - 11th International Conference,
               {COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
               Part {II}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10628},
  pages     = {509--517},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-71147-8\_38},
  doi       = {10.1007/978-3-319-71147-8\_38},
  timestamp = {Tue, 14 Jun 2022 14:15:49 +0200},
  biburl    = {https://dblp.org/rec/conf/cocoa/WellerCG17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/DartiesCGW17,
  author    = {Beno{\^{\i}}t Darties and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  editor    = {Ljiljana Brankovic and
               Joe Ryan and
               William F. Smyth},
  title     = {Improved Complexity for Power Edge Set Problem},
  booktitle = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017,
               Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {10765},
  pages     = {128--141},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-78825-8\_11},
  doi       = {10.1007/978-3-319-78825-8\_11},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl    = {https://dblp.org/rec/conf/iwoca/DartiesCGW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DellKTW17,
  author    = {Holger Dell and
               Christian Komusiewicz and
               Nimrod Talmon and
               Mathias Weller},
  editor    = {Daniel Lokshtanov and
               Naomi Nishimura},
  title     = {The {PACE} 2017 Parameterized Algorithms and Computational Experiments
               Challenge: The Second Iteration},
  booktitle = {12th International Symposium on Parameterized and Exact Computation,
               {IPEC} 2017, September 6-8, 2017, Vienna, Austria},
  series    = {LIPIcs},
  volume    = {89},
  pages     = {30:1--30:12},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2017},
  url       = {https://doi.org/10.4230/LIPIcs.IPEC.2017.30},
  doi       = {10.4230/LIPIcs.IPEC.2017.30},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/iwpec/DellKTW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/ChauveJLSW17,
  author    = {C{\'{e}}dric Chauve and
               Mark Jones and
               Manuel Lafond and
               C{\'{e}}line Scornavacca and
               Mathias Weller},
  editor    = {Gabriele Fici and
               Marinella Sciortino and
               Rossano Venturini},
  title     = {Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended
               Abstract)},
  booktitle = {String Processing and Information Retrieval - 24th International Symposium,
               {SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10508},
  pages     = {129--143},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-67428-5\_12},
  doi       = {10.1007/978-3-319-67428-5\_12},
  timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/spire/ChauveJLSW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Weller17,
  author    = {Mathias Weller},
  title     = {Linear-Time Tree Containment in Phylogenetic Networks},
  journal   = {CoRR},
  volume    = {abs/1702.06364},
  year      = {2017},
  url       = {http://arxiv.org/abs/1702.06364},
  eprinttype = {arXiv},
  eprint    = {1702.06364},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Weller17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChauveJLSW17,
  author    = {C{\'{e}}dric Chauve and
               Mark Jones and
               Manuel Lafond and
               C{\'{e}}line Scornavacca and
               Mathias Weller},
  title     = {Constructing a Consensus Phylogeny from a Leaf-Removal Distance},
  journal   = {CoRR},
  volume    = {abs/1705.05295},
  year      = {2017},
  url       = {http://arxiv.org/abs/1705.05295},
  eprinttype = {arXiv},
  eprint    = {1705.05295},
  timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/ChauveJLSW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KelkISW16,
  author    = {Steven Kelk and
               Leo van Iersel and
               C{\'{e}}line Scornavacca and
               Mathias Weller},
  title     = {Phylogenetic incongruence through the lens of Monadic Second Order
               logic},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {20},
  number    = {2},
  pages     = {189--215},
  year      = {2016},
  url       = {https://doi.org/10.7155/jgaa.00390},
  doi       = {10.7155/jgaa.00390},
  timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jgaa/KelkISW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GarneroW16,
  author    = {Valentin Garnero and
               Mathias Weller},
  title     = {Parameterized certificate dispersal and its variants},
  journal   = {Theor. Comput. Sci.},
  volume    = {622},
  pages     = {66--78},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.tcs.2016.02.001},
  doi       = {10.1016/j.tcs.2016.02.001},
  timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/GarneroW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/DallardWCG16,
  author    = {Cl{\'{e}}ment Dallard and
               Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau},
  editor    = {T.{-}H. Hubert Chan and
               Minming Li and
               Lusheng Wang},
  title     = {Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding},
  booktitle = {Combinatorial Optimization and Applications - 10th International Conference,
               {COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10043},
  pages     = {294--308},
  publisher = {Springer},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-319-48749-6\_22},
  doi       = {10.1007/978-3-319-48749-6\_22},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/cocoa/DallardWCG16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/WellerCGKP16,
  author    = {Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau and
               Jean{-}Claude K{\"{o}}nig and
               Valentin Pollet},
  editor    = {T.{-}H. Hubert Chan and
               Minming Li and
               Lusheng Wang},
  title     = {On Residual Approximation in Solution Extension Problems},
  booktitle = {Combinatorial Optimization and Applications - 10th International Conference,
               {COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10043},
  pages     = {463--476},
  publisher = {Springer},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-319-48749-6\_34},
  doi       = {10.1007/978-3-319-48749-6\_34},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/cocoa/WellerCGKP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BevernMNW15,
  author    = {Ren{\'{e}} van Bevern and
               Matthias Mnich and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Interval scheduling and colorful independent sets},
  journal   = {J. Sched.},
  volume    = {18},
  number    = {5},
  pages     = {449--469},
  year      = {2015},
  url       = {https://doi.org/10.1007/s10951-014-0398-5},
  doi       = {10.1007/s10951-014-0398-5},
  timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/scheduling/BevernMNW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChenKNSSW15,
  author    = {Jiehua Chen and
               Christian Komusiewicz and
               Rolf Niedermeier and
               Manuel Sorge and
               Ondrej Such{\'{y}} and
               Mathias Weller},
  title     = {Polynomial-Time Data Reduction for the Subset Interconnection Design
               Problem},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {29},
  number    = {1},
  pages     = {1--25},
  year      = {2015},
  url       = {https://doi.org/10.1137/140955057},
  doi       = {10.1137/140955057},
  timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/ChenKNSSW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/WellerCG15,
  author    = {Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau},
  editor    = {Zaixin Lu and
               Donghyun Kim and
               Weili Wu and
               Wei Li and
               Ding{-}Zhu Du},
  title     = {On the Complexity of Scaffolding Problems: From Cliques to Sparse
               Graphs},
  booktitle = {Combinatorial Optimization and Applications - 9th International Conference,
               {COCOA} 2015, Houston, TX, USA, December 18-20, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9486},
  pages     = {409--423},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-26626-8\_30},
  doi       = {10.1007/978-3-319-26626-8\_30},
  timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
  biburl    = {https://dblp.org/rec/conf/cocoa/WellerCG15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Cohen0KPSTW15,
  author    = {Nathann Cohen and
               Daniel Gon{\c{c}}alves and
               Eunjung Kim and
               Christophe Paul and
               Ignasi Sau and
               Dimitrios M. Thilikos and
               Mathias Weller},
  editor    = {Lev D. Beklemishev and
               Daniil V. Musatov},
  title     = {A Polynomial-Time Algorithm for Outerplanar Diameter Improvement},
  booktitle = {Computer Science - Theory and Applications - 10th International Computer
               Science Symposium in Russia, {CSR} 2015, Listvyanka, Russia, July
               13-17, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9139},
  pages     = {123--142},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-20297-6\_9},
  doi       = {10.1007/978-3-319-20297-6\_9},
  timestamp = {Tue, 14 May 2019 10:00:51 +0200},
  biburl    = {https://dblp.org/rec/conf/csr/Cohen0KPSTW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BabenkoGKSW15,
  author    = {Maxim A. Babenko and
               Andrew V. Goldberg and
               Haim Kaplan and
               Ruslan Savchenko and
               Mathias Weller},
  editor    = {Giuseppe F. Italiano and
               Giovanni Pighizzini and
               Donald Sannella},
  title     = {On the Complexity of Hub Labeling (Extended Abstract)},
  booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
               Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
               Part {II}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9235},
  pages     = {62--74},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-48054-0\_6},
  doi       = {10.1007/978-3-662-48054-0\_6},
  timestamp = {Tue, 14 May 2019 10:00:37 +0200},
  biburl    = {https://dblp.org/rec/conf/mfcs/BabenkoGKSW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BabenkoGKSW15,
  author    = {Maxim A. Babenko and
               Andrew V. Goldberg and
               Haim Kaplan and
               Ruslan Savchenko and
               Mathias Weller},
  title     = {On the Complexity of Hub Labeling},
  journal   = {CoRR},
  volume    = {abs/1501.02492},
  year      = {2015},
  url       = {http://arxiv.org/abs/1501.02492},
  eprinttype = {arXiv},
  eprint    = {1501.02492},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BabenkoGKSW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/SorgeMNW14,
  author    = {Manuel Sorge and
               Hannes Moser and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Exploiting a hypergraph model for finding Golomb rulers},
  journal   = {Acta Informatica},
  volume    = {51},
  number    = {7},
  pages     = {449--471},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00236-014-0202-1},
  doi       = {10.1007/s00236-014-0202-1},
  timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/acta/SorgeMNW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChopinNNW14,
  author    = {Morgan Chopin and
               Andr{\'{e}} Nichterlein and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Constant Thresholds Can Make Target Set Selection Tractable},
  journal   = {Theory Comput. Syst.},
  volume    = {55},
  number    = {1},
  pages     = {61--83},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00224-013-9499-3},
  doi       = {10.1007/s00224-013-9499-3},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/mst/ChopinNNW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DornfelderGKW14,
  author    = {Martin D{\"{o}}rnfelder and
               Jiong Guo and
               Christian Komusiewicz and
               Mathias Weller},
  title     = {On the parameterized complexity of consensus clustering},
  journal   = {Theor. Comput. Sci.},
  volume    = {542},
  pages     = {71--82},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.tcs.2014.05.002},
  doi       = {10.1016/j.tcs.2014.05.002},
  timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/DornfelderGKW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernMNW14,
  author    = {Ren{\'{e}} van Bevern and
               Matthias Mnich and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Interval scheduling and colorful independent sets},
  journal   = {CoRR},
  volume    = {abs/1402.0851},
  year      = {2014},
  url       = {http://arxiv.org/abs/1402.0851},
  eprinttype = {arXiv},
  eprint    = {1402.0851},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BevernMNW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cohen0KPSTW14,
  author    = {Nathann Cohen and
               Daniel Gon{\c{c}}alves and
               Eun Jung Kim and
               Christophe Paul and
               Ignasi Sau and
               Dimitrios M. Thilikos and
               Mathias Weller},
  title     = {A Polynomial-time Algorithm for Outerplanar Diameter Improvement},
  journal   = {CoRR},
  volume    = {abs/1403.5702},
  year      = {2014},
  url       = {http://arxiv.org/abs/1403.5702},
  eprinttype = {arXiv},
  eprint    = {1403.5702},
  timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/Cohen0KPSTW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Weller14a,
  author    = {Mathias Weller},
  title     = {Optimal Hub Labeling is NP-complete},
  journal   = {CoRR},
  volume    = {abs/1407.8373},
  year      = {2014},
  url       = {http://arxiv.org/abs/1407.8373},
  eprinttype = {arXiv},
  eprint    = {1407.8373},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Weller14a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Weller13,
  author    = {Mathias Weller},
  title     = {Aspects of preprocessing applied to combinatorial graph problems},
  school    = {Berlin Institute of Technology},
  year      = {2013},
  url       = {http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/3838},
  urn       = {urn:nbn:de:kobv:83-opus-38783},
  isbn      = {978-3-7983-2508-1},
  timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/phd/dnb/Weller13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DornMNW13,
  author    = {Frederic Dorn and
               Hannes Moser and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Efficient Algorithms for Eulerian Extension and Rural Postman},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {27},
  number    = {1},
  pages     = {75--94},
  year      = {2013},
  url       = {https://doi.org/10.1137/110834810},
  doi       = {10.1137/110834810},
  timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/DornMNW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/snam/NichterleinNUW13,
  author    = {Andr{\'{e}} Nichterlein and
               Rolf Niedermeier and
               Johannes Uhlmann and
               Mathias Weller},
  title     = {On tractable cases of Target Set Selection},
  journal   = {Soc. Netw. Anal. Min.},
  volume    = {3},
  number    = {2},
  pages     = {233--256},
  year      = {2013},
  url       = {https://doi.org/10.1007/s13278-012-0067-7},
  doi       = {10.1007/s13278-012-0067-7},
  timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/snam/NichterleinNUW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/UhlmannW13,
  author    = {Johannes Uhlmann and
               Mathias Weller},
  title     = {Two-Layer Planarization parameterized by feedback edge set},
  journal   = {Theor. Comput. Sci.},
  volume    = {494},
  pages     = {99--111},
  year      = {2013},
  url       = {https://doi.org/10.1016/j.tcs.2013.01.029},
  doi       = {10.1016/j.tcs.2013.01.029},
  timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/UhlmannW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenKNSSW13,
  author    = {Jiehua Chen and
               Christian Komusiewicz and
               Rolf Niedermeier and
               Manuel Sorge and
               Ondrej Such{\'{y}} and
               Mathias Weller},
  editor    = {Leizhen Cai and
               Siu{-}Wing Cheng and
               Tak Wah Lam},
  title     = {Effective and Efficient Data Reduction for the Subset Interconnection
               Design Problem},
  booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
               2013, Hong Kong, China, December 16-18, 2013, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8283},
  pages     = {361--371},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-45030-3\_34},
  doi       = {10.1007/978-3-642-45030-3\_34},
  timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/ChenKNSSW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/Weller13,
  author    = {Mathias Weller},
  editor    = {Vincenzo Bonifaci and
               Camil Demetrescu and
               Alberto Marchetti{-}Spaccamela},
  title     = {An Improved Branching Algorithm for Two-Layer Planarization Parameterized
               by the Feedback Edge Set Number},
  booktitle = {Experimental Algorithms, 12th International Symposium, {SEA} 2013,
               Rome, Italy, June 5-7, 2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7933},
  pages     = {337--353},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-38527-8\_30},
  doi       = {10.1007/978-3-642-38527-8\_30},
  timestamp = {Tue, 14 May 2019 10:00:42 +0200},
  biburl    = {https://dblp.org/rec/conf/wea/Weller13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/WellerKNU12,
  author    = {Mathias Weller and
               Christian Komusiewicz and
               Rolf Niedermeier and
               Johannes Uhlmann},
  title     = {On making directed graphs transitive},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {78},
  number    = {2},
  pages     = {559--574},
  year      = {2012},
  url       = {https://doi.org/10.1016/j.jcss.2011.07.001},
  doi       = {10.1016/j.jcss.2011.07.001},
  timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/WellerKNU12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SorgeBNW12,
  author    = {Manuel Sorge and
               Ren{\'{e}} van Bevern and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {A new view on Rural Postman based on Eulerian Extension and Matching},
  journal   = {J. Discrete Algorithms},
  volume    = {16},
  pages     = {12--33},
  year      = {2012},
  url       = {https://doi.org/10.1016/j.jda.2012.04.007},
  doi       = {10.1016/j.jda.2012.04.007},
  timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jda/SorgeBNW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BevernMNW12,
  author    = {Ren{\'{e}} van Bevern and
               Matthias Mnich and
               Rolf Niedermeier and
               Mathias Weller},
  editor    = {Kun{-}Mao Chao and
               Tsan{-}sheng Hsu and
               Der{-}Tsai Lee},
  title     = {Interval Scheduling and Colorful Independent Sets},
  booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
               2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7676},
  pages     = {247--256},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-35261-4\_28},
  doi       = {10.1007/978-3-642-35261-4\_28},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/BevernMNW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/SorgeMNW12,
  author    = {Manuel Sorge and
               Hannes Moser and
               Rolf Niedermeier and
               Mathias Weller},
  editor    = {Ali Ridha Mahjoub and
               Vangelis Markakis and
               Ioannis Milis and
               Vangelis Th. Paschos},
  title     = {Exploiting a Hypergraph Model for Finding Golomb Rulers},
  booktitle = {Combinatorial Optimization - Second International Symposium, {ISCO}
               2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {7422},
  pages     = {368--379},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32147-4\_33},
  doi       = {10.1007/978-3-642-32147-4\_33},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl    = {https://dblp.org/rec/conf/iscopt/SorgeMNW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/medalg/ChopinNNW12,
  author    = {Morgan Chopin and
               Andr{\'{e}} Nichterlein and
               Rolf Niedermeier and
               Mathias Weller},
  editor    = {Guy Even and
               Dror Rawitz},
  title     = {Constant Thresholds Can Make Target Set Selection Tractable},
  booktitle = {Design and Analysis of Algorithms - First Mediterranean Conference
               on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5,
               2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7659},
  pages     = {120--133},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-34862-4\_9},
  doi       = {10.1007/978-3-642-34862-4\_9},
  timestamp = {Tue, 14 May 2019 10:00:54 +0200},
  biburl    = {https://dblp.org/rec/conf/medalg/ChopinNNW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DornfelderGKW11,
  author    = {Martin D{\"{o}}rnfelder and
               Jiong Guo and
               Christian Komusiewicz and
               Mathias Weller},
  editor    = {Takao Asano and
               Shin{-}Ichi Nakano and
               Yoshio Okamoto and
               Osamu Watanabe},
  title     = {On the Parameterized Complexity of Consensus Clustering},
  booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
               2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7074},
  pages     = {624--633},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-25591-5\_64},
  doi       = {10.1007/978-3-642-25591-5\_64},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/DornfelderGKW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/SorgeBNW11,
  author    = {Manuel Sorge and
               Ren{\'{e}} van Bevern and
               Rolf Niedermeier and
               Mathias Weller},
  editor    = {Costas S. Iliopoulos and
               William F. Smyth},
  title     = {A New View on Rural Postman Based on Eulerian Extension and Matching},
  booktitle = {Combinatorial Algorithms - 22nd International Workshop, {IWOCA} 2011,
               Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {7056},
  pages     = {310--323},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-25011-8\_25},
  doi       = {10.1007/978-3-642-25011-8\_25},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl    = {https://dblp.org/rec/conf/iwoca/SorgeBNW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BevernHKNW11,
  author    = {Ren{\'{e}} van Bevern and
               Sepp Hartung and
               Frank Kammer and
               Rolf Niedermeier and
               Mathias Weller},
  editor    = {D{\'{a}}niel Marx and
               Peter Rossmanith},
  title     = {Linear-Time Computation of a Linear Problem Kernel for Dominating
               Set on Planar Graphs},
  booktitle = {Parameterized and Exact Computation - 6th International Symposium,
               {IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
               Revised Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {7112},
  pages     = {194--206},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-28050-4\_16},
  doi       = {10.1007/978-3-642-28050-4\_16},
  timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
  biburl    = {https://dblp.org/rec/conf/iwpec/BevernHKNW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/SorgeBNW11,
  author    = {Manuel Sorge and
               Ren{\'{e}} van Bevern and
               Rolf Niedermeier and
               Mathias Weller},
  editor    = {Petr Kolman and
               Jan Kratochv{\'{\i}}l},
  title     = {From Few Components to an Eulerian Graph by Adding Arcs},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
               Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
               21-24, 2011. Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {6986},
  pages     = {307--318},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-25870-1\_28},
  doi       = {10.1007/978-3-642-25870-1\_28},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl    = {https://dblp.org/rec/conf/wg/SorgeBNW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FleischerGNUWWW10,
  author    = {Rudolf Fleischer and
               Jiong Guo and
               Rolf Niedermeier and
               Johannes Uhlmann and
               Yihui Wang and
               Mathias Weller and
               Xi Wu},
  editor    = {Amihood Amir and
               Laxmi Parida},
  title     = {Extended Islands of Tractability for Parsimony Haplotyping},
  booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
               New York, NY, USA, June 21-23, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6129},
  pages     = {214--226},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-13509-5\_20},
  doi       = {10.1007/978-3-642-13509-5\_20},
  timestamp = {Tue, 14 May 2019 10:00:38 +0200},
  biburl    = {https://dblp.org/rec/conf/cpm/FleischerGNUWWW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/NichterleinNUW10,
  author    = {Andr{\'{e}} Nichterlein and
               Rolf Niedermeier and
               Johannes Uhlmann and
               Mathias Weller},
  editor    = {Otfried Cheong and
               Kyung{-}Yong Chwa and
               Kunsoo Park},
  title     = {On Tractable Cases of Target Set Selection},
  booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
               2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6506},
  pages     = {378--389},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-17517-6\_34},
  doi       = {10.1007/978-3-642-17517-6\_34},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/NichterleinNUW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/UhlmannW10,
  author    = {Johannes Uhlmann and
               Mathias Weller},
  editor    = {Jan Kratochv{\'{\i}}l and
               Angsheng Li and
               Jir{\'{\i}} Fiala and
               Petr Kolman},
  title     = {Two-Layer Planarization Parameterized by Feedback Edge Set},
  booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
               {TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6108},
  pages     = {431--442},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-13562-0\_39},
  doi       = {10.1007/978-3-642-13562-0\_39},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/conf/tamc/UhlmannW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DornMNW10,
  author    = {Frederic Dorn and
               Hannes Moser and
               Rolf Niedermeier and
               Mathias Weller},
  editor    = {Dimitrios M. Thilikos},
  title     = {Efficient Algorithms for Eulerian Extension},
  booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
               Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
               2010 Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {6410},
  pages     = {100--111},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-16926-7\_11},
  doi       = {10.1007/978-3-642-16926-7\_11},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl    = {https://dblp.org/rec/conf/wg/DornMNW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/WellerKNU09,
  author    = {Mathias Weller and
               Christian Komusiewicz and
               Rolf Niedermeier and
               Johannes Uhlmann},
  editor    = {Frank K. H. A. Dehne and
               Marina L. Gavrilova and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Csaba D. T{\'{o}}th},
  title     = {On Making Directed Graphs Transitive},
  booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
               2009, Banff, Canada, August 21-23, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5664},
  pages     = {542--553},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-03367-4\_47},
  doi       = {10.1007/978-3-642-03367-4\_47},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/wads/WellerKNU09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics