Hongliang Lu

Orcid: 0000-0003-4447-2416

According to our database1, Hongliang Lu authored at least 88 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
ATT-TA: A Cooperative Multiagent Deep Reinforcement Learning Approach for TSV Assignment in 3-D ICs.
IEEE Trans. Very Large Scale Integr. Syst., December, 2023

Thermal-Aware Fixed-Outline 3-D IC Floorplanning: An End-to-End Learning-Based Approach.
IEEE Trans. Very Large Scale Integr. Syst., December, 2023

A Novel Thermal-Aware Floorplanning and TSV Assignment With Game Theory for Fixed-Outline 3-D ICs.
IEEE Trans. Very Large Scale Integr. Syst., November, 2023

Increased interbrain synchronization and neural efficiency of the frontal cortex to enhance human coordinative behavior: A combined hyper-tES and fNIRS study.
NeuroImage, November, 2023

Improved bound on vertex degree version of Erdős matching conjecture.
J. Graph Theory, November, 2023

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs.
J. Comb. Theory, Ser. B, November, 2023

Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs.
SIAM J. Discret. Math., September, 2023

On Critical Difference, Independence Number and Matching Number of Graphs.
Graphs Comb., August, 2023

Toughness, hamiltonicity and spectral radius in graphs.
Eur. J. Comb., May, 2023

A better bound on the size of rainbow matchings.
J. Comb. Theory, Ser. A, April, 2023

Adaptive Hypergraph Regularized Multilayer Sparse Tensor Factorization for Hyperspectral Unmixing.
IEEE Trans. Geosci. Remote. Sens., 2023

A Probabilistic Sample Boosting Approach With Adaptive Representation Coefficient Consistency for China Coastal Wetland Land Cover Classification Using GF-5 Hyperspectral Imagery.
IEEE Trans. Geosci. Remote. Sens., 2023

Scalable modeling of grounded coplanar waveguide for MMICs design using neural network with an effective sampling strategy.
Microelectron. J., 2023

BEVGPT: Generative Pre-trained Large Model for Autonomous Driving Prediction, Decision-Making, and Planning.
CoRR, 2023

FollowNet: A Comprehensive Benchmark for Car-Following Behavior Modeling.
CoRR, 2023

Design and Optimization of Ternary Inverter using Face Tunnel Field-Effect Transistor.
Proceedings of the 15th IEEE International Conference on ASIC, 2023

2022
A Stability Result on Matchings in 3-Uniform Hypergraphs.
SIAM J. Discret. Math., September, 2022

Self-Balancing Dictionary Learning for Relaxed Collaborative Representation of Hyperspectral Image Classification.
IEEE Trans. Geosci. Remote. Sens., 2022

Diversity-Driven Multikernel Collaborative Representation Ensemble for Hyperspectral Image Classification.
IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2022

Weighted Residual Dynamic Ensemble Learning for Hyperspectral Image Classification.
IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2022

Dynamic Ensemble Learning With Multi-View Kernel Collaborative Subspace Clustering for Hyperspectral Image Classification.
IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2022

Rainbow Perfect Matchings for 4-Uniform Hypergraphs.
SIAM J. Discret. Math., 2022

A Novel Phase Compensation Method for Urban 3D Reconstruction Using SAR Tomography.
Remote. Sens., 2022

Temperature-dependent DC and small signal performance of InGaAs/InP DHBT.
Microelectron. J., 2022

An augmented small-signal model of InP HBT with its analytical-based parameter extraction technique.
Microelectron. J., 2022

A Modified Capon Method for SAR Tomography Over Forest.
IEEE Geosci. Remote. Sens. Lett., 2022

A 20MHz 4A gate driver with 5.5 to 24V output drive voltage for wide bandgap FETs.
IEICE Electron. Express, 2022

A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings.
Graphs Comb., 2022

Stability on Matchings in 3-Uniform Hypergraphs.
Graphs Comb., 2022

Spectral radius and [<i>a</i>, <i>b</i>]-factors in graphs.
Discret. Math., 2022

Critical independent sets of König-Egerváry graphs.
Discret. Appl. Math., 2022

Regular graphs with equal matching number and independence number.
Discret. Appl. Math., 2022

2021
Nearly Perfect Matchings in Uniform Hypergraphs.
SIAM J. Discret. Math., 2021

A Novel False Alarm Suppression Method for CNN-Based SAR Ship Detector.
IEEE Geosci. Remote. Sens. Lett., 2021

Rainbow matchings for 3-uniform hypergraphs.
J. Comb. Theory, Ser. A, 2021

A Characterization for Graphs Having Strong Parity Factors.
Graphs Comb., 2021

On the complexity of all (g, f)-factors problem.
Discret. Math., 2021

A Co-Optimization Method of Actuators/Sensors Placement and LQG Controller for Vibration Suppression.
IEEE Access, 2021

2020
Building 3-D Reconstruction With a Small Data Stack Using SAR Tomography.
IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2020

An Ore-type condition for large k -factor and disjoint perfect matchings.
J. Graph Theory, 2020

