Branch decompositions and minor containment. - Illya V. Hicks (Networks, 2004)

Planar Branch Decompositions I: The Ratcatcher. - Illya V. Hicks (INFORMS J. Comput., 2005)

Planar Branch Decompositions II: The Cycle Method. - Illya V. Hicks (INFORMS J. Comput., 2005)

Graphs, branchwidth, and tangles! Oh my! - Illya V. Hicks (Networks, 2005)

A branch-and-price approach for the maximum weight independent set problem. - Deepak Warrier; Wilbert E. Wilhelm; Jeffrey S. Warren; Illya V. Hicks (Networks, 2005)

On greedy construction heuristics for the MAX-CUT problem. - Sera Kahruman-Anderoglu; Elif Kolotoglu; Sergiy Butenko; Illya V. Hicks (Int. J. Comput. Sci. Eng., 2007)

The branchwidth of graphs and their cycle matroids. - Illya V. Hicks; Nolan B. McMurray Jr. (J. Comb. Theory B, 2007)

New facets for the planar subgraph polytope. - Illya V. Hicks (Networks, 2008)

Composition of stable set polyhedra. - Benjamin McClosky; Illya V. Hicks (Oper. Res. Lett., 2008)

The Co-2-plex Polytope and Integral Systems. - Benjamin McClosky; Illya V. Hicks (SIAM J. Discret. Math., 2009)

Branchwidth and Branch Decompositions. - Illya V. Hicks (Encyclopedia of Optimization, 2009)

A Note on Total and Paired Domination of Cartesian Product Graphs - K. Choudhary; Susan Margulies; Illya V. Hicks (CoRR, 2011)

Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem. - Balabhaskar Balasundaram; Sergiy Butenko; Illya V. Hicks (Oper. Res., 2011)

Co-2-plex polynomials. - Benjamin McClosky; Anthony Simms; Illya V. Hicks (J. Comb. Optim., 2011)

Scheduling the adjuvant endocrine therapy for early stage breast cancer. - Sera Kahruman-Anderoglu; Elif Ulusal; Sergiy Butenko; Illya V. Hicks; Kathleen M. Diehl (Ann. Oper. Res., 2012)

A combinatorial optimization algorithm for solving the branchwidth problem. - J. Cole Smith; Elif Ulusal; Illya V. Hicks (Comput. Optim. Appl., 2012)

An Algebraic Exploration of Dominating Sets and Vizing's Conjecture. - Susan Margulies; Illya V. Hicks (Electron. J. Comb., 2012)

Combinatorial algorithms for the maximum k-plex problem. - Benjamin McClosky; Illya V. Hicks (J. Comb. Optim., 2012)

A Note on Total and Paired Domination of Cartesian Product Graphs. - Keerti Choudhary; Susan Margulies; Illya V. Hicks (Electron. J. Comb., 2013)

Branch decomposition heuristics for linear matroids. - Jing Ma; Susan Margulies; Illya V. Hicks; Edray Goins (Discret. Optim., 2013)

The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming. - Susan Margulies; Jing Ma; Illya V. Hicks (INFORMS J. Comput., 2013)

Degree of Redundancy of Linear Systems Using Implicit Set Covering. - John D. Arellano; Illya V. Hicks (IEEE Trans Autom. Sci. Eng., 2014)

A branch-and-price-and-cut method for computing an optimal bramble. - Sibel B. Sonuc; J. Cole Smith; Illya V. Hicks (Discret. Optim., 2015)

Integer domination of Cartesian product graphs. - Keerti Choudhary; Susan Margulies; Illya V. Hicks (Discret. Math., 2015)

Co-2-plex vertex partitions. - Benjamin McClosky; John D. Arellano; Illya V. Hicks (J. Comb. Optim., 2015)

Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. - Boris Brimkov; Illya V. Hicks (Discret. Appl. Math., 2016)

On the logspace shortest path problem. - Boris Brimkov; Illya V. Hicks (Electron. Colloquium Comput. Complex., 2016)

On the 2-Club Polytope of Graphs. - Foad Mahdavi Pajouh; Balabhaskar Balasundaram; Illya V. Hicks (Oper. Res., 2016)

Image Segmentation via Weighted Carving Decompositions. - Derek Mikesell; Illya V. Hicks (IWCIA, 2017)

Graphs with Extremal Connected Forcing Numbers. - Boris Brimkov; Caleb C. Fast; Illya V. Hicks (CoRR, 2017)

Memory efficient algorithms for cactus graphs and block graphs. - Boris Brimkov; Illya V. Hicks (Discret. Appl. Math., 2017)

Complexity and computation of connected zero forcing. - Boris Brimkov; Illya V. Hicks (Discret. Appl. Math., 2017)

A Branch Decomposition Algorithm for the p-Median Problem. - Caleb C. Fast; Illya V. Hicks (INFORMS J. Comput., 2017)

Effects of vertex degrees on the zero-forcing number and propagation time of a graph. - Caleb C. Fast; Illya V. Hicks (Discret. Appl. Math., 2018)

A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti. - Logan A. Smith; David T. Mildebrath; Illya V. Hicks (CoRR, 2019)

Computational approaches for zero forcing and related problems. - Boris Brimkov; Caleb C. Fast; Illya V. Hicks (Eur. J. Oper. Res., 2019)

Power domination throttling. - Boris Brimkov; Joshua Carlson; Illya V. Hicks; Rutvik Patel; Logan A. Smith (Theor. Comput. Sci., 2019)

Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts. - Logan A. Smith; Illya V. Hicks (CoRR, 2020)

An integer program for positive semidefinite zero forcing in graphs. - Logan A. Smith; Derek Mikesell; Illya V. Hicks (Networks, 2020)

Improved Computational Approaches and Heuristics for Zero Forcing. - Boris Brimkov; Derek Mikesell; Illya V. Hicks (INFORMS J. Comput., 2021)

Tangle bases: Revisited. - Illya V. Hicks; Boris Brimkov (Networks, 2021)

Graph Representation of Computer Network Resources for Precise Allocations. - Stuart Baxley; Deniz Gurkan; Hamidreza Validi; Illya V. Hicks (ICCCN, 2022)

Finding Bipartite Partitions on Co-Chordal Graphs. - Bochuan Lyu; Illya V. Hicks (CoRR, 2022)

Mixed integer linear optimization formulations for learning optimal binary classification trees. - Brandon Alston; Hamidreza Validi; Illya V. Hicks (CoRR, 2022)

Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph. - Illya V. Hicks; Boris Brimkov; Louis Deaett; Ruth Haas; Derek Mikesell; David E. Roberson; Logan A. Smith (INFORMS J. Comput., 2022)

Minimum k-cores and the k-core polytope. - Derek Mikesell; Illya V. Hicks (Networks, 2022)

New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts. - Logan A. Smith; Illya V. Hicks (Networks, 2022)

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs. - Logan A. Smith; David T. Mildebrath; Illya V. Hicks (Networks, 2022)

Combinatorial Disjunctive Constraints for Obstacle Avoidance in Path Planning. - Raul Garcia; Illya V. Hicks; Joey Huchette (IROS, 2023)

Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number. - Bochuan Lyu; Illya V. Hicks (CoRR, 2023)

On relaxations of the max k-cut problem formulations. - Ramin Fakhimi; Hamidreza Validi; Illya V. Hicks; Tamás Terlaky; Luis F. Zuluaga (Oper. Res. Lett., 2023)

Finding biclique partitions of co-chordal graphs. - Bochuan Lyu; Illya V. Hicks (Discret. Appl. Math., 2023)

Optimal Mixed Integer Linear Optimization Trained Multivariate Classification Trees. - Brandon Alston; Illya V. Hicks (CoRR, 2024)

Maximizing Engagement in Large-Scale Social Networks. - Samuel Kroger; Hamidreza Validi; Illya V. Hicks (INFORMS J. Optim., 2024)

The set partitioning problem in a quantum context. - Rafael Cação; Lucas R. C. T. Cortez; Jackson Forner; Hamidreza Validi; Ismael R. de Farias Jr.; Illya V. Hicks (Optim. Lett., 2024)

Linear-size formulations for connected planar graph partitioning and political districting. - Jack Zhang; Hamidreza Validi; Austin Buchanan; Illya V. Hicks (Optim. Lett., 2024)

Modeling combinatorial disjunctive constraints via junction trees. - Bochuan Lyu; Illya V. Hicks; Joey Huchette (Math. Program., 2024)

A polytime preprocess algorithm for the maximum independent set problem. - Samuel Kroger; Hamidreza Validi; Illya V. Hicks (Optim. Lett., 2024)

A folding preprocess for the max k-cut problem. - Ramin Fakhimi; Hamidreza Validi; Illya V. Hicks; Tamás Terlaky; Luis F. Zuluaga (Optim. Lett., 2025)