Zhao Zhang

Optim. Lett., March, 2024

Selfish bin packing with punishment.

[BibT_eX]

[DOI]

Ling Gai

Weiwei Zhang

Theor. Comput. Sci., January, 2024

2023

Approximation algorithm for (connected) Italian dominating function.

[BibT_eX]

[DOI]

Ke Li

Discret. Appl. Math., December, 2023

Capitalize Your Data: Optimal Selling Mechanisms for IoT Data Exchange.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., April, 2023

Construction of minimum edge-fault tolerant connected dominating set in a general graph.

[BibT_eX]

[DOI]

Yaoyao Zhang

J. Comb. Optim., March, 2023

ChainDash: An Ad-Hoc Blockchain Data Analytics System.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2023

Approximation Algorithm for Unrooted Prize-Collecting Forest with Multiple Components and Its Application on Prize-Collecting Sweep Coverage.

[BibT_eX]

[DOI]

CoRR, 2023

A Game-Theoretic Approach to Solving the Roman Domination Problem.

[BibT_eX]

[DOI]

CoRR, 2023

Improved Approximation Algorithm for Minimum-Weight (1, m)-Connected Dominating Set.

[BibT_eX]

[DOI]

CoRR, 2023

SChain: Scalable Concurrency over Flexible Permissioned Blockchain.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022

A Green Stackelberg-game Incentive Mechanism for Multi-service Exchange in Mobile Crowdsensing.

[BibT_eX]

[DOI]

ACM Trans. Internet Techn., 2022

Toward Fairness-Aware Time-Sensitive Asynchronous Federated Learning for Critical Energy Infrastructure.

[BibT_eX]

[DOI]

IEEE Trans. Ind. Informatics, 2022

Approximation algorithm for prize-collecting sweep cover with base stations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph.

[BibT_eX]

[DOI]

Weizhi Hong

Theor. Comput. Sci., 2022

Approximation algorithm for minimum partial multi-cover under a geometric setting.

[BibT_eX]

[DOI]

Optim. Lett., 2022

Nearly tight approximation algorithm for (connected) Roman dominating set.

[BibT_eX]

[DOI]

Optim. Lett., 2022

The price of fairness for a two-agent scheduling game minimizing total completion time.

[BibT_eX]

[DOI]

Yubai Zhang

Zhaohui Liu

J. Comb. Optim., 2022

Computation and algorithm for the minimum k-edge-connectivity of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Partial inverse maximum spanning tree problem under the Chebyshev norm.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

A primal-dual algorithm for the minimum power partial cover problem.

[BibT_eX]

[DOI]

Menghong Li

J. Comb. Optim., 2022

An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

A distributed algorithm for a set cover game.

[BibT_eX]

[DOI]

Chaojie Zhu

Discret. Math. Algorithms Appl., 2022

Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems.

[BibT_eX]

[DOI]

CoRR, 2022

Approximation Algorithm for Minimum p Union Under a Geometric Setting.

[BibT_eX]

[DOI]

CoRR, 2022

A parallel algorithm for minimum weight set cover with small neighborhood property.

[BibT_eX]

[DOI]

Yaoyao Zhang

CoRR, 2022

Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set.

[BibT_eX]

[DOI]

CoRR, 2022

Formulate Full View Camera Sensor Coverage by Using Group Set Coverage.

[BibT_eX]

[DOI]

Proceedings of the Wireless Internet - 15th EAI International Conference, 2022

Computing Connected-k-Subgraph Cover with Connectivity Requirement.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2022

Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem.

[BibT_eX]

[DOI]

Shaojie Tang

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Extortion and Cooperation in Rating Protocol Design for Competitive Crowdsourcing.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Soc. Syst., 2021

Approximation algorithms for the dynamic k-level facility location problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Minimum power partial multi-cover on a line.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks.

[BibT_eX]

[DOI]

J. Glob. Optim., 2021

Breaking the rmax Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2021

A Parallel Algorithm for Minimum Cost Submodular Cover.

[BibT_eX]

[DOI]

CoRR, 2021

Parallel approximation for partial set cover.

[BibT_eX]

[DOI]

Ying Zhang

Appl. Math. Comput., 2021

Laser Marking Hatch Contour Generation Algorithm.

[BibT_eX]

[DOI]

Proceedings of the ICAIIS 2021: 2021 2nd International Conference on Artificial Intelligence and Information Systems, Chongqing, China, May 28, 2021

PEEP: A Parallel Execution Engine for Permissioned Blockchain Systems.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2021

Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l∞ -norm.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph.

[BibT_eX]

[DOI]

Weizhi Hong

Proceedings of the Combinatorial Optimization and Applications, 2021

Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020

