Illya V. Hicks
 
 
Education PhD and MA in Computational and Applied Mathematics, Rice University, 2000. BS in Mathematics, Texas State University, 1995. Experience Associate Professor of Computational and Applied Mathematics, Rice University (current) Associate Professor of Industrial and Systems Engineering, Texas A&M University (Fall 2006) Assistant Professor of Industrial and Systems Engineering, Texas A&M University (Fall 2000 - Spring 2006) Honors & Awards 2005 Optimization Prize for Young Researchers, Optimization Society, INFORMS Academic & Research Interest Branch Decompositions and Tree Decompositions TSP website offered by my advisor Bill Cook Operations Research Graph Theory Graph Instances Courses CAAM 470: Graph Theory CAAM 474: Combinatorial Optimization Professional Organizations Institute for Operations Research and the Management Sciences (INFORMS) Minority Issues Forum of INFORMS Mathematical Programming Society (MPS) National Association of Mathematicians (NAM) Society for Advancement of Chicanos and Native Americans in Science (SACNAS) Society for Industrial and Applied Mathematics (SIAM) Conferences, Graduate Education Programs and Workshops Rice-Houston Alliance for Graduate Education and the Professoriate 2007 Richard Tapia Celebration of Diversity in Computing Conference 13th Annual Conference for African-American Researchers in the Mathematical Sciences (CAARMS) 2006 Blackwell-Tapia Conference MIP 2006: Mixed Integer Programming Workshop NSF Workshop: Development of Minority Faculty in Engineering CombinaTexas, April 9-10, 2004 MSRI Introductory Workshop in Discrete and Computational Geometry, August 20- 29, 2003 NCI/NSF Workshop on Operations Research and Radiation Therapy, Feb. 7-9, 2002 Papers 1.     Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem, with B. Balasundaram, S. Butenko, and S. Sachdeva (working paper) pdf 2.     The Co-2-plex Polytope and Integral Systems, with B. McClosky (working paper) pdf 3.     Combinatorial Branch-and-Bound for the Maximum Weight Independent Set Problem, with J. Warren (working paper) pdf 4. Degree-Bounded Vertex Partitions, with B. McClosky (working paper) pdf 5. Detecting Cohesive Subgraphs, with B. McClosky (working paper) pdf 6. Scheduling the Adjuvant Endocrine Therapy for Early Stage Breast Cancer, with S. Kahruman, E. Kolotoglu, and S. Butenko (working paper) 7.     Composition of Stable Set Polyhedra, with B. McClosky Operations Research Letters (to appear) pdf 8.     New Facets for the Planar Subgraph Polytope, Networks 51(2), 2008, 120-132 pdf 9. The Branchwidth of Graphs and their Cycle Matroids, with N. McMurray, Journal of Combinatorial Theory Series B 97(5), 2007, 681-692 pdf 10.  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 11.  Restricted b -factors in Bipartite Graphs and t- designs, with I. Arambula, Journal of Combinatorial Design 14(3), 2006, 169-182 pdf 12. 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 13.  Graphs, Branchwidth, and Tangles! Oh My!, Networks 45(2), 2005, 55-60 pdf 14.  Planar Branch Decompositions I: The Ratcatcher , INFORMS Journal on Computing 17(4), 2005, 402-412 pdf 15. Planar Branch Decompositions II: The Cycle Method , INFORMS Journal on Computing 17(4), 2005, 413-421 pdf 16. Branch Decompositions and Minor Containment , Networks 43(1), 2004, 1-9 ps Errantum 17. 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 18. Branchwidth Heuristics, Congressus Numerantium 159, 2002, 31-50 ps pdf 19. 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 ·         Branch and Tree Decomposition Techniques for Discrete Optimization, with A. M. C. A. Koster and E. Kolotoglu, to appear in Tutorials in Operations Research: INFORMS--New Orleans 2005, pdf Errantum Projects 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.     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.     Pathways to the Doctorate Research Assistantship Award 2005 , Texas A&M University, $25K, 9/1/2005 -- 8/31/2007 4.    SGER: Branch Decomposition Techniques for Independence Systems, NSF DMI-0521209, $80K, 8/1/2005 -- 7/31/2006 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.    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.    Innovative Techniques for Constructing Branch Decompositions, NSF DMS-0611723, $95K, 9/1/2006 -- 8/31/2009 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.     Travel Support for Minority Students to Attend INFORMS Annual Meetings, NSF CMMI-0739996, $19K, 8/1/2007 -- 7/31/2010 Current Doctoral Students 1.      Adewale Faparusi (Texas A&M University), TBA 2.      Elif Kolotoglu (Texas A&M University), “Integer Programming Techniques for the Branchwidth Problem”, Spring 2008 3.      Benjamin McClosky, “Independence Systems and Stable Set Relaxations”, Spring 2008 Past Doctoral Students 1.     Ivette Arambula Mercado, "A New Polyhedral Approach to Combinatorial Designs", Spring 2004 (Texas A&M University), currently works for PROS Revenue Management 2.     Jeffrey Warren, “Independent Set Problems and Odd-Hole-Preserving Graph Reductions”, Spring 2007 (Texas A&M University), currently works for American Airlines Past MS Students Jegganathan Balu, MS non-thesis, spring 2004  http://www.caam.rice.edu/http://www.rice.edu/http://www.txstate.edu/mathhttp://www.txstate.edu/http://www.caam.rice.eduhttp://www.rice.eduhttp://ie.tamu.eduhttp://www.tamu.eduhttp://www.math.princeton.edu/tsphttp://www.isye.gatech.edu/~wcookhttp://mat.gsia.cmu.edu/http://www.graphtheory.comhttp://www.caam.rice.edu/~ivhicks/data.htmlhttp://www.caam.rice.edu/~ivhicks/CAAM470http://www.caam.rice.edu/~caam474http://www.informs.org/http://www.caam.rice.edu/~ivhicks/MIFhttp://www.mathprog.org/http://www.math.buffalo.edu/mad/NAM/http://www.sacnas.org/http://www.siam.org/http://rgs.rice.edu/Grad/agephttp://www.richardtapia.orghttp://princeton.edu/~wmassey/CAARMS13http://www.ima.umn.edu/2006-2007/SW11.3-4.06/http://coral.ie.lehigh.edu/mip-2006http://www.egr.msu.edu/apps/dmfe/workshop/index.htmlhttp://www.math.tamu.edu/~cyan/combinatexashttp://www.msri.org/calendar/workshops/WorkshopInfo/248/show_workshophttp://www.isye.gatech.edu/nci-nsf.orart.2002/http://www.caam.rice.edu/~ivhicks/kplex4web.pdfhttp://www.caam.rice.edu/~ivhicks/Ben-paper2.pdfhttp://www.caam.rice.edu/~ivhicks/jeff.rev.pdfhttp://www.caam.rice.edu/~ivhicks/color.pdfhttp://www.caam.rice.edu/~ivhicks/CokplexAlgorithmPaper.pdfhttp://www.caam.rice.edu/~ivhicks/article.Ben.pdfhttp://www.caam.rice.edu/~ivhicks/planar.facet.rd1.pdfhttp://www.caam.rice.edu/~ivhicks/branch.matroid.jctb.rev.pdfhttp://www.caam.rice.edu/~ivhicks/ivette.jcd.pdfhttp://www.caam.rice.edu/~ivhicks/wilhelm.pdfhttp://www.caam.rice.edu/~ivhicks/tangle.networks.pdfhttp://www.caam.rice.edu/~ivhicks/pb1.ijoc.pdfhttp://www.caam.rice.edu/~ivhicks/pb2.ijoc.pdfhttp://ie.tamu.edu/people/faculty/Hicks/minor.rev1.pshttp://www.caam.rice.edu/~ivhicks/petersen.error.pdfhttp://www.caam.rice.edu/~ivhicks/iee%20paper.pdfhttp://www.caam.rice.edu/~ivhicks/heuristics.pshttp://www.caam.rice.edu/~ivhicks/heuristics.pdfhttp://www.caam.rice.edu/~ivhicks/bwtw.pdfhttp://www.caam.rice.edu/~ivhicks/petersen.error.pdfhttp://www.caam.rice.edu/~ivhicks/MIF-files/mif.presenters.2004.htmhttp://www.caam.rice.edu/~ivhicks/MIF-files/student.abstracts.2005.htmhttp://www.caam.rice.edu/~ivhicks/MIFhttp://people.tamu.edu/~elifhttp://www.caam.rice.edu/~bjm4shapeimage_1_link_0shapeimage_1_link_1shapeimage_1_link_2shapeimage_1_link_3shapeimage_1_link_4shapeimage_1_link_5shapeimage_1_link_6shapeimage_1_link_7shapeimage_1_link_8shapeimage_1_link_9shapeimage_1_link_10shapeimage_1_link_11shapeimage_1_link_12shapeimage_1_link_13shapeimage_1_link_14shapeimage_1_link_15shapeimage_1_link_16shapeimage_1_link_17shapeimage_1_link_18shapeimage_1_link_19shapeimage_1_link_20shapeimage_1_link_21shapeimage_1_link_22shapeimage_1_link_23shapeimage_1_link_24shapeimage_1_link_25shapeimage_1_link_26shapeimage_1_link_27shapeimage_1_link_28shapeimage_1_link_29shapeimage_1_link_30shapeimage_1_link_31shapeimage_1_link_32shapeimage_1_link_33shapeimage_1_link_34shapeimage_1_link_35shapeimage_1_link_36shapeimage_1_link_37shapeimage_1_link_38shapeimage_1_link_39shapeimage_1_link_40shapeimage_1_link_41shapeimage_1_link_42shapeimage_1_link_43shapeimage_1_link_44shapeimage_1_link_45shapeimage_1_link_46shapeimage_1_link_47shapeimage_1_link_48shapeimage_1_link_49shapeimage_1_link_50shapeimage_1_link_51shapeimage_1_link_52shapeimage_1_link_53shapeimage_1_link_54
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.