![]()
郭炅
-
- 性别：男
- 在职信息：在职
- 所在单位：计算机科学与技术学院
- 入职时间： 2014-10-01
访问量：
-
[1]
郭炅.
Position-Based Matching with Multi-Modal Preferences.
2022.
-
[2]
温映辉.
Constrained Stable Marriage with Free Edges or Few Blocking Pairs.
2021.
-
[3]
张舒.
Sorting a Permutation by Best Short Swaps.
Algorithmica (New York),
2021.
-
[4]
郭炅.
How Hard Is Bribery with Distance Restrictions?.
2016.
-
[5]
郭炅.
Parameterized Complexity of Shift Bribery in Iterative Elections.
2020.
-
[6]
郭炅.
Exact algorithms for weighted and unweighted Borda manipulation problems.
Theoretical Computer Science,
2016.
-
[7]
周爱中.
Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes.
503,
2019.
-
[8]
Yang, Yongjie.
On the complexity of bribery with distance restrictions.
Theoretical Computer Science,
760,
55,
2019.
-
[9]
张舒 , 朱大铭 , 姜海涛 , 郭炅 and 冯好娣.
Can a permutation be sorted by best short swaps?.
2018.
-
[10]
张舒 , 朱大铭 , 姜海涛 , 冯好娣 and 郭炅.
The longest common exemplar subsequence problem.
2018.
-
[11]
刘宏 and 郭炅.
Parameterized Complexity of Winner Determination in Minimax Committee Elections.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems,
2016.
-
[12]
郭炅 and 刘宏.
Parameterized Complexity of Winner Determination in Minimax Committee Elections.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems,
2016.
-
[13]
朱大铭 , 姜海涛 , 冯好娣 , 郭炅 and 张舒.
The longest common exemplar subsequence problem.
2018.
-
[14]
朱大铭 , 姜海涛 , 郭炅 , 冯好娣 and 张舒.
Can a permutation be sorted by best short swaps?.
2018.
-
[15]
郭炅 and 刘宏.
Parameterized Complexity of Winner Determination in Minimax Committee Elections.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems,
2016.
