Jiong Guo

	2009
57		Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM 2009: 226-239
56		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
55		Jiong Guo, Hannes Moser, Rolf Niedermeier: Iterative Compression for Exactly Solving NP-Hard Minimization Problems. Algorithmics of Large and Complex Networks 2009: 65-80
54		Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526
53		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330
52		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420
51		Jiong Guo: Fixed-Parameter Algorithms for Graph-Modeled Date Clustering. TAMC 2009: 39-48
50		Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem CoRR abs/0902.2149: (2009)
49		Jiong Guo: A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8-10): 718-726 (2009)
	2008
48		Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71
47		Nadja Betzler, Jiong Guo, Rolf Niedermeier: Parameterized Computational Complexity of Dodgson and Young Elections. SWAT 2008: 402-413
46		Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang: Improved Algorithms for Bicluster Editing. TAMC 2008: 445-456
45		Jiong Guo: Undirected Feedback Vertex Set. Encyclopedia of Algorithms 2008
44		Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics 13: (2008)
43		Jiong Guo, Rolf Niedermeier, Daniel Raible: Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52(2): 177-202 (2008)
42		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)
41		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)
40		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)
39		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
38		David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier: Probe Matrix Problems: Totally Balanced Matrices. AAIM 2007: 368-377
37		Jiong Guo: A More Effective Linear Kernelization for Cluster Editing. ESCAPE 2007: 36-47
36		Jiong Guo, Rolf Niedermeier: Linear Problem Kernels for NP-Hard Problems on Planar Graphs. ICALP 2007: 375-386
35		Jiong Guo: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. ISAAC 2007: 915-926
34		Michael Dom, Jiong Guo, Rolf Niedermeier: Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. TAMC 2007: 680-691
33		Jiong Guo, Johannes Uhlmann: Kernelization and Complexity Results for Connectivity Augmentation Problems. WADS 2007: 483-494
32		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)
31		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)
30		Jiong Guo, Rolf Niedermeier: Invitation to data reduction and problem kernelization. SIGACT News 38(1): 31-45 (2007)
29		Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Parameterized Complexity of Vertex Cover Variants. Theory Comput. Syst. 41(3): 501-520 (2007)
	2006
28		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
27		Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. IWPEC 2006: 203-214
26		Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann: Complexity and Exact Algorithms for Multicut. SOFSEM 2006: 303-312
25		Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Minimum Membership Set Covering and the Consecutive Ones Property. SWAT 2006: 339-350
24		Jens Gramm, Jiong Guo, Rolf Niedermeier: Pattern matching for arc-annotated sequences. ACM Transactions on Algorithms 2(1): 44-65 (2006)
23		Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Error Compensation in Leaf Power Problems. Algorithmica 44(4): 363-381 (2006)
22		Jiong Guo, Rolf Niedermeier: A fixed-parameter tractability result for multicommodity demand flow in trees. Inf. Process. Lett. 97(3): 109-114 (2006)
21		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)
20		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)
19		Jiong Guo, Rolf Niedermeier: Exact algorithms and applications for Tree-like Weighted Set Cover. J. Discrete Algorithms 4(4): 608-622 (2006)
18		Jens Gramm, Jiong Guo, Rolf Niedermeier: Parameterized Intractability of Distinguishing Substring Selection. Theory Comput. Syst. 39(4): 545-560 (2006)
	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] [21]
2	Nadja Betzler	[47] [48] [56]
3	David B. Chandler	[38]
4	Michael Dom	[10] [13] [17] [23] [25] [28] [34] [39] [42]
5	Michael R. Fellows (Mike Fellows)	[48] [50] [52] [53] [54] [56]
6	Jens Gramm	[1] [2] [3] [4] [5] [6] [7] [8] [11] [15] [18] [20] [21] [24] [32] [44]
7	Falk Hüffner	[4] [5] [7] [9] [10] [11] [13] [15] [20] [23] [26] [28] [31] [32] [41] [42] [44] [46]
8	Erhan Kenar	[26] [41]
9	Ton Kloks (Antonius J. J. Kloks)	[38]
10	Christian Komusiewicz	[46] [54] [57]
11	Hannes Moser	[31] [50] [52] [53] [55]
12	Rolf Niedermeier	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [32] [34] [36] [38] [39] [40] [41] [42] [43] [44] [47] [48] [50] [52] [53] [54] [55] [56] [57]
13	Hans-Peter Piepho	[32]
14	Daniel Raible	[16] [43]
15	Frances A. Rosamond	[48] [56]
16	Ramona Schmid	[32]
17	Anke Truß	[28]
18	Johannes Uhlmann	[26] [33] [40] [41] [54] [57]
19	Sebastian Wernicke	[8] [14] [15] [20] [21] [25] [27] [29] [39]
20	Yong Zhang	[46]