Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiong Guo
Person information
- affiliation: Shandong University, Qingdao, China
- affiliation (former): University of Tübingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c91]Yinghui Wen, Zhongyi Zhang, Jiong Guo:
Stable Marriage in Euclidean Space. AAMAS 2023: 994-1002- [c90]Yinghui Wen, Chunjiao Song, Aizhong Zhou, Jiong Guo:
Multi-winner Approval Voting with Grouped Voters. COCOA (2) 2023: 267-278 - [i8]Jiehua Chen, Jiong Guo, Yinghui Wen:
Algorithms and Complexity for Congested Assignments. CoRR abs/2312.07431 (2023) - 2022
- [c89]Yinghui Wen, Aizhong Zhou, Jiong Guo:
Position-Based Matching with Multi-Modal Preferences. AAMAS 2022: 1373-1381 - [c88]Zhongyi Zhang, Jiong Guo:
Colorful Graph Coloring. FAW 2022: 141-161 - [c87]Peihua Li, Jiong Guo:
Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules. FAW 2022: 235-247 - [c86]Jianqi Zhou, Peihua Li, Jiong Guo:
Parameterized Approximation Algorithms for TSP. ISAAC 2022: 50:1-50:16 - 2021
- [j61]Shu Zhang, Daming Zhu
, Haitao Jiang, Jiong Guo, Haodi Feng, Xiaowen Liu:
Sorting a Permutation by Best Short Swaps. Algorithmica 83(7): 1953-1979 (2021) - [j60]Jiong Guo, Deming Lei, Ming Li:
Two-phase imperialist competitive algorithm for energy-efficient flexible job shop scheduling. J. Intell. Fuzzy Syst. 40(6): 12125-12137 (2021) - [c85]Yinghui Wen, Jiong Guo:
Constrained Stable Marriage with Free Edges or Few Blocking Pairs. COCOA 2021: 468-483 - 2020
- [c84]Aizhong Zhou, Jiong Guo:
Parameterized Complexity of Shift Bribery in Iterative Elections. AAMAS 2020: 1665-1673
2010 – 2019
- 2019
- [j59]Jiong Guo, Danny Hermelin:
Foreword: Special Issue on Parameterized and Exact Computation. Algorithmica 81(2): 419-420 (2019) - [j58]Yongjie Yang, Yash Raj Shrestha, Jiong Guo:
On the complexity of bribery with distance restrictions. Theor. Comput. Sci. 760: 55-71 (2019) - [c83]Aizhong Zhou, Yongjie Yang, Jiong Guo:
Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes. AAMAS 2019: 503-510 - [c82]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 - 2018
- [j57]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) - [j56]Yongjie Yang, Jiong Guo:
Parameterized Complexity of Voter Control in Multi-Peaked Elections. Theory Comput. Syst. 62(8): 1798-1825 (2018) - [j55]Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo:
On the kernelization of split graph problems. Theor. Comput. Sci. 734: 72-82 (2018) - [c81]Shu Zhang, Ruizhi Wang, Daming Zhu, Haitao Jiang, Haodi Feng, Jiong Guo, Xiaowen Liu:
The Longest Common Exemplar Subsequence Problem. BIBM 2018: 92-95 - [c80]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 - [c79]Xingcan Cui, Xiaohui Yu, Xiaofang Zhou, Jiong Guo:
ID Repair for Trajectories with Transition Graphs. EDBT 2018: 1-12 - 2017
- [j54]Yongjie Yang, Jiong Guo:
Possible winner problems on partial tournaments: a parameterized study. J. Comb. Optim. 33(3): 882-896 (2017) - [j53]Yongjie Yang, Jiong Guo:
The control complexity of r-Approval: From the single-peaked case to the general case. J. Comput. Syst. Sci. 89: 432-449 (2017) - [c78]Aizhong Zhou, Haitao Jiang, Jiong Guo, Daming Zhu:
A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction. COCOA (1) 2017: 85-92 - [c77]Aizhong Zhou, Haitao Jiang, Jiong Guo, Haodi Feng, Nan Liu, Binhai Zhu:
Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction. COCOON 2017: 575-587 - [e1]Jiong Guo, Danny Hermelin:
11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark. LIPIcs 63, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-023-1 [contents] - 2016
- [j52]Yongjie Yang, Jiong Guo:
Exact algorithms for weighted and unweighted Borda manipulation problems. Theor. Comput. Sci. 622: 79-89 (2016) - [c76]Hong Liu, Jiong Guo:
Parameterized Complexity of Winner Determination in Minimax Committee Elections. AAMAS 2016: 341-349 - [c75]Yongjie Yang, Yash Raj Shrestha, Jiong Guo:
How Hard Is Bribery with Distance Restrictions? ECAI 2016: 363-371 - [c74]Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo:
Kernelization of Two Path Searching Problems on Split Graphs. FAW 2016: 238-249 - [r2]Jiong Guo:
Undirected Feedback Vertex Set. Encyclopedia of Algorithms 2016: 2289-2291 - 2015
- [j51]Mingyu Xiao, Jiong Guo:
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. Algorithmica 71(1): 87-97 (2015) - [j50]Jan Baumbach, Jiong Guo, Rashid Ibragimov:
Covering tree with stars. J. Comb. Optim. 29(1): 141-152 (2015) - [j49]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) - [j48]Jianxin Wang, Weimin Su, Min Yang, Jiong Guo, Qilong Feng, Feng Shi, Jianer Chen:
Parameterized complexity of control and bribery for d-approval elections. Theor. Comput. Sci. 595: 82-91 (2015) - [c73]Jiong Guo, Yash Raj Shrestha, Yongjie Yang:
How Credible is the Prediction of a Party-Based Election? AAMAS 2015: 1431-1439 - [c72]Yongjie Yang, Yash Raj Shrestha, Jiong Guo:
How Hard is Bribery in Party Based Elections? AAMAS 2015: 1725-1726 - [c71]Yongjie Yang, Jiong Guo:
How Hard is Control in Multi-Peaked Elections: A Parameterized Study. AAMAS 2015: 1729-1730 - 2014
- [j47]Jiong Guo, Yash Raj Shrestha:
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs. J. Graph Algorithms Appl. 18(4): 603-631 (2014) - [j46]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) - [j45]Jiong Guo, Danny Hermelin, Christian Komusiewicz:
Local search for string problems: Brute-force is essentially optimal. Theor. Comput. Sci. 525: 30-41 (2014) - [j44]Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller:
On the parameterized complexity of consensus clustering. Theor. Comput. Sci. 542: 71-82 (2014) - [j43]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) - [c70]Yongjie Yang, Jiong Guo:
The control complexity of r-approval: from the single-peaked case to the general case. AAMAS 2014: 621-628 - [c69]Yongjie Yang, Jiong Guo:
Controlling elections with bounded single-peaked width. AAMAS 2014: 629-636 - [c68]Peng Sun, Jiong Guo, Jan Baumbach:
Complexity of Dense Bicluster Editing Problems. COCOON 2014: 154-165 - [c67]Jiong Guo, Yash Raj Shrestha:
Parameterized Complexity of Edge Interdiction Problems. COCOON 2014: 166-178 - [c66]Jan Baumbach, Jiong Guo, Rashid Ibragimov:
Compactness-Preserving Mapping on Trees. CPM 2014: 162-171 - [c65]Jiong Guo, Yash Raj Shrestha:
Controlling Two-Stage Voting Rules. ECAI 2014: 411-416 - [c64]Jie You, Qilong Feng, Jiong Guo, Feng Shi:
On Star-Cover and Path-Cover of a Tree. FAW 2014: 298-308 - [c63]Peng Sun, Jiong Guo, Jan Baumbach:
Efficient Large-scale bicluster editing. GCB 2014: 54-60 - [c62]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 - [c61]Yuhui Ma, Ronghuai Huang, Xiaoying Zhang, Jiong Guo:
Design Tutoring Feedback to Increase Online Learners' Satisfaction. ICSLE 2014: 113-118 - [c60]Jiong Guo, Yash Raj Shrestha:
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs. WALCOM 2014: 286-297 - [i7]Jiong Guo, Yash Raj Shrestha:
Parameterized Complexity of Edge Interdiction Problems. CoRR abs/1401.2532 (2014) - [i6]Jiong Guo, Yash Raj Shrestha, Yongjie Yang:
How Credible is the Prediction of a Party-Based Election? CoRR abs/1404.2464 (2014) - [i5]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger:
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR abs/1407.2143 (2014) - 2013
- [j42]Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined. Algorithmica 67(1): 89-110 (2013) - [j41]Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen:
Planar graph vertex partition for linear problem kernels. J. Comput. Syst. Sci. 79(5): 609-621 (2013) - [j40]Jianxin Wang, Weizhong Luo, Qilong Feng, Jiong Guo:
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks. Theor. Comput. Sci. 508: 16-25 (2013) - [j39]Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen:
Improved linear problem kernel for planar connected dominating set. Theor. Comput. Sci. 511: 2-12 (2013) - [c59]Yongjie Yang, Jiong Guo:
Possible Winner Problems on Partial Tournaments: A Parameterized Study. ADT 2013: 425-439 - [c58]Yongjie Yang, Jiong Guo:
Exact algorithms for weighted and unweighted borda manipulation problems. AAMAS 2013: 1327-1328 - [c57]Jianxin Wang, Min Yang, Jiong Guo, Qilong Feng, Jianer Chen:
Parameterized Complexity of Control and Bribery for d-Approval Elections. COCOA 2013: 260-271 - [c56]Jan Baumbach, Jiong Guo, Rashid Ibragimov:
Covering Tree with Stars. COCOON 2013: 373-384 - [c55]Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen:
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs. COCOON 2013: 555-566 - [c54]Jiong Guo, Danny Hermelin, Christian Komusiewicz:
Local Search for String Problems: Brute Force Is Essentially Optimal. CPM 2013: 130-141 - [c53]Rashid Ibragimov, Maximilian Malek, Jiong Guo, Jan Baumbach:
GEDEVO: An Evolutionary Graph Edit Distance Algorithm for Biological Network Alignment. GCB 2013: 68-79 - [c52]Rashid Ibragimov, Jan Martens, Jiong Guo, Jan Baumbach:
NABEECO: biological network alignment with bee colony optimization algorithm. GECCO (Companion) 2013: 43-44 - [c51]Jan Baumbach, Jiong Guo, Rashid Ibragimov:
Neighborhood-Preserving Mapping between Trees. WADS 2013: 427-438 - [i4]Yongjie Yang, Jiong Guo:
Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems. CoRR abs/1304.3145 (2013) - [i3]Yongjie Yang, Jiong Guo:
Complexity of Sincere-Strategy Preference-Based Approval Control in k-Peaked Elections. CoRR abs/1304.4471 (2013) - 2012
- [j38]Peng Sun, Jiong Guo, Jan Baumbach:
Integrated simultaneous analysis of different biomedical data types with exact weighted bi-cluster editing. J. Integr. Bioinform. 9(2) (2012) - [j37]Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen:
Complexity and parameterized algorithms for Cograph Editing. Theor. Comput. Sci. 461: 45-54 (2012) - [c50]Jiong Guo, Yash Raj Shrestha:
Kernelization and Parameterized Complexity of Star Editing and Union Editing. ISAAC 2012: 126-135 - [c49]Mingyu Xiao, Jiong Guo:
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. MFCS 2012: 825-835 - [i2]Michael R. Fellows, Jiong Guo, Dániel Marx, Saket Saurabh:
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241). Dagstuhl Reports 2(6): 26-50 (2012) - 2011
- [j36]Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann:
Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61(4): 949-970 (2011) - [j35]Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Graph-based data clustering with overlaps. Discret. Optim. 8(1): 2-17 (2011) - [j34]Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier:
Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4): 774-789 (2011) - [j33]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A generalization of Nemhauser and Trotterʼs local optimization theorem. J. Comput. Syst. Sci. 77(6): 1141-1158 (2011) - [j32]Jiong Guo, Rolf Niedermeier, Ondrej Suchý:
Parameterized Complexity of Arc-Weighted Directed Steiner Problems. SIAM J. Discret. Math. 25(2): 583-599 (2011) - [j31]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. ACM Trans. Comput. Theory 2(2): 5:1-5:23 (2011) - [c48]Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo:
The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View. FAW-AAIM 2011: 156-167 - [c47]Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen:
Cograph Editing: Complexity and Parameterized Algorithms. COCOON 2011: 110-121 - [c46]Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined. ISAAC 2011: 614-623 - [c45]Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller:
On the Parameterized Complexity of Consensus Clustering. ISAAC 2011: 624-633 - [c44]Jiong Guo, Iyad A. Kanj, Stefan Kratsch:
Safe Approximation and Its Relation to Kernelization. IPEC 2011: 169-180 - [c43]Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen:
Linear Problem Kernels for Planar Graph Problems with Small Distance Property. MFCS 2011: 592-603 - [c42]Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen:
An Improved Kernel for Planar Connected Dominating Set. TAMC 2011: 70-81 - 2010
- [j30]Nadja Betzler, Jiong Guo, Rolf Niedermeier:
Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. 208(2): 165-177 (2010) - [j29]Michael Dom, Jiong Guo, Rolf Niedermeier:
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. J. Comput. Syst. Sci. 76(3-4): 204-221 (2010) - [j28]Michael R. Fellows, Jiong Guo, Iyad A. Kanj:
The parameterized complexity of some minimum label problems. J. Comput. Syst. Sci. 76(8): 727-740 (2010) - [j27]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß:
Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms 8(1): 76-86 (2010) - [j26]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Fixed-parameter tractability results for full-degree spanning tree and its dual. Networks 56(2): 116-130 (2010) - [j25]Jiong Guo, Johannes Uhlmann:
Kernelization and complexity results for connectivity augmentation problems. Networks 56(2): 131-142 (2010) - [j24]Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. SIAM J. Discret. Math. 24(4): 1662-1683 (2010) - [c41]Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI 2010: 457-462 - [c40]Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu:
Extended Islands of Tractability for Parsimony Haplotyping. CPM 2010: 214-226 - [c39]Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier:
Average Parameterization and Partial Kernelization for Computing Medians. LATIN 2010: 60-71
2000 – 2009
- 2009
- [j23]Jiong Guo:
A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8-10): 718-726 (2009) - [j22]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410(45): 4554-4570 (2009) - [c38]Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM 2009: 226-239 - [c37]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) 2009: 657-664 - [c36]Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526 - [c35]Jiong Guo, Hannes Moser, Rolf Niedermeier:
Iterative Compression for Exactly Solving NP-Hard Minimization Problems. Algorithmics of Large and Complex Networks 2009: 65-80 - [c34]Jiong Guo, Rolf Niedermeier, Ondrej Suchý:
Parameterized Complexity of Arc-Weighted Directed Steiner Problems. ISAAC 2009: 544-553 - [c33]Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann:
Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC 2009: 583-593 - [c32]Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý:
What Makes Equitable Connected Partition Easy. IWPEC 2009: 122-133 - [c31]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330 - [c30]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420 - [c29]Jiong Guo:
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering. TAMC 2009: 39-48 - [c28]Michael R. Fellows, Jiong Guo, Iyad A. Kanj:
The Parameterized Complexity of Some Minimum Label Problems. WG 2009: 88-99 - [i1]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. CoRR abs/0902.2149 (2009) - 2008
- [j21]Jiong Guo, Rolf Niedermeier, Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52(2): 177-202 (2008) - [j20]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Closest 4-leaf power is fixed-parameter tractable. Discret. Appl. Math. 156(18): 3345-3361 (2008) - [j19]Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann:
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. Eur. J. Oper. Res. 186(2): 542-553 (2008) - [j18]Jiong Guo, Rolf Niedermeier, Johannes Uhlmann:
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees. Inf. Process. Lett. 106(2): 81-86 (2008) - [j17]Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Red-blue covering problems and the consecutive ones property. J. Discrete Algorithms 6(3): 393-407 (2008) - [j16]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithmics 13 (2008) - [c27]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71 - [c26]Nadja Betzler, Jiong Guo, Rolf Niedermeier:
Parameterized Computational Complexity of Dodgson and Young Elections. SWAT 2008: 402-413 - [c25]Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang:
Improved Algorithms for Bicluster Editing. TAMC 2008: 445-456 - [r1]Jiong Guo:
Undirected Feedback Vertex Set. Encyclopedia of Algorithms 2008 - 2007
- [j15]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, Ramona Schmid:
Algorithms for compact letter displays: Comparison and evaluation. Comput. Stat. Data Anal. 52(2): 725-736 (2007) - [j14]Jiong Guo, Falk Hüffner, Hannes Moser:
Feedback arc set in bipartite tournaments is NP-complete. Inf. Process. Lett. 102(2-3): 62-65 (2007) - [j13]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Parameterized Complexity of Vertex Cover Variants. Theory Comput. Syst. 41(3): 501-520 (2007) - [j12]Jiong Guo, Rolf Niedermeier:
Invitation to data reduction and problem kernelization. SIGACT News 38(1): 31-45 (2007) - [c24]David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier:
Probe Matrix Problems: Totally Balanced Matrices. AAIM 2007: 368-377 - [c23]Jiong Guo:
A More Effective Linear Kernelization for Cluster Editing. ESCAPE 2007: 36-47 - [c22]Jiong Guo, Rolf Niedermeier:
Linear Problem Kernels for NP-Hard Problems on Planar Graphs. ICALP 2007: 375-386 - [c21]Jiong Guo:
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. ISAAC 2007: 915-926 - [c20]Michael Dom, Jiong Guo, Rolf Niedermeier:
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. TAMC 2007: 680-691 - [c19]Jiong Guo, Johannes Uhlmann:
Kernelization and Complexity Results for Connectivity Augmentation Problems. WADS 2007: 483-494 - 2006
- [b1]Jiong Guo:
Algorithm design techniques for parameterized graph modification problems. University of Jena, Germany, 2006, pp. 1-156 - [j11]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Error Compensation in Leaf Power Problems. Algorithmica 44(4): 363-381 (2006) - [j10]Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. Int. J. Found. Comput. Sci. 17(6): 1467-1484 (2006) - [j9]Jiong Guo, Rolf Niedermeier:
A fixed-parameter tractability result for multicommodity demand flow in trees. Inf. Process. Lett. 97(3): 109-114 (2006) - [j8]Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8): 1386-1396 (2006) - [j7]Jiong Guo, Rolf Niedermeier:
Exact algorithms and applications for Tree-like Weighted Set Cover. J. Discrete Algorithms 4(4): 608-622 (2006) - [j6]Jens Gramm, Jiong Guo, Rolf Niedermeier:
Parameterized Intractability of Distinguishing Substring Selection. Theory Comput. Syst. 39(4): 545-560 (2006) - [j5]Jens Gramm, Jiong Guo, Rolf Niedermeier:
Pattern matching for arc-annotated sequences. ACM Trans. Algorithms 2(1): 44-65 (2006) - [c18]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. ALENEX 2006: 86-94 - [c17]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß:
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. CIAC 2006: 320-331 - [c16]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. IWPEC 2006: 203-214 - [c15]Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann:
Complexity and Exact Algorithms for Multicut. SOFSEM 2006: 303-312 - [c14]Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Minimum Membership Set Covering and the Consecutive Ones Property. SWAT 2006: 339-350 - [p1]Jiong Guo:
Algorithm design techniques for parameterized graph modification problems. Ausgezeichnete Informatikdissertationen 2006: 99-108 - 2005
- [j4]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. Theory Comput. Syst. 38(4): 373-392 (2005) - [j3]Jiong Guo, Rolf Niedermeier:
Fixed-parameter tractability and data reduction for multicut in trees. Networks 46(3): 124-135 (2005) - [c13]Michael Dom, Jiong Guo, Rolf Niedermeier:
Bounded Degree Closest k-Tree Power Is NP-Complete. COCOON 2005: 757-766 - [c12]Jiong Guo, Rolf Niedermeier, Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT 2005: 172-184 - [c11]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Parameterized Complexity of Generalized Vertex Cover Problems. WADS 2005: 36-48 - [c10]Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS 2005: 158-168 - [c9]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Extending the Tractability Border for Closest Leaf Powers. WG 2005: 397-408 - 2004
- [j2]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. Algorithmica 39(4): 321-347 (2004) - [j1]Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Computing the similarity of two sequences with nested arc annotations. Theor. Comput. Sci. 312(2-3): 337-358 (2004) - [c8]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Error Compensation in Leaf Root Problems. ISAAC 2004: 389-401 - [c7]Jiong Guo, Falk Hüffner, Rolf Niedermeier:
A Structural View on Parameterizing Problems: Distance from Triviality. IWPEC 2004: 162-173 - [c6]Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Avoiding Forbidden Submatrices by Row Deletions. SOFSEM 2004: 349-360 - 2003
- [c5]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. CIAC 2003: 108-119 - [c4]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Automated Generation of Search Tree Algorithms for Graph Modification Problems. ESA 2003: 642-653 - [c3]Jens Gramm, Jiong Guo, Rolf Niedermeier:
On Exact and Approximation Algorithms for Distinguishing Substring Selection. FCT 2003: 195-209 - 2002
- [c2]Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. CPM 2002: 99-114 - [c1]Jens Gramm, Jiong Guo, Rolf Niedermeier:
Pattern Matching for Arc-Annotated Sequences. FSTTCS 2002: 182-193
Coauthor Index
[i5] [j42] [j35] [j34] [j33] [j32] [j31] [c46] [j30] [j29] [j27] [j26] [j24] [c41] [c40] [c39] [j22] [c38] [c37] [c36] [c35] [c34] [c31] [c30] [i1] [j21] [j20] [j19] [j18] [j17] [j16] [c27] [c26] [j15] [j13] [j12] [c24] [c22] [c20] [j11] [j10] [j9] [j8] [j7] [j6] [j5] [c18] [c17] [c16] [c15] [c14] [j4] [j3] [c13] [c12] [c11] [c10] [c9] [j2] [j1] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-06 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
