| Publication | Date of Publication | Type |
|---|
Active fault diagnosis for LPV systems based on constrained zonotopes
IEEE Transactions on Automatic Control | 2025-01-21 | Paper |
Approximation algorithm for prize-collecting vertex cover with fairness constraints
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
Adaptive influence maximization: adaptability via nonadaptability
INFORMS Journal on Computing | 2024-11-20 | Paper |
Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs
Mathematical Structures in Computer Science | 2024-10-16 | Paper |
Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio
INFORMS Journal on Computing | 2024-07-29 | Paper |
Approximation algorithms for maximum weighted target cover problem with distance limitations
Journal of Combinatorial Optimization | 2024-07-11 | Paper |
Approximation algorithm for the minimum partial connected Roman dominating set problem
Journal of Combinatorial Optimization | 2024-07-11 | Paper |
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
Optimization Letters | 2024-03-11 | Paper |
Approximation algorithms for the minimum power partial cover problem
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
An approximation algorithm for the dynamic \(k\)-level facility location problem
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Approximation algorithm for (connected) Italian dominating function
Discrete Applied Mathematics | 2023-11-13 | Paper |
A Computational Approach to Optimal Control Problems with Almost Smooth Controls
Asia-Pacific Journal of Operational Research | 2023-10-19 | Paper |
A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
Computing connected-\(k\)-subgraph cover with connectivity requirement
Lecture Notes in Computer Science | 2023-08-04 | Paper |
An Analytic Model for Cluster-Based Wireless Sensor Networks
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
Construction of minimum edge-fault tolerant connected dominating set in a general graph
Journal of Combinatorial Optimization | 2023-04-14 | Paper |
Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
INFORMS Journal on Computing | 2022-12-01 | Paper |
Partial inverse maximum spanning tree problem under the Chebyshev norm
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Nearly tight approximation algorithm for (connected) Roman dominating set
Optimization Letters | 2022-10-11 | Paper |
A primal-dual algorithm for the minimum power partial cover problem
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
The price of fairness for a two-agent scheduling game minimizing total completion time
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
Theoretical Computer Science | 2022-09-14 | Paper |
Approximation algorithm for prize-collecting sweep cover with base stations
Theoretical Computer Science | 2022-08-25 | Paper |
Algorithms for covering multiple submodular constraints and applications
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
Constant-approximation for prize-collecting min-sensor sweep coverage with base stations
| 2022-07-01 | Paper |
Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
| 2022-06-29 | Paper |
Parallel algorithm for minimum partial dominating set in unit disk graph
| 2022-06-29 | Paper |
Discrete Newton Method
Nonlinear Combinatorial Optimization | 2022-06-10 | Paper |
Nonsubmodular Optimization
Nonlinear Combinatorial Optimization | 2022-06-10 | Paper |
A Role of Minimum Spanning Tree
Nonlinear Combinatorial Optimization | 2022-06-10 | Paper |
A distributed algorithm for a set cover game
Discrete Mathematics, Algorithms and Applications | 2022-06-10 | Paper |
scientific article; zbMATH DE number 7491960 (Why is no real title available?)
| 2022-03-17 | Paper |
Approximation algorithm for minimum partial multi-cover under a geometric setting
Optimization Letters | 2022-03-15 | Paper |
Probabilistic algorithm for minimum \(k\)-fold dominating set problem
SCIENTIA SINICA Mathematica | 2021-12-17 | Paper |
An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
Information Processing Letters | 2021-12-14 | Paper |
Parallel approximation for partial set cover
Applied Mathematics and Computation | 2021-11-11 | Paper |
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
Journal of Global Optimization | 2021-08-17 | Paper |
Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem
| 2021-08-09 | Paper |
Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
INFORMS Journal on Computing | 2021-06-23 | Paper |
Minimum power partial multi-cover on a line
Theoretical Computer Science | 2021-04-08 | Paper |
Data mule scheduling on a path with handling time and time span constraints
Optimization Letters | 2021-02-17 | Paper |
Approximation algorithms for the dynamic \(k\)-level facility location problems
Theoretical Computer Science | 2021-01-25 | Paper |
Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
INFORMS Journal on Computing | 2020-11-09 | Paper |
Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
INFORMS Journal on Computing | 2020-11-09 | Paper |
Approximation algorithm for minimum connected 3-path vertex cover
Discrete Applied Mathematics | 2020-10-14 | Paper |
Optimal coverage in wireless sensor networks
Springer Optimization and Its Applications | 2020-09-03 | Paper |
Approximation algorithm for minimum weight connected-\(k\)-subgraph cover
Theoretical Computer Science | 2020-09-01 | Paper |
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
Theoretical Computer Science | 2020-08-25 | Paper |
A game theoretic approach for minimal connected dominating set
Theoretical Computer Science | 2020-08-25 | Paper |
Improved approximation algorithm for minimum weight \(k\)-subgraph cover problem
| 2020-05-13 | Paper |
Approximation algorithms for capacitated partial inverse maximum spanning tree problem
Journal of Global Optimization | 2020-05-04 | Paper |
A primal-dual algorithm for the minimum partial set multi-cover problem
Journal of Combinatorial Optimization | 2020-03-24 | Paper |
Algorithm for online 3-path vertex cover
Theory of Computing Systems | 2020-02-27 | Paper |
Approximation algorithm for a generalized Roman domination problem in unit ball graphs
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
Theoretical Computer Science | 2019-12-27 | Paper |
Online hole healing for sensor coverage
Journal of Global Optimization | 2019-12-03 | Paper |
Approximation algorithm for the partial set multi-cover problem
Journal of Global Optimization | 2019-12-03 | Paper |
Approximation algorithms for minimum weight connected 3-path vertex cover
Applied Mathematics and Computation | 2019-11-26 | Paper |
Primal dual algorithm for partial set multi-cover
| 2019-10-11 | Paper |
Set function optimization
Journal of the Operations Research Society of China | 2019-07-19 | Paper |
Approximation algorithms for distance constraint sweep coverage with base stations
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Primal dual based algorithm for degree-balanced spanning tree problem
Applied Mathematics and Computation | 2019-04-29 | Paper |
Extremality and Sharp Bounds for the $k$-edge-connectivity of Graphs
| 2019-01-18 | Paper |
A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
Performability Analysis of Large-Scale Multi-State Computing Systems
IEEE Transactions on Computers | 2018-06-27 | Paper |
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
Mathematical Programming. Series A. Series B | 2018-05-16 | Paper |
What network topology can tell in election prediction
Discrete Mathematics, Algorithms and Applications | 2018-04-10 | Paper |
Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
Journal of Global Optimization | 2018-03-13 | Paper |
Circumference of 3-connected cubic graphs
Journal of Combinatorial Theory. Series B | 2017-11-28 | Paper |
A simple approximation algorithm for minimum weight partial connected set cover
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
A kind of conditional fault tolerance of alternating group graphs
Information Processing Letters | 2017-11-03 | Paper |
Two algorithms for minimum 2-connected \(r\)-hop dominating set
Information Processing Letters | 2017-11-03 | Paper |
iGreen: green scheduling for peak demand minimization
Journal of Global Optimization | 2017-11-02 | Paper |
Local ratio method on partial set multi-cover
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks
Journal of Combinatorial Optimization | 2017-03-03 | Paper |
A novel approach for detecting multiple rumor sources in networks with partial observations
Journal of Combinatorial Optimization | 2017-03-03 | Paper |
Approximation algorithm for partial positive influence problem in social network
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
PTAS for minimum \(k\)-path vertex cover in ball graph
Information Processing Letters | 2017-01-13 | Paper |
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
Optimization Letters | 2016-10-27 | Paper |
Algorithms for the partial inverse matroid problem in which weights can only be increased
Journal of Global Optimization | 2016-09-15 | Paper |
Restricted connectivity of total digraph
Discrete Mathematics, Algorithms and Applications | 2016-07-08 | Paper |
The \(0-1\) inverse maximum independent set problem on forests and unicyclic graphs
Discrete Mathematics, Algorithms and Applications | 2016-07-08 | Paper |
Algorithm for constraint partial inverse matroid problem with weight increase forbidden
Theoretical Computer Science | 2016-07-05 | Paper |
An approximation algorithm for maximum weight budgeted connected set cover
Journal of Combinatorial Optimization | 2016-05-11 | Paper |
Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover
Discrete Applied Mathematics | 2016-04-07 | Paper |
A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
Approximation algorithms for minimum weight partial connected set cover problem
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
Approximation algorithm for the balanced 2-connected \(k\)-partition problem
Theoretical Computer Science | 2015-12-11 | Paper |
A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
Information Sciences | 2015-09-23 | Paper |
Approximation algorithm for the minimum connected \(k\)-path vertex cover problem
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Equitable total-coloring of subcubic graphs
Discrete Applied Mathematics | 2015-04-28 | Paper |
A PTAS for weak minimum routing cost connected dominating set of unit disk graph
Optimization, Simulation, and Control | 2015-03-30 | Paper |
scientific article; zbMATH DE number 6402649 (Why is no real title available?)
| 2015-02-11 | Paper |
A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs
Theoretical Computer Science | 2015-01-30 | Paper |
Some upper bounds related with domination number
Journal of the Operations Research Society of China | 2014-09-29 | Paper |
Approximation algorithm for the balanced 2-connected bipartition problem
Lecture Notes in Computer Science | 2014-09-26 | Paper |
A greedy algorithm for the fault-tolerant connected dominating set in a general graph
Journal of Combinatorial Optimization | 2014-09-05 | Paper |
On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
Discrete Applied Mathematics | 2014-08-22 | Paper |
Minimum vertex cover in ball graphs through local search
Journal of Global Optimization | 2014-07-04 | Paper |
The size of maximally irregular graphs and maximally irregular triangle-free graphs
Graphs and Combinatorics | 2014-06-16 | Paper |
On the existence of super edge-connected graphs with prescribed degrees
Discrete Mathematics | 2014-05-06 | Paper |
Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem
Theoretical Computer Science | 2014-04-29 | Paper |
Spanning 3-connected index of graphs
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Optimally restricted edge connected elementary Harary graphs
Theoretical Computer Science | 2014-01-10 | Paper |
Max-min weight balanced connected partition
Journal of Global Optimization | 2013-12-09 | Paper |
A bicriteria approximation algorithm for quarantining-vaccination-cure problem
Chinese Quarterly Journal of Mathematics | 2013-11-19 | Paper |
Constant-approximation for optimal data aggregation with physical interference
Journal of Global Optimization | 2013-08-07 | Paper |
scientific article; zbMATH DE number 6181074 (Why is no real title available?)
| 2013-06-25 | Paper |
The directed metric dimension of Cartesian product of digraphs
| 2013-01-24 | Paper |
On cyclic vertex-connectivity of Cartesian product digraphs
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
Super-mixed-connected line digraphs.
| 2012-10-12 | Paper |
Diameter vulnerability of directed cycles and directed tori
Discrete Mathematics, Algorithms and Applications | 2012-08-27 | Paper |
Cyclic connectivity of star graph
Discrete Mathematics, Algorithms and Applications | 2012-08-27 | Paper |
Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem
Journal of Combinatorial Optimization | 2012-07-17 | Paper |
Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks
Journal of Combinatorial Optimization | 2012-07-17 | Paper |
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences | 2012-07-13 | Paper |
Radar placement along banks of river
Journal of Global Optimization | 2012-06-13 | Paper |
On the connectivity of \(p\)-diamond-free vertex transitive graphs
Discrete Applied Mathematics | 2012-05-30 | Paper |
Edge fault tolerance of graphs with respect to super edge connectivity
Discrete Applied Mathematics | 2012-05-04 | Paper |
On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
Discrete Mathematics | 2012-04-13 | Paper |
Super cyclically edge connected transitive graphs
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
Isoperimetric edge connectivity of line graphs and path graphs.
Ars Combinatoria | 2012-04-03 | Paper |
Eulerian subgraphs containing given vertices
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Spectral radius of the complement of unicyclic graphs
| 2011-09-29 | Paper |
Restricted edge connectivity of Harary graphs
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
On the edge-connectivity of graphs with two orbits of the same size
Discrete Mathematics | 2011-08-08 | Paper |
Characterization of \(\lambda_{3,q}\)-connected graphs
| 2011-07-19 | Paper |
On minimum submodular cover with submodular cost
Journal of Global Optimization | 2011-06-03 | Paper |
Edge neighbor connectivity of Cartesian product graph \(G\times K_{2}\)
Applied Mathematics and Computation | 2011-03-08 | Paper |
Restricted connectivity of line digraphs
| 2011-02-05 | Paper |
Neighbor connectivity of line graphs
| 2011-02-05 | Paper |
Cyclic Vertex Connectivity of Star Graphs
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Sufficient conditions for a graph to be \(\lambda_k\)-optimal with given girth and diameter
Networks | 2010-11-24 | Paper |
A recurrence formula for unreliability polynomial of graphs
| 2010-11-05 | Paper |
Double-super-connected digraphs
Discrete Applied Mathematics | 2010-10-11 | Paper |
A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs
Optimization Letters | 2010-10-04 | Paper |
Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
Information Processing Letters | 2010-09-01 | Paper |
\(P_3\)-factor in line graphs of trees
| 2010-07-08 | Paper |
Nowhere-zero flows in lexicographic product of graphs
| 2010-07-08 | Paper |
Extremal properties of \((1,f)\)-odd factors in graphs.
| 2010-06-15 | Paper |
Cyclic arc-connectivity in a Cartesian product digraph
Applied Mathematics Letters | 2010-06-09 | Paper |
FAST INFORMATION PROPAGATION IN SOCIAL NETWORKS
Discrete Mathematics, Algorithms and Applications | 2010-05-19 | Paper |
The existence and upper bound for two types of restricted connectivity
Discrete Applied Mathematics | 2010-05-05 | Paper |
TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
Discrete Mathematics, Algorithms and Applications | 2010-03-11 | Paper |
On cyclic edge-connectivity of transitive graphs
Discrete Mathematics | 2009-12-10 | Paper |
Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
Discrete Mathematics | 2009-12-10 | Paper |
PTAS for connected vertex cover in unit disk graphs
Theoretical Computer Science | 2009-11-25 | Paper |
A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
Journal of Global Optimization | 2009-11-16 | Paper |
A better constant-factor approximation for weighted dominating set in unit disk graph
Journal of Combinatorial Optimization | 2009-11-16 | Paper |
\(P_3\)-factors in the line graphs of 2-edge-connected graphs
| 2009-11-11 | Paper |
scientific article; zbMATH DE number 5630515 (Why is no real title available?)
| 2009-11-11 | Paper |
Minimally 3-restricted edge connected graphs
Discrete Applied Mathematics | 2009-06-30 | Paper |
Super-connected arc-transitive digraphs
Discrete Applied Mathematics | 2009-06-30 | Paper |
A kind of conditional vertex connectivity of star graphs
Applied Mathematics Letters | 2009-06-29 | Paper |
Semi-hyper-connected vertex transitive graphs
Discrete Mathematics | 2009-04-09 | Paper |
Construction of strongly connected dominating sets in asymmetric multihop wireless networks
Theoretical Computer Science | 2009-03-17 | Paper |
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Theoretical Computer Science | 2009-03-17 | Paper |
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Minimally restricted edge connected graphs
Applied Mathematics Letters | 2008-11-06 | Paper |
Super-connected edge transitive graphs
Discrete Applied Mathematics | 2008-09-10 | Paper |
Extra edge connectivity and isoperimetric edge connectivity
Discrete Mathematics | 2008-09-04 | Paper |
Path-factors in the square of a tree
Graphs and Combinatorics | 2008-08-20 | Paper |
(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Sufficient conditions for restricted-edge-connectivity to be optimal
Discrete Mathematics | 2007-11-27 | Paper |
Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
Graphs and Combinatorics | 2007-09-10 | Paper |
Algorithms for long paths in graphs
Theoretical Computer Science | 2007-06-06 | Paper |
A characterization of graphs without even factors
Graphs and Combinatorics | 2007-05-24 | Paper |
Nowhere-zero flows in tensor product of graphs
Journal of Graph Theory | 2007-05-11 | Paper |
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
Discrete Mathematics | 2007-02-13 | Paper |
scientific article; zbMATH DE number 5064073 (Why is no real title available?)
| 2006-10-16 | Paper |
On optimally-\(\lambda^{(3)}\) transitive graphs
Discrete Applied Mathematics | 2006-06-09 | Paper |
Semi-hyper-connected edge transitive graphs
Discrete Mathematics | 2006-05-16 | Paper |
A proof of an inequality concerning \(k\)-restricted edge connectivity
Discrete Mathematics | 2005-12-29 | Paper |
The transformation graph \(G^{xyz}\) when \(xyz=-++\)
Discrete Mathematics | 2005-08-17 | Paper |
scientific article; zbMATH DE number 2186061 (Why is no real title available?)
| 2005-07-04 | Paper |
Number of minimum vertex cuts in transitive graphs
Discrete Mathematics | 2003-09-04 | Paper |
