郭炅  Professor Website

Home


郭炅    Professor

2006, PhD, Jena University, Germany
2009, Habilitation, Jena University, Germany
2009-2014, Research Group Leader, Professor, Saarland University, Germany

Research


Parameterized algorithmics is a relatively new approach dealing with NP-hard problem, aiming at shrining the inherent computational explosion to a small parameter, leading to efficient solving strategies.

Courses


N/A

Projects


2015, Taishan Oversee Professor, Shandong, China

Publications


Mingyu Xiao, Jiong Guo: A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. Algorithmica 71(1): 87-97 (2015)

Jan Baumbach, Jiong Guo, Rashid Ibragimov: Covering tree with stars. J. Comb. Optim. 29(1): 141-152 (2015)

Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen: An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. J. Comb. Optim. 29(1): 257-275 (2015)

Jiong Guo, Yash Raj Shrestha: Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs. J. Graph Algorithms Appl. 18(4): 603-631 (2014)

Weizhong Luo, Jianxin Wang, Jiong Guo, Jianer Chen: Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks. Theor. Comput. Sci. 518: 32-41 (2014)

Jiong Guo, Danny Hermelin, Christian Komusiewicz: Local search for string problems: Brute-force is essentially optimal. Theor. Comput. Sci. 525: 30-41 (2014)

Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller: On the parameterized complexity of consensus clustering. Theor. Comput. Sci. 542: 71-82 (2014)

Feng Shi, Jianxin Wang, Jianer Chen, Qilong Feng, Jiong Guo: Algorithms for parameterized maximum agreement forest problem on multiple trees. Theor. Comput. Sci. 554: 207-216 (2014)

Yongjie Yang, Jiong Guo: The control complexity of r-approval: from the single-peaked case to the general case. AAMAS 2014: 621-628

Yongjie Yang, Jiong Guo: Controlling elections with bounded single-peaked width. AAMAS 2014: 629-636

Peng Sun, Jiong Guo, Jan Baumbach: Complexity of Dense Bicluster Editing Problems. COCOON 2014: 154-165

Jiong Guo, Yash Raj Shrestha: Parameterized Complexity of Edge Interdiction Problems. COCOON 2014: 166-178

Jan Baumbach, Jiong Guo, Rashid Ibragimov: Compactness-Preserving Mapping on Trees. CPM 2014: 162-171

Jiong Guo, Yash Raj Shrestha: Controlling Two-Stage Voting Rules. ECAI 2014: 411-416

Jie You, Qilong Feng, Jiong Guo, Feng Shi: On Star-Cover and Path-Cover of a Tree. FAW 2014: 298-308

Peng Sun, Jiong Guo, Jan Baumbach: Efficient Large-scale bicluster editing. GCB 2014: 54-60

Rashid Ibragimov, Maximilian Malek, Jan Baumbach, Jiong Guo: Multiple graph edit distance: simultaneous topological alignment of multiple protein-protein interaction networks with an evolutionary algorithm. GECCO 2014: 277-284

Jiong Guo, Yash Raj Shrestha: Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs. WALCOM 2014: 286-297


Telephone


Email: jguo@sdu.edu.cn or jguo@mmci.uni-saarland.de