Qingying Deng

Orcid: 0000-0003-3931-435X

According to our database1, Qingying Deng authored at least 18 papers between 2007 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Test-Time Adaptation for Non-stationary Time Series: From Synthetic Regime Shifts to Financial Markets.
CoRR, February, 2026

Proof of a conjecture of Fomichev and Karev.
Eur. J. Comb., 2026

Introducing a vertex polynomial invariant for embedded graphs.
Discret. Math., 2026

2025
Hamiltonian properties of hybrid-faulty burnt pancake graphs.
Int. J. Parallel Emergent Distributed Syst., November, 2025

Subnetwork reliability analysis about complete-transposition graph networks.
Theor. Comput. Sci., 2025

2024
Restricted arc-connectivity of unidirectional star graphs.
Discret. Appl. Math., March, 2024

Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network.
Theor. Comput. Sci., January, 2024

Structure connectivity and substructure connectivity of Möbius cubes.
Comput. J., 2024

2023
Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges.
Discret. Appl. Math., July, 2023

Non-cooperative game algorithms for computation offloading in mobile edge computing environments.
J. Parallel Distributed Comput., February, 2023

Fault-Tolerant Strongly Hamiltonian Laceability and Hyper-Hamiltonian Laceability of Cayley Graphs Generated by Transposition Trees.
Comput. J., February, 2023

Constructions of DNA and polypeptide cages based on plane graphs and odd crossing π-junctions.
Appl. Math. Comput., 2023

2020
Characterizations of bipartite and Eulerian partial duals of ribbon graphs.
Discret. Math., 2020

2019
Distributed Deep Learning Model for Intelligent Video Surveillance Systems with Edge Computing.
CoRR, 2019

2018
Even Subgraph Expansions for the Flow Polynomial of Planar Graphs with Maximum Degree at Most 4.
Electron. J. Comb., 2018

2007
A Parallel Infrastructure on Dynamic EPIC SMT and Its Speculation Optimization.
Proceedings of the Parallel and Distributed Processing and Applications, 2007

Register File Management and Compiler Optimization on EDSMT.
Proceedings of the Frontiers of High Performance Computing and Networking ISPA 2007 Workshops, 2007

A Parallel Infrastructure on Dynamic EPIC SMT.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2007


  Loading...