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}
}
@inproceedings{DBLP:conf/esa/Iersel0W22,
  author    = {Leo van Iersel and
               Mark Jones and
               Mathias Weller},
  title     = {Embedding Phylogenetic Trees in Networks of Low Treewidth},
  booktitle = {{ESA}},
  series    = {LIPIcs},
  volume    = {244},
  pages     = {69:1--69:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2022}
}
@inproceedings{DBLP:conf/recombcg/SwensonEVMW22,
  author    = {Krister M. Swenson and
               Afif Elghraoui and
               Faramarz Valafar and
               Siavash Mirarab and
               Mathias Weller},
  title     = {Quantifying Hierarchical Conflicts in Homology Statements},
  booktitle = {{RECOMB-CG}},
  series    = {Lecture Notes in Computer Science},
  volume    = {13234},
  pages     = {146--167},
  publisher = {Springer},
  year      = {2022}
}
@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}
}
@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}
}
@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}
}
@inproceedings{DBLP:conf/wabi/ScornavaccaW21,
  author    = {C{\'{e}}line Scornavacca and
               Mathias Weller},
  title     = {Treewidth-Based Algorithms for the Small Parsimony Problem on Networks},
  booktitle = {{WABI}},
  series    = {LIPIcs},
  volume    = {201},
  pages     = {6:1--6:21},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2021}
}
@inproceedings{DBLP:conf/mfcs/MorawietzRW20,
  author    = {Nils Morawietz and
               Carolin Rehs and
               Mathias Weller},
  title     = {A Timecop's Work Is Harder Than You Think},
  booktitle = {{MFCS}},
  series    = {LIPIcs},
  volume    = {170},
  pages     = {71:1--71:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2020}
}
@inproceedings{DBLP:conf/sofsem/DavotCGW20,
  author    = {Tom Davot and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  title     = {Linearizing Genomes: Exact Methods and Local Search},
  booktitle = {{SOFSEM}},
  series    = {Lecture Notes in Computer Science},
  volume    = {12011},
  pages     = {505--518},
  publisher = {Springer},
  year      = {2020}
}
@inproceedings{DBLP:conf/sofsem/BerrySW20,
  author    = {Vincent Berry and
               C{\'{e}}line Scornavacca and
               Mathias Weller},
  title     = {Scanning Phylogenetic Networks Is NP-hard},
  booktitle = {{SOFSEM}},
  series    = {Lecture Notes in Computer Science},
  volume    = {12011},
  pages     = {519--530},
  publisher = {Springer},
  year      = {2020}
}
@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}
}
@inproceedings{DBLP:conf/alcob/DavotCGW19,
  author    = {Tom Davot and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  title     = {New Polynomial-Time Algorithm Around the Scaffolding Problem},
  booktitle = {AlCoB},
  series    = {Lecture Notes in Computer Science},
  volume    = {11488},
  pages     = {25--38},
  publisher = {Springer},
  year      = {2019}
}
@inproceedings{DBLP:conf/iwoca/CazalsDCGW19,
  author    = {Pierre Cazals and
               Beno{\^{\i}}t Darties and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  title     = {Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs},
  booktitle = {{IWOCA}},
  series    = {Lecture Notes in Computer Science},
  volume    = {11638},
  pages     = {122--135},
  publisher = {Springer},
  year      = {2019}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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},
  title     = {What Is Known About Vertex Cover Kernelization?},
  booktitle = {Adventures Between Lower Bounds and Higher Altitudes},
  series    = {Lecture Notes in Computer Science},
  volume    = {11011},
  pages     = {330--356},
  publisher = {Springer},
  year      = {2018}
}
@inproceedings{DBLP:conf/cocoa/TabaryDWCG18,
  author    = {Dorine Tabary and
               Tom Davot and
               Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau},
  title     = {New Results About the Linearization of Scaffolds Sharing Repeated
               Contigs},
  booktitle = {{COCOA}},
  series    = {Lecture Notes in Computer Science},
  volume    = {11346},
  pages     = {94--107},
  publisher = {Springer},
  year      = {2018}
}
@inproceedings{DBLP:conf/recomb/DavotCGW18,
  author    = {Tom Davot and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  title     = {On the Hardness of Approximating Linearization of Scaffolds Sharing
               Repeated Contigs},
  booktitle = {{RECOMB-CG}},
  series    = {Lecture Notes in Computer Science},
  volume    = {11183},
  pages     = {91--107},
  publisher = {Springer},
  year      = {2018}
}
@inproceedings{DBLP:conf/recomb/Weller18,
  author    = {Mathias Weller},
  title     = {Linear-Time Tree Containment in Phylogenetic Networks},
  booktitle = {{RECOMB-CG}},
  series    = {Lecture Notes in Computer Science},
  volume    = {11183},
  pages     = {309--323},
  publisher = {Springer},
  year      = {2018}
}
@inproceedings{DBLP:conf/swat/BentertMW18,
  author    = {Matthias Bentert and
               Josef Mal{\'{\i}}k and
               Mathias Weller},
  title     = {Tree Containment With Soft Polytomies},
  booktitle = {{SWAT}},
  series    = {LIPIcs},
  volume    = {101},
  pages     = {9:1--9:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018}
}
@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}
}
@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}
}
@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}
}
@inproceedings{DBLP:conf/cocoa/DartiesCGW17,
  author    = {Beno{\^{\i}}t Darties and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  title     = {New Insights for Power Edge Set Problem},
  booktitle = {{COCOA} {(1)}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10627},
  pages     = {180--194},
  publisher = {Springer},
  year      = {2017}
}
@inproceedings{DBLP:conf/cocoa/WellerCG17,
  author    = {Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau},
  title     = {On the Linearization of Scaffolds Sharing Repeated Contigs},
  booktitle = {{COCOA} {(2)}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10628},
  pages     = {509--517},
  publisher = {Springer},
  year      = {2017}
}
@inproceedings{DBLP:conf/iwoca/DartiesCGW17,
  author    = {Beno{\^{\i}}t Darties and
               Annie Chateau and
               Rodolphe Giroudeau and
               Mathias Weller},
  title     = {Improved Complexity for Power Edge Set Problem},
  booktitle = {{IWOCA}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10765},
  pages     = {128--141},
  publisher = {Springer},
  year      = {2017}
}
@inproceedings{DBLP:conf/iwpec/DellKTW17,
  author    = {Holger Dell and
               Christian Komusiewicz and
               Nimrod Talmon and
               Mathias Weller},
  title     = {The {PACE} 2017 Parameterized Algorithms and Computational Experiments
               Challenge: The Second Iteration},
  booktitle = {{IPEC}},
  series    = {LIPIcs},
  volume    = {89},
  pages     = {30:1--30:12},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2017}
}
@inproceedings{DBLP:conf/spire/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 (Extended
               Abstract)},
  booktitle = {{SPIRE}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10508},
  pages     = {129--143},
  publisher = {Springer},
  year      = {2017}
}
@article{DBLP:journals/corr/Weller17,
  author    = {Mathias Weller},
  title     = {Linear-Time Tree Containment in Phylogenetic Networks},
  journal   = {CoRR},
  volume    = {abs/1702.06364},
  year      = {2017}
}
@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}
}
@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}
}
@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}
}
@inproceedings{DBLP:conf/cocoa/DallardWCG16,
  author    = {Cl{\'{e}}ment Dallard and
               Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau},
  title     = {Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding},
  booktitle = {{COCOA}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10043},
  pages     = {294--308},
  publisher = {Springer},
  year      = {2016}
}
@inproceedings{DBLP:conf/cocoa/WellerCGKP16,
  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},
  booktitle = {{COCOA}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10043},
  pages     = {463--476},
  publisher = {Springer},
  year      = {2016}
}
@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}
}
@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}
}
@inproceedings{DBLP:conf/cocoa/WellerCG15,
  author    = {Mathias Weller and
               Annie Chateau and
               Rodolphe Giroudeau},
  title     = {On the Complexity of Scaffolding Problems: From Cliques to Sparse
               Graphs},
  booktitle = {{COCOA}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9486},
  pages     = {409--423},
  publisher = {Springer},
  year      = {2015}
}
@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},
  title     = {A Polynomial-Time Algorithm for Outerplanar Diameter Improvement},
  booktitle = {{CSR}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9139},
  pages     = {123--142},
  publisher = {Springer},
  year      = {2015}
}
@inproceedings{DBLP:conf/mfcs/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 (Extended Abstract)},
  booktitle = {{MFCS} {(2)}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9235},
  pages     = {62--74},
  publisher = {Springer},
  year      = {2015}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@article{DBLP:journals/corr/Weller14a,
  author    = {Mathias Weller},
  title     = {Optimal Hub Labeling is NP-complete},
  journal   = {CoRR},
  volume    = {abs/1407.8373},
  year      = {2014}
}
@phdthesis{DBLP:phd/dnb/Weller13,
  author    = {Mathias Weller},
  title     = {Aspects of preprocessing applied to combinatorial graph problems},
  school    = {Berlin Institute of Technology},
  year      = {2013}
}
@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}
}
@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}
}
@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}
}
@inproceedings{DBLP:conf/isaac/ChenKNSSW13,
  author    = {Jiehua Chen and
               Christian Komusiewicz and
               Rolf Niedermeier and
               Manuel Sorge and
               Ondrej Such{\'{y}} and
               Mathias Weller},
  title     = {Effective and Efficient Data Reduction for the Subset Interconnection
               Design Problem},
  booktitle = {{ISAAC}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8283},
  pages     = {361--371},
  publisher = {Springer},
  year      = {2013}
}
@inproceedings{DBLP:conf/wea/Weller13,
  author    = {Mathias Weller},
  title     = {An Improved Branching Algorithm for Two-Layer Planarization Parameterized
               by the Feedback Edge Set Number},
  booktitle = {{SEA}},
  series    = {Lecture Notes in Computer Science},
  volume    = {7933},
  pages     = {337--353},
  publisher = {Springer},
  year      = {2013}
}
@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}
}
@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}
}
@inproceedings{DBLP:conf/isaac/BevernMNW12,
  author    = {Ren{\'{e}} van Bevern and
               Matthias Mnich and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Interval Scheduling and Colorful Independent Sets},
  booktitle = {{ISAAC}},
  series    = {Lecture Notes in Computer Science},
  volume    = {7676},
  pages     = {247--256},
  publisher = {Springer},
  year      = {2012}
}
@inproceedings{DBLP:conf/iscopt/SorgeMNW12,
  author    = {Manuel Sorge and
               Hannes Moser and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Exploiting a Hypergraph Model for Finding Golomb Rulers},
  booktitle = {{ISCO}},
  series    = {Lecture Notes in Computer Science},
  volume    = {7422},
  pages     = {368--379},
  publisher = {Springer},
  year      = {2012}
}
@inproceedings{DBLP:conf/medalg/ChopinNNW12,
  author    = {Morgan Chopin and
               Andr{\'{e}} Nichterlein and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Constant Thresholds Can Make Target Set Selection Tractable},
  booktitle = {MedAlg},
  series    = {Lecture Notes in Computer Science},
  volume    = {7659},
  pages     = {120--133},
  publisher = {Springer},
  year      = {2012}
}
@inproceedings{DBLP:conf/isaac/DornfelderGKW11,
  author    = {Martin D{\"{o}}rnfelder and
               Jiong Guo and
               Christian Komusiewicz and
               Mathias Weller},
  title     = {On the Parameterized Complexity of Consensus Clustering},
  booktitle = {{ISAAC}},
  series    = {Lecture Notes in Computer Science},
  volume    = {7074},
  pages     = {624--633},
  publisher = {Springer},
  year      = {2011}
}
@inproceedings{DBLP:conf/iwoca/SorgeBNW11,
  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},
  booktitle = {{IWOCA}},
  series    = {Lecture Notes in Computer Science},
  volume    = {7056},
  pages     = {310--323},
  publisher = {Springer},
  year      = {2011}
}
@inproceedings{DBLP:conf/iwpec/BevernHKNW11,
  author    = {Ren{\'{e}} van Bevern and
               Sepp Hartung and
               Frank Kammer and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Linear-Time Computation of a Linear Problem Kernel for Dominating
               Set on Planar Graphs},
  booktitle = {{IPEC}},
  series    = {Lecture Notes in Computer Science},
  volume    = {7112},
  pages     = {194--206},
  publisher = {Springer},
  year      = {2011}
}
@inproceedings{DBLP:conf/wg/SorgeBNW11,
  author    = {Manuel Sorge and
               Ren{\'{e}} van Bevern and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {From Few Components to an Eulerian Graph by Adding Arcs},
  booktitle = {{WG}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6986},
  pages     = {307--318},
  publisher = {Springer},
  year      = {2011}
}
@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},
  title     = {Extended Islands of Tractability for Parsimony Haplotyping},
  booktitle = {{CPM}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6129},
  pages     = {214--226},
  publisher = {Springer},
  year      = {2010}
}
@inproceedings{DBLP:conf/isaac/NichterleinNUW10,
  author    = {Andr{\'{e}} Nichterlein and
               Rolf Niedermeier and
               Johannes Uhlmann and
               Mathias Weller},
  title     = {On Tractable Cases of Target Set Selection},
  booktitle = {{ISAAC} {(1)}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6506},
  pages     = {378--389},
  publisher = {Springer},
  year      = {2010}
}
@inproceedings{DBLP:conf/tamc/UhlmannW10,
  author    = {Johannes Uhlmann and
               Mathias Weller},
  title     = {Two-Layer Planarization Parameterized by Feedback Edge Set},
  booktitle = {{TAMC}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6108},
  pages     = {431--442},
  publisher = {Springer},
  year      = {2010}
}
@inproceedings{DBLP:conf/wg/DornMNW10,
  author    = {Frederic Dorn and
               Hannes Moser and
               Rolf Niedermeier and
               Mathias Weller},
  title     = {Efficient Algorithms for Eulerian Extension},
  booktitle = {{WG}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6410},
  pages     = {100--111},
  year      = {2010}
}
@inproceedings{DBLP:conf/wads/WellerKNU09,
  author    = {Mathias Weller and
               Christian Komusiewicz and
               Rolf Niedermeier and
               Johannes Uhlmann},
  title     = {On Making Directed Graphs Transitive},
  booktitle = {{WADS}},
  series    = {Lecture Notes in Computer Science},
  volume    = {5664},
  pages     = {542--553},
  publisher = {Springer},
  year      = {2009}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics