The following pages link to Jiong Guo (Q249098):
Displaying 50 items.
- Possible Winner Problems on Partial Tournaments: A Parameterized Study (Q2868574) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments (Q2912782) (← links)
- Complexity of Dense Bicluster Editing Problems (Q2920455) (← links)
- Parameterized Complexity of Edge Interdiction Problems (Q2920456) (← links)
- Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs (Q2938754) (← links)
- Pattern matching for arc-annotated sequences (Q2944505) (← links)
- The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View (Q3004665) (← links)
- An Improved Kernel for Planar Connected Dominating Set (Q3010387) (← links)
- A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing (Q3013154) (← links)
- Fixed-parameter tractability results for full-degree spanning tree and its dual (Q3057174) (← links)
- Kernelization and complexity results for connectivity augmentation problems (Q3057175) (← links)
- Cograph Editing: Complexity and Parameterized Algorithms (Q3087943) (← links)
- Linear Problem Kernels for Planar Graph Problems with Small Distance Property (Q3088074) (← links)
- The Parameterized Complexity of Local Search for TSP, More Refined (Q3104663) (← links)
- On the Parameterized Complexity of Consensus Clustering (Q3104664) (← links)
- On Star-Cover and Path-Cover of a Tree (Q3188857) (← links)
- Fixed-parameter tractability and data reduction for multicut in trees (Q3367053) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments (Q3434567) (← links)
- Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual (Q3499738) (← links)
- Improved Algorithms for Bicluster Editing (Q3502668) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
- Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)
- Average Parameterization and Partial Kernelization for Computing Medians (Q3557009) (← links)
- Extended Islands of Tractability for Parsimony Haplotyping (Q3575249) (← links)
- Kernelization and Complexity Results for Connectivity Augmentation Problems (Q3603551) (← links)
- A More Effective Linear Kernelization for Cluster Editing (Q3611894) (← links)
- Fixed-Parameter Algorithms for Graph-Modeled Date Clustering (Q3630188) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing (Q3638452) (← links)
- Editing Graphs into Disjoint Unions of Dense Clusters (Q3652245) (← links)
- What Makes Equitable Connected Partition Easy (Q3656856) (← links)
- (Q4415254) (← links)
- (Q4437501) (← links)
- How Hard Is Bribery with Distance Restrictions (Q4576183) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- (Q4737693) (← links)
- Kernelization and Parameterized Complexity of Star Editing and Union Editing (Q4909529) (← links)
- Covering Tree with Stars (Q4925253) (← links)
- An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs (Q4925270) (← links)
- Local Search for String Problems: Brute Force Is Essentially Optimal (Q4928567) (← links)
- A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem (Q5088892) (← links)
- (Q5140777) (← links)
- Compactness-Preserving Mapping on Trees (Q5165602) (← links)
- Data Reduction, Exact, and Heuristic Algorithms for Clique Cover (Q5233468) (← links)
- (Q5283001) (← links)
- Parameterized and Exact Computation (Q5311509) (← links)
- Graph-Based Data Clustering with Overlaps (Q5323099) (← links)
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs (Q5387826) (← links)
