Jiong Guo

	2011
86		Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen: Cograph Editing: Complexity and Parameterized Algorithms. COCOON 2011: 110-121
85		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
84		Jiong Guo, Iyad A. Kanj, Stefan Kratsch: Safe Approximation and Its Relation to Kernelization. IPEC 2011: 169-180
83		Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý: The Parameterized Complexity of Local Search for TSP, More Refined. ISAAC 2011: 614-623
82		Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller: On the Parameterized Complexity of Consensus Clustering. ISAAC 2011: 624-633
81		Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen: Linear Problem Kernels for Planar Graph Problems with Small Distance Property. MFCS 2011: 592-603
80		Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen: An Improved Kernel for Planar Connected Dominating Set. TAMC 2011: 70-81
79		Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61(4): 949-970 (2011)
78		Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-based data clustering with overlaps. Discrete Optimization 8(1): 2-17 (2011)
77		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)
76		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)
75		Jiong Guo, Rolf Niedermeier, Ondrej Suchý: Parameterized Complexity of Arc-Weighted Directed Steiner Problems. SIAM J. Discrete Math. 25(2): 583-599 (2011)
74		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. TOCT 2(2): 5 (2011)
	2010
73		Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI 2010
72		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
71		Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier: Average Parameterization and Partial Kernelization for Computing Medians. LATIN 2010: 60-71
70		Nadja Betzler, Jiong Guo, Rolf Niedermeier: Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. 208(2): 165-177 (2010)
69		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)
68		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)
67		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)
66		Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Fixed-parameter tractability results for full-degree spanning tree and its dual. Networks 56(2): 116-130 (2010)
65		Jiong Guo, Johannes Uhlmann: Kernelization and complexity results for connectivity augmentation problems. Networks 56(2): 131-142 (2010)
64		Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. SIAM J. Discrete Math. 24(4): 1662-1683 (2010)
	2009
63		Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM 2009: 226-239
62		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
61		Jiong Guo, Hannes Moser, Rolf Niedermeier: Iterative Compression for Exactly Solving NP-Hard Minimization Problems. Algorithmics of Large and Complex Networks 2009: 65-80
60		Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526
59		Jiong Guo, Rolf Niedermeier, Ondrej Suchý: Parameterized Complexity of Arc-Weighted Directed Steiner Problems. ISAAC 2009: 544-553
58		Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC 2009: 583-593
57		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
56		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330
55		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420
54		Jiong Guo: Fixed-Parameter Algorithms for Graph-Modeled Date Clustering. TAMC 2009: 39-48
53		Michael R. Fellows, Jiong Guo, Iyad A. Kanj: The Parameterized Complexity of Some Minimum Label Problems. WG 2009: 88-99
52		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem CoRR abs/0902.2149: (2009)
51		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)
50		Jiong Guo: A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8-10): 718-726 (2009)
	2008
49		Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71
48		Nadja Betzler, Jiong Guo, Rolf Niedermeier: Parameterized Computational Complexity of Dodgson and Young Elections. SWAT 2008: 402-413
47		Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang: Improved Algorithms for Bicluster Editing. TAMC 2008: 445-456
46		Jiong Guo: Undirected Feedback Vertex Set. Encyclopedia of Algorithms 2008
45		Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics 13: (2008)
44		Jiong Guo, Rolf Niedermeier, Daniel Raible: Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52(2): 177-202 (2008)
43		Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Closest 4-leaf power is fixed-parameter tractable. Discrete Applied Mathematics 156(18): 3345-3361 (2008)
42		Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European Journal of Operational Research 186(2): 542-553 (2008)
41		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)
40		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)
	2007
39		David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier: Probe Matrix Problems: Totally Balanced Matrices. AAIM 2007: 368-377
38		Jiong Guo: A More Effective Linear Kernelization for Cluster Editing. ESCAPE 2007: 36-47
37		Jiong Guo, Rolf Niedermeier: Linear Problem Kernels for NP-Hard Problems on Planar Graphs. ICALP 2007: 375-386
36		Jiong Guo: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. ISAAC 2007: 915-926
35		Michael Dom, Jiong Guo, Rolf Niedermeier: Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. TAMC 2007: 680-691
34		Jiong Guo, Johannes Uhlmann: Kernelization and Complexity Results for Connectivity Augmentation Problems. WADS 2007: 483-494
33		Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, Ramona Schmid: Algorithms for compact letter displays: Comparison and evaluation. Computational Statistics & Data Analysis 52(2): 725-736 (2007)
32		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)
31		Jiong Guo, Rolf Niedermeier: Invitation to data reduction and problem kernelization. SIGACT News 38(1): 31-45 (2007)
30		Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Parameterized Complexity of Vertex Cover Variants. Theory Comput. Syst. 41(3): 501-520 (2007)
	2006
