The following pages link to Jiong Guo (Q249098):
Displaying 50 items.
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- Algorithms for parameterized maximum agreement forest problem on multiple trees (Q744101) (← links)
- Graph-modeled data clustering: Exact algorithms for clique generation (Q814914) (← links)
- Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- A more effective linear kernelization for cluster editing (Q1006044) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- A new approximation algorithm for the maximum stacking base pairs problem from RNA secondary structures prediction (Q1699765) (← links)
- On the complexity of bribery with distance restrictions (Q1713407) (← links)
- Automated generation of search tree algorithms for hard graphs modification problems (Q1882409) (← links)
- Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Sorting a permutation by best short swaps (Q2037101) (← links)
- Constrained stable marriage with free edges or few blocking pairs (Q2150572) (← links)
- A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
- Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
- Covering tree with stars (Q2354301) (← links)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
- Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction (Q2412438) (← links)
- Parameterized intractability of distinguishing substring selection (Q2432546) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Parameterized complexity of Vertex Cover variants (Q2464318) (← links)
- Error compensation in leaf power problems (Q2498407) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Neighborhood-Preserving Mapping between Trees (Q2842180) (← links)
- Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
