山东大学计算机专业郭炅,郭炅-山大计算机科学与技术学院

这些研究涉及选举系统的参数化复杂性分析,包括迭代选举中的转移贿赂问题、多峰选举中的选民控制复杂性、带有距离限制的贿赂问题以及图问题的核化。此外,还探讨了无线传感器网络中的小型组多播优化算法和轨迹数据的修复方法。研究集中于算法设计、复杂性理论和选举策略的交互影响。
摘要由CSDN通过智能技术生成

Aizhong Zhou, Jiong Guo: Parameterized Complexity of Shift Bribery in Iterative Elections.AAMAS 2020: 1665-1673

Yongjie Yang, Yash Raj Shrestha, Jiong Guo: On the complexity of bribery with distance restrictions. Theor. Comput. Sci. 760: 55-71 (2019)

Aizhong Zhou, Yongjie Yang, Jiong Guo: Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes. AAMAS 2019: 503-510

Haitao Jiang, Jiong Guo, Daming Zhu, Binhai Zhu: A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem. CPM 2019: 5:1-5:13

Weizhong Luo, Jianxin Wang, Zhaoquan Cai, Gang Peng, Jiong Guo, Shigeng Zhang: An optimal algorithm for small group multicast in wireless sensor networks. Int. J. Ad Hoc Ubiquitous Comput. 28(3): 168-179 (2018)

Yongjie Yang, Jiong Guo: Parameterized Complexity of Voter Control in Multi-Peaked Elections. Theory Comput. Syst. 62(8): 1798-1825 (2018)

Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo: On the kernelization of split graph problems. Theor. Comput. Sci. 734: 72-82 (2018)

Shu Zhang, Ruizhi Wang, Daming Zhu, Haitao Jiang, Haodi Feng, Jiong Guo, Xiaowen Liu: The Longest Common Exemplar Subsequence Problem. BIBM 2018: 92-95

Shu Zhang, Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, Haodi Feng: Can a permutation be sorted by best short swaps?. CPM 2018: 14:1-14:12

Xingcan Cui, Xiaohui Yu, Xiaofang Zhou, Jiong Guo: ID Repair for Trajectories with Transition Graphs. EDBT 2018: 1-12

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值