# Zan-Bo Zhang

Orcid: 0000-0002-0851-4984
According to our database

Collaborative distances:

^{1}, Zan-Bo Zhang authored at least 28 papers between 2007 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Discret. Appl. Math., 2024

Discret. Appl. Math., 2024

2023

Appl. Math. Comput., December, 2023

A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis.

J. Glob. Optim., November, 2023

J. Parallel Distributed Comput., September, 2023

RAIRO Oper. Res., March, 2023

Proceedings of the International Conference on Machine Learning and Cybernetics, 2023

2022

IEEE Trans. Inf. Theory, 2022

Sufficient conditions for graphs with {<i>P</i><sub>2</sub>, <i>P</i><sub>5</sub>}-factors.

RAIRO Oper. Res., 2022

Randomized selection algorithm for online stochastic unrelated machines scheduling.

J. Comb. Optim., 2022

Discret. Math., 2022

2021

RAIRO Oper. Res., 2021

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments.

J. Graph Theory, 2021

Discret. Math., 2021

2020

Approximation algorithm for a generalized Roman domination problem in unit ball graphs.

J. Comb. Optim., 2020

Discret. Appl. Math., 2020

2019

Proceedings of the 3rd International Conference on Computer Science and Application Engineering, 2019

2017

SIAM J. Discret. Math., 2017

Int. J. Comput. Math., 2017

2016

On the complexity of edge-colored subgraph partitioning problems in network optimization.

Discret. Math. Theor. Comput. Sci., 2016

2014

Inf. Process. Lett., 2014

2013

Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs.

SIAM J. Discret. Math., 2013

2012

Graphs Comb., 2012

2011

M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities.

Discret. Math., 2011

2010

Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility.

Ars Comb., 2010

2009

Discret. Math., 2009

2008

Notes on factor-critically, extendability and independence number.

Ars Comb., 2008

2007

Equivalence between Extendability and Factor-Criticality.

Ars Comb., 2007