Illya V. Hicks

66 papers A 1B 1C 1Journal 62

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