World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
4924
World Ranking
10893
National Ranking
1350

Overview

Jiong Guo is affiliated with Shandong University in China and has contributed to research across multiple disciplines, primarily in Computer Science and Engineering. Their work spans several specialized subfields, including Computational Theory and Mathematics, Economics and Econometrics, Molecular Biology, Aerospace Engineering, and Computational Mechanics.

Their research topics notably cover areas such as Game Theory and Voting Systems, Advanced Graph Theory Research, Complexity and Algorithms in Graphs, Computational Geometry and Mesh Generation, Auction Theory and Applications, Nuclear Reactor Physics and Engineering, and Advanced Numerical Analysis Techniques.

Recent publications by Jiong Guo include:

  • "Incorporation of anisotropic scattering into Fourier moment expanded axial DGFEM SN based 2D/1D coupling method" (2023, Annals of Nuclear Energy)
  • "Sorting a Permutation by Best Short Swaps" (2021, Algorithmica)
  • "PCO: Precision-Controllable Offset Surfaces with Sharp Features" (2024, ACM Transactions on Graphics)
  • "Innovation and Reform on Technology Empowered Education: The 24th Global Chinese Conference on Computers in Education" (2020, TechTrends)
  • "Constrained Stable Marriage with Free Edges or Few Blocking Pairs" (2022, SSRN Electronic Journal)

Guo frequently collaborates with the following co-authors:

  • Aizhong Zhou
  • Yinghui Wen
  • Fengbo Wang
  • Fu Li
  • Shuangmin Chen

The publication venues where Jiong Guo's work appears regularly include:

  • SSRN Electronic Journal
  • arXiv (Cornell University)
  • Annals of Nuclear Energy
  • ACM Transactions on Graphics
  • Algorithmica

Best Publications

  • Invitation to data reduction and problem kernelization

    Jiong Guo;Rolf Niedermeier

  • Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

    Jiong Guo;Jens Gramm;Falk Hüffner;Rolf Niedermeier

  • Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

    Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier

  • Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

    Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier

  • A more effective linear kernelization for cluster editing

    Jiong Guo

  • A structural view on parameterizing problems: Distance from triviality

    Jiong Guo;Falk Hüffner;Rolf Niedermeier

  • Improved Algorithms and Complexity Results for Power Domination in Graphs

    Jiong Guo;Rolf Niedermeier;Daniel Raible

  • Data reduction and exact algorithms for clique cover

    Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier

  • Graph-based data clustering with overlaps

    Michael R. Fellows;Jiong Guo;Christian Komusiewicz;Rolf Niedermeier

  • Parameterized Complexity of Vertex Cover Variants

    Jiong Guo;Rolf Niedermeier;Sebastian Wernicke

  • Graph-modeled data clustering: fixed-parameter algorithms for clique generation

    Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier

  • Fixed-parameter algorithms for Kemeny rankings

    Nadja Betzler;Michael R. Fellows;Jiong Guo;Rolf Niedermeier

  • Linear problem kernels for NP-hard problems on planar graphs

    Jiong Guo;Rolf Niedermeier

  • Parameterized complexity of generalized vertex cover problems

    Jiong Guo;Rolf Niedermeier;Sebastian Wernicke

  • Bi-Force: large-scale bicluster editing and its application to gene expression data biclustering

    Peng Sun;Nora K Speicher;Richard Röttger;Richard Röttger;Jiong Guo

  • Problem kernels for NP-complete edge deletion problems: split and related graphs

    Jiong Guo

  • Data reduction, exact, and heuristic algorithms for clique cover

    Jens Gramm;Jiong Guo;Falk Hüffner;Rolf Niedermeier

  • Parameterized computational complexity of Dodgson and Young elections

    Nadja Betzler;Jiong Guo;Rolf Niedermeier

  • Complexity and parameterized algorithms for Cograph Editing

    Yunlong Liu;Jianxin Wang;Jiong Guo;Jianer Chen

  • Fixed-parameter tractability results for feedback set problems in tournaments

    Michael Dom;Jiong Guo;Falk Hüffner;Rolf Niedermeier

  • Fixed-parameter tractability results for feedback set problems in tournaments

    Michael Dom;Jiong Guo;Falk Hüffner;Rolf Niedermeier

  • A generalization of Nemhauser and Trotter's local optimization theorem

    Michael R. Fellows;Jiong Guo;Hannes Moser;Rolf Niedermeier

Frequent Co-Authors

Rolf Niedermeier
Rolf Niedermeier Technical University of Berlin
Michael R. Fellows
Michael R. Fellows Lebanese American University
Jan Baumbach
Jan Baumbach Universität Hamburg
Jianer Chen
Jianer Chen Texas A&M University
Jianxin Wang
Jianxin Wang Central South University
Frances A. Rosamond
Frances A. Rosamond University of Bergen
Piotr Faliszewski
Piotr Faliszewski AGH University of Science and Technology
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Hans-Peter Piepho
Hans-Peter Piepho University of Hohenheim

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you're exploring Computer Science study options in the USA, online programs offer flexibility and affordability with pathways for every stage of your academic journey. Students looking for a fast route to advanced qualifications may want to consider quickest masters degree online programs, which let you earn a graduate credential in a fraction of the usual time.

Selecting the right degree is crucial for career growth. Some masters degrees that are worth it are specifically geared towards fields with strong hiring prospects and higher salaries, such as data science and cybersecurity.

If you're just getting started, an online associate degree in Computer Science can provide foundational skills and open entry-level job opportunities. For those concerned about costs, there are also cheap online degrees fast that let you minimize expenses while advancing your education.

Whether you're aiming for a quick credential, a valuable master’s, or beginning with an associate degree, online study offers a flexible path toward a rewarding tech career.

Best Scientists Citing Jiong Guo

Trending Scientists