Online Rating Protocol Using Endogenous and Incremental Learning Design for Mobile Crowdsensing.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2020

Edge Computing-Empowered Large-Scale Traffic Data Recovery Leveraging Low-Rank Theory.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2020

Reliability Analysis of IoT Networks with Community Structures.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2020

A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Approximation algorithm for minimum weight connected-k-subgraph cover.

[BibT_eX]

[DOI]

Pengcheng Liu

Theor. Comput. Sci., 2020

Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs.

[BibT_eX]

[DOI]

Pengcheng Liu

Theor. Comput. Sci., 2020

A game theoretic approach for minimal connected dominating set.

[BibT_eX]

[DOI]

Xiuyang Chen

Theor. Comput. Sci., 2020

Data mule scheduling on a path with handling time and time span constraints.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Algorithm for Online 3-Path Vertex Cover.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Approximation algorithms for capacitated partial inverse maximum spanning tree problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2020

Approximation algorithm for a generalized Roman domination problem in unit ball graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

A primal-dual algorithm for the minimum partial set multi-cover problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Approximation algorithm for minimum connected 3-path vertex cover.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Online hole healing for sensor coverage.

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

Approximation algorithm for the partial set multi-cover problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

Approximation algorithms for distance constraint sweep coverage with base stations.

[BibT_eX]

[DOI]

Jian Liang

J. Comb. Optim., 2019

Incentive Mechanism for Macrotasking Crowdsourcing: A Zero-Determinant Strategy Approach.

[BibT_eX]

[DOI]

IEEE Internet Things J., 2019

Quality of barrier cover with wireless sensors.

[BibT_eX]

[DOI]

Int. J. Sens. Networks, 2019

Maximisation of the number of β-view covered targets in visual sensor networks.

[BibT_eX]

[DOI]

Int. J. Sens. Networks, 2019

Approximation algorithms for minimum weight connected 3-path vertex cover.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

Multi-Level Two-Sided Rating Protocol Design for Service Exchange Contest Dilemma in Crowdsensing.

[BibT_eX]

[DOI]

IEEE Access, 2019

Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem.

[BibT_eX]

[DOI]

Pengcheng Liu

Proceedings of the Combinatorial Optimization and Applications, 2019

An Approximation Algorithm for the Dynamic k-level Facility Location Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

Approximation Algorithms for the Minimum Power Partial Cover Problem.

[BibT_eX]

[DOI]

Menghong Li

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2018

Game-Theoretic Design of Optimal Two-Sided Rating Protocols for Service Exchange Dilemma in Crowdsourcing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2018

Performability Analysis of Large-Scale Multi-State Computing Systems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2018

Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming.

[BibT_eX]

[DOI]

Math. Program., 2018

Partial inverse maximum spanning tree in which weight can only be decreased under lp-norm.

[BibT_eX]

[DOI]

Xianyue Li

J. Glob. Optim., 2018

Circumference of 3-connected cubic graphs.

[BibT_eX]

[DOI]

Xingxing Yu

J. Comb. Theory, Ser. B, 2018

A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network.

[BibT_eX]

[DOI]

Lina Chen

J. Comb. Optim., 2018

Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2018

Computing Minimum k-Connected m-Fold Dominating Set in General Graphs.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2018

Supporting user authorization queries in RBAC systems by role-permission reassignment.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2018

What network topology can tell in election prediction.

[BibT_eX]

[DOI]

Zhihao Chen

Discret. Math. Algorithms Appl., 2018

Primal dual based algorithm for degree-balanced spanning tree problem.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

Approximating the k-Minimum Distance Rumor Source Detection in Online Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Computer Communication and Networks, 2018

Primal Dual Algorithm for Partial Set Multi-cover.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017

Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

iGreen: green scheduling for peak demand minimization.

[BibT_eX]

[DOI]

J. Glob. Optim., 2017

A novel approach for detecting multiple rumor sources in networks with partial observations.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

A simple approximation algorithm for minimum weight partial connected set cover.

[BibT_eX]

[DOI]

Yubai Zhang

J. Comb. Optim., 2017

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Approximation algorithm for partial positive influence problem in social network.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Local ratio method on partial set multi-cover.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence.

[BibT_eX]

[DOI]

Zaixin Lu

J. Comb. Optim., 2017

PTAS for minimum k-path vertex cover in ball graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Game-Theoretic Design of Optimal Two-Sided Rating Protocols for Service Exchange Dilemma in Crowdsourcing.

[BibT_eX]

[DOI]

CoRR, 2017

Rating Protocol Design for Extortion and Cooperation in the Crowdsourcing Contest Dilemma.

[BibT_eX]

