The following pages link to Robert Bredereck (Q249100):
Displaying 50 items.
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Parameterized complexity of team formation in social networks (Q1704854) (← links)
- Pattern-guided \(k\)-anonymity (Q1736590) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Stable roommate with narcissistic, single-peaked, and single-crossing preferences (Q1990314) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Bribery and control in stable marriage (Q2109958) (← links)
- Line-up elections: parallel voting with shared candidate pool (Q2109967) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Using patterns to form homogeneous teams (Q2346970) (← links)
- The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
- A characterization of the single-crossing domain (Q2453407) (← links)
- Are there any nicely structured preference profiles nearby? (Q2634484) (← links)
- Multidimensional stable roommates with master list (Q2692267) (← links)
- Large-Scale Election Campaigns: Combinatorial Shift Bribery (Q2800947) (← links)
- Parameterized Complexity of Team Formation in Social Networks (Q2830065) (← links)
- On Explaining Integer Vectors by Few Homogenous Segments (Q2842158) (← links)
- How to Put through Your Agenda in Collective Binary Decisions (Q2868543) (← links)
- The Complexity of Finding a Large Subgraph under Anonymity Constraints (Q2872080) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
- Partial Kernelization for Rank Aggregation: Theory and Experiments (Q3058689) (← links)
- On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510) (← links)
- Pattern-Guided Data Anonymization and Clustering (Q3088038) (← links)
- The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width (Q3133204) (← links)
- Elections with Few Candidates: Prices, Weights, and Covering Problems (Q3449547) (← links)
- A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs (Q4634393) (← links)
- Parameterized Complexity of DAG Partitioning (Q4924637) (← links)
- Bribery and Control in Stable Marriage (Q5154751) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- The Complexity of Degree Anonymization by Vertex Addition (Q5251633) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty (Q5278045) (← links)
- Assessing the Computational Complexity of Multi-layer Subgraph Detection (Q5283362) (← links)
- Pattern-Guided k-Anonymity (Q5405946) (← links)
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda (Q5494853) (← links)
- Complexity of Shift Bribery in Committee Elections (Q5868881) (← links)
- Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters (Q5875607) (← links)
- Robustness among multiwinner voting rules (Q5894693) (← links)
- Robustness among multiwinner voting rules (Q5918366) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
