Curriculum Vitae of Guoliang (Larry) Xue, January

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 0 Contents 1 CONTACT INFORMATION 1 2 EDUCATION 1 3 ACADEMIC EXPERIENCE 1 4 HONORS AND AWARDS 1 5 RESEARCH CONTRIBUTIONS 2 5.1 QoS Provisioning.................................... 2 5.2 Survivable Network Design............................. 3 5.3 Optimization...................................... 4 6 RESEARCH GRANTS 5 6.1 FEDERAL RESEARCH GRANTS........................ 5 6.2 EQUIPMENT, CONFERENCE AND OTHER GRANTS.......... 6 7 PUBLICATIONS 7 7.1 REFEREED JOURNAL PAPERS (J81-J01).................. 7 7.2 EDITORIAL ARTICLES (E04-E01)........................ 14 7.3 BOOK CHAPTERS (B09-B01)........................... 15 7.4 REFEREED CONFERENCE PAPERS (C84-C01).............. 16 7.5 TECHNICAL REPORTS (T01).......................... 25 8 PROFESSIONAL SERVICES 26 8.1 JOURNAL EDITORSHIP.............................. 26 8.2 PROFESSIONAL SOCIETIES........................... 26 8.3 CONFERENCE ACTIVITIES........................... 26 9 GRADUATE STUDENTS SUPERVISED 27 9.1 PHD STUDENTS GRADUATED......................... 27 9.2 MS STUDENTS GRADUATED.......................... 28 9.3 POSTDOCTORAL FELLOWS SUPERVISED................. 29 10 TEACHING 29

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 1 1 CONTACT INFORMATION Guoliang (Larry) Xue Computer Science and Engineering Arizona State University, Tempe, AZ 85287-8809 Phone: (480) 965-6218, Email: xue@asu.edu, URL: http://optimization.asu.edu/ xue 2 EDUCATION Postdoc at Army High Performance Computing Research Center, June 1991-August 1993. PhD in Computer Science, June 1991, University of Minnesota, Twin Cities, USA. MS in Operations Research, December 1984, Qufu Normal University, Qufu, China. BS in Mathematics, February 1982, Qufu Normal University, Qufu, China. 3 ACADEMIC EXPERIENCE Full Professor (with tenure) (08/16/05 present) Department of Computer Science and Engineering, Arizona State University, Tempe, Arizona. Associate Professor (with tenure) (08/16/01 06/30/05) Department of Computer Science and Engineering, Arizona State University, Tempe, Arizona. Associate Professor (with tenure) (06/01/99 08/15/01) Department of Computer Science, University of Vermont, Burlington, Vermont. Assistant Professor (tenure-track) (09/01/93 05/31/99) Department of Computer Science, University of Vermont, Burlington, Vermont. Postdoctoral Fellow (06/16/91 08/15/93) Army High Performance Computing Research Center, Minneapolis, Minnesota. Lecturer (12/16/84 09/15/87) Institute of Operations Research, Qufu Normal University, Qufu, China. 4 HONORS AND AWARDS IEEE Communications Society Distinguished Lecturer, 2010-2011. TPC co-chair for IEEE INFOCOM 2010, San Diego, March 14-19, 2010. Keynote Speaker at IEEE IPCCC 2009, Phoenix, Arizona, December 14-15, 2009. Distinguished Invited Speaker at IEEE ICCCN 2008, St. Thomas, US Virgin Islands, August 3-7, 2008. Best Paper Award from IEEE Globecom 2007 for the paper titled, Multiconstrained QoS routing: Greedy is good, co-authored with Weiyi Zhang. NSF Research Initiation Award, 1994-1997.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 2 5 RESEARCH CONTRIBUTIONS 5.1 QoS Provisioning C54: Jian Tang, Guoliang Xue, Weiyi Zhang; Interference-aware topology control and QoS routing in multi-channel wireless mesh networks ; ACM MOBIHOC 2005, pp. 68 77. Different channel assignments can lead to different topologies in a multi-channel wireless mesh network. We introduce the concept of co-channel interference and present a simple channel assignment to construct a K-connected topology with low interference. We propose, for the first time, to use quality of service (QoS) guarantees to model the problem of interference aware routing and scheduling in multi-hop multi-channel wireless mesh networks. One of the challenges in interference-aware routing is the presence of intra-flow interference where the flow on some link of the path may interfere with the flow of another link on the same path. A novel linear programming based approach is proposed to deal with both intra-flow interference and inter-flow interference. The paper has been cited more than 200 times according to Google Scholar. J74: Guoliang Xue, Weiyi Zhang, Jian Tang, and Krishnaiyan Thulasiraman; Polynomial time approximation algorithms for multi-constrained QoS routing ; IEEE/ACM Transactions on Networking; Vol. 16(2008), pp. 656-669. This paper studies the classical multi-constrained QoS routing problem. Given a source node and a destination node, we are interested in computing a source-to-destination path that satisfies one additive QoS constraint, while optimizing K-1 other additive QoS constraints. For this NP-hard problem, we present a fully polynomial time approximation scheme (FPTAS), which can find (1 + ɛ)-approximations in polynomial time. For the case of K = 2, our FPTAS improves the state of the art with a lower time complexity. For the general case, our FPTAS runs an order V faster than the previous best algorithm. J69: Guoliang Xue, Arunabha Sen Weiyi Zhang, Jian Tang, and Krishnaiyan Thulasiraman; Finding a path subject to many additive QoS constraints ; IEEE/ACM Transactions on Networking; Vol. 15(2007), pp. 201 211. In this paper, we study the problem of computing a source-to-destination path that simultaneously optimizes K 2 additive QoS constraints. We present a novel K-approximation algorithm with running time as low as that of Dijkstra s shortest path algorithm. We also present a fully polynomial time approximation scheme (FPTAS) which can find (1+ɛ)-approximations in time O(m( n ɛ )K 1 ), where n and m are the number of nodes and links in the network. Our FPTAS is asymptotically the fastest possible. C71: Guoliang Xue and Weiyi Zhang; Multiconstrained QoS routing: Greedy is good ; IEEE Global Communications Conference (Globecom 2007); pp. 1866-1871. Best Paper Award. In this paper, we present a very simple hop-by-hop routing algorithm for the problem studied in [J69]. Our algorithm runs as fast as (and is very similar to) Dijkstra s shortest path algorithm. While the proved approximation ratio is K (the same as that of the algorithm

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 3 in [J69]), this algorithm performs much better, demonstrated by extensive computational studies. C81: Satyajayant Misra, Guoliang Xue, and Dejun Yang; Polynomial time approximations for multi-path routing with bandwidth and delay constraints ; IEEE INFOCOM 2009; pp. 558-566. Given a source and a destination, along with a bandwidth requirement B, we are interested in computing a set of source-to-destination paths with an aggregated bandwidth at least B, while minimizing the delay of the longest path in the set. We show that the previous best algorithm can be arbitrarily far from the optimal solution, and present a fully polynomial time approximation scheme for this problem, based on a novel linear programming approach. 5.2 Survivable Network Design J56: Guoliang Xue, Li Chen, and K. Thulasiraman; Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees ; IEEE JSAC Optical Communications and Networking series; Vol. 21(2003), pp. 1332 1345. Medard, Finn, Barry and Gallager proposed the MFBG scheme for computing a pair of red/blue trees that can be used for preplanned recovery (from single failure) in networks. We present the XCT scheme for computing a pair of red/blue trees for preplanned recovery. We demonstrate that every pair of red/blue trees that can be generated by the MFBG scheme can be generated by the XCT scheme, but not vice versa. We also demonstrate that the red/blue trees can be used for recovery from multiple failures, as long as the failures are isolated. We further introduce the concept of quality of protection of a pair of red/blue trees to measure the number of simultaneous isolated failures that the red/blue trees can be used to recover, and show that the quality of protection is equal to the number of ears in an ear decomposition of the pair of red/blue trees. Our scheme has been used by other researchers in the design of survivable routing tables for wireless sensor networks. J73: Weiyi Zhang, Guoliang Xue, Jian Tang, and Krishnaiyan Thulasiraman; Faster algorithms for constructing recovery trees enhancing QoP and QoS ; IEEE/ACM Transactions on Networking; Vol. 16(2008), pp. 642-655. In this paper, we present linear time algorithms for the construction of red/blue trees, further improving the results in [J56]. C68: Weiyi Zhang, Guoliang Xue, and Satyajayant Misra; Fault-tolerant relay node placement in wireless sensor networks: problems and algorithms ; IEEE INFOCOM 2007; pp. 1649 1657. In a wireless sensor network, short range multihop transmission is preferred to prolong the network lifetime due to super-linear nature of energy consumption with transmit distance. Therefore relay nodes are deployed in a wireless sensor network as a means to extend network lifetime. The relay node placement problems aim to meet certain connectivity and/or survivability requirements of the network by deploying a minimum number of relay nodes. In this paper, we formulate the problem of fault-tolerant relay node placement and present O(1)-approximation algorithms for this problem.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 4 C73: Satyajayant Misra, Don Hong, Guoliang Xue, and Jian Tang Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements ; IEEE INFOCOM 2008; pp. 879 887. In practice, there may be some physical constraints on the placement of the relay nodes: there may be a lower bound on the distance between two network nodes to reduce interference; there may be some forbidden regions where relay nodes cannot be placed. Therefore we study two-tiered constrained relay node placement problems, where the relay nodes can only be placed at some pre-specified candidate locations. We present O(1)-approximation algorithms for these problems. An extended version of this paper has been accepted for publication in IEEE/ACM Transactions on Networking. C39: Reid Andersen, Fan Chung, Arunabha Sen, Guoliang Xue; On disjoint path pairs with wavelength continuity constraint in WDM networks ; INFOCOM 2004; pp. 524 535. A fundamental problem in preplanned recovery in WDM optical networks is to compute a pair of link-disjoint lightpaths connecting a source node s to a destination node t in a WDM network. A commonly used heuristic algorithm for this problem is to find the first lightpath (known as the active path) and then find the second lightpath (known as the protection path) without using the links that are used by the first lightpath. This is known as the active path first heuristic. If the active path first heuristic fails to find the first lightpath, it implies that a pair of link-disjoint lightpaths connecting s and t does not exist. However, if the active path first heuristic finds the first lightpath but fails to find the second lightpath, it does not imply that a pair of link-disjoint lightpaths connecting s and t does not exist. For a long time, researchers in the networking community have speculated that finding a pair of link-disjoint lightpaths connecting a pair of source and destination nodes is NP-hard. We proved that this fundamental problem is indeed NP-hard. 5.3 Optimization C40: Xiuzhen Cheng, Andrew Thaeler, Guoliang Xue, Dechang Chen; TPS: A time-based positioning scheme for outdoor wireless sensor networks, INFOCOM 2004; pp. 2685 2696. This paper presents a simple and robust localization scheme for wireless sensor networks. The advantage of this scheme over other localization schemes is two-fold. First, this scheme does not require both RF and ultra sound signals. Second, this scheme is completely localized. It does not require synchronization among the sensor nodes and the anchor nodes. The paper has been cited over 130 times according to Google Scholar. J27: Guoliang Xue and Yinyu Ye; An efficient algorithm for minimizing a sum of Euclidean norms with applications ; SIAM Journal on Optimization; Vol. 7(1997), pp. 1017 1036. Many optimization problems (such as the Euclidean multifacility location problem) can be transformed into the minimization of a sum of Euclidean norms. While there have been some iterative algorithms for this problem which converges to the optimal solution in the limit, there have been no known polynomial time algorithms for this problem. In this paper, we

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 5 present primal-dual potential reduction algorithms for this problem, and prove its polynomial time complexity. More than a decade later, the results in this paper is still the best known for this problem. In a companion paper [J41] (also published in the SIAM Journal on Optimization), we presented polynomial time algorithm for minimizing a sum of p-norms for any p [1, ]. The paper has been cited 86 times according to Google Scholar. T01: Brett M. Averick, Richard G. Carter, Jorge J. More, and Guo-Liang Xue; The MINPACK-2 Test Problem Collection ; Preprint MCS-P153-0692; June 1992; Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL. MINPACK is an optimization package for many nonlinear optimization problems. MINPACK- 2 is an enhancement of MINPCAK, suitable for advanced computer architectures. An novel part of MINPACK-2 is the inclusion of a large number of real world test problems. This technical report present a collection of these problems and their solutions via the application of the optimization software in MINPACK-2. Although never formally published in a journal or conference form, this document has been cited 122 times according to Google Scholar. 6 RESEARCH GRANTS 6.1 FEDERAL RESEARCH GRANTS I have been continuously supported by NSF and ARO since the second year of my academic appointment, with my share exceeding $2,500,000 in federal research grants on fundamental research. PI: $355,016 from ARO, 100% to Xue; Multiconstrained Multipath Routing ; 08/25/2009 08/24/2013. PI: $333,521 from NSF, 67% to Xue (Junshan Zhang is the Co-PI); IHCS: Improving Coverage and Connectivity in Heterogeneous Wireless Sensor Networks through Relay, Cooperation, and Mobility ; 08/01/2009 07/31/2012. Co-PI: $400,000 from NSF, 33% to Xue (Junshan Zhang is the PI); NeTS: Medium: Collaborative Research: MIMO-Pipe Modeling, Scheduling and Delay Analysis in Multi-hop MIMO Networks ; 08/01/2009 07/31/2012. PI: $256,000 from NSF, 100% to Xue; SING: Efficient Survivable Routing in Next Generation Networks ; 09/01/2008 08/31/2011. PI: $108,000 from NSF, 100% to Xue; NeTS-WN: Collaborative Research: Cross-layer Optimization for Dynamic Spectrum Access Wireless Mesh Networks ; 09/01/2007 02/28/2010.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 6 Co-PI: $200,000 from NSF, 30% to Xue (Stephen Yau is the PI); Collaborative research: CT-T: Security and survivability of real-time systems with MANETs 09/01/2005 08/31/2008. PI: $255,734 from ARO, 100% to Xue; Robustness and Survivability Issues in Wireless Ad Hoc Networks ; 08/01/2004 07/31/2008. PI: $212,000 from NSF, 100% to Xue; Numerical and Combinatorial Algorithms for Location Problems arising in Wireless Sensor Networks and Other Applications ; 08/01/2004 07/30/2008. PI: $168,500 from NSF, 100% to Xue; ITR Collaborative Research: Fault Tolerance in WDM Optical Networks: Multifailure Recovery and Multilayer Survivability ; 09/01/2003 08/31/2007. PI: $287,000 from ARO, 100% to Xue; Efficient Approximations to Minimum Cost QoS Routing in Communication Systems and VLSI CAD Systems ; 07/14/2000 07/13/2004. Co-Investigator: $2,250,000 from DOE, (PI: Susan Wallace); Initiative in Structural Biology and Computational Biology/Bioinformatics ; 07/01/2000 06/30/2003. Project-Lead-Investigator: $90,000 from NSF, 100% to Xue; This is part of the Vermont Cluster for Computational Sciences and Engineering ; 12/01/1996 11/30/1998. PI: $255,000 from ARO, 100% to Xue; Parallel Algorithms and Software for Computing Minimum Cost Interconnection Networks ; 06/01/1996 05/31/2000. PI: $90,000 from NSF, 100% to Xue; Research Initiation Award: The Rapid Evaluation and Global Minimization of Potential Energy Functions in Molecular and Protein Conformations ; 08/01/1994 07/30/1998. 6.2 EQUIPMENT, CONFERENCE AND OTHER GRANTS PI: $2,000 from CEINT, 100% to Xue; IEEE International Performance, Computing, and Communications Conference (IPCCC 2005); April 7-8, 2005, Phoenix, Arizona.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 7 Co-PI: $2,000 from CEINT, 50% to Xue (Arunabha Sen is the PI); IEEE Workshop on High Performance Switching and Routing (HPSR 2004); April 19-21, 2004, Phoenix, Arizona. PI: $68,166 from CEINT, 100% to Xue; ROSENET: Robustness Issues in Wireless Sensor Networks; 01/01/2004 12/31/2004. Co-PI: $50,000 from NSF, $30,000 from University of Vermont, 20% to Xue; CISE Research Instrumentation: A High-Performance Computing Facility for Experimental Algorithms ; 1997 1998. (PI: Sanjoy Baruah, co-pis: Robert Snapp, Guoliang Xue, Yuanyuan Yang, Charles Colbourn). 7 PUBLICATIONS 7.1 REFEREED JOURNAL PAPERS (J81-J01) Four special classes of authors are distinguished: student, postdoc and self, and adviser. Published in 2010 or accepted for publication: J81: Satyajayant Misra, Dong Hong, Guoliang Xue, and Jian Tang; Constrained relay node placement in wireless sensor networks: formulation and approximations ; IEEE/ACM Transactions on Networking; in press. J80: Jian Tang, Roberto Hincapie, Guoliang Xue, Weiyi Zhang, and Roberto Bustamante; Fair bandwidth allocation in wireless mesh networks with cognitive radios ; IEEE Transactions on Vehicular Technology; in press. J79: Wei Ding and Guoliang Xue; A linear time algorithm for computing a most reliable source on a tree with faulty nodes ; Theoretical Computer Science; in press. Published in 2009: J78: Satyajayant Misra, Guoliang Xue, and Sarvesh Bhardwaj; Secure and robust localization in a wireless ad hoc environment ; IEEE Transactions on Vehicular Technology; Vol. 58(2009), pp. 1480-1489. J77: Satyajayant Misra, Martin Reisslein, and Guoliang Xue; A survey of multimedia streaming in wireless sensor networks ; IEEE Communications Surveys and Tutorials; Vol. 10, No. 4(2009), pp. 18-39. J76: Jian Tang, Guoliang Xue and Weiyi Zhang; Cross-Layer optimization for end-to-end rate allocation in multi-radio wireless mesh networks ; ACM Wireless Networks (WINET); Vol. 15(2009), pp. 53-64. Published in 2008:

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 8 J75: Jian Tang, Satyajayant Misra, and Guoliang Xue; Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks ; Computer Networks (COMNET); Vol. 52(2008), pp. 2148-2158. J74: Guoliang Xue, Weiyi Zhang, Jian Tang, and Krishnaiyan Thulasiraman; Polynomial time approximation algorithms for multi-constrained QoS routing ; IEEE/ACM Transactions on Networking; Vol. 16(2008), pp. 656-669. J73: Weiyi Zhang, Guoliang Xue, Jian Tang, and Krishnaiyan Thulasiraman; Faster algorithms for constructing recovery trees enhancing QoP and QoS ; IEEE/ACM Transactions on Networking; Vol. 16(2008), pp. 642-655. Published in 2007: J72: Jian Tang, Guoliang Xue and Weiyi Zhang; Cross-layer design for end-to-end throughput and fairness enhancement in multi-channel wireless mesh networks ; IEEE Transactions on Wireless Communications; Vol. 6(2007), pp. 3482-3486. J71: Muhammad Javed, Krishnaiyan Thulasiraman and Guoliang Xue; Lightpaths routing for single link failure survivability in IP-over-WDM networks ; KICS/IEEE Journal of Communication and Networks; Vol. 9(2007), pp. 394-401. J70: Guoliang Xue, Weiyi Zhang, Tie Wang, and Krishnaiyan Thulasiraman; On the partial path protection scheme for WDM optical networks and polynomial time computability of primary and secondary paths ; Journal of Industrial and Management Optimization; Vol. 3(2007), pp. 625-643. J69: Guoliang Xue, Arunabha Sen Weiyi Zhang, Jian Tang, and Krishnaiyan Thulasiraman; Finding a path subject to many additive QoS constraints ; IEEE/ACM Transactions on Networking; Vol. 15(2007), pp. 201-211. J68: Guoliang Xue and Kami Makki; Multi-constrained QoS routing: a norm approach ; IEEE Transactions on Computers; Vol. 56(2007), pp. 859-863. J67: Errol L. Lloyd and Guoliang Xue; Relay node placement in wireless sensor networks ; IEEE Transactions on Computers; Vol. 56(2007), pp. 134-138. J66: Tie Wang, Guoliang Xue, and Jeffrey Touchman; Modeling gene functional linkages with two-level simulated annealing ; International Journal of Bioinformatics Research and Applications; Vol. 3(2007), pp. 170-186. Published in 2006: J65: Guoliang Xue, Weiyi Zhang, Jian Tang, and Krishnaiyan Thulasiraman; An improved algorithm for optimal lightpath establishment on a tree topology ; IEEE JSAC Optical Communications and Networking Series; Vol. 24(2006), No. 8, pp. 45-56.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 9 J64: Ying Xiao, Krishnaiyan Thulasiraman and Guoliang Xue; QoS routing in communication networks: approximation algorithms based on the primal simplex method of linear programming ; IEEE Transactions on Computers; Vol. 55(2006), pp. 815-829. J63: Jian Tang, Guoliang Xue, Christopher Chandler and Weiyi Zhang; Link scheduling with power control for throughput enhancement in multihop wireless networks ; IEEE Transactions on Vehicular Technology; Vol. 55(2006), pp. 733-742. J62: Ying Xiao, Krishnaiyan Thulasiraman and Guoliang Xue; Constrained shortest link-disjoint paths selection: a network programming based approach ; IEEE Transactions on Circuits and Systems I: Regular Papers; Vol. 53(2006), pp. 1174-1187. J61: Satyajayant Misra and Guoliang Xue; Efficient anonymity schemes for clustered wireless sensor networks ; International Journal of Sensor Networks; Vol. 1(2006), pp. 50-63. J60: Wenye Wang and Guoliang Xue; A cost-minimization algorithm for fast location tracking in mobile wireless networks ; Computer Networks (COMNET); Vol. 50(2006), pp 2713-2726. J59: Jian Tang, Guoliang Xue, and Weiyi Zhang; Reliable ad hoc routing based on mobility prediction ; Journal of Combinatorial Optimization special issue on Wireless Network Applications; Vol. 11(2006), pp. 71-85. Published in 2005: J58: Jian Tang, Guoliang Xue and Christopher Chandler; Interference-aware routing and bandwidth allocation for QoS provisioning in multihop wireless networks ; Wireless Communication and Mobile Computing, Vol. 5(2005), pp. 933-943. Published in 2004: J57: Guoliang Xue and Wei Xiao; A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology ; Algorithmica, Vol. 41(2004), pp. 53-72. Published in 2003: J56: Guoliang Xue, Li Chen, and Krishnaiyan Thulasiraman; Quality-of-service and qualityof-protection issues in preplanned recovery schemes using redundant trees ; IEEE JSAC Optical Communications and Networking Series; Vol. 21(2003), pp. 1332-1345. NOTE: Out of over 100 papers submitted, only 11 made to this inaugural issue of the new series on Optical Communications and Networking (see editorial).

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 10 J55: Guangting Chen and Guoliang Xue; A PTAS for weight constrained steiner trees in series-parallel graphs ; Theoretical Computer Science; Vol. 304(2003), pp. 237-247. J54: Guoliang Xue; Minimum cost QoS multicast and unicast routing in communication networks ; IEEE Transactions on Communications; Vol. 51(2003), pp. 817-824. J53: Guoliang Xue; Server cost minimization in a distributed servers architecture for on-demand video services ; IEEE Communications Letters; Vol. 7(2003), pp. 52-54. J52: Guoliang Xue; Optimal multichannel data transmission in computer networks ; Computer Communications; Vol. 26(2003), pp. 759-765. Published in 2002: J51: Guoliang Xue and Krishnaiyan Thulasiraman; Computing the shortest network under a fixed topology ; IEEE Transactions on Computers; Vol. 51(2002), pp. 1117-1120. J50: Guoliang Xue; An improved random walk model for PCS networks ; IEEE Transactions on Communications; Vol. 50(2002), pp. 1224-1226. J49: Guohui Lin and Guoliang Xue; On the terminal Steiner tree problem ; Information Processing Letters; Vol. 84(2002), pp. 103-107. Published in 2001: J48: Guohui Lin and Guoliang Xue; Signed genome rearrangement by reversals and transpositions: models and approximations ; Theoretical Computer Science; Vol. 259(2001), pp. 513-531. J47: Guoliang Xue, Guohui Lin and Dingzhu Du; Grade of service Steiner minimum trees in the Euclidean plane ; Algorithmica; Vol. 31(2001), pp. 479-500. J46: Guoliang Xue; A cost optimal parallel algorithm for computing force field in n-body simulations on a CREW PRAM ; Theoretical Computer Science; Vol. 255(2001), pp. 555-568. Published in 2000: J45: Donghui Chen, Dingzhu Du, Xiaodong Hu, Guohui Lin, Lusheng Wang, and Guoliang Xue; Approximations for Steiner trees with minimum number of Steiner points ; Journal of Global Optimization; Vol. 18(2000), pp. 17-33. J44: Guoliang Xue and Mark Lasher; Fast evaluation of potential and force field in particle systems using a fair-split tree spatial structure ; Optimization Methods and Software; Vol. 14(2000), pp. 245-266.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 11 J43: Guohui Lin and Guoliang Xue; The Steiner tree problem with 45-degree routing ; Networks; Vol. 35(2000), pp. 287-301. J42: Guoliang Xue, Ted Lillys, and David Dougherty; Computing the minimum cost pipe network interconnecting one sink and many sources ; SIAM Journal on Optimization; Vol. 10(2000), pp. 22-42. J41: Guoliang Xue and Yinyu Ye; An efficient algorithm for minimizing a sum of p-norms, SIAM Journal on Optimization; Vol. 10(2000), pp. 551-579. J40: Guoliang Xue, Shangzhi Sun, David H.C. Du, and Lojun Shi; An efficient algorithm for delay buffer minimization, Journal of Combinatorial Optimization; Vol. 4(2000), pp. 217-233. Published in 1999: J39: Guohui Lin and Guoliang Xue; Steiner tree problem with minimum number of Steiner points and bounded edge-length ; Information Processing Letters; Vol. 69(1999), pp. 53-57. J38: Guoliang Xue and Shangzhi Sun; Optimal multicast trees in communication systems with channel capacities and channel reliabilities ; IEEE Transactions on Communications; Vol. 47(1999), pp. 662-663. J37: Dingzhu Du, F.K. Hwang, and Guoliang Xue; Interconnecting highways ; SIAM Journal on Discrete Mathematics; Vol. 12(1999), pp. 252-261. J36: Panos M. Pardalos and Guoliang Xue; Algorithms for a class of isotonic regression problems ; Algorithmica; Vol. 23(1999), pp. 211-222. J35: Guohui Lin, Dingzhu Du, Xiaodong Hu, and Guoliang Xue; On rearrangeability of multirate Clos networks ; SIAM Journal on Computing; Vol. 28(1999), pp. 1225-1231. J34: Lingjun Ling and Guoliang Xue; Optimization of molecular similarity index with applications to biomolecules ; Journal of Global Optimization; Vol. 14(1999), pp. 299-312. J33: Guoliang Xue and Dingzhu Du; An O(n log n) average time algorithm for shortest network under a given topology ; Algorithmica; Vol. 23(1999), pp. 363-373. Published in 1998: J32: C.J. Colbourn and Guoliang Xue; A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges ; Theoretical Computer Science; Vol. 209(1998), pp. 331-345.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 12 J31: Guohui Lin and Guoliang Xue; K-center and k-median problems in graded distances ; Theoretical Computer Science; Vol. 207(1998), pp. 181-192. J30: Guoliang Xue; End-to-end data paths: quickest or most reliable? ; IEEE Communications Letters; Vol. 2(1998), pp. 156-158. J29: Guoliang Xue, Shangzhi Sun, and J.B. Rosen; Fast data transmission and maximal dynamic flow ; Information Processing Letters; Vol. 66(1998), pp. 127-132. J28: Guoliang Xue; An O(n) time algorithm for force field calculation in N-body simulations ; Theoretical Computer Science; Vol. 197(1998), pp. 157-169. Published in 1997: J27: Guoliang Xue and Yinyu Ye; An efficient algorithm for minimizing a sum of Euclidean norms with applications ; SIAM Journal on Optimization; Vol. 7(1997), pp. 1017-1036. J26: Guoliang Xue; Linear time algorithms for computing the most reliable source on an unreliable tree network ; Networks; Vol. 30(1997), pp. 37-45. J25: Guoliang Xue; Minimum inter-particle distance at global minimizers of Lennard-Jones clusters ; Journal of Global Optimization; Vol. 11(1997), pp. 83-90. J24: Panos M. Pardalos, X. Liu, and Guoliang Xue; Protein conformation of a lattice model using tabu search ; Journal of Global Optimization; Vol. 11(1997), pp. 55-68. Published in 1996: J23: Guoliang Xue, J.B. Rosen, and Panos M. Pardalos; A polynomial time dual algorithm for the Euclidean multifacility location problem ; Operations Research Letters; Vol. 18(1996), pp. 201-204. Published in 1995: J22: Panos M. Pardalos, Guoliang Xue, and Yong Li; Efficient computation of isotonic median regression ; Applied Mathematics Letters; Vol. 8(1995), pp. 67-70. J21: Guoliang Xue; On an open problem in spherical facility location ; Numerical Algorithms; Vol. 9(1995), pp. 1-12. Published in 1994: J20: Guoliang Xue; A globally convergent algorithm for facility location on a sphere ; Computers & Mathematics with Applications; Vol. 27-6(1994), pp. 37-50.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 13 J19: Guoliang Xue; Improvement on the Northby algorithm for molecular conformation: better solutions ; Journal of Global Optimization; Vol. 4(1994), pp. 425-440. J18: Guoliang Xue; Molecular conformation on the CM-5 by parallel two-level simulated annealing ; Journal of Global Optimization; Vol. 4(1994), pp. 187-208. J17: Panos M. Pardalos, David Shalloway, and Guoliang Xue; Optimization methods for computing global minima of non-convex potential energy functions ; Journal of Global Optimization; Vol. 4(1994), pp. 117-133. J16: Dingzhu Du, Guoliang Xue, Shangzhi Sun, and Siuwing Cheng; Modifications of competitive group testing ; SIAM Journal on Computing; Vol. 23(1994), pp. 82-96. Published in 1993: J15: J.B. Rosen and Guoliang Xue; On the convergence of a hyperboloid approximation procedure for the perturbed Euclidean multifacility location problem ; Operations Research; Vol. 41(1993), pp. 1164-1171. Published in 1992: J14: J.B. Rosen and Guoliang Xue; On the convergence of Miehle s algorithm for the Euclidean multifacility location problem ; Operations Research; Vol. 40(1992), pp. 188-191. J13: J.B. Rosen, Shangzhi Sun, and Guoliang Xue; On a new algorithm for stable assignment ; International Journal of Computer Mathematics; Vol. 41(1992), pp. 165-167. J12: J.B. Rosen and Guoliang Xue; A globally convergent algorithm for the Euclidean multifacility location problem ; Acta Mathematicae Applicatae Sinica; Vol. 8(1992), pp. 357-366. Published in 1991: J11: J.B. Rosen and Guoliang Xue; Computational comparison of two algorithms for the Euclidean single facility location problem ; ORSA Journal on Computing; Vol. 3(1991), pp. 207-212. J10: J.B. Rosen, Shangzhi Sun, and Guoliang Xue; Algorithms for the quickest path problem and the enumeration of quickest paths ; Computers & Operations Research; Vol. 18(1991), pp. 579-584. J09: Guoliang Xue; Algorithms and their convergence properties for solving a class of linearly constrained minimax problems ; Communications on Applied Mathematics and Computation; Vol. 5-2(1991), pp. 22-31.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 14 J08: Changyu Wang and Guoliang Xue; Global properties of local minima of quasi-convex functions ; Communications on Applied Mathematics and Computation; Vol. 5-1(1991), pp. 28-32. Published in 1989: J07: Guoliang Xue; On the convergence of one-dimensional simplex search ; Computers and Operations Research; Vol. 16(1989), pp. 113-116. J06: Guoliang Xue; A globally and quadratically convergent algorithm for min m i=1 c i x a i type location problems ; Acta Mathematicae Applicate Sinica; Vol. 11(1989), pp. 65-72. Published in 1988: J05: Guoliang Xue; Algorithms and their convergence properties for solving a class of minimax problems ; Chinese Journal of Operations Research; Vol. 7-1(1988), pp. 55-56. Published in 1987: J04: Guoliang Xue; A family of gradient projection algorithms and their convergence properties ; Acta Mathematicae Applicate Sinica; Vol. 9(1987), pp. 396-404. Published in 1986: J03: Guoliang Xue; Another application of Zangwill s theorem ; Chinese Journal of Operations Research; Vol. 5-2(1986), pp. 65-66. J02: Guoliang Xue; On convergence properties of a least-distance programming procedure for minimization problems under linear constraints ; Journal of Optimization Theory and Applications; Vol. 50(1986), pp. 365-370. Published in 1985: J01: Guoliang Xue; On convergence properties of a gradient projection algorithm in nonlinear programming ; Chinese Journal of Operations Research; Vol. 4-1(1985), pp. 69-70. 7.2 EDITORIAL ARTICLES (E04-E01) E04: Guoliang Xue and Jelena Misic; Selected papers from fourth international conference on heterogeneous networking for quality, reliability, security and robustness ; Mobile Networks & Applications; Vol. 12(2007), pp. 293-295. E03: Guoliang Xue and Hossam Hassanein; On current areas of interest in wireless sensor networks designs ; Computer Communications; Vol. 29(2006), pp. 409-412.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 15 E02: Guoliang Xue, Ding-Zhu Du and Feng Cao; Recent Advances in wireless ad hoc networks ; Wireless Communications and Mobile Computing; Vol. 6(2006), pp. 1-3. E01: W. Kabacinski, C.T. Lea and Guoliang Xue; 50th anniversary of Clos networks ; IEEE Communications Magazine, Vol. 41, Issue 10, October 2003, pp. 26 27. 7.3 BOOK CHAPTERS (B09-B01) Four special classes of authors are distinguished: student, postdoc and self, and adviser. B09: C.J. Colbourn and Guoliang Xue; Grade of service Steiner trees in series-parallel networks ; in Ding-Zhu Du, J.M. Smith, and J.H. Rubinstein, eds., Advances in Steiner Trees; Kluwer Academic Publishers, 2000, pp. 163 174. B08: Guoliang Xue; Finite behavior of simulated annealing: a probabilistic study ; in P.M. Pardalos, ed., IMA Volume on Parallel Processing for Discrete Problems; Vol. 106(1998), pp. 223-234. B07: Guoliang Xue, Dingzhu Du and Frank Hwang; Faster algorithm for shortest network under given topology ; The Fields Institute Communication Series; Vol. 18(1998), pp. 137-152. B06: Panos M. Pardalos, Guoliang Xue, and P.D. Panagiotopoulos; Parallel algorithms for global optimization ; in A. Ferreira and P.M. Pardalos, ed., Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques; Lecture Notes in Computer Science; Vol. 1054(1996), pp. 233-247. B05: Guoliang Xue, Alan Zall and P.M. Pardalos; Rapid evaluation of potential energy functions in molecular and protein conformations ; DIMACS Series in Discrete Mathematics and Theoretical Computer Science; Vol. 23(1995), pp. 237-249. B04: Guoliang Xue and Shangzhi Sun; The spherical one-center problem ; in D.-Z. Du and P.M. Pardalos eds, Minimax and Applications; Kluwer Academic Publishers(1995), pp. 153 156. B03: Guoliang Xue and Changyu Wang; The Euclidean facilities location problem ; in D.-Z. Du and J. Sun eds., New Advances in Optimization and Approximation; Kluwer Academic Publishers(1994), pp. 313 331. B02: Guoliang Xue and Shangzhi Sun; The shortest path network and its applications in bicriteria shortest path problems ; in D.Z. Du and P.M. Pardalos eds., Network Optimization Problems; World Scientific(1993), pp. 353 360.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 16 B01: J.B. Rosen, Guoliang Xue and A.T. Phillips; Efficient computation of extreme points of convex hulls in R d ; in P.M. Pardalos ed., Advances in Optimization and Parallel Computing; North-Holland(1992), pp. 267 292. 7.4 REFEREED CONFERENCE PAPERS (C84-C01) Three special classes of authors are distinguished: student, postdoc, adviser. Published in 2010 or accepted for publication: C84: Krishnaiyan Thulasiraman, Muhammad Javed, and Guoliang Xue; Primal meets dual: a generalized theory of logical topology survivability in IP-over-WDM optical networks ; IEEE International Conference on Communication Systems and Networks (COMSNETS 2010); January 5-9, 2010, Bangalore, India. Published in 2009: C83: Krishnaiyan Thulasiraman, Muhammad Javed, Tachun Lin, and Guoliang Xue; Logical topology augmentation for guaranteed survivability under multiple failures in IP-over-WDM optical networks ; IEEE International Symposium on Advanced Networks and Telecommunication Systems (ANTS 2009); December 14-16, 2009, New Delhi, India. C83: Dejun Yang, Satyajayant Misra, and Guoliang Xue; Joint base station placement and fault-tolerant routing in wireless sensor networks ; IEEE Global Communications Conference (Globecom 2009); November 30-December 4, 2009, Honolulu, HI. C82: Dejun Yang, Xi Fang, Nan Li, and Guoliang Xue; A simple greedy algorithm for link scheduling with the physical interference model ; IEEE Global Communications Conference (Globecom 2009); November 30-December 4, 2009, Honolulu, HI. C81: Satyajayant Misra, Guoliang Xue, and Dejun Yang; Polynomial time approximations for multi-path routing with bandwidth and delay constraints ; IEEE INFOCOM 2009; April 19-25, 2009, Rio de Janeiro, Brazil; pp. 558-566. C80: Krishnaiyan Thulasiraman, Muhammad Javed, and Guoliang Xue; Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks; IEEE INFOCOM 2009; April 19-25, 2009, Rio de Janeiro, Brazil; pp. 1026-1034. C79: Satyajayant Misra, Mayank Verma, Dijiang Huang, and Guoliang Xue; SEAS: A Secure and Efficient Anonymity Scheme for Low-Cost RFID tags ; IEEE International Conference on Communications (ICC 2009); June 14-18, 2009, Dresden, Germany;

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 17 C78: Roberto Hincapie, Li Zhang, Jian Tang, Guoliang Xue, Richard Wolff, and Roberto Bustamante; Efficient Recovery Algorithms for Wireless Mesh Networks with Cognitive Radios ; IEEE International Conference on Communications (ICC 2009), June 14-18, 2009, Dresden, Germany; Published in 2008: C77: Weiyi Zhang, Guoliang Xue, Jian Tang, and Krishnaiyan Thulasiraman; Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints ; IEEE Global Communications Conference (Globecom 2008); November 30-December 4, 2008, New Orleans, LA. C76: R. Hincapie, Jian Tang, Guoliang Xue, and R. Bustamante; QoS Routing in Wireless Mesh Networks with Cognitive Radios ; IEEE Global Communications Conference (Globecom 2008); November 30-December 4, 2008, New Orleans, LA. C75: Krishnaiyan Thulasiraman, Muhammad Javed, and Guoliang Xue; Logical topology design for IP-over-WDM networks: a hybrid approach for minimum protection capacity ; IEEE International Conference on Communications and Computer Networks (ICCCN 2008); August 3-7, 2008, St. Thomas, US Virgin Islands. C74: Weiyan Ge, Junshan Zhang, and Guoliang Xue; Joint clustering and optimal cooperative routing in wireless sensor networks ; IEEE International Conference on Communications (ICC 2008); May 19-23, 2008, Beijing, China; pp. 2216 2220. C73: Satyajayant Misra, Don Hong, Guoliang Xue, and Jian Tang Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements ; IEEE INFOCOM 2008; April 15-17, 2008, Phoenix, AZ; pp. 879 887. Published in 2007: C72: Satyajayant Misra Weiyi Zhang, and Guoliang Xue; A technique to enhance localization in the presence of NLOS errors ; IEEE Global Communications Conference (Globecom 2007); November 26-30, 2007; Washington DC; pp. 1070 1075. C71: Guoliang Xue and Weiyi Zhang; Multiconstrained QoS routing: Greedy is good ; IEEE Global Communications Conference (Globecom 2007); November 26-30, 2007; Washington DC; pp. 1866-1871. Best Paper Award. C70: Satyajayant Misra and Guoliang Xue; CluRoL: Clustering based robust localization in wireless sensor networks ; IEEE Military Communications Conference (Milcom 2007); October 29-31, 2007, Orlando, FL.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 18 C69: Jian Tang, Satyajayant Misra, and Guoliang Xue; Spectrum allocation and scheduling in dynamic spectrum access wireless networks ; The Fourth International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine 2007); August 14-17, 2007, Vancouver, Canada. C68: Weiyi Zhang, Guoliang Xue, and Satyajayant Misra; Fault-tolerant relay node placement in wireless sensor networks: problems and algorithms ; IEEE INFOCOM 2007; May 6-12, 2007; Anchorage, AK; pp. 1649 1657. C67: Satyajayant Misra, Guoliang Xue, and Aviral Shrivastava; Robust localization in wireless sensor networks through the revocation of malicious anchors ; IEEE International Conference on Communications (ICC 07); June 24-28, 2007; Glasgow, UK; pp. 3057 3062. Published in 2006: C66: Satyajayant Misra, Sarvesh Bhardwaj and Guoliang Xue; ROSETTA: Robust and secure mobile target tracking in a wireless ad hoc environment ; IEEE Military Communications Conference (Milcom 2006); October 23-25, 2006, Washington, DC. C65: Weiyan Ge, Junshan Zhang and Guoliang Xue; Cooperative geographic routing in wireless sensor networks ; IEEE Military Communications Conference (Milcom 2006); October 23-25, 2006, Washington, DC. C64: Muhammad S Javed, Krishnaiyan Thulasiraman, Matthew Gaines, and Guoliang Xue; Survivability aware routing of logical topologies: on Thiran-Kurant approach, evaluation and enhancements ; IEEE Global Communications Conference (Globecom 2006); November 27-December 1, 2006; San Francisco, CA. C63: Jian Tang Guoliang Xue, and Weiyi Zhang; End-to-end rate allocation in multi-radio wireless mesh networks: cross-layer schemes ; The Third International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine 2006); August 07-09, 2006, Waterloo, Canada. C62: Satyajayant Misra and Guoliang Xue; SAS: A simple anonymity scheme for clustered wireless sensor networks ; IEEE International Conference on Communications (ICC 2006); June 11-15, 2006; Istanbul, Turkey; pp. 3414 3419. C61: Jian Tang, Guoliang Xue, and Weiyi Zhang; Maximum throughput and fair bandwidth allocation in multi-channel wireless mesh networks ; IEEE INFOCOM 2006; April 23-29, 2006; Barcelona, Spain.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 19 Published in 2005: C60: Ying Xiao; Krishnaiyan Thulasiraman; Guoliang Xue; GEN-LARAC: A generalized approach to the constrained shortest path problem under multiple additive constraints ; International Symposium on Algorithms and Computation (ISAAC 2005); Sanya, China, December 19-21, 2005; Lecture Notes in Computer Science Vol. 3827 (2005), pp. 92-105. C59: Krishnaiyan Thulasiraman; Ying Xiao; Guoliang Xue; Advances in QoS path(s) selection problem ; IEEE International Symposium on Circuits and Systems (ISCAS 2005); May 23-26, 2005, Kobe, Japan. pp. 164 167. C58: Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan Thulasiraman; Dynamic light trail routing and protection issues in WDM optical networks ; IEEE Global Communications Conference (Globecom 2005); November 28 December 2, 2005; St. Louis, MO. pp. 1963 1967. C57: Tie Wang, J.W. Touchman, Weiyi Zhang, E.B. Suh, Guoliang Xue; A parallel algorithm for extracting transcriptional regulatory network motifs ; IEEE Symposium on Bioinformatics and Bioengineering (BIBE 2005); October 19-21 2005, Mineapolis, MN; pp. 193 200. C56: Jian Tang, Guoliang Xue, Christopher Chandler; Weiyi Zhang; Link scheduling with power control for throughput enhancement in multihop wireless networks ; The Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine 2005); August 22-24, 2005, Orlando, FL; pp. 1 8. C55: Zhipeng Cai, Guohui Lin, Guoliang Xue; Improved approximation algorithms for the capacitated multicast routing problem ; International Computing and Combinatorics Conference (COCOON 2005); August 16-19, 2005; Kunming, China; Lecture Notes in Computer Science; Vol. 3595(2005), pp. 136-145. C54: Jian Tang, Guoliang Xue, Weiyi Zhang; Interference-aware topology control and QoS routing in multi-channel wireless mesh networks ; ACM MOBIHOC 2005, May 25-28, 2005, Urbana-Champaign; pp. 68 77. C53: Jian Tang, Guoliang Xue, Weiyi Zhang; Power efficient broadcasting and multicasting in wireless networks with directional antennas ; IEEE International Conference on Communications (ICC 2005), May 16-20, 2005, Seoul, Korea; pp. 1438 1442. C52: Guoliang Xue, Weiyi Zhang, Jian Tang, and Krishnaiyan Thulasiraman; Establishment of survivable connections in WDM networks using partial path protection ; IEEE International Conference on Communications (ICC 2005), May 16-20, 2005, Seoul, Korea. pp. 1756 1760.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 20 C51: Manvendu Bhardwaj, Satyajayant Misra, and Guoliang Xue; Topology Control in Wireless Ad Hoc Networks using β-skeletons ; IEEE Workshop on High Performance Switching and Routing (HPSR 2005); May 12-14, 2005; Hong Kong. pp. 371 375. C50: Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan Thulasiraman; Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS ; IEEE INFOCOM 2005; March 13-17, 2005, Miami, FL; pp. 2702 2710. C49: Jian Tang, Guoliang Xue, Christopher Chandler; Weiyi Zhang; Interference-aware routing in multi-hop wireless networks using directional antennas ; IEEE INFOCOM 2005; March 13-17, 2005, Miami, FL; pp. 751 760. Published in 2004: C48: Jian Tang, Guoliang Xue, Weiyi Zhang; Energy efficient survivable broadcasting and multicasting in wireless ad hoc networks ; IEEE Military Communications Conference (Milcom 2004); October 31-November 3, 2004, Monterey, CA; pp. 1165-1171. C47: Jian Tang, Guoliang Xue, Weiyi Zhang; Reliable routing in mobile ad hoc networks based on mobility prediction ; IEEE International Conference on Mobile, Ad-Hoc and Sensor Systems (MASS 2004); October 25-27, 2004, Fort Lauderdale, Florida, USA; C46: Ying Xiao, Krishnaiyan Thulasiraman and Guoliang Xue; Approximation and heuristic algorithms for delay constrained path selection under inaccurate state information ; The First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine 2004); October 18-20, 2004, Dallas, TX, USA; pp. 130 137. C45: Ying Xiao, Krishnaiyan Thulasiraman and Guoliang Xue; The primal simplex approach to the QoS routing problem ; The First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine 2004); October 18-20, 2004, Dallas, TX, USA; pp. 120 129. C44: Tie Wang, J. Touchman, and Guoliang Xue; Applying two-level simulated annealing on Bayesian structure learning to infer genetic networks ; IEEE Computer Society Bioinformatics Conference (CSB 2004); August 16-19, 2004, Stanford, CA; pp. 647 648. C43: S. Ganguly, Arunabha Sen, Guoliang Xue, Bin Hao and Baohong Shen; Optimal routing for fast transfer of bulk data files in time-varying networks ; IEEE International Conference on Communications (ICC 2004); June 20-24, 2004, Paris, France. pp. 1182 1186.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 21 C42: Jian Tang and Guoliang Xue; Node-disjoint path routing in wireless sensor networks: tradeoffs between path lifetime and total energy ; IEEE International Conference on Communications (ICC 2004); June 20-24, 2004, Paris, France. pp. 3812 3816. C41: Bin Hao, Jian Tang and Guoliang Xue; Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation ; IEEE Workshop on High Performance Switching and Routing (HPSR 2004); April 19-21, 2004, Phoenix, Arizona; pp. 246 250. C40: Xiuzhen Cheng, A. Thaeler, Guoliang Xue, Dechang Chen; TPS: A time-based positioning scheme for outdoor wireless sensor networks, INFOCOM 2004; March 7-11, 2004, Hong Kong; pp. 2685 2696. C39: Reid Andersen, Fan Chung, Arunabha Sen, Guoliang Xue; On disjoint path pairs with wavelength continuity constraint in WDM networks ; INFOCOM 2004; March 7-11, 2004, Hong Kong; pp. 524 535. Published in 2003: C38: Min Ding, Xiuzhen Cheng and Guoliang Xue; Aggregation tree construction in sensor networks ; IEEE Vehicular Technology Conference (VTC 2003); October 6-9, 2003, Orlando, FL; pp. 2168 2172. C37: Guoliang Xue and Ravi Gottapu; Efficient construction of virtual p-cycles protecting all cycle-protectable working links ; IEEE Workshop on High Performance Switching and Routing (HPSR 2003); June 24-27, 2003, Torino, Italy; pp. 305 309. C36: Guoliang Xue, Arun Sen, and Rakesh Banka; Routing with many additive QoS constraints ; IEEE International Conference on Communications (ICC 2003); May 11-15, 2003, Anchorage, Alaska. pp. 223 227. C35: Guoliang Xue and Rakesh Banka; Bottom-up construction of dynamic multicast trees in WDM networks ; IEEE International Performance, Computing, and Communications Conference (IPCCC 2003); April 9-11, 2003, Phoenix, Arizona; pp. 49 56. Published in 2002: C34: Rakesh Banka and Guoliang Xue; Angle routing protocol: Location aided routing for mobile ad-hoc networks using dynamic angle selection ; IEEE Military Communications Conference (Milcom 2002); October 7-10, 2002, Anaheim, CA; pp. 501 506.

