Xiaoyan Zhang

Orcid: 0000-0002-2224-1484

Affiliations:

Nanjing Normal University, School of Mathematical Science / Institute of Mathematics, China

According to our database¹, Xiaoyan Zhang authored at least 67 papers between 2004 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

A Commentary on the Progress of Big Data in Combinatorial Optimization.

[BibT_eX]

[DOI]

Parallel Process. Lett., March, 2024

Online Single-Processor Scheduling with an Unexpected Breakdown.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., February, 2024

2023

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

[BibT_eX]

[DOI]

J. Glob. Optim., November, 2023

Minimization Problems with Non-Submodular Cover Constraint.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., October, 2023

Online scheduling with deterioration and unexpected processor breakdown.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

A distributed message passing algorithm for computing perfect demand matching.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., September, 2023

Two-stage non-submodular maximization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., August, 2023

Two-stage submodular maximization under curvature.

[BibT_eX]

[DOI]

J. Comb. Optim., March, 2023

An LP-based approximation algorithm for the generalized traveling salesman path problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Streaming Algorithms for the k-Submodular Cover Problem.

[BibT_eX]

[DOI]

CoRR, 2023

Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism.

[BibT_eX]

[DOI]

CoRR, 2023

Polynomial algorithms for computing the isolated toughness of interval and split graphs.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2023

2022

Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

An optimal online algorithm for single-processor scheduling problem with learning effect.

[BibT_eX]

[DOI]

Ran Ma

Sainan Guo

Xiaoyan Zhang

Theor. Comput. Sci., 2022

Improved algorithms for non-submodular function maximization problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Sufficient conditions for graphs with {P2, P5}-factors.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2022

Maximization problems of balancing submodular relevance and supermodular diversity.

[BibT_eX]

[DOI]

J. Glob. Optim., 2022

Randomized selection algorithm for online stochastic unrelated machines scheduling.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Approximation algorithms with constant ratio for general cluster routing problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Computation and algorithm for the minimum k-edge-connectivity of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

The Hamiltonian properties in K1, r-free split graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Packing strong subgraph in digraphs.

[BibT_eX]

[DOI]

Yuefang Sun

Gregory Z. Gutin

Xiaoyan Zhang

Discret. Optim., 2022

A distributed message passing algorithm for the capacitated directed Chinese postman problem.

[BibT_eX]

[DOI]

Comput. Electr. Eng., 2022

Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2022

Two-Stage Non-submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2022

Two-Stage BP Maximization Under p-matroid Constraint.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Approximation algorithms for the dynamic k-level facility location problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Online algorithms for BP functions maximization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Some degree conditions for 𝒫≥k-factor covered graphs.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2021

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

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Extremality of VDB topological indices over f-benzenoids with given order.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

Demo: Resource Allocation for Wafer-Scale Deep Learning Accelerator.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem.

[BibT_eX]

[DOI]

Jian Sun

Gregory Z. Gutin

Xiaoyan Zhang

Proceedings of the Combinatorial Optimization and Applications, 2021

Improved Algorithms for Non-submodular Function Maximization Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020

Randomized mechanism design for decentralized network scheduling.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2020

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2020

Optimal Algorithm of Isolated Toughness for Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

Approximation Algorithms for the General Cluster Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

Approximation Algorithms for General Cluster Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Approximation Algorithm for Stochastic Set Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

Online BP Functions Maximization.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Strong subgraph k-connectivity.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Convergence and correctness of belief propagation for the Chinese postman problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

A polynomial algorithm for weighted scattering number in interval graphs.

[BibT_eX]

[DOI]

Fengwei Li

Xiaoyan Zhang

Hajo Broersma

Discret. Appl. Math., 2019

Extremality and Sharp Bounds for the k-edge-connectivity of Graphs.

[BibT_eX]

[DOI]

Yuefang Sun

Xiaoyan Zhang

Zhao Zhang

CoRR, 2019

Solutions to All-Colors Problem on Graph Cellular Automata.

[BibT_eX]

[DOI]

Xiaoyan Zhang

Chao Wang

Complex., 2019

Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Complex., 2019

Scheduling Three Identical Parallel Machines with Capacity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Optimization of Complex Systems: Theory, 2019

Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019

An Approximation Algorithm for the Dynamic k-level Facility Location Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2017

Extremal and Degree Conditions for Path Extendability in Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

2016

Distributed Approximation Algorithms for Spectrum Allocation in Wireless ad Hoc Networks.

[BibT_eX]

[DOI]

Mob. Networks Appl., 2016

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

[BibT_eX]

[DOI]

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

2015

Delay Optimization Via Packet Scheduling for Multi-Path Routing in Wireless Networks.

[BibT_eX]

[DOI]

Wirel. Pers. Commun., 2015

A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2014

Triangle strings: Structures for augmentation of vertex-disjoint triangle sets.

[BibT_eX]

[DOI]

Zan-Bo Zhang

Xiaoyan Zhang

Inf. Process. Lett., 2014

2013

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

[BibT_eX]

[DOI]

Zan-Bo Zhang

Xiaoyan Zhang

Xuelian Wen

SIAM J. Discret. Math., 2013

2012

Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

2010

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

[BibT_eX]

Ars Comb., 2010

2008

The general sigma all-ones problem for trees.

[BibT_eX]

[DOI]

Xueliang Li

Chao Wang

Xiaoyan Zhang

Discret. Appl. Math., 2008

Notes on factor-critically, extendability and independence number.

[BibT_eX]

Zan-Bo Zhang

Dingjun Lou

Xiaoyan Zhang

Ars Comb., 2008

2004

The Minimum All-Ones Problem for Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Xiaoyan Zhang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...