Xiaoyan Zhang

Orcid: 0000-0002-2224-1484

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


According to our database1, Xiaoyan Zhang authored at least 71 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Commentary on the Progress of Big Data in Combinatorial Optimization.
Parallel Process. Lett., March, 2024

Online Single-Processor Scheduling with an Unexpected Breakdown.
Asia Pac. J. Oper. Res., February, 2024

Erdös-Gallai-type problems for distance-edge-monitoring numbers.
Discret. Appl. Math., January, 2024

An approximation algorithm for high-dimensional table compression on balanced K-partite graph.
Comput. Electr. Eng., January, 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

2023
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis.
J. Glob. Optim., November, 2023

Minimization Problems with Non-Submodular Cover Constraint.
Asia Pac. J. Oper. Res., October, 2023

Online scheduling with deterioration and unexpected processor breakdown.
Theor. Comput. Sci., September, 2023

A distributed message passing algorithm for computing perfect demand matching.
J. Parallel Distributed Comput., September, 2023

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

Two-stage submodular maximization under curvature.
J. Comb. Optim., March, 2023

An LP-based approximation algorithm for the generalized traveling salesman path problem.
Theor. Comput. Sci., 2023

Streaming Algorithms for the k-Submodular Cover Problem.
CoRR, 2023

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

Polynomial algorithms for computing the isolated toughness of interval and split graphs.
Concurr. Comput. Pract. Exp., 2023

2022
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths.
IEEE Trans. Inf. Theory, 2022

An optimal online algorithm for single-processor scheduling problem with learning effect.
Theor. Comput. Sci., 2022

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

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

Maximization problems of balancing submodular relevance and supermodular diversity.
J. Glob. Optim., 2022

Randomized selection algorithm for online stochastic unrelated machines scheduling.
J. Comb. Optim., 2022

Approximation algorithms with constant ratio for general cluster routing problems.
J. Comb. Optim., 2022

Computation and algorithm for the minimum k-edge-connectivity of graphs.
J. Comb. Optim., 2022

Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty.
J. Comb. Optim., 2022

The Hamiltonian properties in <i>K</i><sub>1, <i>r</i></sub>-free split graphs.
Discret. Math., 2022

Packing strong subgraph in digraphs.
Discret. Optim., 2022

A distributed message passing algorithm for the capacitated directed Chinese postman problem.
Comput. Electr. Eng., 2022

Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints.
Proceedings of the Theory and Applications of Models of Computation, 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
Approximation algorithms for the dynamic <i>k</i>-level facility location problems.
Theor. Comput. Sci., 2021

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

Some degree conditions for 𝒫<sub>≥<i>k</i></sub>-factor covered graphs.
RAIRO Oper. Res., 2021

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments.
J. Graph Theory, 2021

Extremality of VDB topological indices over f-benzenoids with given order.
Appl. Math. Comput., 2021

Demo: Resource Allocation for Wafer-Scale Deep Learning Accelerator.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem.
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
Randomized mechanism design for decentralized network scheduling.
Optim. Methods Softw., 2020

Approximation algorithm for a generalized Roman domination problem in unit ball 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

Optimal Algorithm of Isolated Toughness for Interval Graphs.
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

Approximation Algorithms for the General Cluster Routing Problem.
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

Approximation Algorithms for General Cluster Routing Problem.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Approximation Algorithm for Stochastic Set Cover Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

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

2019
Strong subgraph k-connectivity.
J. Graph Theory, 2019

Convergence and correctness of belief propagation for the Chinese postman problem.
J. Glob. Optim., 2019

A polynomial algorithm for weighted scattering number in interval graphs.
Discret. Appl. Math., 2019

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

Solutions to All-Colors Problem on Graph Cellular Automata.
Complex., 2019

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

Scheduling Three Identical Parallel Machines with Capacity Constraints.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract).
Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019

An Approximation Algorithm for the Dynamic k-level Facility Location Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2017
Extremal and Degree Conditions for Path Extendability in Digraphs.
SIAM J. Discret. Math., 2017

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

2016
Distributed Approximation Algorithms for Spectrum Allocation in Wireless ad Hoc Networks.
Mob. Networks Appl., 2016

On the complexity of edge-colored subgraph partitioning problems in network optimization.
Discret. Math. Theor. Comput. Sci., 2016

2015
Delay Optimization Via Packet Scheduling for Multi-Path Routing in Wireless Networks.
Wirel. Pers. Commun., 2015

A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs.
Theor. Comput. Sci., 2015

2014
Triangle strings: Structures for augmentation of vertex-disjoint triangle sets.
Inf. Process. Lett., 2014

2013
Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs.
SIAM J. Discret. Math., 2013

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

2010
Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility.
Ars Comb., 2010

2008
The general sigma all-ones problem for trees.
Discret. Appl. Math., 2008

Notes on factor-critically, extendability and independence number.
Ars Comb., 2008

2004
The Minimum All-Ones Problem for Trees.
SIAM J. Comput., 2004

Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs.
Electron. Notes Discret. Math., 2004


  Loading...