Curriculum Vitae of Guoliang (Larry) Xue, January 2010 22 C33: Guoliang Xue, Li Chen and Krishnaiyan Thulasiraman; Delay reduction in redundant trees for pre-planned protection against single link/node failure in 2-connected graphs ; IEEE Global Communications Conference (Globecom 2002); November 17-21, 2002, Taipei, Taiwan; pp. 2691 2695. C32: Guoliang Xue, Li Chen, and Krishnaiyan Thulasiraman; QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs ; IEEE International Conference on Communications (ICC 2002); April 28-May 2, 2002, New York, NY; pp. 2766 2770. C31: R. Ravindran, Krishnaiyan Thulasiraman, G. Lou, K. Huang, and Guoliang Xue; QoS routing: heuristics and approximation schemes and a comparative evaluation ; IEEE International Symposium on Circuits and Systems (ISCAS 2002); May 26-29, 2002, Scottsdale, Arizona; pp. 775 778. C30: Li Chen, Guoliang Xue, and Byung Suk Lee, A delay-scaling multicast algorithm with multiple QoS criteria, International Conference on Computer Science and Informatics (CS&I 2002); March 8-14, 2002, Durham, NC. pp. 319 323. C29: Guoliang Xue, Li Chen, and Krishnaiyan Thulasiraman; Cost minimization in redundant trees for protection in vertex-redundant or edge-redundant graphs ; IEEE International Performance, Computing and Communications Conference (IPCCC 2002); April 3-5, 2002, Phoenix, Arizona; pp. 187 194. Published in 2001: C28: Guoliang Xue; Optimal lightpath routing and rerouting in WDM networks ; IEEE Global Communications Conference (Globecom 2001); November 25-29, 2001, San Antonio, TX; pp. 2124 2128. C27: Guangting Chen and Guoliang Xue; An FPTAS for weight-constrained Steiner tree in series-parallel graphs ; International Computing and Combinatorics Conference (COCOON 2001); August 20-23, 2001, Guilin, China; Lecture Notes in Computer Science; Vol. 2108(2001), pp. 519-528. C26: Guoliang Xue, Guojun Li, Guangting Chen and Xuedao Chu; Source-waiting QoS routing in networks with advanced resource reservations ; IEEE International Conference on Communications (ICC 2001); June 11-14 2001, Helsinki, Finland; pp. 619 624. C25: Guangting Chen and Guoliang Xue; k-pair delay constrained minimum cost routing in undirected networks, ACM/SIAM Symposium on Discrete Algorithms (SODA 2001); January 7-9, 2001, Washington, DC; pp. 230 231. Published in 2000: