Illya V. Hicks

 
 

Branchwidth (and related) Papers

  1. 1. A Branch-and-Price-and-Cut Method for Computing an Optimal Bramble, with S. Sonuc and J.C. Smith (working paper) pdf

  2. 2.  The Cunningham-Geelen Method in Practice:  Branch-decompositions and Integer Programming, with S. Margulies and J. Ma, INFORMS Journal on Computing (to appear) pdf

  3. 3.  Branch Decomposition Heuristics for Linear Matroids, with J. Ma, S. Margulies, and E. Goins, Discrete Optimization (to appear) pdf correction

  4. 4.  A Combinatorial Optimization Algorithm  for Solving the Branchwidth Problem, with E. Ulusal, and J. C. Smith, Computational Optimization and Applications 51(3), 2012, 1211-1229 pdf

  5. 5. The Branchwidth of Graphs and their Cycle Matroids, with N. McMurray, Journal of Combinatorial Theory Series B 97(5), 2007, 681-692 pdf

  6. 6. Graphs, Branchwidth, and Tangles! Oh My!, Networks 45(2), 2005, 55-60 pdf

  7. 7. Planar Branch Decompositions I: The Ratcatcher , INFORMS Journal on Computing 17(4), 2005, 402-412 pdf

  8. 8. Planar Branch Decompositions II: The Cycle Method , INFORMS Journal on Computing 17(4), 2005, 413-421 pdf

  9. 9. Branch Decompositions and Minor Containment , Networks 43(1), 2004, 1-9 ps Errantum

  10. 10.Branchwidth Heuristics, Congressus Numerantium 159, 2002, 31-50 ps pdf


Clique Generalization Papers

  1. 11. On the 2-club Polytope, with F. Pajouh and B. Balasundarm (working paper)

  2. 12. Combinatorial Branch-and-Bound for the Maximum Weight Independent Set Problem, with J. Warren (working paper) pdf

  3. 13. Co-k-plex Vertex Partitions, with B. McClosky and J. Arellano (working paper) pdf

  4. 14.  Combinatorial Algorithms for the Maximum k-plex Problem, with B. McClosky, Journal of Combinatorial Optimization 23(1), 2012, 29-49 pdf

  5. 15.   Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem, with B. Balasundaram and S. Butenko, Operations Research 59(1), 2011, 133-142 pdf

  6. 16.  Co-2-plex Polynomials, with B. McClosky and A. Simms, Journal of Combinatorial Optimization 22(4), 2011, 640-650 pdf

  7. 17. The Co-2-plex Polytope and Integral Systems, with B. McClosky, SIAM Journal on Discrete Mathematics 23(3), 2009, 1135-1148 pdf

  8. 18. Composition of Stable Set Polyhedra, with B. McClosky, Operations Research Letters 36, 2008, 615-617 pdf

  9. 19.A Branch-and-Price Approach for the Maximum Weight Independent Set Problem, with J. Warren, D. Warrier, and W. Wilhelm, Networks 46(14), 2005, 198-209 pdf


Other Combinatorial Optimization Papers

  1. 20.An Algebraic Exploration of Dominating Sets and Vizing’s Conjecture, with S. Margulies, Electronic Journal of Combinatorics 19(2), 2012, P1 pdf

  2. 21. A Note on Total and Paired Domination of Cartesian Product Graphs, K. Choudhary and S. Margulies (working paper) pdf

  3. 22. A Note on Integer Domination of Cartesian Product Graphs, K. Choudhary and S. Margulies (working paper) pdf

  4. 23.New Facets for the Planar Subgraph Polytope, Networks 51(2), 2008, 120-132 pdf

  5. 24. On Greedy Construction Heuristics for MAX CUT problem, with S. Kahruman, E. Kolotoğlu*, and S. Butenko, International Journal on Computational Science and Engineering 3(3), 2007, 211-218

  6. 25. Restricted b -factors in Bipartite Graphs and t- designs, with I. Arambula, Journal of Combinatorial Design 14(3), 2006, 169-182 pdf


Systems Engineering Papers

  1. 26. Degree of Redundancy of Linear Systems using Implicit Set Covering, with J. Arellano (working paper) pdf

  2. 27.Scheduling the Adjuvant Endocrine Therapy for Early Stage Breast Cancer, with K. Diehl, S. Kahruman, E. Kolotoglu, and S. Butenko, Annals of Operations Research 196(1), 2012, 683-705 pdf

  3. 28. Service Restoration in Naval Shipboard Power Systems, with K. L. Butler- Purry and N. D. R. Sarma , IEE Proceedings Generation, Transmission and Distribution 151(1), 2004, 95-102 pdf

  4. 29. Optimization Procedures for Simultaneous Road Rehabilitation and Bridge Replacement Decisions in Highway Networks , with A. Garcia-Diaz and M. Bonyuet , Engineering Optimization 34(5), 2002, 445-459


Chapters

 1) Branch and Tree Decomposition Techniques for Discrete Optimization, with A. M. C. A. Koster and E. Kolotoglu, Tutorials in Operations Research: INFORMS--New Orleans 2005, J. Cole Smith (ed), INFORMS, Hanover, MD pdf Errantum

2) Branchwidth and Branch Decompositions, Encyclopedia of Optimization, C. Floudas and P. Pardalos (eds.), Springer, New York, 2009

3) Branch-width and Tangles, with S. Oum, Wiley Encyclopedia of OR/MS, J. Cochran et al. (eds.), Wiley, New York, 2011

4) Graph and Network Theory:  Basic Concepts and Applications, with A. Garcia-Diaz, Wiley Encyclopedia of OR/MS, J. Cochran et al. (eds.), Wiley, New York, 2011



Projects

  1. 1)     A New Decomposition Approach for a Class of NP-hard Graph Problems , with W. E. Wilhelm, NSF DMI-0217265, $175K, 9/1/2002 -- 8/31/2005, ($24K REU)

  2. 2)     Travel Support for Minority Students to Attend INFORMS Annual Meeting; October 24-27, 2004; Denver, CO , NSF DMI-0440785, $4.75K, 9/1/2004 -- 8/31/ 2005

  3. 3)     Pathways to the Doctorate Research Assistantship Award 2005 , Texas A&M University, $25K, 9/1/2005 -- 8/31/2007

  4. 4)    SGER: Branch Decomposition Techniques for Independence Systems, NSF DMI-0521209, $80K, 8/1/2005 -- 7/31/2006

  5. 5)     Travel Support for Minority Students to Attend INFORMS Annual Meeting; November 13-16, 2005; New Orleans, LA, NSF DMI-0537840, $5K, 9/1/2005 -- 8/31/2006

  6. 6)    GAAN: Fellowships for Research in Industrial and Systems Engineering, with G.-A. Klutke and S. Cetinkaya, DoEd, Texas A&M, $380K, 9/1/2006 -- 8/31/2009

  7. 7)    Innovative Techniques for Constructing Branch Decompositions, NSF DMS-0729251, $185K, 9/1/2006 -- 8/31/2009

  8. 8)     BPC-DP:  Academic Mentoring Workshops for Underrepresented Participants, with V. Taylor (Texas A&M) and B. York (Portland St.), NSF CNS-0634272, Texas A&M, $388K,  3/1/2007 -- 2/28/2010

  9. 9)    Travel Support for Minority Students to Attend INFORMS Annual Meetings, NSF CMMI-0739996, $19K, 8/1/2007 -- 7/31/2011

  10. 10)    Branch Decomposition Techniques for Submodular Optimization, NSF CMMI-0926618, $250K, 8/1/2009 -- 7/31/2013

  11. 11)    Travel Support for Minority Students Attending INFORMS Annual Meeetings, NSF CMMI-1130507, $18.9K, 7/20/2011 -- 7/19/2014




 


    profile




Name: Illya V. Hicks

Status: Married

Hometown: Waco, TX



    occupation




Occupation: Associate Professor

School: Computational and Applied Mathematics Department, Rice University

Location: Houston, TX




    contact




Computational and Applied Mathematics Department

Rice University

6100 Main St. - MS 134

Houston, TX 77005-1892

(office) 713-348-5667

(fax) 713-348-5318

Email me

 

My research interests are in combinatorial optimization, integer programming, graph theory and matroid theory. Some applications of interest are social networks, cancer treatment and network design. My current research is focused on using graph decomposition techniques to solve NP-complete problems. I teach courses related to discrete optimization.