[DOI]

CoRR, 2017

Randomized Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem.

[BibT_eX]

[DOI]

CoRR, 2017

A Simpler Method to Obtain a PTAS for Connected k-Path Vertex Cover in Unit Disk Graph.

[BibT_eX]

[DOI]

Lina Chen

Proceedings of the Wireless Algorithms, Systems, and Applications, 2017

Viral marketing with positive influence.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Networked Stochastic Multi-armed Bandits with Combinatorial Strategies.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016

Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Reliability Evaluation of Network Systems with Dependent Propagated Failures Using Decision Diagrams.

[BibT_eX]

[DOI]

IEEE Trans. Dependable Secur. Comput., 2016

Approximation algorithm for the balanced 2-connected k-partition problem.

[BibT_eX]

[DOI]

Di Wu

Theor. Comput. Sci., 2016

Algorithm for constraint partial inverse matroid problem with weight increase forbidden.

[BibT_eX]

[DOI]

Shuangshuang Li

Hong-Jian Lai

Theor. Comput. Sci., 2016

Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs.

[BibT_eX]

[DOI]

Optim. Lett., 2016

Algorithms for the partial inverse matroid problem in which weights can only be increased.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

Editorial for Special Issue: COCOA2014.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

A greedy algorithm for the minimum 2-connected m-fold dominating set problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

An approximation algorithm for maximum weight budgeted connected set cover.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Approximation algorithms for minimum weight partial connected set cover problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Restricted connectivity of total digraph.

[BibT_eX]

[DOI]

Zhenhua Liu

Discret. Math. Algorithms Appl., 2016

The 0-1 inverse maximum independent set problem on forests and unicyclic graphs.

[BibT_eX]

[DOI]

Shuaifu Liu

Discret. Math. Algorithms Appl., 2016

Approximation algorithms for minimum (weight) connected k-path vertex cover.

[BibT_eX]

[DOI]

Xiaosong Li

Discret. Appl. Math., 2016

Approximation Approximation for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks.

[BibT_eX]

[DOI]

CoRR, 2016

Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set.

[BibT_eX]

[DOI]

CoRR, 2016

Minimum cost seed set for competitive social influence.

[BibT_eX]

[DOI]

Yuqing Zhu

Deying Li

Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015

Preface.

[BibT_eX]

[DOI]

Lidong Wu

Theor. Comput. Sci., 2015

A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Strongly connected dominating and absorbing set in directed disk graph.

[BibT_eX]

[DOI]

Int. J. Sens. Networks, 2015

Degree sequence realizations with given packing and covering of spanning trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Equitable total-coloring of subcubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set.

[BibT_eX]

[DOI]

CoRR, 2015

Approximation Algorithm for Minimum Weight (k, m)-CDS Problem in Unit Disk Graph.

[BibT_eX]

[DOI]

CoRR, 2015

Approximation algorithm for minimum weight fault-tolerant virtual backbone in homogeneous wireless sensor network.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Fault-tolerant coverage with maximum lifetime in wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014

Approximation algorithm for the minimum weight connected k-subgraph cover problem.

[BibT_eX]

[DOI]

Yaping Zhang

Theor. Comput. Sci., 2014

Minimum vertex cover in ball graphs through local search.

[BibT_eX]

[DOI]

J. Glob. Optim., 2014

A greedy algorithm for the fault-tolerant connected dominating set in a general graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Spanning 3-connected index of graphs.

[BibT_eX]

[DOI]

Wei Xiong

Hong-Jian Lai

J. Comb. Optim., 2014

The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs.

[BibT_eX]

[DOI]

Fengxia Liu

Graphs Comb., 2014

On the existence of super edge-connected graphs with prescribed degrees.

[BibT_eX]

[DOI]

Discret. Math., 2014

On strongly Z2s-1-connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Approximation Algorithm for the Balanced 2-Connected Bipartition Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Approximation Algorithm for the Minimum Connected k -Path Vertex Cover Problem.

[BibT_eX]

[DOI]

Xiaosong Li

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2013

Optimally restricted edge connected elementary Harary graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Max-min weight balanced connected partition.

[BibT_eX]

[DOI]

J. Glob. Optim., 2013

Constant-approximation for optimal data aggregation with physical interference.

[BibT_eX]

[DOI]

J. Glob. Optim., 2013

A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs.

[BibT_eX]

[DOI]

Xiangming Yu

Inf. Sci., 2013

2012

Radar placement along banks of river.

[BibT_eX]

[DOI]

J. Glob. Optim., 2012

Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Algorithms for the minimum weight k-fold (connected) dominating set problem.

[BibT_eX]

[DOI]

Wenkai Ma

Deying Li

