Xiao-Dong Hu

According to our database1, Xiao-Dong Hu authored at least 133 papers between 1992 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Implementation and Optimization of a CFD Solver Using Overlapped Meshes on Multiple MIC Coprocessors.
Scientific Programming, 2019

Geo-parcel-based geographical thematic mapping using C5.0 decision tree: a case study of evaluating sugarcane planting suitability.
Earth Science Informatics, 2019

2018
A Minimal Dataset Construction Method Based on Similar Training for Capture Position Recognition of Space Robot.
Wireless Personal Communications, 2018

A Thin-Cloud Mask Method for Remote Sensing Images Based on Sparse Dark Pixel Region Detection.
Remote Sensing, 2018

Covering Triangles in Edge-Weighted Graphs.
Theory Comput. Syst., 2018

The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017
Adaptive Scale Selection for Multiscale Segmentation of Satellite Images.
IEEE J Sel. Topics in Appl. Earth Observ. and Remote Sensing, 2017

Parallelization of an Unsteady ALE Solver with Deforming Mesh Using OpenACC.
Scientific Programming, 2017

Geo-Parcel Based Crop Identification by Integrating High Spatial-Temporal Resolution Imagery from Multi-Source Satellite Data.
Remote Sensing, 2017

Approximation algorithms for pricing with negative network externalities.
J. Comb. Optim., 2017

On the Design of High Precision Factory Temperature Control System Based on Wireless Sensor.
Int. J. Online Eng., 2017

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

Finding connected k-subgraphs with high density.
Inf. Comput., 2017

Continuous Firefighting on Infinite Square Grids.
Proceedings of the Theory and Applications of Models of Computation, 2017

