Xiao-Dong Hu

Zhuo Diao

J. Comb. Optim., 2022

2021

Algorithms for the metric ring star problem with fixed edge-cost ratio.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

2020

The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Sequential Location Game on Continuous Directional Star Networks.

[BibT_eX]

[DOI]

Mengqi Zhang

Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

2019

The Price of Anarchy for the Load Balancing Game with a Randomizing Scheduler.

[BibT_eX]

[DOI]

Xiaoying Wu

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

Covering Triangles in Edge-Weighted Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty.

[BibT_eX]

[DOI]

Chenhao Wang

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017

Approximation algorithms for pricing with negative network externalities.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

A novel feed-forward segmented digital automatic gain control algorithm for long-term evolution digital radio-over-fibre systems.

[BibT_eX]

[DOI]

IET Commun., 2017

Finding connected k-subgraphs with high density.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Continuous Firefighting on Infinite Square Grids.

[BibT_eX]

[DOI]

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

Efficient Mechanism Design for Online Scheduling (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Algorithms for the Ring Star Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Approximation for the minimum cost doubly resolving set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Network Characterizations for Excluding Braess's Paradox.

[BibT_eX]

[DOI]

Zhuo Diao

Theory Comput. Syst., 2016

Efficient Mechanism Design for Online Scheduling.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Total Dual Integrality of Triangle Covering.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Balancing Load via Small Coalitions in Selfish Ring Routing Games.

[BibT_eX]

[DOI]

Weidong Ma

Asia Pac. J. Oper. Res., 2015

Finding Connected Dense k -Subgraphs.

[BibT_eX]

[DOI]

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

Excluding Braess's Paradox in Nonatomic Selfish Routing.

[BibT_eX]

[DOI]

Zhuo Diao

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Selling Reserved Instances in Cloud Computing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Pricing in Social Networks with Negative Externalities.

[BibT_eX]

[DOI]

Proceedings of the Computational Social Networks - 4th International Conference, 2015

New Mechanism for Reservation in Cloud Computing.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

The Price of Anarchy for Selfish Ring Routing is Two.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2014

Enumeration of digraph embeddings.

[BibT_eX]

[DOI]

Yichao Chen

Jonathan L. Gross

Eur. J. Comb., 2014

Approximability of the Minimum Weighted Doubly Resolving Set Problem.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Reducing price of anarchy of selfish task allocation with more selfishness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

On the union of intermediate nodes of shortest paths.

[BibT_eX]

[DOI]

Xiang Li

Wonjun Lee

J. Comb. Optim., 2013

2012

Pairwise cooperations in selfish ring routing for minimax linear latency.

[BibT_eX]

[DOI]

Weidong Ma

Theor. Comput. Sci., 2012

The Maximum-Weight Stable Matching Problem: Duality and Efficiency.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

A New Proof for Zassenhaus-Groemer-Oler inequality.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2012

Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Preface.

[BibT_eX]

[DOI]

Ding-Zhu Du

Panos M. Pardalos

Theor. Comput. Sci., 2011

Deterministic risk control for cost-effective network connections.

[BibT_eX]

[DOI]

Eduardo Álvarez-Miranda

Theor. Comput. Sci., 2011

Preface.

[BibT_eX]

[DOI]

Jie Wang

J. Comb. Optim., 2011

2010

Approximation algorithm for minimal convergecast time problem in wireless sensor networks.

[BibT_eX]

[DOI]

Peng-Jun Wan

Wirel. Networks, 2010

The conditional diagnosability of shuffle-cubes.

[BibT_eX]

[DOI]

Songpu Shang

J. Syst. Sci. Complex., 2010

The price of atomic selfish ring routing.

[BibT_eX]

[DOI]

Bo Chen

J. Comb. Optim., 2010

Roman domination and its Variants in Unit Disk Graphs.

[BibT_eX]

[DOI]

Xiumei Wang

Discret. Math. Algorithms Appl., 2010

Recent Advances in Computation and Combinatorial Optimization.

[BibT_eX]

[DOI]

Jie Wang

Algorithmica, 2010

Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations.

[BibT_eX]

[DOI]

Weidong Ma

Proceedings of the Combinatorial Optimization and Applications, 2010

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.

[BibT_eX]

[DOI]

Eduardo Álvarez-Miranda

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Conditional Diagnosability of Matching Composition Networks Under the PMC Model.

[BibT_eX]

[DOI]

Krishnaiyan Thulasiraman

IEEE Trans. Circuits Syst. II Express Briefs, 2009

Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2009

A polynomial solvable minimum risk spanning tree problem with interval data.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

A new model for path planning with interval data.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

2008

Improved Algorithm for Minimum Data Aggregation Time Problem in Wireless Sensor Networks.

[BibT_eX]

[DOI]

J. Syst. Sci. Complex., 2008

Inapproximability and approximability of minimal tree routing and coloring.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

On minimum m -connected k -dominating set problem in unit disc graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

A full-scale solution to the rectilinear obstacle-avoiding Steiner problem.

[BibT_eX]

[DOI]

Integr., 2008

Identifying codes of cycles with odd orders.

[BibT_eX]

[DOI]

Krishnaiyan Thulasiraman

Eur. J. Comb., 2008

Steiner tree problems in computer communication networks.

[BibT_eX]

Ding-Zhu Du

World Scientific, ISBN: 978-981-279-144-3, 2008

2007

Algorithms for minimum m-connected k-tuple dominating set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

lambda-OAT: lambda-Geometry Obstacle-Avoiding Tree Construction With O(nlog n) Complexity.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007

A Min-Max Theorem on Tournaments.

[BibT_eX]

[DOI]

Wenan Zang

SIAM J. Comput., 2007

Energy efficient multicast routing in ad hoc wireless networks.

[BibT_eX]

[DOI]

Comput. Commun., 2007

On the restricted forwarding index problem in communication networks.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2007

Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes.

[BibT_eX]

[DOI]

Jun-Ming Xu

Appl. Math. Comput., 2007

New Algorithm for Minimum Multicast Time Problem in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE Wireless Communications and Networking Conference, 2007

The Roman Domination Problem in Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

On the Minimum Risk-Sum Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

Algorithms for Minimum m -Connected k -Dominating Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

The Minimum Risk Spanning Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

A Min-Max Relation on Packing Feedback Vertex Sets.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2006

Inapproximability and approximability of maximal tree routing and coloring.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

Energy efficient information dissemination protocols by negotiation for wireless sensor networks.

[BibT_eX]

[DOI]

Dandan Liu

Comput. Commun., 2006

Energy efficient routing and scheduling for real-time data aggregation in WSNs.

[BibT_eX]

[DOI]

Hongwei Du

Comput. Commun., 2006

Edge-bipancyclicity of star graphs under edge-fault tolerant.

[BibT_eX]

[DOI]

Qiang Zhu

Appl. Math. Comput., 2006

Minimum Multicast Time Problem in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Wireless Algorithms, 2006

An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the lambda-geometry plane.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Symposium on Physical Design, 2006

Average lengths of wire routing under M-architecture and X-architecture.

[BibT_eX]

[DOI]

S. P. Shang

Tong Jing

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

DraXRouter: global routing in X-Architecture with dynamic resource assignment.

[BibT_eX]

[DOI]

Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASP-DAC 2006, 2006

Energy Efficient Protocols for Information Dissemination in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Dandan Liu

Proceedings of the Advanced Web and Network Technologies, and Applications, 2006

Connected Set Cover Problem and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

A Routing Paradigm with Novel Resources Estimation and Routability Models for X-Architecture Based Physical Design.

[BibT_eX]

[DOI]

Proceedings of the Embedded Computer Systems: Architectures, 2005

Minimum Data Aggregation Time Problem in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Mobile Ad-hoc and Sensor Networks, First International Conference, 2005

Routing and Coloring for Maximal Number of Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Rotational Steiner Ratio Problem Under Uniform Orientation Metrics.

[BibT_eX]

[DOI]

Songpu Shang

Tong Jing

Proceedings of the Discrete Geometry, 2005

The polygonal contraction heuristic for rectilinear Steiner tree construction.

[BibT_eX]

[DOI]

Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

An-OARSMan: obstacle-avoiding routing tree construction with good length performance.

[BibT_eX]

[DOI]

Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

Via-Aware Global Routing for Good VLSI Manufacturability and High Yield.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE International Conference on Application-Specific Systems, 2005

Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

Complexity of Minimal Tree Routing and Coloring.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004

Routing algorithm for multicast under multi-tree model in optical networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks.

[BibT_eX]

[DOI]

Comput. Commun., 2004

An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design.

[BibT_eX]

[DOI]

Proceedings of the Integrated Circuit and System Design, 2004

Optimal Data Replica Placements in Linear Bus Networks.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Multicast Routing and Wavelength Assignment in WDM Networks with Limited Drop-offs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003

On the optimal placement of wavelength converters in WDM networks.

[BibT_eX]

[DOI]

Comput. Commun., 2003

Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet.

[BibT_eX]

[DOI]

Comput. J., 2003

2002

Algorithms for multicast connection under multi-path routing model.

[BibT_eX]

[DOI]

Jun Gu

Mu-Hong Zhang

Inf. Process. Lett., 2002

Multicast routing, load balancing, and wavelength assignment on tree of rings.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2002

Rivest-Vuillemin conjecture is true for monotone boolean functions with twelve variables.

[BibT_eX]

[DOI]

Discret. Math., 2002

Placement of Wavelength Converters for Minimal Wavelength Usage in WDM Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001

Wire segmenting for buffer insertion based on RSTP-MSP.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Approximations for Steiner trees with minimum number of Steiner points.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Optimization of wavelength assignment for QoS multicast in WDM networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2001

Converter Placement Supporting Broadcast in WDM Optical Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2001

Placement of Data Replicas for Optimal Data Availability in Ring Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2001

Monotone Routing in Multirate Rearrangeable Clos Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2001

Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks.

[BibT_eX]

[DOI]

Ding-Zhu Du

Comput. Commun., 2001

Optimal Placement of Web Proxies for Replicated Web Servers in the Internet.

[BibT_eX]

[DOI]

Comput. J., 2001

Placement of Read-Write Web Proxies in the Internet.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

2000

Minimizing number of wavelengths in multicast routing trees in WDM networks.

[BibT_eX]

[DOI]

Networks, 2000

On Shortest k-Edge-Connected Steiner Networks in Metric Spaces.

[BibT_eX]

[DOI]

Xiufeng Du

J. Comb. Optim., 2000

On Minimum-Weight k-Edge Connected Steiner Networks on Metric Spaces.

[BibT_eX]

[DOI]

D. Frank Hsu

Guo-Hui Lin

Graphs Comb., 2000

On shortest three-edge-connected Steiner networks with Euclidean distance.

[BibT_eX]

[DOI]

D. Frank Hsu

Discret. Appl. Math., 2000

Optimal Placement of Proxies of Replicated Web Servers in the Internet.

[BibT_eX]

[DOI]

Proceedings of the WISE 2000, 2000

A new wavelength assignment method for minimal wavelength conversions in WDM networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Conference on Computer Communications and Networks, 2000

1999

Nontrivial Monotone Weakly Symmetric Boolean Functions with Six Variables are Elusive.

[BibT_eX]

[DOI]

Sui-Xiang Gao

Weili Wu

Theor. Comput. Sci., 1999

On Rearrangeability of Multirate Clos Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables.

[BibT_eX]

[DOI]

J. Complex., 1999

1998

On shortest two-connected Steiner networks with Euclidean distance.

[BibT_eX]

[DOI]

D. Frank Hsu

Networks, 1998

1997

Exact reliabilities of most reliable double-loop networks.

[BibT_eX]

[DOI]

Paul E. Wright

Networks, 1997

1994

A New Competitive Algorithm for the Counterfeit Coin Problem.

[BibT_eX]

[DOI]

P. D. Chen

Inf. Process. Lett., 1994

Cutting Numbers for the Forward Loop Backward Hop Network.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Most reliable double loop networks in survival reliability.

[BibT_eX]

[DOI]

Wen-Ch'ing Winnie Li

Networks, 1993

1992

Reliabilities of chordal rings.

[BibT_eX]

[DOI]

Frank Kwang-Ming Hwang

Networks, 1992

An Improved Upper Bound for the Subarray Partial Concentrators.

[BibT_eX]

[DOI]