Antifactors of regular bipartite graphs.
Discret. Math. Theor. Comput. Sci., 2020

Characterization of 1-tough graphs using factors.
Discret. Math., 2020

2019
Corrigendum to "A Distributed Relation Detection Approach in the Internet of Things".
Mob. Inf. Syst., 2019

Minimum codegree condition for perfect matchings in k-partite k-graphs.
J. Graph Theory, 2019

H-Decomposition of r-Graphs when H is an r-Graph with Exactly k Independent Edges.
Graphs Comb., 2019

Binding Number, Toughness and General Matching Extendability in Graphs.
Discret. Math. Theor. Comput. Sci., 2019

Characterizations of graphs G having all [1, k]-factors in kG.
Discret. Math., 2019

Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs.
Electron. J. Comb., 2019

SAR Tomographic Imaging Demonstration Using GF-3 Data.
Proceedings of the 2019 IEEE International Geoscience and Remote Sensing Symposium, 2019

2018
On Rainbow Matchings for Hypergraphs.
SIAM J. Discret. Math., 2018

Almost Perfect Matchings in k-Partite k-Graphs.
SIAM J. Discret. Math., 2018

Disjoint perfect matchings in 3-uniform hypergraphs.
J. Graph Theory, 2018

A degree condition for a graph to have (a, b)-parity factors.
Discret. Math., 2018

A Physically Unclonable Function with BER < 0.35% for Secure Chip Authentication Using Write Speed Variation of RRAM.
Proceedings of the 48th European Solid-State Device Research Conference, 2018

2017
A Tutte-Type Characterization for Graph Factors.
SIAM J. Discret. Math., 2017

Improved analytical model of surface potential with modified boundary conditions for double gate tunnel FETs.
Microelectron. Reliab., 2017

A Distributed Relation Detection Approach in the Internet of Things.
Mob. Inf. Syst., 2017

Note on matchings in 3-partite 3-uniform hypergraphs.
Discret. Math., 2017

On the number of disjoint perfect matchings of regular graphs with given edge connectivity.
Discret. Math., 2017

2016
An Extension of Cui-Kano's Characterization on Graph Factors.
J. Graph Theory, 2016

A <i>Ku</i>-Band Low-Phase-Noise Cross-Coupled VCO in GaAs HBT Technology.
J. Circuits Syst. Comput., 2016

Generalization of Matching Extensions in Graphs (IV): Closures.
Graphs Comb., 2016

Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights.
Discret. Math. Theor. Comput. Sci., 2016

A Cluster Based Approach for Task Scheduling across Multiple Programming Systems.
Proceedings of the 15th International Symposium on Parallel and Distributed Computing, 2016

2015
Maximizing Information Diffusion in the Cyber-physical Integrated Network.
Sensors, 2015

Maximum spectral radius of graphs with given connectivity, minimum degree and independence number.
J. Discrete Algorithms, 2015

DMRUT-MCDS: Discovery relationships in the cyber-physical integrated network.
J. Commun. Networks, 2015

Maximizing the information diffusion opportunity in the cyber-physical network.
Proceedings of the 11th International Conference on Heterogeneous Networking for Quality, 2015

MatrixMap: Programming Abstraction and Implementation of Matrix Computation for Big Data Applications.
Proceedings of the 21st IEEE International Conference on Parallel and Distributed Systems, 2015

2014
On Perfect k-Matchings.
Graphs Comb., 2014

Surface embedding of (n, k)-extendable graphs.
Discret. Appl. Math., 2014

Distributed Relation Discovery in Internet of Things.
Proceedings of the International Conference on Cloud Computing and Big Data, 2014

2013
On the Existence of General Factors in Regular Graphs.
SIAM J. Discret. Math., 2013

On Cui-Kano's Characterization Problem on Graph Factors.
J. Graph Theory, 2013

PTAS for the minimum k-path connected vertex cover problem in unit disk graphs.
J. Glob. Optim., 2013

On Superconnectivity of (4, g)-Cages.
Graphs Comb., 2013

Note on parity factors of regular graphs.
Electron. J. Graph Theory Appl., 2013

Simplified existence theorems on all fractional [<i>a</i>, <i>b</i>][a, b]-factors.
Discret. Appl. Math., 2013

Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
Regular Graphs, Eigenvalues and Regular Factors.
J. Graph Theory, 2012

How to Dynamically Protect Data in Mobile Cloud Computing?
Proceedings of the Pervasive Computing and the Networked World, 2012

2011
Vertex-coloring 2-edge-weighting of graphs.
Eur. J. Comb., 2011

Vertex-deleted subgraphs and regular factors from regular graph.
Discret. Math., 2011

Generalization of matching extensions in graphs (III).
Discret. Appl. Math., 2011

General fractional f-factor numbers of graphs.
Appl. Math. Lett., 2011

2010
On superconnectivity of (4, <i>g</i>)-cages with even girth.
Networks, 2010

Regular Factors of Regular Graphs from Eigenvalues.
Electron. J. Comb., 2010

Component factors with large components in graphs.
Appl. Math. Lett., 2010


  Loading...