J. Comb. Optim., 2012

On cyclic vertex-connectivity of Cartesian product digraphs.

[BibT_eX]

[DOI]

Da Huang

J. Comb. Optim., 2012

Diameter Vulnerability of Directed cycles and Directed Tori.

[BibT_eX]

[DOI]

Xiaoyan Ma

Discret. Math. Algorithms Appl., 2012

A New Proof for Zassenhaus-Groemer-Oler inequality.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2012

On the connectivity of p-diamond-free vertex transitive graphs.

[BibT_eX]

[DOI]

Yingzhi Tian

Discret. Appl. Math., 2012

Edge fault tolerance of graphs with respect to super edge connectivity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Preface.

[BibT_eX]

[DOI]

Yingfei Dong

Theor. Comput. Sci., 2011

On minimum submodular cover with submodular cost.

[BibT_eX]

[DOI]

J. Glob. Optim., 2011

Super cyclically edge connected transitive graphs.

[BibT_eX]

[DOI]

Bing Wang

J. Comb. Optim., 2011

PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs.

[BibT_eX]

[DOI]

Lidan Fan

Wei Wang

J. Comb. Optim., 2011

Cyclic Connectivity of Star Graph.

[BibT_eX]

[DOI]

Zhihua Yu

Discret. Math. Algorithms Appl., 2011

Restricted Edge Connectivity of Harary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2010

A PTAS for minimum d-hop connected dominating set in growth-bounded graphs.

[BibT_eX]

[DOI]

Optim. Lett., 2010

Sufficient conditions for a graph to be lambdak-optimal with given girth and diameter.

[BibT_eX]

[DOI]

Networks, 2010

Fast Information Propagation in Social Networks.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

The existence and upper bound for two types of restricted connectivity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Double-super-connected digraphs.

[BibT_eX]

[DOI]

Juan Liu

Discret. Appl. Math., 2010

A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Cyclic Vertex Connectivity of Star Graphs.

[BibT_eX]

[DOI]

Zhihua Yu

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

PTAS for connected vertex cover in unit disk graphs.

[BibT_eX]

[DOI]

Xiaofeng Gao

Theor. Comput. Sci., 2009

Algorithms for connected set cover problem and fault-tolerant connected set cover problem.

[BibT_eX]

[DOI]

Xiaofeng Gao

Theor. Comput. Sci., 2009

Construction of strongly connected dominating sets in asymmetric multihop wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Optimal placements of replicas in a ring network with majority voting protocol.

[BibT_eX]

[DOI]

Shashi Shekhar

J. Parallel Distributed Comput., 2009

A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks.

[BibT_eX]

[DOI]

J. Glob. Optim., 2009

A better constant-factor approximation for weighted dominating set in unit disk graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Two Algorithms for Connected R-Hop k-Dominating Set.

[BibT_eX]

[DOI]

Deying Li

Discret. Math. Algorithms Appl., 2009

On cyclic edge-connectivity of transitive graphs.

[BibT_eX]

[DOI]

Bing Wang

Discret. Math., 2009

Edges of degree k in minimally restricted k-edge connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Super-connected arc-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Minimally 3-restricted edge connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Latency-Bounded Minimum Influential Node Selection in Social Networks.

[BibT_eX]

[DOI]

Feng Zou

Proceedings of the Wireless Algorithms, 2009

Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 20th International Conference, 2009

2008

Super-connected edge transitive graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Minimally restricted edge connected graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2008

PTAS for Minimum Connected Dominating Set in Unit Ball Graph.

[BibT_eX]

[DOI]

Proceedings of the Wireless Algorithms, 2008

Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Wireless Algorithms, 2008

Minimum Power Strongly Connected Dominating Sets in Wireless Networks.

[BibT_eX]

Proceedings of the 2008 International Conference on Wireless Networks, 2008

Optimal Placements in Ring Network for Data Replicas in Distributed Database with MajorityVoting Protocol.

[BibT_eX]

[DOI]

Shashi Shekhar

Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008

(6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph.

[BibT_eX]

[DOI]

Xiaofeng Gao

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs.

[BibT_eX]

[DOI]

Xiaodong Liang

Graphs Comb., 2007

2006

Semi-hyper-connected edge transitive graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

On optimally-lambda(3) transitive graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Restricted Edge Connectivity of Edge Transitive Graphs.

[BibT_eX]

Ars Comb., 2006

2005

The transformation graph Gxyz when xyz=-++.

[BibT_eX]

[DOI]

Baoyindureng Wu

Li Zhang

Discret. Math., 2005

2003

Number of minimum vertex cuts in transitive graphs.

[BibT_eX]

[DOI]