Illya V. Hicks

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 33

Top Topics

Integer Program

Top Venues

Discret. Appl. Math.

INFORMS J. Comput.

Publications

Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks
Linear-size formulations for connected planar graph partitioning and political districting. Optim. Lett. 18 (1) (2024)
Bochuan Lyu, Illya V. Hicks, Joey Huchette
Modeling combinatorial disjunctive constraints via junction trees. Math. Program. 204 (1) (2024)
Rafael Cação, Lucas R. C. T. Cortez, Jackson Forner, Hamidreza Validi, Ismael R. de Farias Jr., Illya V. Hicks
The set partitioning problem in a quantum context. Optim. Lett. 18 (1) (2024)
Samuel Kroger, Hamidreza Validi, Illya V. Hicks
A polytime preprocess algorithm for the maximum independent set problem. Optim. Lett. 18 (2) (2024)
Bochuan Lyu, Illya V. Hicks
Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number. CoRR (2023)
Bochuan Lyu, Illya V. Hicks
Finding biclique partitions of co-chordal graphs. Discret. Appl. Math. 337 (2023)
Raul Garcia, Illya V. Hicks, Joey Huchette
Combinatorial Disjunctive Constraints for Obstacle Avoidance in Path Planning. IROS (2023)
Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga
-cut problem formulations. Oper. Res. Lett. 51 (5) (2023)
Illya V. Hicks, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David Roberson, Logan A. Smith
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph. INFORMS J. Comput. 34 (6) (2022)
Stuart Baxley, Deniz Gurkan, Hamidreza Validi, Illya V. Hicks
Graph Representation of Computer Network Resources for Precise Allocations. ICCCN (2022)
Derek Mikesell, Illya V. Hicks
Minimum k-cores and the k-core polytope. Networks 80 (1) (2022)
Bochuan Lyu, Illya V. Hicks
Finding Bipartite Partitions on Co-Chordal Graphs. CoRR (2022)
Logan A. Smith, David T. Mildebrath, Illya V. Hicks
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs. Networks 79 (1) (2022)
Brandon Alston, Hamidreza Validi, Illya V. Hicks
Mixed integer linear optimization formulations for learning optimal binary classification trees. CoRR (2022)
Logan A. Smith, Illya V. Hicks
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts. Networks 79 (2) (2022)
Illya V. Hicks, Boris Brimkov
Tangle bases: Revisited. Networks 77 (1) (2021)
Boris Brimkov, Derek Mikesell, Illya V. Hicks
Improved Computational Approaches and Heuristics for Zero Forcing. INFORMS J. Comput. 33 (4) (2021)
Logan A. Smith, David T. Mildebrath, Illya V. Hicks
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs. CoRR (2020)
Logan A. Smith, Illya V. Hicks
Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts. CoRR (2020)
Logan A. Smith, Derek Mikesell, Illya V. Hicks
An integer program for positive semidefinite zero forcing in graphs. Networks 76 (3) (2020)
Boris Brimkov, Joshua Carlson, Illya V. Hicks, Rutvik Patel, Logan A. Smith
Power domination throttling. Theor. Comput. Sci. 795 (2019)
Logan A. Smith, David T. Mildebrath, Illya V. Hicks
A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti. CoRR (2019)
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Computational approaches for zero forcing and related problems. Eur. J. Oper. Res. 273 (3) (2019)
Caleb C. Fast, Illya V. Hicks
Effects of vertex degrees on the zero-forcing number and propagation time of a graph. Discret. Appl. Math. 250 (2018)
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Graphs with Extremal Connected Forcing Numbers. CoRR (2017)
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Computational Approaches for Zero Forcing and Related Problems. CoRR (2017)
Boris Brimkov, Illya V. Hicks
Complexity and computation of connected zero forcing. Discret. Appl. Math. 229 (2017)
Derek Mikesell, Illya V. Hicks
Image Segmentation via Weighted Carving Decompositions. IWCIA (2017)
Caleb C. Fast, Illya V. Hicks
-Median Problem. INFORMS J. Comput. 29 (3) (2017)
Boris Brimkov, Illya V. Hicks
Memory efficient algorithms for cactus graphs and block graphs. Discret. Appl. Math. 216 (2017)
Boris Brimkov, Illya V. Hicks
On the logspace shortest path problem. Electron. Colloquium Comput. Complex. 23 (2016)
Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks
On the 2-Club Polytope of Graphs. Oper. Res. 64 (6) (2016)
Boris Brimkov, Illya V. Hicks
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. Discret. Appl. Math. 204 (2016)
Boris Brimkov, Illya V. Hicks
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. CoRR (2015)
Benjamin McClosky, John D. Arellano, Illya V. Hicks
Co-2-plex vertex partitions. J. Comb. Optim. 30 (3) (2015)
Sibel B. Sonuc, J. Cole Smith, Illya V. Hicks
A branch-and-price-and-cut method for computing an optimal bramble. Discret. Optim. 18 (2015)
Keerti Choudhary, Susan Margulies, Illya V. Hicks
Integer domination of Cartesian product graphs. Discret. Math. 338 (7) (2015)
John D. Arellano, Illya V. Hicks
Degree of Redundancy of Linear Systems Using Implicit Set Covering. IEEE Trans Autom. Sci. Eng. 11 (1) (2014)
Keerti Choudhary, Susan Margulies, Illya V. Hicks
A Note on Total and Paired Domination of Cartesian Product Graphs. Electron. J. Comb. 20 (3) (2013)
Susan Margulies, Jing Ma, Illya V. Hicks
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming. INFORMS J. Comput. 25 (4) (2013)
Jing Ma, Susan Margulies, Illya V. Hicks, Edray Goins
Branch decomposition heuristics for linear matroids. Discret. Optim. 10 (2) (2013)
J. Cole Smith, Elif Ulusal, Illya V. Hicks
A combinatorial optimization algorithm for solving the branchwidth problem. Comput. Optim. Appl. 51 (3) (2012)
Susan Margulies, Illya V. Hicks
An Algebraic Exploration of Dominating Sets and Vizing's Conjecture. Electron. J. Comb. 19 (2) (2012)
Benjamin McClosky, Illya V. Hicks
Combinatorial algorithms for the maximum k-plex problem. J. Comb. Optim. 23 (1) (2012)
Sera Kahruman-Anderoglu, Elif Ulusal, Sergiy Butenko, Illya V. Hicks, Kathleen M. Diehl
Scheduling the adjuvant endocrine therapy for early stage breast cancer. Ann. Oper. Res. 196 (1) (2012)
Benjamin McClosky, Anthony Simms, Illya V. Hicks
Co-2-plex polynomials. J. Comb. Optim. 22 (4) (2011)
K. Choudhary, Susan Margulies, Illya V. Hicks
A Note on Total and Paired Domination of Cartesian Product Graphs CoRR (2011)
Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks
-Plex Problem. Oper. Res. 59 (1) (2011)
Benjamin McClosky, Illya V. Hicks
The Co-2-plex Polytope and Integral Systems. SIAM J. Discret. Math. 23 (3) (2009)
Illya V. Hicks
New facets for the planar subgraph polytope. Networks 51 (2) (2008)
Benjamin McClosky, Illya V. Hicks
Composition of stable set polyhedra. Oper. Res. Lett. 36 (5) (2008)
Illya V. Hicks, Nolan B. McMurray Jr.
The branchwidth of graphs and their cycle matroids. J. Comb. Theory, Ser. B 97 (5) (2007)
Sera Kahruman-Anderoglu, Elif Kolotoglu, Sergiy Butenko, Illya V. Hicks
On greedy construction heuristics for the MAX-CUT problem. Int. J. Comput. Sci. Eng. 3 (3) (2007)
Deepak Warrier, Wilbert E. Wilhelm, Jeffrey S. Warren, Illya V. Hicks
A branch-and-price approach for the maximum weight independent set problem. Networks 46 (4) (2005)
Illya V. Hicks
Graphs, branchwidth, and tangles! Oh my! Networks 45 (2) (2005)
Illya V. Hicks
Planar Branch Decompositions I: The Ratcatcher. INFORMS J. Comput. 17 (4) (2005)
Illya V. Hicks
Planar Branch Decompositions II: The Cycle Method. INFORMS J. Comput. 17 (4) (2005)
Illya V. Hicks
Branch decompositions and minor containment. Networks 43 (1) (2004)