| Publication | Date of Publication | Type |
|---|
| Some combinatorial algorithms on the eliminating edge feedback number of hypergraphs | 2026-07-06 | Paper |
A simple approximation algorithm for k-correlation clustering on uniform hypergraphs
Theoretical Computer Science | 2026-06-15 | Paper |
| Approximation algorithms on k-correlation clustering of uniform hypergraphs | 2025-10-29 | Paper |
| Some combinatorial algorithms on the independent number of k-regular connected hypergraphs | 2025-10-29 | Paper |
Characterizing the extremal k-girth graphs on feedback vertex set
Journal of the Operations Research Society of China | 2025-09-03 | Paper |
A sharp upper bound for the edge dominating number of hypergraphs with minimum degree
Journal of Combinatorial Optimization | 2025-04-28 | Paper |
A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R
Acta Informatica | 2025-01-08 | Paper |
Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains
Discrete Applied Mathematics | 2025-01-06 | Paper |
| Some combinatorial algorithms on the edge cover number of k-regular connected hypergraphs | 2024-11-12 | Paper |
| Some combinatorial algorithms on the dominating number of anti-rank k hypergraphs | 2024-09-16 | Paper |
| On the matching number of \(k\)-uniform connected hypergraphs with maximum degree | 2024-02-28 | Paper |
Approximation algorithms on \(k\)-correlation clustering
Journal of the Operations Research Society of China | 2024-02-09 | Paper |
Some new results on Gallai theorem and perfect matching for \(k\)-uniform hypergraphs
Lecture Notes in Computer Science | 2023-08-10 | Paper |
On the transversal number of rank k hypergraphs
Frontiers of Algorithmic Wisdom | 2023-08-03 | Paper |
On the transversal number of k-uniform connected hypergraphs
Algorithmic Aspects in Information and Management | 2023-07-07 | Paper |
| Packing and covering triangles in dense random graphs | 2023-03-21 | Paper |
Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Triangle packing and covering in dense random graphs
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
On weak Pareto optimality of nonatomic routing networks
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
| On the feedback number of 3-uniform linear extremal hypergraphs | 2022-06-29 | Paper |
Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
Journal of the Operations Research Society of China | 2021-12-13 | Paper |
On the vertex cover number of 3-uniform hypergraph
Journal of the Operations Research Society of China | 2021-11-05 | Paper |
| Approximation algorithms for balancing signed graphs | 2021-07-05 | Paper |
On the feedback number of 3-uniform hypergraphs
(available as arXiv preprint) | 2020-10-27 | Paper |
| The theory and application of nondeterministic selfish routing model | 2019-10-02 | Paper |
| A combinatorial property of flows on a cycle | 2018-08-30 | Paper |
Covering triangles in edge-weighted graphs
Theory of Computing Systems | 2018-08-03 | Paper |
| Approximation algorithms on k- cycle covering and k- clique covering | 2018-07-18 | Paper |
Total dual integrality of triangle covering
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Network characterizations for excluding Braess's paradox
Theory of Computing Systems | 2017-02-01 | Paper |
Sufficient conditions for Tuza's conjecture on packing and covering triangles
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Network topologies for weakly Pareto optimal nonatomic selfish routing
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Excluding Braess's paradox in nonatomic selfish routing
Algorithmic Game Theory | 2015-11-04 | Paper |