29		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
28		Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. IWPEC 2006: 203-214
27		Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann: Complexity and Exact Algorithms for Multicut. SOFSEM 2006: 303-312
26		Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Minimum Membership Set Covering and the Consecutive Ones Property. SWAT 2006: 339-350
25		Jens Gramm, Jiong Guo, Rolf Niedermeier: Pattern matching for arc-annotated sequences. ACM Transactions on Algorithms 2(1): 44-65 (2006)
24		Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Error Compensation in Leaf Power Problems. Algorithmica 44(4): 363-381 (2006)
23		Jiong Guo, Rolf Niedermeier: A fixed-parameter tractability result for multicommodity demand flow in trees. Inf. Process. Lett. 97(3): 109-114 (2006)
22		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)
21		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)
20		Jiong Guo, Rolf Niedermeier: Exact algorithms and applications for Tree-like Weighted Set Cover. J. Discrete Algorithms 4(4): 608-622 (2006)
19		Jens Gramm, Jiong Guo, Rolf Niedermeier: Parameterized Intractability of Distinguishing Substring Selection. Theory Comput. Syst. 39(4): 545-560 (2006)
18		Jiong Guo: Algorithm design techniques for parameterized graph modification problems. Universität Jena 2006: 1-156
	2005
17		Michael Dom, Jiong Guo, Rolf Niedermeier: Bounded Degree Closest k-Tree Power Is NP-Complete. COCOON 2005: 757-766
16		Jiong Guo, Rolf Niedermeier, Daniel Raible: Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT 2005: 172-184
15		Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke: Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS 2005: 158-168
14		Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Parameterized Complexity of Generalized Vertex Cover Problems. WADS 2005: 36-48
13		Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Extending the Tractability Border for Closest Leaf Powers. WG 2005: 397-408
12		Jiong Guo, Rolf Niedermeier: Fixed-parameter tractability and data reduction for multicut in trees. Networks 46(3): 124-135 (2005)
11		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)
	2004
10		Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Error Compensation in Leaf Root Problems. ISAAC 2004: 389-401
9		Jiong Guo, Falk Hüffner, Rolf Niedermeier: A Structural View on Parameterizing Problems: Distance from Triviality. IWPEC 2004: 162-173
8		Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier: Avoiding Forbidden Submatrices by Row Deletions. SOFSEM 2004: 349-360
7		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)
6		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)
	2003
5		Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. CIAC 2003: 108-119
4		Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Automated Generation of Search Tree Algorithms for Graph Modification Problems. ESA 2003: 642-653
3		Jens Gramm, Jiong Guo, Rolf Niedermeier: On Exact and Approximation Algorithms for Distinguishing Substring Selection. FCT 2003: 195-209
	2002
2		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
1		Jens Gramm, Jiong Guo, Rolf Niedermeier: Pattern Matching for Arc-Annotated Sequences. FSTTCS 2002: 182-193

Coauthor Index

1	Jochen Alber	[2] [6] [8] [22]
2	Nadja Betzler	[48] [49] [51] [62] [70] [71] [77]
3	Daniel Binkele-Raible (Daniel Raible)	[16] [44]
4	David B. Chandler	[39]
5	Jianer Chen	[80] [81] [86]
6	Michael Dom	[10] [13] [17] [24] [26] [29] [35] [40] [43] [67] [69]
7	Martin Dörnfelder	[82]
8	Rosa Enciso	[57]
9	Michael R. Fellows (Mike Fellows)	[49] [51] [52] [53] [55] [56] [57] [60] [62] [68] [74] [76] [78]
10	Qilong Feng	[80] [85]
11	Rudolf Fleischer	[72]
12	Jens Gramm	[1] [2] [3] [4] [5] [6] [7] [8] [11] [15] [19] [21] [22] [25] [33] [45]
13	Sepp Hartung	[73] [83]
14	Falk Hüffner	[4] [5] [7] [9] [10] [11] [13] [15] [21] [24] [27] [29] [32] [33] [42] [43] [45] [47] [67]
15	Iyad A. Kanj	[53] [57] [58] [68] [79] [84]
16	Erhan Kenar	[27] [42]
17	Ton Kloks (Antonius J. J. Kloks)	[39]
18	Christian Komusiewicz	[47] [58] [60] [63] [64] [71] [73] [77] [78] [79] [82]
19	Stefan Kratsch	[84]
20	Yunlong Liu	[86]
21	Weizhong Luo	[80] [85]
22	Hannes Moser	[32] [52] [55] [56] [61] [74] [76]
23	Rolf Niedermeier	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [33] [35] [37] [39] [40] [41] [42] [43] [44] [45] [48] [49] [51] [52] [55] [56] [59] [60] [61] [62] [63] [64] [66] [67] [69] [70] [71] [72] [73] [74] [75] [76] [77] [78] [83]
24	Hans-Peter Piepho	[33]
25	Frances A. Rosamond	[49] [51] [57] [62]
26	Ramona Schmid	[33]
27	Ondrej Suchý	[57] [59] [75] [83]
28	Anke Truß	[29] [67]
29	Johannes Uhlmann	[27] [34] [41] [42] [58] [60] [63] [64] [65] [72] [73] [78] [79]
30	Jianxin Wang	[80] [81] [85] [86]
31	Yihui Wang	[72]
32	Mathias Weller	[72] [82]
33	Sebastian Wernicke	[8] [14] [15] [21] [22] [26] [28] [30] [40] [66]
34	Xi Wu	[72]
35	Yongjie Yang	[81]
36	Yong Zhang	[47]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page