@article {188,
	title = {Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters},
	year = {2022},
	keywords = {2022 - Journal articles},
	doi = {10.1016/J.IC.2022.104943},
	url = {https://doi.org/10.1016/j.ic.2022.104943},
	author = {Robert Bredereck and Klaus Heeger and Du{\v s}an Knop and Rolf Niedermeier}
}
@inproceedings {174,
	title = {Putting a Compass on the Map of Elections},
	booktitle = {Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}21)},
	year = {2021},
	pages = {59{\textendash}65},
	publisher = {ijcai.org},
	organization = {ijcai.org},
	keywords = {2021 - Conference articles},
	url = {https://arxiv.org/abs/2105.07815},
	author = {Niclas Boehmer and Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Stanislaw Szufa}
}
@inproceedings {160,
	title = {Parameterized Algorithms for Finding a Collective Set of Items},
	booktitle = {Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI {\textquoteright}20)},
	year = {2020},
	note = {Accepted for publication.},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	keywords = {2020 - Conference articles},
	author = {Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk and Dušan Knop and Rolf Niedermeier}
}
@article {147,
	title = {A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems},
	journal = {Algorithmica},
	volume = {81},
	year = {2019},
	pages = {1584--1614},
	keywords = {2019 - Journal articles},
	doi = {10.1007/s00453-018-0494-6},
	url = {http://arxiv.org/abs/1604.06302},
	author = {Robert Bredereck and Vincent Froese and Marcel Koseler and Marcelo Garlet Millani and Andr{\'e} Nichterlein and Rolf Niedermeier}
}
@inproceedings {conference-BHKN19,
	title = {Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters},
	booktitle = {Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC {\textquoteright}19)},
	year = {2019},
	note = {Accepted for publication.},
	type = {conference2019},
	keywords = {2019 - Conference articles},
	author = {Robert Bredereck and Klaus Heeger and Du{\v s}an Knop and Rolf Niedermeier}
}
@article {148,
	title = {Parameterized complexity of team formation in social networks},
	volume = {717},
	year = {2018},
	pages = {26-36},
	keywords = {2018 - Journal articles},
	doi = {10.1016/j.tcs.2017.05.024},
	author = {Robert Bredereck and Jiehua Chen and Falk H{\"u}ffner and Stefan Kratsch}
}
@article {journal-BBBCFNW16,
	title = {Partitioning Perfect Graphs into Stars},
	volume = {85},
	number = {2},
	year = {2017},
	pages = {297{\textendash}335},
	type = {journal2017},
	keywords = {2017 - Journal articles},
	doi = {10.1016/j.dam.2016.12.002},
	url = {http://arxiv.org/abs/1402.2589},
	author = {Ren{\'e} van Bevern and Robert Bredereck and Laurent Bulteau and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger}
}
@article {journal-BCNW17,
	title = {Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty},
	volume = {59},
	year = {2017},
	pages = {133{\textendash}173},
	type = {journal2017},
	keywords = {2017 - Journal articles},
	doi = {10.1613/jair.5407},
	author = {Robert Bredereck and Jiehua Chen and Rolf Niedermeier and Toby Walsh}
}
@inproceedings {conference-IBE17,
	title = {On Parameterized Complexity of Group Activity Selection Problems on Social Networks},
	booktitle = {Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS {\textquoteright}17)},
	year = {2017},
	note = {Accepted for publication.},
	pages = {2 (extended abstract)},
	type = {conference2017},
	keywords = {2017 - Conference articles},
	url = {https://arxiv.org/abs/1703.01121},
	author = {Ayumi Igarashi and Robert Bredereck and Edith Elkind}
}
@inproceedings {conference-BFKMNN17,
	title = {A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems},
	booktitle = {Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC {\textquoteright}16)},
	series = {LIPIcs},
	volume = {63},
	year = {2017},
	pages = {10:1{\textendash}10:14},
	publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik},
	organization = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik},
	type = {conference2017},
	keywords = {2017 - Conference articles},
	doi = {10.4230/LIPIcs.IPEC.2016.10},
	url = {http://arxiv.org/abs/1604.06302},
	author = {Robert Bredereck and Vincent Froese and Marcel Koseler and Marcelo Garlet Millani and Andr{\'e} Nichterlein and Rolf Niedermeier}
}
@article {journal-BCFNN16,
	title = {Prices Matter for the Parameterized Complexity of Shift Bribery},
	volume = {251},
	year = {2016},
	pages = {140{\textendash}164},
	type = {journal2016},
	keywords = {2016 - Journal articles},
	doi = {10.1016/j.ic.2016.08.003},
	author = {Robert Bredereck and Jiehua Chen and Andr{\'e} Nichterlein and Piotr Faliszewski and Rolf Niedermeier}
}
@inproceedings {121,
	title = {Parameterized Complexity of Team Formation in Social Networks},
	booktitle = {Proceedings of the 11th International Conference on Algorithmic Aspects of Information and Management (AAIM {\textquoteright}16)},
	year = {2016},
	pages = {137-149},
	publisher = {Springer},
	organization = {Springer},
	keywords = {2016 - Conference articles},
	author = {Robert Bredereck and Jiehua Chen and Falk H{\"u}ffner and Stefan Kratch}
}
@inproceedings {120,
	title = {Precedence-constrained scheduling problems parameterized by partial order width},
	booktitle = {Proceedings of the International Conference on Discrete Optimization and Operations Research (DOOR {\textquoteright}16)},
	series = {LNCS},
	volume = {9869},
	year = {2016},
	pages = {105-120},
	publisher = {Springer},
	organization = {Springer},
	keywords = {2016 - Conference articles},
	author = {Ren{\'e} van Bevern and Robert Bredereck and Laurent Bulteau and Christian Komusiewicz and Nimrod Talmon and Gerhard J. Woeginger}
}
@inproceedings {conference-BCNW15,
	title = {{Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty}},
	booktitle = {Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}15)},
	year = {2015},
	note = {Accepted for publication.},
	pages = {164-170},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	type = {conference2015},
	keywords = {2015 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/parliamentary_voting.pdf},
	author = {Robert Bredereck and Jiehua Chen and Rolf Niedermeier and Toby Walsh}
}
@article {journal-BCFGNW14,
	title = {{Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges}},
	journal = {Tsinghua Science and Technology},
	volume = {19},
	number = {4},
	year = {2014},
	pages = {358{\textendash}373},
	type = {journal2014},
	keywords = {2014 - Journal articles},
	url = {http://fpt.akt.tu-berlin.de/publications/Parameterized_Algorithmics_for_Computational_Social_Choice__Nine_Research_Challenges.pdf},
	author = {Robert Bredereck and Jiehua Chen and Piotr Faliszewski and Jiong Guo and Rolf Niedermeier and Gerhard J. Woeginger}
}
@article {conference-BCFNN14,
	title = {{Prices Matter for the Parameterized Complexity of Shift Bribery}},
	year = {2014},
	pages = {552{\textendash}558},
	type = {conference2014},
	keywords = {2014 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/sb_BrChFaNiNi.pdf},
	author = {Robert Bredereck and Jiehua Chen and Andr{\'e} Nichterlein and Piotr Faliszewski and Rolf Niedermeier}
}
@article {journal-BNN13,
	title = {{Pattern-Guided k-Anonymity}},
	journal = {Algorithms},
	volume = {6},
	number = {4},
	year = {2013},
	pages = {678{\textendash}701},
	type = {journal2013},
	keywords = {2013 - Journal articles},
	doi = {10.3390/a6040678},
	url = {http://fpt.akt.tu-berlin.de/publications/pattern_guided_k-anonymity.pdf},
	author = {Robert Bredereck and Andr{\'e} Nichterlein and Rolf Niedermeier}
}
@article {conference-BBC+13,
	title = {Parameterized Complexity of DAG Partitioning},
	volume = {7878},
	year = {2013},
	pages = {49-60},
	publisher = {Springer},
	type = {conference2013},
	keywords = {2013 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/dagPartitioning.pdf},
	author = {Ren{\'e} van Bevern and Robert Bredereck and Morgan Chopin and Sepp Hartung and Falk H{\"u}ffner and Andr{\'e} Nichterlein and Ond{\v r}ej Such{\'y}}
}
@article {conference-BNN13,
	title = {Pattern-Guided k-Anonymity},
	volume = {7924},
	year = {2013},
	pages = {350{\textendash}361},
	publisher = {Springer},
	type = {conference2013},
	keywords = {2013 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/Pattern-Guided_k-Anonymity-FAW-AAIM.pdf},
	author = {Robert Bredereck and Andr{\'e} Nichterlein and Rolf Niedermeier}
}
@inproceedings {conference-BNNP11b,
	title = {Pattern-Guided Data Anonymization and Clustering},
	booktitle = {Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS {\textquoteright}11)},
	series = {LNCS},
	volume = {6907},
	year = {2011},
	pages = {182-193},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2011},
	keywords = {2011 - Conference articles},
	doi = {10.1007/978-3-642-22993-0_19},
	url = {http://fpt.akt.tu-berlin.de/publications/Pattern-Guided_Data_Anonymization_and_Clustering-MFCS.pdf},
	author = {Robert Bredereck and Andr{\'e} Nichterlein and Rolf Niedermeier and Geevarghese Philip}
}
@inproceedings {conference-BBN10,
	title = {Partial Kernelization for Rank Aggregation: Theory and Experiments},
	booktitle = {Proceedings of the 5th International Symposium on Parameterized and Exact Computation (IPEC {\textquoteright}10)},
	series = {LNCS},
	volume = {6478},
	year = {2010},
	pages = {26-37},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2010},
	abstract = {R<small>ANK </small>A<small>GGREGATION</small> is important  in many  areas ranging from web search over databases to bioinformatics. The underlying decision problem K<small>EMENY </small>S<small>CORE</small> is NP-complete even in case of four input rankings to be aggregated into a  "median ranking". We study efficient polynomial-time data reduction rules that  allow us to find <em>optimal</em> median rankings. On the theoretical side, we improve a result for a "partial problem kernel" from quadratic to linear size. On the practical side, we provide encouraging experimental results with data based on web search and sport competitions, e.g., computing optimal median rankings for real-world instances with more than 100 candidates within milliseconds.},
	keywords = {2010 - Conference articles},
	doi = {10.1007/978-3-642-17493-3_5},
	url = {http://fpt.akt.tu-berlin.de/publications/Partial_Kernelization_for_Rank_Aggregation__Theory_and_Experiments-IPEC.pdf},
	author = {Nadja Betzler and Robert Bredereck and Rolf Niedermeier}
}
