Yichao Chen

This page is a disambiguation page, it actually contains multiple papers from persons of the same or a similar name.

Bibliography

2026
Erratum to "The thickness of amalgamations and Cartesian product of graphs" [Discuss. Math. Graph Theory 37(2017) 561-572].
Discuss. Math. Graph Theory, 2026

Pre-signed graphs: A reformulation of signed graphs and their embeddings.
Adv. Appl. Math., 2026

2025
One Walk is All You Need: Data-Efficient 3D RF Scene Reconstruction with Human Movements.
CoRR, November, 2025

Sensing Metal Coil Vibration of Headsets for Eavesdropping on Online Conversations With Out-of-Vocabulary Words Using RFID.
IEEE Trans. Mob. Comput., August, 2025

On Stahl's conjectures about the region distributions of bouquets.
J. Graph Theory, 2025

DP-DTG: Dynamic Gradient Updating-Based Differentially Privacy Preservation Mechanism for Distributed Services.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2025

DP-GNN-P: Graph Partitioning-Based Differential Privacy Preservation Mechanism for Service-Oriented Distributed Graph Neural Network Computing.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2025

2024
Improving Physical Layer Security for multi-UAV Systems Against Hybrid Wireless Attacks.
IEEE Trans. Veh. Technol., May, 2024

New bounds for the average genus and average number of faces of a simple graph.
Discret. Math., January, 2024

Enhancing Vaxign-DL for Vaccine Candidate Prediction with Added ESM-Generated Features.
Proceedings of the Advances in Conceptual Modeling, 2024

2023
Forward-looking omnidirectional infrared pedestrian detection for driver assistance.
Multim. Tools Appl., December, 2023

A Comprehensive Physical Layer Security Mechanism for Mobile Edge Computing.
IEEE Internet Things J., October, 2023

Dual multi-objective optimisation of the cane milling process.
Comput. Ind. Eng., May, 2023

AMRank: An adversarial Markov ranking model combining short- and long-term returns.
Expert Syst. Appl., 2023

2022
Blockchain-based multi-skill mobile crowdsourcing services.
EURASIP J. Wirel. Commun. Netw., 2022

Parallel edges in ribbon graphs and interpolating behavior of partial-duality polynomials.
Eur. J. Comb., 2022

A character approach to directed genus distribution of graphs: The bipartite single-black-vertex case.
Discret. Math., 2022

Incentive Mechanism for Secure Mobile Edge Computing under Managed Eavesdropping Risk.
Proceedings of the 10th IEEE International Conference on Smart City and Informatization, 2022

2021
Deep Learning for Principal-Agent Mean Field Games.
CoRR, 2021

The average genus for bouquets of circles and dipoles.
Ars Math. Contemp., 2021

Limits for embedding distributions.
Adv. Appl. Math., 2021

2020
Value of CT and three-dimensional reconstruction revealing specific radiological signs for screening causative high jugular bulb in patients with Meniere's disease.
BMC Medical Imaging, 2020

Multi-Modal Image Fusion via Sparse Representation and Multi-Scale Anisotropic Guided Measure.
IEEE Access, 2020

2019
A bootstrap-based KPSS test for functional time series.
J. Multivar. Anal., 2019

Infrared dim target detection method based on the fuzzy accurate updating symmetric adaptive resonance theory.
J. Vis. Commun. Image Represent., 2019

Constructing a minimum genus embedding of the complete tripartite graph Kn, n, 1 for odd n.
Discret. Math., 2019

Remarks on the joins of 1-planar graphs.
Appl. Math. Comput., 2019

A Pricing Strategy for D2D Communication from a Prospect Theory Perspective.
Proceedings of the 89th IEEE Vehicular Technology Conference, 2019

2018
An Efficient Incentive Mechanism for Device-to-Device Multicast Communication in Cellular Networks.
IEEE Trans. Wirel. Commun., 2018

An Euler-genus approach to the calculation of the crosscap-number polynomial.
J. Graph Theory, 2018

On the genus distributions of wheels and of related graphs.
Discret. Math., 2018

A note on the thickness of some complete bipartite graphs.
Ars Math. Contemp., 2018

2017
Promoting Device-to-Device Communication in Cellular Networks by Contract-based Incentive Mechanisms.
IEEE Netw., 2017

The thickness of the complete multipartite graphs and the join of graphs.
J. Comb. Optim., 2017

The thickness of amalgamations and Cartesian product of graphs.
Discuss. Math. Graph Theory, 2017

Recursive formulas for embedding distributions of cubic outerplanar graphs.
Australas. J Comb., 2017

Joint optimization of transmission and processing delay in fog computing access networks.
Proceedings of the 9th International Conference on Advanced Infocomm Technology, 2017

2015
Optimal user-centric relay assisted device-to-device communications: an auction approach.
IET Commun., 2015

2014
Enumeration of digraph embeddings.
Eur. J. Comb., 2014

3-Connected Simple Graphs With The Same Genus Distributions.
Ars Comb., 2014

2013
Total Embedding Distributions of Circular Ladders.
J. Graph Theory, 2013

On The Average Crosscap Number Of A Graph.
Ars Comb., 2013

2012
Embedding Distributions and Chebyshev Polynomials.
Graphs Comb., 2012

Genus distributions of star-ladders.
Discret. Math., 2012

Polyhedral Embeddings of Snarks with Arbitrary Nonorientable Genera.
Electron. J. Comb., 2012

2011
Total embedding distributions of Ringel ladders.
Discret. Math., 2011

2010
Lower Bounds for the Average Genus of a CF-graph.
Electron. J. Comb., 2010

A note on the neighbor condition for up-embeddability of graphs.
Ars Comb., 2010

2007
Up-Embeddability of a Graph by Order and Girth.
Graphs Comb., 2007

2006
Maximum genus, Girth and Maximum non-adjacent edge set.
Ars Comb., 2006


  Loading...