default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Bredereck
Person information
- affiliation: TU Clausthal, Germany
- affiliation (former): TU Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j35]Robert Bredereck, Junjie Luo
:
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas. Inf. Comput. 296: 105128 (2024)- [i46]Robert Bredereck, Junjie Luo:
Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas. CoRR abs/2402.16016 (2024) - 2023
- [j34]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Fine-grained view on bribery for group identification. Auton. Agents Multi Agent Syst. 37(1): 21 (2023) - [j33]Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
Improving Resource Allocations by Sharing in Pairs. J. Artif. Intell. Res. 78: 1069-1109 (2023) - [j32]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. 26(4): 369-382 (2023) - [c64]Niclas Boehmer, Robert Bredereck, Dominik Peters:
Rank Aggregation Using Scoring Rules. AAAI 2023: 5515-5523 - [c63]Bartosz Kusek, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop:
Bribery Can Get Harder in Structured Multiwinner Approval Election. AAMAS 2023: 1725-1733 - [c62]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. ECAI 2023: 303-310 - [c61]Robert Bredereck, Till Fluschnik, Nimrod Talmon:
Efficiently Computing Smallest Agreeable Sets. ECAI 2023: 311-318 - [c60]Eva Michelle Deltl, Till Fluschnik, Robert Bredereck:
Algorithmics of Egalitarian versus Equitable Sequences of Committees. IJCAI 2023: 2651-2658 - [i45]Eva Michelle Deltl, Till Fluschnik, Robert Bredereck:
Algorithmics of Egalitarian versus Equitable Sequences of Committees. CoRR abs/2306.14850 (2023) - 2022
- [j31]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Envy-free allocations respecting social networks. Artif. Intell. 305: 103664 (2022) - [j30]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. 289(Part): 104943 (2022) - [c59]Niclas Boehmer, Robert Bredereck, André Nichterlein:
Combating Collusion Rings Is Hard but Possible. AAAI 2022: 4843-4850 - [c58]Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
On Improving Resource Allocations by Sharing. AAAI 2022: 4875-4883 - [c57]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate Algorithmics for Eliminating Envy by Donating Goods. AAMAS 2022: 127-135 - [c56]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. EAAMO 2022: 7:1-7:10 - [c55]Robert Bredereck, Anne-Marie George, Jonas Israel, Leon Kellerhals:
Single-Peaked Opinion Updates. IJCAI 2022: 137-143 - [c54]Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk:
When Votes Change and Committees Should (Not). IJCAI 2022: 144-150 - [c53]Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa:
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. NeurIPS 2022 - [i44]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate Algorithmics for Eliminating Envy by Donating Goods. CoRR abs/2202.01716 (2022) - [i43]Robert Bredereck, Anne-Marie George, Jonas Israel, Leon Kellerhals:
Single-Peaked Opinion Updates. CoRR abs/2204.14094 (2022) - [i42]Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa:
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. CoRR abs/2205.07831 (2022) - [i41]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. CoRR abs/2208.13760 (2022) - [i40]Bartosz Kusek, Robert Bredereck, Piotr Faliszewski:
Bribery Can Get Harder in Structured Multiwinner Approval Election. CoRR abs/2209.00368 (2022) - [i39]Niclas Boehmer, Robert Bredereck, Dominik Peters:
Rank Aggregation Using Scoring Rules. CoRR abs/2209.08856 (2022) - 2021
- [j29]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On coalitional manipulation for multiwinner elections: shortlisting. Auton. Agents Multi Agent Syst. 35(2): 38 (2021) - [j28]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness among multiwinner voting rules. Artif. Intell. 290: 103403 (2021) - [j27]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. J. Artif. Intell. Res. 71: 993-1048 (2021) - [j26]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory 13(3): 20:1-20:25 (2021) - [c52]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI 2021: 11755-11763 - [c51]Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Made More Practical. AAMAS 2021: 260-268 - [c50]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. IJCAI 2021: 52-58 - [c49]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa:
Putting a Compass on the Map of Elections. IJCAI 2021: 59-65 - [i38]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR abs/2102.13642 (2021) - [i37]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable. CoRR abs/2104.10124 (2021) - [i36]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa:
Putting a Compass on the Map of Elections. CoRR abs/2105.07815 (2021) - [i35]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Fine-Grained View on Bribery for Group Identification. CoRR abs/2105.08376 (2021) - [i34]Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
On Improving Resource Allocations by Sharing. CoRR abs/2112.07525 (2021) - [i33]Niclas Boehmer, Robert Bredereck, André Nichterlein:
Combating Collusion Rings is Hard but Possible. CoRR abs/2112.08444 (2021) - 2020
- [j25]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable roommates with narcissistic, single-peaked, and single-crossing preferences. Auton. Agents Multi Agent Syst. 34(2): 53 (2020) - [j24]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci. 814: 86-105 (2020) - [c48]Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier:
Adapting Stable Matchings to Evolving Preferences. AAAI 2020: 1830-1837 - [c47]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
Parameterized Algorithms for Finding a Collective Set of Items. AAAI 2020: 1838-1845 - [c46]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Electing Successive Committees: Complexity and Algorithms. AAAI 2020: 1846-1853 - [c45]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Fine-Grained View on Bribery for Group Identification. IJCAI 2020: 67-73 - [c44]Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Martin Lackner:
Strategic Campaign Management in Apportionment Elections. IJCAI 2020: 103-109 - [c43]Robert Bredereck, Lilian Jacobs, Leon Kellerhals:
Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks. IJCAI 2020: 1622-1628 - [c42]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. SAGT 2020: 163-177 - [c41]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. SAGT 2020: 275-290 - [c40]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Multidimensional Stable Roommates with Master List. WINE 2020: 59-73 - [i32]Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk:
Multistage Committee Election. CoRR abs/2005.02300 (2020) - [i31]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. CoRR abs/2005.04907 (2020) - [i30]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. CoRR abs/2007.04948 (2020) - [i29]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. CoRR abs/2007.04960 (2020) - [i28]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Multidimensional Stable Roommates with Master List. CoRR abs/2009.14191 (2020) - [i27]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
On the Robustness of Winners: Counting Briberies in Elections. CoRR abs/2010.09678 (2020) - [i26]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Envy-Free Allocations Respecting Social Networks. CoRR abs/2011.11596 (2020)
2010 – 2019
- 2019
- [j23]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Algorithmica 81(4): 1584-1614 (2019) - [j22]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. 7(2): 215-241 (2019) - [c39]Robert Bredereck, Edith Elkind, Ayumi Igarashi:
Hedonic Diversity Games. AAMAS 2019: 565-573 - [c38]Robert Bredereck, Junjie Luo:
Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas. AAMAS 2019: 819-827 - [c37]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. EC 2019: 505-523 - [c36]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
An Experimental View on Committees Providing Justified Representation. IJCAI 2019: 109-115 - [c35]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ISAAC 2019: 44:1-44:14 - [i25]Robert Bredereck, Edith Elkind, Ayumi Igarashi:
Hedonic Diversity Games. CoRR abs/1903.00303 (2019) - [i24]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences. CoRR abs/1903.05975 (2019) - [i23]Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier:
Adapting Stable Matchings to Evolving Preferences. CoRR abs/1907.01375 (2019) - [i22]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. CoRR abs/1911.09379 (2019) - 2018
- [j21]Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch:
Parameterized complexity of team formation in social networks. Theor. Comput. Sci. 717: 26-36 (2018) - [c34]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections With Diversity Constraints. AAAI 2018: 933-940 - [c33]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Envy-Free Allocations Respecting Social Networks. AAMAS 2018: 283-291 - [i21]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. CoRR abs/1806.10460 (2018) - 2017
- [j20]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220: 134-160 (2017) - [j19]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh:
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. J. Artif. Intell. Res. 59: 133-173 (2017) - [j18]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Partitioning Perfect Graphs into Stars. J. Graph Theory 85(2): 297-335 (2017) - [c32]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. AAAI 2017: 390-396 - [c31]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences. ADT 2017: 315-330 - [c30]Ayumi Igarashi, Robert Bredereck, Edith Elkind:
On Parameterized Complexity of Group Activity Selection Problems on Social Networks. AAMAS 2017: 1575-1577 - [c29]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC 2017: 128-139 - [c28]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. IJCAI 2017: 887-893 - [c27]Robert Bredereck, Edith Elkind:
Manipulating Opinion Diffusion in Social Networks. IJCAI 2017: 894-900 - [c26]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. SAGT 2017: 80-92 - [c25]Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. TAMC 2017: 348-361 - [i20]Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. CoRR abs/1701.05108 (2017) - [i19]Ayumi Igarashi, Robert Bredereck, Edith Elkind:
On Parameterized Complexity of Group Activity Selection Problems on Social Networks. CoRR abs/1703.01121 (2017) - [i18]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. CoRR abs/1707.01417 (2017) - [i17]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting. CoRR abs/1709.02850 (2017) - [i16]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections with Diversity Constraints. CoRR abs/1711.06527 (2017) - [i15]Ayumi Igarashi, Robert Bredereck, Dominik Peters, Edith Elkind:
Group Activity Selection on Social Networks. CoRR abs/1712.02712 (2017) - 2016
- [j17]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices matter for the parameterized complexity of shift bribery. Inf. Comput. 251: 140-164 (2016) - [j16]Robert Bredereck, Nimrod Talmon:
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting. Inf. Process. Lett. 116(2): 147-152 (2016) - [j15]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. J. Artif. Intell. Res. 55: 603-652 (2016) - [j14]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are there any nicely structured preference profiles nearby? Math. Soc. Sci. 79: 61-73 (2016) - [j13]Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622: 90-110 (2016) - [c24]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. AAAI 2016: 2452-2458 - [c23]Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch:
Parameterized Complexity of Team Formation in Social Networks. AAIM 2016: 137-149 - [c22]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR 2016: 105-120 - [c21]Bernhard Bliem, Robert Bredereck, Rolf Niedermeier:
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. IJCAI 2016: 102-108 - [c20]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. IPEC 2016: 10:1-10:14 - [i14]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. CoRR abs/1601.01492 (2016) - [i13]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR abs/1604.06302 (2016) - [i12]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the Computational Complexity of Multi-Layer Subgraph Detection. CoRR abs/1604.07724 (2016) - [i11]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-constrained scheduling problems parameterized by partial order width. CoRR abs/1605.00901 (2016) - [i10]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-Parameter Algorithms for DAG Partitioning. CoRR abs/1611.08809 (2016) - [i9]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. CoRR abs/1611.08892 (2016) - 2015
- [j12]Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Using Patterns to Form Homogeneous Teams. Algorithmica 71(2): 517-538 (2015) - [j11]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On explaining integer vectors by few homogeneous segments. J. Comput. Syst. Sci. 81(4): 766-782 (2015) - [j10]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Vertex Dissolution. SIAM J. Discret. Math. 29(2): 888-914 (2015) - [j9]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. 607: 16-34 (2015) - [j8]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put Through Your Agenda in Collective Binary Decisions. ACM Trans. Economics and Comput. 4(1): 5:1-5:28 (2015) - [c19]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Elections with Few Candidates: Prices, Weights, and Covering Problems. ADT 2015: 414-431 - [c18]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. AAMAS 2015: 67-75 - [c17]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh:
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. IJCAI 2015: 164-170 - [i8]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. CoRR abs/1502.01253 (2015) - [i7]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh:
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. CoRR abs/1509.02424 (2015) - [i6]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are there any nicely structured preference~profiles~nearby? CoRR abs/1509.04595 (2015) - 2014
- [j7]Nadja Betzler, Robert Bredereck, Rolf Niedermeier:
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation. Auton. Agents Multi Agent Syst. 28(5): 721-748 (2014) - [j6]Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Algorithmica 68(3): 715-738 (2014) - [j5]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
The effect of homogeneity on the computational complexity of combinatorial data anonymization. Data Min. Knowl. Discov. 28(1): 65-91 (2014) - [j4]Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res. 50: 409-446 (2014) - [c16]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. AAAI 2014: 1398-1404 - [c15]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Degree Anonymization by Vertex Addition. AAIM 2014: 44-55 - [c14]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. ICALP (1) 2014: 174-185 - [c13]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. MFCS (2) 2014: 69-80 - [i5]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. CoRR abs/1402.2589 (2014) - [i4]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. CoRR abs/1402.2664 (2014) - [i3]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger:
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR abs/1407.2143 (2014) - 2013
- [j3]Robert Bredereck, André Nichterlein, Rolf Niedermeier:
Pattern-Guided k-Anonymity. Algorithms 6(4): 678-701 (2013) - [j2]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
A characterization of the single-crossing domain. Soc. Choice Welf. 41(4): 989-998 (2013) - [c12]Robert Bredereck, André Nichterlein, Rolf Niedermeier:
Pattern-Guided k-Anonymity. FAW-AAIM 2013: 350-361 - [c11]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put through Your Agenda in Collective Binary Decisions. ADT 2013: 30-44 - [c10]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Parameterized Complexity of DAG Partitioning. CIAC 2013: 49-60 - [c9]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are There Any Nicely Structured Preference Profiles Nearby? IJCAI 2013: 62-68 - [c8]Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
The Complexity of Finding a Large Subgraph under Anonymity Constraints. ISAAC 2013: 152-162 - [c7]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On Explaining Integer Vectors by Few Homogenous Segments. WADS 2013: 207-218 - 2012
- [j1]Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Bounded-Degree Vertex Deletion parameterized by treewidth. Discret. Appl. Math. 160(1-2): 53-60 (2012) - [c6]Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI 2012: 1292-1298 - [c5]Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier:
Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. The Multivariate Algorithmic Revolution and Beyond 2012: 318-363 - 2011
- [c4]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
The Effect of Homogeneity on the Complexity of k-Anonymity. FCT 2011: 53-64 - [c3]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Pattern-Guided Data Anonymization and Clustering. MFCS 2011: 182-193 - [c2]Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. SOFSEM 2011: 123-134 - [i2]Robert Bredereck:
Graph and Election Problems Parameterized by Feedback Set Numbers. CoRR abs/1108.2191 (2011) - 2010
- [c1]Nadja Betzler, Robert Bredereck, Rolf Niedermeier:
Partial Kernelization for Rank Aggregation: Theory and Experiments. IPEC 2010: 26-37 - [i1]Robert Bredereck:
Fixed-Parameter Algorithms for Computing Kemeny Scores - Theory and Practice. CoRR abs/1001.4003 (2010)
Coauthor Index
[j33] [j32] [c62] [j31] [j30] [c58] [c56] [i41] [j29] [j28] [j27] [j26] [c52] [c51] [c50] [c49] [i38] [i36] [i34] [j25] [j24] [c48] [c47] [c46] [c42] [c41] [c40] [i31] [i30] [i29] [i28] [i27] [i26] [j23] [j22] [c37] [c36] [c35] [i24] [i23] [i22] [c33] [i21] [j19] [j18] [c32] [c31] [c29] [c28] [c26] [i18] [i17] [j17] [j15] [c24] [c21] [c20] [i14] [i13] [i12] [i9] [j12] [j11] [j10] [j9] [j8] [c19] [c18] [c17] [i8] [i7] [j7] [j6] [j5] [j4] [c16] [c15] [c14] [c13] [i5] [i4] [i3] [j3] [c12] [c11] [c7] [j1] [c6] [c5] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
