@article {196,
	title = {Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas},
	year = {2024},
	keywords = {2024 - Journal articles},
	doi = {10.1016/J.IC.2023.105128},
	url = {https://doi.org/10.1016/j.ic.2023.105128},
	author = {Robert Bredereck and Junjie Luo}
}
@article {195,
	title = {Fine-grained view on bribery for group identification},
	year = {2023},
	keywords = {2023 - Journal articles},
	doi = {10.1007/S10458-023-09597-7},
	url = {https://doi.org/10.1007/s10458-023-09597-7},
	author = {Niclas Boehmer and Robert Bredereck and Du{\v s}an Knop and Junjie Luo}
}
@article {194,
	title = {Improving Resource Allocations by Sharing in Pairs},
	year = {2023},
	keywords = {2023 - Journal articles},
	doi = {10.1613/JAIR.1.15001},
	url = {https://doi.org/10.1613/jair.1.15001},
	author = {Robert Bredereck and Andrzej Kaczmarczyk and Junjie Luo and Rolf Niedermeier and Florian Sachse}
}
@article {193,
	title = {A multivariate complexity analysis of the material consumption scheduling problem},
	year = {2023},
	keywords = {2023 - Journal articles},
	doi = {10.1007/S10951-022-00771-5},
	url = {https://doi.org/10.1007/s10951-022-00771-5},
	author = {Matthias Bentert and Robert Bredereck and P{\'e}ter Gy{\"o}rgyi and Andrzej Kaczmarczyk and Rolf Niedermeier}
}
@inproceedings {192,
	title = {Rank Aggregation Using Scoring Rules},
	booktitle = {Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI {\textquoteright}23)},
	year = {2023},
	pages = {5515{\textendash}5523},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	keywords = {2023 - Conference articles},
	doi = {10.1609/AAAI.V37I5.25685},
	url = {https://doi.org/10.1609/aaai.v37i5.25685},
	author = {Niclas Boehmer and Robert Bredereck and Dominik Peters}
}
@inproceedings {191,
	title = {High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming},
	booktitle = {Proceedings of the 26th European Conference on Artificial Intelligence (ECAI {\textquoteright}23)},
	series = {Frontiers in Artificial Intelligence and Applications},
	volume = {372},
	year = {2023},
	pages = {303{\textendash}310},
	publisher = {IOS Press},
	organization = {IOS Press},
	keywords = {2023 - Conference articles},
	doi = {10.3233/FAIA230284},
	url = {https://doi.org/10.3233/FAIA230284},
	author = {Robert Bredereck and Andrzej Kaczmarczyk and Du{\v s}an Knop and Rolf Niedermeier}
}
@inproceedings {190,
	title = {Efficiently Computing Smallest Agreeable Sets},
	booktitle = {Proceedings of the 26th European Conference on Artificial Intelligence (ECAI {\textquoteright}23)},
	series = {Frontiers in Artificial Intelligence and Applications},
	volume = {372},
	year = {2023},
	pages = {311{\textendash}318},
	publisher = {IOS Press},
	organization = {IOS Press},
	keywords = {2023 - Conference articles},
	doi = {10.3233/FAIA230285},
	url = {https://doi.org/10.3233/FAIA230285},
	author = {Robert Bredereck and Till Fluschnik and Nimrod Talmon}
}
@inproceedings {189,
	title = {Algorithmics of Egalitarian versus Equitable Sequences of Committees},
	booktitle = {Proceedings of the 32nd International Joint Conference Artificial Intelligence (IJCAI {\textquoteright}23)},
	year = {2023},
	pages = {2651{\textendash}2658},
	publisher = {ijcai.org},
	organization = {ijcai.org},
	keywords = {2023 - Conference articles},
	doi = {10.24963/IJCAI.2023/295},
	url = {https://doi.org/10.24963/ijcai.2023/295},
	author = {Eva Michelle Deltl and Till Fluschnik and Robert Bredereck}
}
@article {179,
	title = {Envy-free allocations respecting social networks},
	journal = {Artificial Intelligence},
	volume = {305},
	year = {2022},
	pages = {103664},
	keywords = {2022 - Journal articles},
	doi = {10.1016/j.artint.2022.103664},
	url = {https://doi.org/10.1016/j.artint.2022.103664},
	author = {Robert Bredereck and Andrzej Kaczmarczyk and Rolf Niedermeier}
}
@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 {182,
	title = {Combating Collusion Rings is Hard but Possible},
	booktitle = {Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI {\textquoteright}22)},
	year = {2022},
	note = {Accepted for publication.},
	keywords = {2022 - Conference articles},
	url = {https://arxiv.org/abs/2112.08444},
	author = {Niclas Boehmer and Robert Bredereck and Andr{\'e} Nichterlein}
}
@inproceedings {187,
	title = {A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners},
	booktitle = {Proceedings of the 2nd ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization},
	year = {2022},
	pages = {7:1{\textendash}7:10},
	publisher = {ACM},
	organization = {ACM},
	keywords = {2022 - Conference articles},
	doi = {10.1145/3551624.3555292},
	url = {https://doi.org/10.1145/3551624.3555292},
	author = {Niclas Boehmer and Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier}
}
@inproceedings {181,
	title = {Single-Peaked Opinion Updates},
	booktitle = {Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}22)},
	year = {2022},
	note = {Accepted for publication.},
	publisher = {ijcai.org},
	organization = {ijcai.org},
	keywords = {2022 - Conference articles},
	author = {Robert Bredereck and Anne-Marie George and Jonas Israel and Leon Kellerhals}
}
@inproceedings {186,
	title = {Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning},
	booktitle = {Proceedings of the 36th Annual Conference on Neural Information Processing Systems},
	year = {2022},
	keywords = {2022 - Conference articles},
	url = {http://papers.nips.cc/paper_files/paper/2022/hash/cb1a0e1bd8b2f20f7500c7886e1fbc60-Abstract-Conference.html},
	author = {Niclas Boehmer and Robert Bredereck and Edith Elkind and Piotr Faliszewski and Stanislaw Szufa}
}
@inproceedings {180,
	title = {When Votes Change and Committees Should (Not)},
	booktitle = {Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}22)},
	year = {2022},
	note = {Accepted for publication.},
	publisher = {ijcai.org},
	organization = {ijcai.org},
	keywords = {2022 - Conference articles},
	author = {Robert Bredereck and Till Fluschnik and Andrzej Kaczmarczyk}
}
@inproceedings {184,
	title = {Multivariate Algorithmics for Eliminating Envy by Donating Goods},
	booktitle = {Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS {\textquoteright}22)},
	year = {2022},
	note = {Accepted for publication.},
	keywords = {2022 - Conference articles},
	author = {Niclas Boehmer and Robert Bredereck and Klaus Heeger and Du{\v s}an Knop and Junjie Luo}
}
@inproceedings {183,
	title = {On Improving Resource Allocations by Sharing},
	booktitle = {Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI {\textquoteright}22)},
	year = {2022},
	note = {Accepted for publication.},
	keywords = {2022 - Conference articles},
	url = {https://arxiv.org/abs/2112.07525},
	author = {Robert Bredereck and Andrzej Kaczmarczyk and Junjie Luo and Rolf Niedermeier and Florian Sachse}
}
@article {177,
	title = {Bribery and Control in Stable Marriage},
	journal = {Journal of Artificial Intelligence Research},
	volume = {71},
	year = {2021},
	pages = {993--1048},
	keywords = {2021 - Journal articles},
	doi = {10.1613/jair.1.12755},
	url = {https://doi.org/10.1613/jair.1.12755},
	author = {Niclas Boehmer and Robert Bredereck and Klaus Heeger and Rolf Niedermeier}
}
@article {176,
	title = {Complexity of Shift Bribery in Committee Elections},
	journal = {ACM Transactions on Computation Theory},
	volume = {13},
	year = {2021},
	pages = {20:1--20:25},
	keywords = {2021 - Journal articles},
	doi = {10.1145/3470647},
	url = {https://doi.org/10.1145/3470647},
	author = {Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Nimrod Talmon}
}
@article {178,
	title = {On coalitional manipulation for multiwinner elections: shortlisting},
	journal = {Autonomous Agents and Multi-Agent Systems},
	volume = {35},
	year = {2021},
	pages = {38 pages},
	keywords = {2021 - Journal articles},
	doi = {10.1007/s10458-021-09507-9},
	url = {https://doi.org/10.1007/s10458-021-09507-9},
	author = {Robert Bredereck and Andrzej Kaczmarczyk and Rolf Niedermeier}
}
@article {173,
	title = {Robustness among multiwinner voting rules},
	journal = {Artificial Intelligence},
	volume = {290},
	year = {2021},
	month = {2021},
	pages = {103403},
	keywords = {2021 - Journal articles},
	doi = {10.1016/j.artint.2020.103403},
	url = {https://doi.org/10.1016/j.artint.2020.103403},
	author = {Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon}
}
@inproceedings {172,
	title = {High-Multiplicity Fair Allocation Made More Practical},
	booktitle = {Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS {\textquoteright}21)},
	year = {2021},
	note = {Accepted for publication.},
	keywords = {2021 - Conference articles},
	author = {Robert Bredereck and Aleksander Figiel and Andrzej Kaczmarczyk and Du{\v s}an Knop and Rolf Niedermeier}
}
@inproceedings {171,
	title = {A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem},
	booktitle = {Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI {\textquoteright}21)},
	year = {2021},
	note = {Accepted for publication.},
	keywords = {2021 - Conference articles},
	author = {Matthias Bentert and Robert Bredereck and P{\'e}ter Gy{\"o}rgyi and Andrzej Kaczmarczyk and Rolf Niedermeier}
}
@inproceedings {175,
	title = {Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments},
	booktitle = {Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}21)},
	year = {2021},
	pages = {52{\textendash}58},
	publisher = {ijcai.org},
	organization = {ijcai.org},
	keywords = {2021 - Conference articles},
	url = {https://arxiv.org/abs/2010.09678},
	author = {Niclas Boehmer and Robert Bredereck and Piotr Faliszewski 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}
}
@article {166,
	title = {Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting},
	journal = {Theoretical Computer Science},
	volume = {814},
	year = {2020},
	pages = {86{\textendash}105},
	publisher = {Elsevier},
	keywords = {2020 - Journal articles},
	doi = {10.1016/j.tcs.2020.01.017},
	url = {https://arxiv.org/abs/1709.02850},
	author = {Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon}
}
@article {170,
	title = {Stable roommates with narcissistic, single-peaked, and single-crossing preferences},
	journal = {Autonomous Agents and Multi-Agent Systems},
	volume = {34},
	year = {2020},
	pages = {53},
	keywords = {2020 - Journal articles},
	doi = {10.1007/s10458-020-09470-x},
	url = {https://doi.org/10.1007/s10458-020-09470-x},
	author = {Robert Bredereck and Jiehua Chen and Ugo Paavo Finnendahl and Rolf Niedermeier}
}
@inproceedings {159,
	title = {Adapting Stable Matchings to Evolving Preferences},
	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 Jiehua Chen and Dušan Knop and Junjie Luo and Rolf Niedermeier}
}
@inproceedings {168,
	title = {Bribery and Control in Stable Marriage},
	booktitle = {Proceedings of the 13th Symposium on Algorithmic Game Theory (SAGT {\textquoteright}20)},
	year = {2020},
	note = {Accepted for publication.},
	keywords = {2020 - Conference articles},
	url = {https://arxiv.org/abs/2007.04948},
	author = {Niclas Boehmer and Robert Bredereck and Klaus Heeger and Rolf Niedermeier}
}
@inproceedings {conference-BBKL20,
	title = {Fine-Grained View on Bribery for Group Identification},
	booktitle = {Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}20)},
	year = {2020},
	note = {Accepted for publication.},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	type = {conference2020},
	keywords = {2020 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/Fine-Grained_View_on_Bribery_for_Group_Identification-IJCAI20.pdf},
	author = {Niclas Boehmer and Robert Bredereck and Du{\v s}an Knop and Junjie Luo}
}
@inproceedings {167,
	title = {Line-Up Elections: Parallel Voting with Shared Candidate Pool},
	booktitle = {Proceedings of the 13th Symposium on Algorithmic Game Theory (SAGT {\textquoteright}20)},
	year = {2020},
	note = {Accepted for publication.},
	keywords = {2020 - Conference articles},
	url = {https://arxiv.org/abs/2007.04960},
	author = {Niclas Boehmer and Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk and Rolf Niedermeier}
}
@inproceedings {161,
	title = {Electing Successive Committees: Complexity and Algorithms},
	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 Andrzej Kaczmarczyk and Rolf Niedermeier}
}
@inproceedings {conference-BJK20,
	title = {Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks},
	booktitle = {Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}20)},
	year = {2020},
	note = {Accepted for publication.},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	type = {conference2020},
	keywords = {2020 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/Maximizing_the_Spread_of_an_Opinion_in_Few_Steps_Opinion_Diffusion_in_Non-Binary_Networks-IJCAI20.pdf},
	author = {Robert Bredereck and Lilian Jacobs and Leon Kellerhals}
}
@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}
}
@inproceedings {169,
	title = {Multidimensional Stable Roommates with Master List},
	booktitle = {Proceedings of the 16th International Conference on Web and Internet Economics (WINE {\textquoteright}20)},
	year = {2020},
	note = {Accepted for publication.},
	keywords = {2020 - Conference articles},
	author = {Robert Bredereck and Klaus Heeger and Du{\v s}an Knop and Rolf Niedermeier}
}
@inproceedings {conference-BFFKL20,
	title = {Strategic Campaign Management in Apportionment Elections},
	booktitle = {Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}20)},
	year = {2020},
	note = {Accepted for publication.},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	type = {conference2020},
	keywords = {2020 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/Strategic_Campaign_Management_in_Apportionment_Elections-IJCAI20.pdf},
	author = {Robert Bredereck and Piotr Faliszewski and Michal Furdyna and Andrzej Kaczmarczyk and Martin Lackner}
}
@article {162,
	title = {Assessing the computational complexity of multilayer subgraph detection},
	journal = {Network Science},
	volume = {7},
	year = {2019},
	pages = {215--241},
	keywords = {2019 - Journal articles},
	doi = {10.1017/nws.2019.13},
	url = {https://doi.org/10.1017/nws.2019.13},
	author = {Robert Bredereck and Christian Komusiewicz and Stefan Kratsch and Hendrik Molter and Rolf Niedermeier and Manuel Sorge}
}
@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}
}
@inproceedings {conference-BIE19,
	title = {Hedonic Games with Diversity Preferences},
	booktitle = {Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS {\textquoteright}19)},
	year = {2019},
	pages = {565{\textendash}573},
	publisher = {IFAAMAS},
	organization = {IFAAMAS},
	type = {conference2019},
	keywords = {2019 - Conference articles},
	url = {https://dl.acm.org/citation.cfm?id=3331741},
	author = {Ayumi Igarashi and Edith Elkind and Robert Bredereck}
}
@inproceedings {conference-BL19,
	title = {Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas},
	booktitle = {Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS {\textquoteright}19)},
	year = {2019},
	pages = {819{\textendash}827},
	publisher = {IFAAMAS},
	organization = {IFAAMAS},
	type = {conference2019},
	keywords = {2019 - Conference articles},
	url = {http://dl.acm.org/citation.cfm?id=3306127},
	author = {Robert Bredereck and Junjie Luo}
}
@inproceedings {156,
	title = {High-Multiplicity Fair Allocation: Lenstra Empowered by $N$-fold Integer Programming},
	booktitle = {Proceedings of the 20th ACM Conference on Economics and Computation (EC{\textquoteright}19)},
	year = {2019},
	pages = {505{\textendash}523},
	publisher = {ACM},
	organization = {ACM},
	keywords = {2019 - Conference articles},
	doi = {10.1145/3328526.3329649},
	url = {https://dl.acm.org/authorize?N687432},
	author = {Robert Bredereck and Andrzej Kaczmarczyk and Du{\v s}an Knop and Rolf Niedermeier}
}
@inproceedings {157,
	title = {An Experimental View on Committees Providing Justified Representation},
	booktitle = {Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}19)},
	year = {2019},
	pages = {109{\textendash}115},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	keywords = {2019 - Conference articles},
	url = {https://doi.org/10.24963/ijcai.2019/16},
	author = {Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk 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}
}
@inproceedings {conference-BFILS,
	title = {Multiwinner Elections with Diversity Constraints},
	booktitle = {Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI {\textquoteright}18)},
	year = {2018},
	pages = {933-940},
	type = {conference2018},
	keywords = {2018 - Conference articles},
	url = {https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/download/16769/15777},
	author = {Robert Bredereck and Piotr Faliszewski and Ayumi Igarashi and Martin Lackner and Piotr Skowron}
}
@inproceedings {146,
	title = {Envy-Free Allocations Respecting Social Networks},
	booktitle = {Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS {\textquoteright}18)},
	year = {2018},
	pages = {283-291},
	publisher = {IFAAMAS},
	organization = {IFAAMAS},
	keywords = {2018 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/Envy-Free_Allocations_Respecting_Social_Networks_conference.pdf},
	author = {Robert Bredereck and Andrzej Kaczmarczyk and Rolf Niedermeier}
}
@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}
}
@article {journal-BBCHHNS17,
	title = {Fixed-parameter algorithms for DAG Partitioning},
	volume = {220},
	year = {2017},
	pages = {134-160},
	type = {journal2017},
	keywords = {2017 - Journal articles},
	doi = {10.1016/j.dam.2016.12.002},
	url = {https://arxiv.org/abs/1611.08809},
	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}}
}
@inproceedings {conference-BCFN,
	title = {Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences},
	booktitle = {Proceedings of the 5th International Conference on Algorithmic Decision Theory (ADT {\textquoteright}17)},
	series = {LNCS},
	volume = {10576},
	year = {2017},
	pages = {315{\textendash}330},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2017},
	keywords = {2017 - Conference articles},
	doi = {10.1007/978-3-319-67504-6_22},
	url = {http://fpt.akt.tu-berlin.de/publications/stable_roommate_nspsc-ADT17.pdf},
	author = {Robert Bredereck and Jiehua Chen and Ugo Paavo Finnendahl and Rolf Niedermeier}
}
@inproceedings {conference-BE17,
	title = {Manipulating Opinion Diffusion in Social Networks},
	booktitle = {Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}17)},
	year = {2017},
	pages = {894-900},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	type = {conference2017},
	keywords = {2017 - Conference articles},
	doi = {10.24963/ijcai.2017/124},
	url = {http://fpt.akt.tu-berlin.de/publications/binary_opinion_diffusion-IJCAI17.pdf},
	author = {Robert Bredereck and Edith Elkind}
}
@inproceedings {conference-BFKNST2017,
	title = {Robustness Among Multiwinner Voting Rules},
	booktitle = {Proceedings of the Algorithmic Game Theory: 10th International Symposium (SAGT {\textquoteright}17)},
	series = {LNCS},
	volume = {10504},
	year = {2017},
	pages = {80{\textendash}92},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2017},
	keywords = {2017 - Conference articles},
	doi = {10.1007/978-3-319-66700-3_7},
	url = {https://arxiv.org/abs/1707.01417},
	author = {Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon}
}
@inproceedings {conference-KKZBC2017,
	title = {On the Computational Complexity of Variants of Combinatorial Voter Control in Elections},
	booktitle = {Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC {\textquoteright}17)},
	year = {2017},
	pages = {348{\textendash}361},
	type = {conference2017},
	keywords = {2017 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/voter_control_tamc17.pdf},
	author = {Leon Kellerhals and Viatcheslav Korenwein and Philipp Zschoche and Robert Bredereck and Jiehua Chen}
}
@inproceedings {conference-BKKMNS17,
	title = {Assessing the Computational Complexity of Multi-Layer Subgraph Detection},
	booktitle = {Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC {\textquoteright}17)},
	series = {Lecture Notes in Computer Science},
	volume = {10236},
	year = {2017},
	pages = {128{\textendash}139},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2017},
	keywords = {2017 - Conference articles},
	doi = {10.1007/978-3-319-57586-5_12},
	url = {https://arxiv.org/abs/1604.07724},
	author = {Robert Bredereck and Christian Komusiewicz and Stefan Kratsch and Hendrik Molter and Rolf Niedermeier and Manuel Sorge}
}
@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}
}
@inproceedings {conference-BCNOT17,
	title = {Teams in Online Scheduling Polls: Game-Theoretic Aspects},
	booktitle = {Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI {\textquoteright}17)},
	year = {2017},
	pages = {390{\textendash}396},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	type = {conference2017},
	keywords = {2017 - Conference articles},
	url = {https://arxiv.org/abs/1611.08892},
	author = {Robert Bredereck and Jiehua Chen and Rolf Niedermeier and Svetlana Obraztsova and Nimrod Talmon}
}
@inproceedings {conference-BKN17,
	title = { On Coalitional Manipulation for Multiwinner Elections: Shortlisting},
	booktitle = {Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}17)},
	year = {2017},
	pages = {887-893},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	type = {conference2017},
	keywords = {2017 - Conference articles},
	doi = {10.24963/ijcai.2017/123},
	url = {http://fpt.akt.tu-berlin.de/publications/coalitional_multiwinner_manipulation-IJCAI17.pdf},
	author = {Robert Bredereck and Andrzej Kaczmarczyk and Rolf Niedermeier}
}
@article {127,
	title = {Large-Scale Election Campaigns: Combinatorial Shift Bribery},
	journal = {Journal of Artificial Intelligence Research},
	volume = {55},
	year = {2016},
	pages = {603{\textendash}652},
	type = {journal2016},
	keywords = {2016 - Journal articles},
	doi = {10.1613/jair.4927},
	author = {Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Nimrod Talmon}
}
@article {126,
	title = {NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting},
	journal = {Information Processing Letters},
	volume = {116},
	year = {2016},
	pages = {147{\textendash}152},
	type = {journal2016},
	keywords = {2016 - Journal articles},
	doi = {10.1016/j.ipl.2015.09.008},
	author = {Robert Bredereck and Nimrod Talmon}
}
@article {125,
	title = {Are there any nicely structured preference profiles nearby?},
	journal = {Mathematical Social Sciences},
	volume = {79},
	year = {2016},
	pages = {61{\textendash}73},
	type = {journal2016},
	keywords = {2016 - Journal articles},
	doi = {10.1016/j.mathsocsci.2015.11.002},
	author = {Robert Bredereck and Jiehua Chen and Gerhard J. Woeginger}
}
@article {124,
	title = {Finding large degree-anonymous subgraphs is hard},
	journal = {Theoretical Computer Science},
	volume = {622},
	year = {2016},
	pages = {90{\textendash}110},
	type = {journal2016},
	keywords = {2016 - Journal articles},
	doi = {10.1016/j.tcs.2016.02.004},
	url = {http://fpt.akt.tu-berlin.de/publications/anon-deletion-TCS-2016.pdf},
	author = {Cristina Bazgan and Robert Bredereck and Sepp Hartung and Andr{\'e} Nichterlein and Gerhard J. Woeginger}
}
@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 {123,
	title = {Complexity of Shift Bribery in Committee Elections},
	booktitle = {Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI {\textquoteright}16)},
	year = {2016},
	pages = {2452--2458},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	keywords = {2016 - Conference articles},
	url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12362},
	author = {Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon}
}
@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 {122,
	title = {Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels},
	booktitle = {Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}16)},
	year = {2016},
	pages = {102-108},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	keywords = {2016 - Conference articles},
	url = {https://www.ijcai.org/Proceedings/16/Papers/022.pdf},
	author = {Berhard Bliem and Robert Bredereck 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}
}
@article {114,
	title = {NP-Hardness of Two Edge Cover Generalizations with Applications to Control and Bribery for Approval Voting},
	journal = {Information Processing Letters},
	volume = {116},
	year = {2015},
	pages = {147{\textendash}152},
	keywords = {2015 - Journal articles},
	doi = {10.1016/j.ipl.2015.09.008},
	url = {http://fpt.akt.tu-berlin.de/publications/NP-Hardness_of_Two_Edge_Cover_Generalizations-IPL.pdf},
	author = {Robert Bredereck and Nimrod Talmon}
}
@article {118,
	title = {Network-Based Vertex Dissolution},
	journal = {SIAM Journal on Discrete Mathematics},
	volume = {29},
	year = {2015},
	pages = {888{\textendash}914},
	type = {journal2015},
	keywords = {2015 - Journal articles},
	doi = {10.1137/140978880},
	url = {http://fpt.akt.tu-berlin.de/publications/Network-based_dissolution-SIAM.pdf},
	author = {Ren{\'e} van Bevern and Robert Bredereck and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger}
}
@article {117,
	title = {On Explaining Integer Vectors by Few Homogenous Segments},
	journal = {Journal of Computer and System Sciences},
	volume = {81},
	year = {2015},
	pages = {766-782},
	type = {journal2015},
	keywords = {2015 - Journal articles},
	doi = {10.1016/j.jcss.2014.12.028},
	url = {http://fpt.akt.tu-berlin.de/publications/explainVector-journal.pdf},
	author = {Robert Bredereck and Jiehua Chen and Sepp Hartung and Christian Komusiewicz and Rolf Niedermeier and Ond{\v r}ej Such{\'y}}
}
@article {116,
	title = {How to Put Through Your Agenda in Collective Binary Decisions},
	journal = {ACM Transactions on Economics and Computation},
	volume = {4},
	year = {2015},
	pages = {5:1{\textendash}5:28},
	type = {journal2015},
	keywords = {2015 - Journal articles},
	doi = {10.1145/2837467},
	url = {https://fpt.akt.tu-berlin.de/publications/agenda-teac.pdf},
	author = {Noga Alon and Robert Bredereck and Jiehua Chen and Stefan Kratsch and Rolf Niedermeier and Gerhard J. Woeginger}
}
@article {115,
	title = {The Complexity of Degree Anonymization by Vertex Addition},
	journal = {Theoretical Computer Science},
	volume = {607},
	year = {2015},
	pages = {16{\textendash}34},
	keywords = {2015 - Journal articles},
	doi = {10.1016/j.tcs.2015.07.004},
	url = {http://fpt.akt.tu-berlin.de/publications/TheComplexityofDegreeAnonymization-TCS.pdf},
	author = {Robert Bredereck and Vincent Froese and Sepp Hartung and Andr{\'e} Nichterlein and Rolf Niedermeier and Nimrod Talmon}
}
@article {119,
	title = {Using Patterns to Form Homogeneous Teams},
	journal = {Algorithmica},
	volume = {71},
	year = {2015},
	pages = {517-538},
	type = {journal2015},
	keywords = {2015 - Journal articles},
	doi = {10.1007/s00453-013-9821-0},
	url = {http://fpt.akt.tu-berlin.de/publications/homteam.pdf},
	author = {Robert Bredereck and Thomas K{\"o}hler and Andr{\'e} Nichterlein and Rolf Niedermeier and Geevarghese Philip}
}
@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}
}
@inproceedings {conference-BFNT15,
	title = {{Large-Scale Election Campaigns: Combinatorial Shift Bribery}},
	booktitle = {Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS {\textquoteright}15)},
	year = {2015},
	note = {Accepted for publication.},
	pages = {67-75},
	type = {conference2015},
	keywords = {2015 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/CombinatorialShiftBribery_AAMAS15.pdf},
	author = {Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Nimrod Talmon}
}
@inproceedings {conference-BFNST15,
	title = {Elections with Few Candidates: Prices, Weights, and Covering Problems},
	booktitle = {Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT {\textquoteright}15)},
	series = {LNCS},
	volume = {9346},
	year = {2015},
	note = {Accepted for publication.},
	pages = {414-431},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2015},
	keywords = {2015 - Conference articles},
	doi = {10.1007/978-3-319-23114-3_25},
	url = {http://fpt.akt.tu-berlin.de/publications/ElectionswithFewCandidates_ADT15.pdf},
	author = {Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon}
}
@phdthesis {Bred14,
	title = {{Multivariate complexity analysis of team management problems}},
	number = {3},
	year = {2014},
	month = {10/2014},
	pages = {252},
	school = {Universit{\"a}tsverlag der TU Berlin},
	address = {Berlin},
	abstract = {In this thesis, we identify and develop simple combinatorial models for four natural team management tasks and identify tractable and intractable cases with respect to their computational complexity. To this end, we perform a multivariate complexity analysis of the underlying problems and test some of our algorithms on synthetic and empirical data.

Our first task is to find a team that is accepted by competing groups and also satisfies the agenda of some principal. Extending an approval balloting procedure by an agenda model, we formalize this task as a simple combinatorial model where potential team members are represented by a set of proposals and the competing groups are represented by voters with favorite ballots, that is, subsets of proposals. We show that the underlying problems UNANIMOUSLY ACCEPTED BALLOT and MAJORITYWISE ACCEPTED BALLOT are NP-hard even without an agenda for the principal. Herein, UNANIMOUSLY ACCEPTED BALLOT asks for a set of proposals that is accepted by all voters and MAJORITYWISE ACCEPTED BALLOT asks for a set of proposals that is accepted by a strict majority of the voters where acceptance means that each voter supports the majority of the proposals. On the positive side, we show fixed-parameter tractability with respect to the parameters "number of proposals" and "number of voters". With respect to the parameter "maximum size of the favorite ballots" we show fixed-parameter tractability for UNANIMOUSLY ACCEPTED BALLOT and W[1]-completeness for MAJORITYWISE ACCEPTED BALLOT. On the negative side, we show W[2]-hardness for the parameter "size of the solution" and NP-hardness for various special cases.

Our second task is to partition a set of individuals into homogeneous groups. Using concepts from the combinatorial data anonymization model k-ANONYMITY, we develop a new model which formalizes this task. The information about the individuals is stored in a matrix where rows represent individuals and columns represent attributes of the individuals. The homogeneity requirement of each potential group is specified by a "pattern vector". We show that some special cases of the underlying problem HOMOGENEOUS TEAM FORMATION are NP-hard while others allow for (fixed-parameter) tractability results. We transfer our "pattern vector" concept back to combinatorial data anonymization and show that it may help to improve the usability of the anonymized data. We show that the underlying problem PATTERN-GUIDED k-ANONYMITY is NP-hard and complement this by a fixed-parameter tractability result based on a "homogeneity parameterization". Building on this, we develop an exact ILP-based solution method as well as a simple but very effective greedy heuristic. Experiments on several real-world datasets show that our heuristic easily matches up to the established "Mondrian" algorithm for k-ANONYMITY in terms of quality of the anonymization and outperforms it in terms of running time.

Our third task is to effectively train team members in order to ensure that from a set of important skills each skill is covered by a majority of the team. We formalize this task by a natural binary matrix modification problem where team members are represented by rows and skills are represented by columns. The underlying problem is known as LOBBYING in the context of bribery in voting. We study how natural parameters such as "number of rows", "number of columns", "number of rows to modify", or the "maximum number of ones missing for any column to have a majority of ones" (referred to as "gap value") govern the computational complexity. On the negative side, we show NP-hardness even if each row contains at most three ones. On the positive side, for example, we prove fixed-parameter tractability for the parameter "number of columns" and provide a greedy logarithmic-factor approximation algorithm. We also show empirically that this greedy algorithm performs well on general instances. As a further key result, we prove LOGSNP-completeness for constant gap values.

Our fourth task is to redistribute teams of equal size. More precisely, one asks to reduce the number of equal-size teams by dissolving some teams, distributing their team members to non-conflicting non-dissolved teams, and ensuring that all new teams are again of equal size. We formalize this task by a new combinatorial graph model. We show relations to known graph models such as perfect matchings, flow networks, and star partitions. On the negative side, we show that the underlying problem is NP-hard even if the old team size and the team size increase are distinct constants. On the positive side, we show that even our two-party variant of the problem is polynomial-time solvable when there are no conflicts or when the districts to dissolve and the districts to win are known. Furthermore, we show fixed-parameter tractability with respect to treewidth when the old team size and the team size increase are constants.},
	keywords = {2014 - PhD Thesis},
	isbn = {978-3-7983-2765-8},
	url = {http://dx.doi.org/10.14279/depositonce-4450},
	author = {Robert Bredereck}
}
@article {journal-BNNP14,
	title = {{The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization}},
	journal = {Data Mining and Knowledge Discovery},
	volume = {28},
	number = {1},
	year = {2014},
	pages = {65{\textendash}91},
	publisher = {Springer},
	type = {journal2014},
	keywords = {2014 - Journal articles},
	doi = {10.1007/s10618-012-0293-7},
	url = {http://fpt.akt.tu-berlin.de/publications/The_Effect_of_Homogeneity_on_the_Computational_Complexity_of_Combinatorial_Data_Anonymization_DataMinKnowlDis.pdf},
	author = {Robert Bredereck and Andr{\'e} Nichterlein and Rolf Niedermeier and Geevarghese Philip}
}
@article {journal-BBN14,
	title = {{Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation}},
	journal = {Autonomous Agents and Multi-Agent Systems},
	volume = {28},
	number = {5},
	year = {2014},
	pages = {721{\textendash}748},
	publisher = {Springer},
	type = {journal2014},
	keywords = {2014 - Journal articles},
	doi = {10.1007/s10458-013-9236-y},
	url = {http://fpt.akt.tu-berlin.de/publications/kemeny-jaamas.pdf},
	author = {Nadja Betzler and Robert Bredereck and Rolf Niedermeier}
}
@article {journal-BBBNU14,
	title = {{On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion}},
	journal = {Algorithmica},
	number = {3},
	year = {2014},
	pages = {715{\textendash}738},
	publisher = {Springer},
	type = {journal2014},
	keywords = {2014 - Journal articles},
	doi = {10.1007/s00453-012-9695-6},
	url = {http://fpt.akt.tu-berlin.de/publications/On_Making_a_Distinguished_Vertex_of_Minimum_Degree_by_Vertex_Deletion-Algorithmica.pdf},
	author = {Nadja Betzler and Hans Bodlaender and Robert Bredereck and Rolf Niedermeier and Johannes Uhlmann}
}
@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 {journal-BCHKNSW14,
	title = {{A multivariate complexity analysis of lobbying in multiple referenda}},
	journal = {Journal of Artificial Intelligence Research},
	volume = {50},
	year = {2014},
	pages = {409{\textendash}446},
	type = {journal2014},
	keywords = {2014 - Journal articles},
	url = {http://fpt.akt.tu-berlin.de/publications/A_Multivariate_Complexity_Analysis_of_Lobbying_in_Multiple_Referenda-JAIR.pdf},
	author = {Robert Bredereck and Jiehua Chen and Sepp Hartung and Stefan Kratsch and Rolf Niedermeier and Ond{\v r}ej Such{\'y} and Gerhard J. Woeginger}
}
@inproceedings {conference-BBCFNW14,
	title = {{Network-Based Dissolution}},
	booktitle = {Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS {\textquoteright}14)},
	series = {LNCS},
	volume = {8635},
	year = {2014},
	pages = {69{\textendash}80},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2014},
	keywords = {2014 - Conference articles},
	url = {http://arxiv.org/abs/1402.2664},
	author = {Ren{\'e} van Bevern and Robert Bredereck and Jiehua Chen and Vincent Froese 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 {conference-BBBCFNW14,
	title = {{Star Partitions of Perfect Graphs}},
	number = {8572},
	year = {2014},
	pages = {174{\textendash}185},
	publisher = {Springer},
	type = {conference2014},
	keywords = {2014 - Conference articles},
	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}
}
@inproceedings {conference-BFHNNT14,
	title = {{The Complexity of Degree Anonymization by Vertex Addition}},
	booktitle = {Proceedings of the International Conference on Algorithmic Aspects of Information and Management (AAIM {\textquoteright}14)},
	series = {LNCS},
	volume = {8546},
	year = {2014},
	pages = {44{\textendash}55},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2014},
	keywords = {2014 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/aaim-12.pdf},
	author = {Robert Bredereck and Vincent Froese and Sepp Hartung and Andr{\'e} Nichterlein and Rolf Niedermeier and Nimrod Talmon}
}
@article {journal-BCW13,
	title = {{A characterization of the single-crossing domain}},
	journal = {Social Choice and Welfare},
	volume = {41},
	number = {4},
	year = {2013},
	pages = {989{\textendash}998},
	publisher = {Springer},
	type = {journal2013},
	keywords = {2013 - Journal articles},
	doi = {10.1007/s00355-012-0717-8},
	url = {http://fpt.akt.tu-berlin.de/publications/A_characterization_of_the_single-crossing_domain.pdf},
	author = {Robert Bredereck and Jiehua Chen and Gerhard J. Woeginger}
}
@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-ABCKNW13,
	title = {{How to Put Through Your Agenda in Collective Binary Decisions}},
	volume = {8176},
	year = {2013},
	pages = {30-44},
	publisher = {Springer},
	type = {conference2013},
	keywords = {2013 - Conference articles},
	doi = {10.1007/978-3-642-41575-3},
	url = {http://fpt.akt.tu-berlin.de/publications/How_to_Put_Through_Your_Agenda_in_Collective_Binary_Decisions-ADT13.pdf},
	author = {Noga Alon and Robert Bredereck and Jiehua Chen and Stefan Kratsch and Rolf Niedermeier and Gerhard J. Woeginger}
}
@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}
}
@article {conference-BHNW13,
	title = {{The complexity of finding a large subgraph under anonymity constraints}},
	volume = {8283},
	year = {2013},
	pages = {152{\textendash}162},
	publisher = {Springer},
	type = {conference2013},
	keywords = {2013 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/graph_anon_isaac.pdf},
	author = {Robert Bredereck and Sepp Hartung and Andr{\'e} Nichterlein and Gerhard J. Woeginger}
}
@inproceedings {conference-BCW13,
	title = {{Are There Any Nicely Structured Preference Profiles Nearby?}},
	booktitle = {Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI {\textquoteright}13)},
	year = {2013},
	pages = {62{\textendash}68},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	type = {conference2013},
	keywords = {2013 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/Are_There_Any_Nicely_Structured_Preference_Profiles_Nearby-IJCAI.pdf},
	author = {Robert Bredereck and Jiehua Chen and Gerhard J. Woeginger}
}
@inproceedings {conference-BCHKNS13,
	title = {{On Explaining Integer Vectors by Few Homogenous Segments}},
	booktitle = {Proceedings of the 13th Algorithms and Data Structures Symposium (WADS {\textquoteright}13)},
	series = {{LNCS}},
	volume = {8037},
	year = {2013},
	pages = {207{\textendash}218},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2013},
	keywords = {2013 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/expMatrix.pdf},
	author = {Robert Bredereck and Jiehua Chen and Sepp Hartung and Christian Komusiewicz and Rolf Niedermeier and Ond{\v r}ej Such{\'y}}
}
@article {journal-BBNU12,
	title = {{On Bounded-Degree Vertex Deletion Parameterized by Treewidth}},
	journal = {Discrete Applied Mathematics},
	volume = {160},
	number = {1{\textendash}2},
	year = {2012},
	pages = {53{\textendash}60},
	publisher = {Elsevier},
	type = {journal2012},
	keywords = {2012 - Journal articles},
	doi = {10.1016/j.dam.2011.08.013},
	url = {http://fpt.akt.tu-berlin.de/publications/On_Bounded-Degree_Vertex_Deletion_Parameterized_by_Treewidth-DAM.pdf},
	author = {Nadja Betzler and Robert Bredereck and Rolf Niedermeier and Johannes Uhlmann}
}
@inproceedings {conference-BCH+12,
	title = {A Multivariate Complexity Analysis of Lobbying in Multiple Referenda},
	booktitle = {Proceedings of the 26th Conference on Artificial Intelligence (AAAI {\textquoteright}12)},
	year = {2012},
	pages = {1292-1298},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	type = {conference2012},
	keywords = {2012 - Conference articles},
	url = {http://fpt.akt.tu-berlin.de/publications/lobbying-aaai12.pdf},
	author = {Robert Bredereck and Jiehua Chen and Sepp Hartung and Stefan Kratsch and Rolf Niedermeier and Ond{\v r}ej Such{\'y}}
}
@incollection {bookchapter-BBCN12,
	title = {Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective},
	booktitle = {The Multivariate Algorithmic Revolution and Beyond},
	series = {LNCS},
	volume = {7370},
	year = {2012},
	pages = {318{\textendash}363},
	publisher = {Springer},
	organization = {Springer},
	type = {bookchapter2012},
	keywords = {2012 - Book chapters},
	doi = {10.1007/978-3-642-30891-8_16},
	url = {http://fpt.akt.tu-berlin.de/publications/survey-voting-online.pdf},
	author = {Nadja Betzler and Robert Bredereck and Jiehua Chen and Rolf Niedermeier}
}
@inproceedings {conference-BBNU11,
	title = {On Making a Distinguished Vertex Minimum Degree by Vertex Deletion},
	booktitle = {Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM {\textquoteright}11)},
	series = {LNCS},
	volume = {6543},
	year = {2011},
	pages = {123{\textendash}134},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2011},
	keywords = {2011 - Conference articles},
	doi = {10.1007/978-3-642-18381-2_10},
	url = {http://fpt.akt.tu-berlin.de/publications/On_Making_a_Distinguished_Vertex_Minimum_Degree_by_Vertex_Deletion-SOFSEM.pdf},
	author = {Nadja Betzler and Robert Bredereck and Rolf Niedermeier and Johannes Uhlmann}
}
@inproceedings {conference-BNNP11a,
	title = {The Effect of Homogeneity on the Complexity of k-Anonymity},
	booktitle = {Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT {\textquoteright}11)},
	series = {LNCS},
	volume = {6914},
	year = {2011},
	pages = {53-64},
	publisher = {Springer},
	organization = {Springer},
	type = {conference2011},
	keywords = {2011 - Conference articles},
	doi = {10.1007/978-3-642-22953-4_5},
	url = {http://fpt.akt.tu-berlin.de/publications/The_Effect_of_Homogeneity_on_the_Complexity_of_k-Anonymity-FCT.pdf},
	author = {Robert Bredereck and Andr{\'e} Nichterlein and Rolf Niedermeier and Geevarghese Philip}
}
@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}
}
