The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jiong Guo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
    Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:320-331 [Conf]
  2. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:108-119 [Conf]
  3. Michael Dom, Jiong Guo, Rolf Niedermeier
    Bounded Degree Closest k-Tree Power Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:757-766 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:99-114 [Conf]
  5. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Automated Generation of Search Tree Algorithms for Graph Modification Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:642-653 [Conf]
  6. Jens Gramm, Jiong Guo, Rolf Niedermeier
    On Exact and Approximation Algorithms for Distinguishing Substring Selection. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:195-209 [Conf]
  7. Jiong Guo, Rolf Niedermeier, Daniel Raible
    Improved Algorithms and Complexity Results for Power Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:172-184 [Conf]
  8. Jens Gramm, Jiong Guo, Rolf Niedermeier
    Pattern Matching for Arc-Annotated Sequences. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:182-193 [Conf]
  9. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Error Compensation in Leaf Root Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:389-401 [Conf]
  10. Jiong Guo, Falk Hüffner, Rolf Niedermeier
    A Structural View on Parameterizing Problems: Distance from Triviality. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:162-173 [Conf]
  11. Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:203-214 [Conf]
  12. Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann
    Complexity and Exact Algorithms for Multicut. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:303-312 [Conf]
  13. Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
    Avoiding Forbidden Submatrices by Row Deletions. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2004, pp:349-360 [Conf]
  14. Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    Minimum Membership Set Covering and the Consecutive Ones Property. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:339-350 [Conf]
  15. Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
    Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:158-168 [Conf]
  16. Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    Parameterized Complexity of Generalized Vertex Cover Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:36-48 [Conf]
  17. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Extending the Tractability Border for Closest Leaf Powers. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:397-408 [Conf]
  18. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Error Compensation in Leaf Power Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:4, pp:363-381 [Journal]
  19. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:4, pp:321-347 [Journal]
  20. Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
    The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1467-1484 [Journal]
  21. Jiong Guo, Rolf Niedermeier
    A fixed-parameter tractability result for multicommodity demand flow in trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:3, pp:109-114 [Journal]
  22. Jiong Guo, Falk Hüffner, Hannes Moser
    Feedback arc set in bipartite tournaments is NP-complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:2-3, pp:62-65 [Journal]
  23. Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
    Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1386-1396 [Journal]
  24. Jiong Guo, Rolf Niedermeier
    Exact algorithms and applications for Tree-like Weighted Set Cover. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:608-622 [Journal]
  25. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:4, pp:373-392 [Journal]
  26. Jens Gramm, Jiong Guo, Rolf Niedermeier
    Parameterized Intractability of Distinguishing Substring Selection. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:4, pp:545-560 [Journal]
  27. Jiong Guo, Rolf Niedermeier
    Fixed-parameter tractability and data reduction for multicut in trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:46, n:3, pp:124-135 [Journal]
  28. Jens Gramm, Jiong Guo, Rolf Niedermeier
    Pattern matching for arc-annotated sequences. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:44-65 [Journal]
  29. Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
    Computing the similarity of two sequences with nested arc annotations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:337-358 [Journal]
  30. David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier
    Probe Matrix Problems: Totally Balanced Matrices. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:368-377 [Conf]
  31. Jiong Guo, Rolf Niedermeier
    Linear Problem Kernels for NP-Hard Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:375-386 [Conf]
  32. Michael Dom, Jiong Guo, Rolf Niedermeier
    Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:680-691 [Conf]
  33. Jiong Guo, Johannes Uhlmann
    Kernelization and Complexity Results for Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:483-494 [Conf]
  34. Jiong Guo
    A More Effective Linear Kernelization for Cluster Editing. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:36-47 [Conf]

  35. Exact Algorithms and Experiments for Hierarchical Tree Clustering. [Citation Graph (, )][DBLP]


  36. Fixed-Parameter Algorithms for Kemeny Scores. [Citation Graph (, )][DBLP]


  37. A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. [Citation Graph (, )][DBLP]


  38. How similarity helps to efficiently compute Kemeny rankings. [Citation Graph (, )][DBLP]


  39. Graph-Based Data Clustering with Overlaps. [Citation Graph (, )][DBLP]


  40. Extended Islands of Tractability for Parsimony Haplotyping. [Citation Graph (, )][DBLP]


  41. Iterative Compression for Exactly Solving NP-Hard Minimization Problems. [Citation Graph (, )][DBLP]


  42. Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. [Citation Graph (, )][DBLP]


  43. Editing Graphs into Disjoint Unions of Dense Clusters. [Citation Graph (, )][DBLP]


  44. Parameterized Complexity of Arc-Weighted Directed Steiner Problems. [Citation Graph (, )][DBLP]


  45. What Makes Equitable Connected Partition Easy. [Citation Graph (, )][DBLP]


  46. Average Parameterization and Partial Kernelization for Computing Medians. [Citation Graph (, )][DBLP]


  47. A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. [Citation Graph (, )][DBLP]


  48. A Generalization of Nemhauser and Trotter's Local Optimization Theorem. [Citation Graph (, )][DBLP]


  49. Parameterized Computational Complexity of Dodgson and Young Elections. [Citation Graph (, )][DBLP]


  50. Fixed-Parameter Algorithms for Graph-Modeled Date Clustering. [Citation Graph (, )][DBLP]


  51. Improved Algorithms for Bicluster Editing. [Citation Graph (, )][DBLP]


  52. The Parameterized Complexity of Some Minimum Label Problems. [Citation Graph (, )][DBLP]


  53. Improved Algorithms and Complexity Results for Power Domination in Graphs. [Citation Graph (, )][DBLP]


  54. A Generalization of Nemhauser and Trotter's Local Optimization Theorem [Citation Graph (, )][DBLP]


  55. Closest 4-leaf power is fixed-parameter tractable. [Citation Graph (, )][DBLP]


Search in 0.043secs, Finished in 0.045secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002