The following pages link to Nadja Betzler (Q528860):
Displayed 23 items.
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- On the Computation of Fully Proportional Representation (Q2842192) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Partial Kernelization for Rank Aggregation: Theory and Experiments (Q3058689) (← links)
- On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510) (← links)
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules (Q3182918) (← links)
- Tree Decompositions of Graphs: Saving Memory in Dynamic Programming (Q3439128) (← links)
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
- Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)
- Average Parameterization and Partial Kernelization for Computing Medians (Q3557009) (← links)
- On Problem Kernels for Possible Winner Determination under the k-Approval Protocol (Q3586077) (← links)
- Optimal Edge Deletions for Signed Graph Balancing (Q5432322) (← links)
- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems (Q5505642) (← links)