| Publication | Date of Publication | Type |
|---|
| A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems | 2024-03-11 | Paper |
| Approximation algorithms for the minimum power partial cover problem | 2024-02-23 | Paper |
| An approximation algorithm for the dynamic \(k\)-level facility location problem | 2024-02-23 | Paper |
| Approximation algorithm for (connected) Italian dominating function | 2023-11-13 | Paper |
| A Computational Approach to Optimal Control Problems with Almost Smooth Controls | 2023-10-19 | Paper |
| A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem | 2023-10-16 | Paper |
| Computing connected-\(k\)-subgraph cover with connectivity requirement | 2023-08-04 | Paper |
| An Analytic Model for Cluster-Based Wireless Sensor Networks | 2023-05-09 | Paper |
| Construction of minimum edge-fault tolerant connected dominating set in a general graph | 2023-04-14 | Paper |
| Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage | 2022-12-01 | Paper |
| Partial inverse maximum spanning tree problem under the Chebyshev norm | 2022-10-31 | Paper |
| Nearly tight approximation algorithm for (connected) Roman dominating set | 2022-10-11 | Paper |
| A primal-dual algorithm for the minimum power partial cover problem | 2022-10-04 | Paper |
| The price of fairness for a two-agent scheduling game minimizing total completion time | 2022-10-04 | Paper |
| Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph | 2022-09-14 | Paper |
| Approximation algorithm for prize-collecting sweep cover with base stations | 2022-08-25 | Paper |
| Algorithms for covering multiple submodular constraints and applications | 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 |
| A Role of Minimum Spanning Tree | 2022-06-10 | Paper |
| Discrete Newton Method | 2022-06-10 | Paper |
| Nonsubmodular Optimization | 2022-06-10 | Paper |
| A distributed algorithm for a set cover game | 2022-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5062597 | 2022-03-17 | Paper |
| Approximation algorithm for minimum partial multi-cover under a geometric setting | 2022-03-15 | Paper |
| 构建最小<italic>k</italic> 重控制集的概率算法 | 2021-12-17 | Paper |
| An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem | 2021-12-14 | Paper |
| Parallel approximation for partial set cover | 2021-11-11 | Paper |
| Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks | 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 | 2021-06-23 | Paper |
| Minimum power partial multi-cover on a line | 2021-04-08 | Paper |
| Data mule scheduling on a path with handling time and time span constraints | 2021-02-17 | Paper |
| Approximation algorithms for the dynamic \(k\)-level facility location problems | 2021-01-25 | Paper |
| Computing Minimum k-Connected m-Fold Dominating Set in General Graphs | 2020-11-09 | Paper |
| Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set | 2020-11-09 | Paper |
| Approximation algorithm for minimum connected 3-path vertex cover | 2020-10-14 | Paper |
| Optimal Coverage in Wireless Sensor Networks | 2020-09-03 | Paper |
| Approximation algorithm for minimum weight connected-\(k\)-subgraph cover | 2020-09-01 | Paper |
| A game theoretic approach for minimal connected dominating set | 2020-08-25 | Paper |
| Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs | 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 | 2020-05-04 | Paper |
| A primal-dual algorithm for the minimum partial set multi-cover problem | 2020-03-24 | Paper |
| Algorithm for online 3-path vertex cover | 2020-02-27 | Paper |
| Approximation algorithm for a generalized Roman domination problem in unit ball graphs | 2020-02-03 | Paper |
| A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem | 2019-12-27 | Paper |
| Online hole healing for sensor coverage | 2019-12-03 | Paper |
| Approximation algorithm for the partial set multi-cover problem | 2019-12-03 | Paper |
| Approximation algorithms for minimum weight connected 3-path vertex cover | 2019-11-26 | Paper |
| Primal dual algorithm for partial set multi-cover | 2019-10-11 | Paper |
| Set function optimization | 2019-07-19 | Paper |
| Approximation algorithms for distance constraint sweep coverage with base stations | 2019-06-25 | Paper |
| Primal dual based algorithm for degree-balanced spanning tree problem | 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 | 2018-07-26 | Paper |
| Performability Analysis of Large-Scale Multi-State Computing Systems | 2018-06-27 | Paper |
| Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming | 2018-05-16 | Paper |
| What network topology can tell in election prediction | 2018-04-10 | Paper |
| Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm | 2018-03-13 | Paper |
| Circumference of 3-connected cubic graphs | 2017-11-28 | Paper |
| A simple approximation algorithm for minimum weight partial connected set cover | 2017-11-16 | Paper |
| Two algorithms for minimum 2-connected \(r\)-hop dominating set | 2017-11-03 | Paper |
| A kind of conditional fault tolerance of alternating group graphs | 2017-11-03 | Paper |
| iGreen: green scheduling for peak demand minimization | 2017-11-02 | Paper |
| Local ratio method on partial set multi-cover | 2017-10-17 | Paper |
| A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks | 2017-03-03 | Paper |
| A novel approach for detecting multiple rumor sources in networks with partial observations | 2017-03-03 | Paper |
| Approximation algorithm for partial positive influence problem in social network | 2017-02-22 | Paper |
| Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence | 2017-02-22 | Paper |
| PTAS for minimum \(k\)-path vertex cover in ball graph | 2017-01-13 | Paper |
| Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs | 2016-10-27 | Paper |
| Algorithms for the partial inverse matroid problem in which weights can only be increased | 2016-09-15 | Paper |
| The 0–1 inverse maximum independent set problem on forests and unicyclic graphs | 2016-07-08 | Paper |
| Restricted connectivity of total digraph | 2016-07-08 | Paper |
| Algorithm for constraint partial inverse matroid problem with weight increase forbidden | 2016-07-05 | Paper |
| An approximation algorithm for maximum weight budgeted connected set cover | 2016-05-11 | Paper |
| Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover | 2016-04-07 | Paper |
| A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem | 2016-02-23 | Paper |
| Approximation algorithms for minimum weight partial connected set cover problem | 2016-02-23 | Paper |
| Approximation algorithm for the balanced 2-connected \(k\)-partition problem | 2015-12-11 | Paper |
| A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs | 2015-09-23 | Paper |
| Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem | 2015-09-11 | Paper |
| Equitable total-coloring of subcubic graphs | 2015-04-28 | Paper |
| A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph | 2015-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5171764 | 2015-02-11 | Paper |
| A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs | 2015-01-30 | Paper |
| Some upper bounds related with domination number | 2014-09-29 | Paper |
| Approximation Algorithm for the Balanced 2-Connected Bipartition Problem | 2014-09-26 | Paper |
| A greedy algorithm for the fault-tolerant connected dominating set in a general graph | 2014-09-05 | Paper |
| On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs | 2014-08-22 | Paper |
| Minimum vertex cover in ball graphs through local search | 2014-07-04 | Paper |
| The size of maximally irregular graphs and maximally irregular triangle-free graphs | 2014-06-16 | Paper |
| On the existence of super edge-connected graphs with prescribed degrees | 2014-05-06 | Paper |
| Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem | 2014-04-29 | Paper |
| Spanning 3-connected index of graphs | 2014-02-25 | Paper |
| Optimally restricted edge connected elementary Harary graphs | 2014-01-10 | Paper |
| Max-min weight balanced connected partition | 2013-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2860323 | 2013-11-19 | Paper |
| Constant-approximation for optimal data aggregation with physical interference | 2013-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5299397 | 2013-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4900948 | 2013-01-24 | Paper |
| On cyclic vertex-connectivity of Cartesian product digraphs | 2013-01-03 | Paper |
| A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY | 2012-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3166473 | 2012-10-12 | Paper |
| CYCLIC CONNECTIVITY OF STAR GRAPH | 2012-08-27 | Paper |
| DIAMETER VULNERABILITY OF DIRECTED CYCLES AND DIRECTED TORI | 2012-08-27 | Paper |
| Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks | 2012-07-17 | Paper |
| Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem | 2012-07-17 | Paper |
| A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees | 2012-07-13 | Paper |
| Radar placement along banks of river | 2012-06-13 | Paper |
| On the connectivity of \(p\)-diamond-free vertex transitive graphs | 2012-05-30 | Paper |
| Edge fault tolerance of graphs with respect to super edge connectivity | 2012-05-04 | Paper |
| On super 2-restricted and 3-restricted edge-connected vertex transitive graphs | 2012-04-13 | Paper |
| Super cyclically edge connected transitive graphs | 2012-04-04 | Paper |
| PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs | 2012-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2881281 | 2012-04-03 | Paper |
| Eulerian Subgraphs Containing Given Vertices | 2011-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3170941 | 2011-09-29 | Paper |
| Restricted Edge Connectivity of Harary Graphs | 2011-08-12 | Paper |
| On the edge-connectivity of graphs with two orbits of the same size | 2011-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3017192 | 2011-07-19 | Paper |
| On minimum submodular cover with submodular cost | 2011-06-03 | Paper |
| Edge neighbor connectivity of Cartesian product graph \(G\times K_{2}\) | 2011-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3071910 | 2011-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3073253 | 2011-02-05 | Paper |
| Cyclic Vertex Connectivity of Star Graphs | 2011-01-08 | Paper |
| Sufficient conditions for a graph to be λ k -optimal with given girth and diameter | 2010-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3052567 | 2010-11-05 | Paper |
| Double-super-connected digraphs | 2010-10-11 | Paper |
| A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs | 2010-10-04 | Paper |
| Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs | 2010-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3572807 | 2010-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3573693 | 2010-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3568732 | 2010-06-15 | Paper |
| Cyclic arc-connectivity in a Cartesian product digraph | 2010-06-09 | Paper |
| FAST INFORMATION PROPAGATION IN SOCIAL NETWORKS | 2010-05-19 | Paper |
| The existence and upper bound for two types of restricted connectivity | 2010-05-05 | Paper |
| TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET | 2010-03-11 | Paper |
| Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs | 2009-12-10 | Paper |
| On cyclic edge-connectivity of transitive graphs | 2009-12-10 | Paper |
| PTAS for connected vertex cover in unit disk graphs | 2009-11-25 | Paper |
| A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks | 2009-11-16 | Paper |
| A better constant-factor approximation for weighted dominating set in unit disk graph | 2009-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3641090 | 2009-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3641113 | 2009-11-11 | Paper |
| Super-connected arc-transitive digraphs | 2009-06-30 | Paper |
| Minimally 3-restricted edge connected graphs | 2009-06-30 | Paper |
| A kind of conditional vertex connectivity of star graphs | 2009-06-29 | Paper |
| Semi-hyper-connected vertex transitive graphs | 2009-04-09 | Paper |
| Construction of strongly connected dominating sets in asymmetric multihop wireless networks | 2009-03-17 | Paper |
| Algorithms for connected set cover problem and fault-tolerant connected set cover problem | 2009-03-17 | Paper |
| Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph | 2009-01-27 | Paper |
| Minimally restricted edge connected graphs | 2008-11-06 | Paper |
| Super-connected edge transitive graphs | 2008-09-10 | Paper |
| Extra edge connectivity and isoperimetric edge connectivity | 2008-09-04 | Paper |
| Path-factors in the square of a tree | 2008-08-20 | Paper |
| (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs | 2008-07-10 | Paper |
| Sufficient conditions for restricted-edge-connectivity to be optimal | 2007-11-27 | Paper |
| Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs | 2007-09-10 | Paper |
| Algorithms for long paths in graphs | 2007-06-06 | Paper |
| A characterization of graphs without even factors | 2007-05-24 | Paper |
| Nowhere-zero flows in tensor product of graphs | 2007-05-11 | Paper |
| Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal | 2007-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5492623 | 2006-10-16 | Paper |
| On optimally-\(\lambda^{(3)}\) transitive graphs | 2006-06-09 | Paper |
| Semi-hyper-connected edge transitive graphs | 2006-05-16 | Paper |
| A proof of an inequality concerning \(k\)-restricted edge connectivity | 2005-12-29 | Paper |
| The transformation graph \(G^{xyz}\) when \(xyz=-++\) | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3023236 | 2005-07-04 | Paper |
| Number of minimum vertex cuts in transitive graphs | 2003-09-04 | Paper |
