Xiaoyan Zhang
Orcid: 0000000222241484Affiliations:
 Nanjing Normal University, School of Mathematical Science / Institute of Mathematics, China
According to our database^{1},
Xiaoyan Zhang
authored at least 71 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
Parallel Process. Lett., March, 2024
Asia Pac. J. Oper. Res., February, 2024
Discret. Appl. Math., January, 2024
An approximation algorithm for highdimensional table compression on balanced Kpartite graph.
Comput. Electr. Eng., January, 2024
Theor. Comput. Sci., 2024
Math. Struct. Comput. Sci., 2024
2023
A maximum hypergraph 3cut problem with limited unbalance: approximation and analysis.
J. Glob. Optim., November, 2023
Asia Pac. J. Oper. Res., October, 2023
Theor. Comput. Sci., September, 2023
J. Parallel Distributed Comput., September, 2023
Theor. Comput. Sci., August, 2023
J. Comb. Optim., March, 2023
An LPbased approximation algorithm for the generalized traveling salesman path problem.
Theor. Comput. Sci., 2023
CoRR, 2023
Acceleration for TimingAware GateLevel Logic Simulation with OnePass GPU Parallelism.
CoRR, 2023
Polynomial algorithms for computing the isolated toughness of interval and split graphs.
Concurr. Comput. Pract. Exp., 2023
2022
IEEE Trans. Inf. Theory, 2022
An optimal online algorithm for singleprocessor scheduling problem with learning effect.
Theor. Comput. Sci., 2022
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
J. Comb. Optim., 2022
Approximation algorithms for stochastic set cover and single sink rentorbuy with submodular penalty.
J. Comb. Optim., 2022
Discret. Math., 2022
Discret. Optim., 2022
A distributed message passing algorithm for the capacitated directed Chinese postman problem.
Comput. Electr. Eng., 2022
Proceedings of the Theory and Applications of Models of Computation, 2022
Proceedings of the Theory and Applications of Models of Computation, 2022
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
Theor. Comput. Sci., 2021
RAIRO Oper. Res., 2021
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments.
J. Graph Theory, 2021
Appl. Math. Comput., 2021
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021
A LPbased Approximation Algorithm for generalized Traveling Salesperson Path Problem.
Proceedings of the Combinatorial Optimization and Applications, 2021
Proceedings of the Algorithmic Aspects in Information and Management, 2021
2020
Optim. Methods Softw., 2020
Approximation algorithm for a generalized Roman domination problem in unit ball graphs.
J. Comb. Optim., 2020
Proceedings of the Theory and Applications of Models of Computation, 2020
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020
Proceedings of the Computing and Combinatorics  26th International Conference, 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
J. Graph Theory, 2019
Convergence and correctness of belief propagation for the Chinese postman problem.
J. Glob. Optim., 2019
Discret. Appl. Math., 2019
CoRR, 2019
Complex., 2019
Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.
Complex., 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
StrategyProof CostSharing Mechanism Design for a Generalized CoverSets Problem (Extended Abstract).
Proceedings of the Computational Data and Social Networks  8th International Conference, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
2017
SIAM J. Discret. Math., 2017
A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3dimensional 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 edgecolored subgraph partitioning problems in network optimization.
Discret. Math. Theor. Comput. Sci., 2016
2015
Delay Optimization Via Packet Scheduling for MultiPath 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
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
2010
Degree and connectivity conditions for IMextendibility and vertexdeletable IMextendibility.
Ars Comb., 2010
2008
Discret. Appl. Math., 2008
Notes on factorcritically, extendability and independence number.
Ars Comb., 2008
2004
SIAM J. Comput., 2004
Linear Time Algorithms to the Minimum AllOnes Problem for Unicyclic and Bicyclic Graphs.
Electron. Notes Discret. Math., 2004