郭炅
Gender:
Male
Status:
Employed
School/Department:
计算机科学与技术学院
Date of Employment:
2014-10-01
2023-05-29
[1]
温映辉.
Stable Marriage in Euclidean Space.
2023.
2022-12-19
[2]
周建奇.
Parameterized Approximation Algorithms for TSP.
2022.
2022-08-15
[3]
张中一.
Colorful Graph Coloring.
2022.
2022-08-15
[4]
黎佩华.
Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules.
2022.
2022-05-09
[5]
郭炅.
Position-Based Matching with Multi-Modal Preferences.
2022.
2021-12-17
[6]
温映辉.
Constrained Stable Marriage with Free Edges or Few Blocking Pairs.
2021.
2021-03-15
[7]
张舒.
Sorting a Permutation by Best Short Swaps.
Algorithmica (New York),
2021.
2016-08-29
[8]
郭炅.
How Hard Is Bribery with Distance Restrictions?.
2016.
2020-05-09
[9]
郭炅.
Parameterized Complexity of Shift Bribery in Iterative Elections.
2020.
2016-04-04
[10]
郭炅.
Exact algorithms for weighted and unweighted Borda manipulation problems.
Theoretical Computer Science,
2016.
2019-05-28
[11]
周爱中.
Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes.
503,
2019.
2019-02-14
[12]
Yang, Yongjie.
On the complexity of bribery with distance restrictions.
Theoretical Computer Science,
760,
55,
2019.
2018-07-02
[13]
zhangshu , zhudaming , jianghaitao , guogui , Feng Haodi and 张舒.
Can a permutation be sorted by best short swaps?.
2018.
2018-12-01
[14]
zhangshu , zhudaming , jianghaitao , Feng Haodi , guogui and 张舒.
The longest common exemplar subsequence problem.
2018.
2016-05-09
[15]
Liu Hong and guogui.
Parameterized Complexity of Winner Determination in Minimax Committee Elections.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems,
2016.
2016-05-09
[16]
guogui and Liu Hong.
Parameterized Complexity of Winner Determination in Minimax Committee Elections.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems,
2016.
2018-12-01
[17]
zhudaming , jianghaitao , Feng Haodi , guogui and 张舒.
The longest common exemplar subsequence problem.
2018.
2018-07-02
[18]
zhudaming , jianghaitao , guogui , Feng Haodi and 张舒.
Can a permutation be sorted by best short swaps?.
2018.
2016-05-09
[19]
guogui and Liu Hong.
Parameterized Complexity of Winner Determination in Minimax Committee Elections.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems,
2016.
total19 1/1 first previous next last
Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Paper Publications
Current position: