Jiong Guo

From MaRDI portal
Person:249098

Available identifiers

zbMath Open guo.jiongWikidataQ123966022 ScholiaQ123966022MaRDI QIDQ249098

List of research outcomes

PublicationDate of PublicationType
New approximation algorithms for RNA secondary structures prediction problems by local search2024-02-09Paper
Possible and necessary winner problems in iterative elections with multiple rules2023-08-03Paper
Colorful graph coloring2023-08-03Paper
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem2022-07-18Paper
Constrained stable marriage with free edges or few blocking pairs2022-06-29Paper
Sorting a permutation by best short swaps2021-06-30Paper
https://portal.mardi4nfdi.de/entity/Q51407772020-12-16Paper
Data Reduction, Exact, and Heuristic Algorithms for Clique Cover2019-09-11Paper
Parameterized complexity of voter control in multi-peaked elections2019-09-05Paper
Kernelization of Two Path Searching Problems on Split Graphs2019-04-26Paper
On the complexity of bribery with distance restrictions2019-01-25Paper
How Hard Is Bribery with Distance Restrictions2018-07-12Paper
On the kernelization of split graph problems2018-06-05Paper
A new approximation algorithm for the maximum stacking base pairs problem from RNA secondary structures prediction2018-02-26Paper
Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction2017-10-23Paper
The control complexity of \(r\)-Approval: from the single-peaked case to the general case2017-09-07Paper
https://portal.mardi4nfdi.de/entity/Q52830012017-07-18Paper
Possible winner problems on partial tournaments: a parameterized study2017-06-22Paper
Exact algorithms for weighted and unweighted Borda manipulation problems2016-02-26Paper
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems2015-09-24Paper
Pattern matching for arc-annotated sequences2015-09-02Paper
Parameterized complexity of control and bribery for \(d\)-approval elections2015-07-24Paper
Covering tree with stars2015-07-10Paper
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs2015-07-10Paper
A quadratic vertex kernel for feedback arc set in bipartite tournaments2015-03-02Paper
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs2015-01-15Paper
Algorithms for parameterized maximum agreement forest problem on multiple trees2014-10-06Paper
Complexity of Dense Bicluster Editing Problems2014-09-26Paper
Parameterized Complexity of Edge Interdiction Problems2014-09-26Paper
On Star-Cover and Path-Cover of a Tree2014-09-02Paper
Compactness-Preserving Mapping on Trees2014-06-30Paper
On the parameterized complexity of consensus clustering2014-06-23Paper
Data reduction and exact algorithms for clique cover2014-04-01Paper
Local search for string problems: brute-force is essentially optimal2014-03-13Paper
https://portal.mardi4nfdi.de/entity/Q53983992014-02-27Paper
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs2014-02-18Paper
Parameterized complexity of max-lifetime target coverage in wireless sensor networks2014-01-13Paper
Improved linear problem kernel for planar connected dominating set2014-01-13Paper
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks2013-12-19Paper
Possible Winner Problems on Partial Tournaments: A Parameterized Study2013-12-17Paper
Parameterized Complexity of Control and Bribery for d-Approval Elections2013-12-10Paper
The parameterized complexity of local search for TSP, more refined2013-11-11Paper
Neighborhood-Preserving Mapping between Trees2013-08-12Paper
Planar graph vertex partition for linear problem kernels2013-07-24Paper
Local Search for String Problems: Brute Force Is Essentially Optimal2013-06-14Paper
Covering Tree with Stars2013-06-11Paper
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs2013-06-11Paper
Kernelization and Parameterized Complexity of Star Editing and Union Editing2013-03-21Paper
Complexity and parameterized algorithms for cograph editing2012-11-27Paper
Graph-based data clustering with overlaps2012-10-16Paper
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments2012-09-25Paper
Safe Approximation and Its Relation to Kernelization2012-06-15Paper
A Generalization of Nemhauser and Trotter's Local Optimization Theorem.2012-04-24Paper
A generalization of Nemhauser and Trotter's local optimization theorem2012-01-11Paper
The Parameterized Complexity of Local Search for TSP, More Refined2011-12-16Paper
On the Parameterized Complexity of Consensus Clustering2011-12-16Paper
Editing graphs into disjoint unions of dense clusters2011-12-14Paper
Parameterized Complexity of Arc-Weighted Directed Steiner Problems2011-10-27Paper
Cograph Editing: Complexity and Parameterized Algorithms2011-08-17Paper
Linear Problem Kernels for Planar Graph Problems with Small Distance Property2011-08-17Paper
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing2011-07-18Paper
An Improved Kernel for Planar Connected Dominating Set2011-07-01Paper
The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View2011-06-03Paper
Average parameterization and partial kernelization for computing medians2011-04-28Paper
Fixed-parameter tractability results for full-degree spanning tree and its dual2010-11-24Paper
Kernelization and complexity results for connectivity augmentation problems2010-11-24Paper
The parameterized complexity of some minimum label problems2010-10-07Paper
Extended Islands of Tractability for Parsimony Haplotyping2010-07-26Paper
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems2010-05-25Paper
Average Parameterization and Partial Kernelization for Computing Medians2010-04-27Paper
Fundamentals of Computation Theory2010-04-20Paper
Two fixed-parameter algorithms for vertex covering by paths on trees2010-04-19Paper
Algorithms - ESA 20032010-03-03Paper
Fixed-parameter tractability results for feedback set problems in tournaments2010-02-26Paper
Parameterized computational complexity of Dodgson and Young elections2010-02-26Paper
Feedback arc set in bipartite tournaments is NP-complete2010-01-29Paper
The Parameterized Complexity of Some Minimum Label Problems2010-01-21Paper
What Makes Equitable Connected Partition Easy2010-01-14Paper
A fixed-parameter tractability result for multicommodity demand flow in trees2009-12-18Paper
Parameterized Complexity of Arc-Weighted Directed Steiner Problems2009-12-17Paper
Editing Graphs into Disjoint Unions of Dense Clusters2009-12-17Paper
Fixed-parameter algorithms for Kemeny rankings2009-11-04Paper
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems2009-10-16Paper
Graph-Based Data Clustering with Overlaps2009-07-23Paper
Iterative Compression for Exactly Solving NP-Hard Minimization Problems2009-07-09Paper
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing2009-07-02Paper
SOFSEM 2004: Theory and Practice of Computer Science2009-06-04Paper
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering2009-06-03Paper
Algorithms for compact letter displays: comparison and evaluation2009-06-02Paper
Red-blue covering problems and the consecutive ones property2009-05-13Paper
A more effective linear kernelization for cluster editing2009-03-17Paper
Closest 4-leaf power is fixed-parameter tractable2009-03-04Paper
A More Effective Linear Kernelization for Cluster Editing2009-03-03Paper
Kernelization and Complexity Results for Connectivity Augmentation Problems2009-02-17Paper
Improved algorithms and complexity results for power domination in graphs2008-12-02Paper
Parameterized Computational Complexity of Dodgson and Young Elections2008-07-15Paper
Fixed-Parameter Algorithms for Kemeny Scores2008-07-10Paper
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual2008-06-03Paper
Improved Algorithms for Bicluster Editing2008-05-27Paper
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs2008-05-27Paper
Probe Matrix Problems: Totally Balanced Matrices2008-01-04Paper
Parameterized complexity of Vertex Cover variants2007-12-19Paper
Linear Problem Kernels for NP-Hard Problems on Planar Graphs2007-11-28Paper
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs2007-11-23Paper
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems2007-11-13Paper
Minimum Membership Set Covering and the Consecutive Ones Property2007-09-07Paper
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments2007-05-02Paper
Exact algorithms and applications for tree-like Weighted Set Cover2007-02-14Paper
THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS2007-02-08Paper
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization2006-12-07Paper
SOFSEM 2006: Theory and Practice of Computer Science2006-11-14Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
Algorithms and Data Structures2006-10-25Paper
Algorithms and Data Structures2006-10-25Paper
Parameterized intractability of distinguishing substring selection2006-10-25Paper
Fundamentals of Computation Theory2006-10-20Paper
Error compensation in leaf power problems2006-08-16Paper
Graph-modeled data clustering: Exact algorithms for clique generation2006-02-08Paper
Fixed-parameter tractability and data reduction for multicut in trees2006-01-23Paper
Computing and Combinatorics2006-01-11Paper
Algorithms and Computation2005-12-22Paper
Parameterized and Exact Computation2005-08-23Paper
Computing the similarity of two sequences with nested arc annotations2004-10-27Paper
Automated generation of search tree algorithms for hard graphs modification problems2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q47376932004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44375012003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44152542003-07-28Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jiong Guo