Efficient Mechanism Design for Online Scheduling (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Algorithms for the Ring Star Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Approximation for the minimum cost doubly resolving set problem.
Theor. Comput. Sci., 2016

Network Characterizations for Excluding Braess's Paradox.
Theory Comput. Syst., 2016

Efficient Mechanism Design for Online Scheduling.
J. Artif. Intell. Res., 2016

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Total Dual Integrality of Triangle Covering.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Geometric Parameters Estimation and Calibration in Cone-Beam Micro-CT.
Sensors, 2015

Balancing Load via Small Coalitions in Selfish Ring Routing Games.
APJOR, 2015

Finding Connected Dense k -Subgraphs.
Proceedings of the Theory and Applications of Models of Computation, 2015

Excluding Braess's Paradox in Nonatomic Selfish Routing.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Selling Reserved Instances in Cloud Computing.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Pricing in Social Networks with Negative Externalities.
Proceedings of the Computational Social Networks - 4th International Conference, 2015

New Mechanism for Reservation in Cloud Computing.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
The Price of Anarchy for Selfish Ring Routing is Two.
ACM Trans. Economics and Comput., 2014

Multiscale Water Body Extraction in Urban Environments From Satellite Images.
IEEE J Sel. Topics in Appl. Earth Observ. and Remote Sensing, 2014

Investigation on Blind Tip Reconstruction Errors Caused by Sample Features.
Sensors, 2014

Enumeration of digraph embeddings.
Eur. J. Comb., 2014

Real-time Dynamic Visualization Techniques for Massive Geospatial Data.
Proceedings of the 2014 IEEE International Conference on Data Mining Workshops, 2014

2013
Reducing price of anarchy of selfish task allocation with more selfishness.
Theor. Comput. Sci., 2013

On the union of intermediate nodes of shortest paths.
J. Comb. Optim., 2013

An Investigation of Calibration Phantoms for CT Scanners with Tube Voltage Modulation.
Int. J. Biomedical Imaging, 2013

2012
Pairwise cooperations in selfish ring routing for minimax linear latency.
Theor. Comput. Sci., 2012

The Maximum-Weight Stable Matching Problem: Duality and Efficiency.
SIAM J. Discrete Math., 2012

A New Proof for Zassenhaus-Groemer-Oler inequality.
Discrete Math., Alg. and Appl., 2012

The Price of Anarchy for Selfish Ring Routing Is Two.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Adaptive extraction of water in urban areas based on local iteration using high-resolution multi-spectral image.
Proceedings of the 2012 IEEE International Geoscience and Remote Sensing Symposium, 2012

Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
Preface.
Theor. Comput. Sci., 2011

Deterministic risk control for cost-effective network connections.
Theor. Comput. Sci., 2011

Preface.
J. Comb. Optim., 2011

2010
Approximation algorithm for minimal convergecast time problem in wireless sensor networks.
Wireless Networks, 2010

The conditional diagnosability of shuffle-cubes.
J. Systems Science & Complexity, 2010

The price of atomic selfish ring routing.
J. Comb. Optim., 2010

Roman domination and its Variants in Unit Disk Graphs.
Discrete Math., Alg. and Appl., 2010

Recent Advances in Computation and Combinatorial Optimization.
Algorithmica, 2010

Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations.
Proceedings of the Combinatorial Optimization and Applications, 2010

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Conditional Diagnosability of Matching Composition Networks Under the PMC Model.
IEEE Trans. on Circuits and Systems, 2009

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

A polynomial solvable minimum risk spanning tree problem with interval data.
European Journal of Operational Research, 2009

A new model for path planning with interval data.
Computers & OR, 2009

A New Product Development Cost Estimation Method Based on the Optimal Weight Combination.
Proceedings of the Fifth International Conference on Natural Computation, 2009

2008
Improved Algorithm for Minimum Data Aggregation Time Problem in Wireless Sensor Networks.
J. Systems Science & Complexity, 2008

Inapproximability and approximability of minimal tree routing and coloring.
J. Discrete Algorithms, 2008

On minimum m -connected k -dominating set problem in unit disc graphs.
J. Comb. Optim., 2008

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

Identifying codes of cycles with odd orders.
Eur. J. Comb., 2008

Steiner tree problems in computer communication networks.
World Scientific, ISBN: 978-981-279-144-3, 2008

2007
Algorithms for minimum m-connected k-tuple dominating set problem.
Theor. Comput. Sci., 2007

lambda-OAT: lambda-Geometry Obstacle-Avoiding Tree Construction With O(nlog n) Complexity.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2007

A Min-Max Theorem on Tournaments.
SIAM J. Comput., 2007

Energy efficient multicast routing in ad hoc wireless networks.
Computer Communications, 2007

On the restricted forwarding index problem in communication networks.
Computers & Mathematics with Applications, 2007

Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes.
Applied Mathematics and Computation, 2007

New Algorithm for Minimum Multicast Time Problem in Wireless Sensor Networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2007

The Roman Domination Problem in Unit Disk Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

On the Minimum Risk-Sum Path Problem.
Proceedings of the Combinatorics, 2007

Algorithms for Minimum m -Connected k -Dominating Set Problem.
Proceedings of the Combinatorial Optimization and Applications, 2007

The Minimum Risk Spanning Tree Problem.
Proceedings of the Combinatorial Optimization and Applications, 2007

2006
ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm.
J. Comput. Sci. Technol., 2006

Inapproximability and approximability of maximal tree routing and coloring.
J. Comb. Optim., 2006

Energy efficient information dissemination protocols by negotiation for wireless sensor networks.
Computer Communications, 2006

Energy efficient routing and scheduling for real-time data aggregation in WSNs.
Computer Communications, 2006

Edge-bipancyclicity of star graphs under edge-fault tolerant.
Applied Mathematics and Computation, 2006

Minimum Multicast Time Problem in Wireless Sensor Networks.
Proceedings of the Wireless Algorithms, 2006

An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the lambda-geometry plane.
Proceedings of the 2006 International Symposium on Physical Design, 2006

Average lengths of wire routing under M-architecture and X-architecture.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

DraXRouter: global routing in X-Architecture with dynamic resource assignment.
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.
Proceedings of the Advanced Web and Network Technologies, and Applications, 2006

Connected Set Cover Problem and Its Applications.
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.
Proceedings of the Embedded Computer Systems: Architectures, 2005

Minimum Data Aggregation Time Problem in Wireless Sensor Networks.
Proceedings of the Mobile Ad-hoc and Sensor Networks, First International Conference, 2005

A Min-Max Relation on Packing Feedback Vertex Sets.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Routing and Coloring for Maximal Number of Trees.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Rotational Steiner Ratio Problem Under Uniform Orientation Metrics.
Proceedings of the Discrete Geometry, 2005

The polygonal contraction heuristic for rectilinear Steiner tree construction.
Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

An-OARSMan: obstacle-avoiding routing tree construction with good length performance.
Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

Via-Aware Global Routing for Good VLSI Manufacturability and High Yield.
Proceedings of the 16th IEEE International Conference on Application-Specific Systems, 2005

Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

Complexity of Minimal Tree Routing and Coloring.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
Routing algorithm for multicast under multi-tree model in optical networks.
Theor. Comput. Sci., 2004

Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks.
Computer Communications, 2004

An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design.
Proceedings of the Integrated Circuit and System Design, 2004

Optimal Data Replica Placements in Linear Bus Networks.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Multicast Routing and Wavelength Assignment in WDM Networks with Limited Drop-offs.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003
On the optimal placement of wavelength converters in WDM networks.
Computer Communications, 2003

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

2002
Algorithms for multicast connection under multi-path routing model.
Inf. Process. Lett., 2002

Multicast routing, load balancing, and wavelength assignment on tree of rings.
IEEE Communications Letters, 2002

Rivest-Vuillemin conjecture is true for monotone boolean functions with twelve variables.
Discrete Mathematics, 2002

Placement of Wavelength Converters for Minimal Wavelength Usage in WDM Networks.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001
Wire segmenting for buffer insertion based on RSTP-MSP.
Theor. Comput. Sci., 2001

Approximations for Steiner trees with minimum number of Steiner points.
Theor. Comput. Sci., 2001

Optimization of wavelength assignment for QoS multicast in WDM networks.
IEEE Trans. Communications, 2001

Converter Placement Supporting Broadcast in WDM Optical Networks.
IEEE Trans. Computers, 2001

Placement of Data Replicas for Optimal Data Availability in Ring Networks.
J. Parallel Distrib. Comput., 2001

Monotone Routing in Multirate Rearrangeable Clos Networks.
J. Parallel Distrib. Comput., 2001

Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks.
Computer Communications, 2001

Optimal Placement of Web Proxies for Replicated Web Servers in the Internet.
Comput. J., 2001

Placement of Read-Write Web Proxies in the Internet.
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.
Networks, 2000

Approximations for Steiner Trees with Minimum Number of Steiner Points.
J. Global Optimization, 2000

On Shortest k-Edge-Connected Steiner Networks in Metric Spaces.
J. Comb. Optim., 2000

On Minimum-Weight k-Edge Connected Steiner Networks on Metric Spaces.
Graphs and Combinatorics, 2000

On shortest three-edge-connected Steiner networks with Euclidean distance.
Discrete Applied Mathematics, 2000

Optimal Placement of Proxies of Replicated Web Servers in the Internet.
Proceedings of the WISE 2000, 2000

A new wavelength assignment method for minimal wavelength conversions in WDM networks.
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.
Theor. Comput. Sci., 1999

On Rearrangeability of Multirate Clos Networks.
SIAM J. Comput., 1999

The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables.
J. Complexity, 1999

1998
On shortest two-connected Steiner networks with Euclidean distance.
Networks, 1998

1997
Exact reliabilities of most reliable double-loop networks.
Networks, 1997

1994
A New Competitive Algorithm for the Counterfeit Coin Problem.
Inf. Process. Lett., 1994

Cutting Numbers for the Forward Loop Backward Hop Network.
Discrete Applied Mathematics, 1994

1993
Most reliable double loop networks in survival reliability.
Networks, 1993

1992
Reliabilities of chordal rings.
Networks, 1992

An Improved Upper Bound for the Subarray Partial Concentrators.
Discrete Applied Mathematics, 1992


  Loading...