Hong Chang

Orcid: 0000-0003-0828-5189

Affiliations:
  • Nanjing Normal University, Nanjing, China


According to our database1, Hong Chang authored at least 18 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Graph Algorithm Based Submodular Function for Sparsest Cut Problem.
Int. J. Found. Comput. Sci., August, 2025

2024
Two-stage BP maximization under p-matroid constraint.
Theor. Comput. Sci., 2024

Two-stage submodular maximization problem beyond nonnegative and monotone.
Math. Struct. Comput. Sci., 2024

A survey on conflict-free connection coloring of graphs.
Discret. Appl. Math., 2024

2023
Two-stage non-submodular maximization.
Theor. Comput. Sci., August, 2023

2022
Improved algorithms for non-submodular function maximization problem.
Theor. Comput. Sci., 2022

Two-Stage Non-submodular Maximization.
Proceedings of the Theory and Applications of Models of Computation, 2022

Two-Stage BP Maximization Under p-matroid Constraint.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
Online algorithms for BP functions maximization.
Theor. Comput. Sci., 2021

Conflict-free connection of trees.
J. Comb. Optim., 2021

Two-Stage Submodular Maximization Under Curvature.
Proceedings of the Combinatorial Optimization and Applications, 2021

Improved Algorithms for Non-submodular Function Maximization Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020
More on limited packings in graphs.
J. Comb. Optim., 2020

Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone.
Proceedings of the Theory and Applications of Models of Computation, 2020

Online BP Functions Maximization.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
On conflict-free connection of graphs.
Discret. Appl. Math., 2019

2018
The (k , ℓ)-proper index of graphs.
J. Comb. Optim., 2018

Graphs with Conflict-Free Connection Number Two.
Graphs Comb., 2018


  Loading...