Parameterized complexity of candidate control in elections and related digraph problems-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Parameterized complexity of candidate control in elections and related digraph problems

Published:2009-12 Issue:52 Volume:410 Page:5425-5442
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Betzler Nadja,Uhlmann Johannes

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference31 articles.

1. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2009

2. The computational difficulty of manipulating an election;Bartholdi;Social Choice and Welfare,1989

3. How hard is it to control an election;Bartholdi;Mathematical and Computer Modelling,1992

4. Fixed-parameter algorithms for Kemeny scores;Betzler,2008

5. How similarity helps to efficiently compute Kemeny rankings;Betzler,2009

Cited by 41 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Structural Parameterizations for Two Bounded Degree Problems Revisited;ACM Transactions on Computation Theory;2024-09-10

2. Hardness of candidate nomination;Autonomous Agents and Multi-Agent Systems;2023-08-16

3. On the Complexity of Winner Determination and Strategic Control in Conditional Approval Voting;2023

4. On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs;Frontiers of Computer Science;2022-12-05

5. Constraint-based electoral districting using a new compactness measure: An application to Portugal;Computers & Operations Research;2022-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP