default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIllya V. Hicks
Person information
- affiliation: Rice University, Houston, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Samuel Kroger
, Hamidreza Validi, Illya V. Hicks:
Maximizing Engagement in Large-Scale Social Networks. INFORMS J. Optim. 6(3-4): 196-213 (2024)- [j44]Bochuan Lyu, Illya V. Hicks, Joey Huchette:
Modeling combinatorial disjunctive constraints via junction trees. Math. Program. 204(1): 385-413 (2024) - [j43]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): 1-17 (2024) - [j42]Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks:
Linear-size formulations for connected planar graph partitioning and political districting. Optim. Lett. 18(1): 19-31 (2024) - [j41]Samuel Kroger, Hamidreza Validi, Illya V. Hicks:
A polytime preprocess algorithm for the maximum independent set problem. Optim. Lett. 18(2): 651-661 (2024) - [i12]Brandon Alston, Illya V. Hicks:
Optimal Mixed Integer Linear Optimization Trained Multivariate Classification Trees. CoRR abs/2408.01297 (2024) - 2023
- [j40]Bochuan Lyu, Illya V. Hicks:
Finding biclique partitions of co-chordal graphs. Discret. Appl. Math. 337: 278-287 (2023) - [j39]Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga:
On relaxations of the max k-cut problem formulations. Oper. Res. Lett. 51(5): 521-527 (2023) - [c3]Raul Garcia, Illya V. Hicks, Joey Huchette:
Combinatorial Disjunctive Constraints for Obstacle Avoidance in Path Planning. IROS 2023: 267-273 - [i11]Bochuan Lyu, Illya V. Hicks:
Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number. CoRR abs/2302.12775 (2023) - 2022
- [j38]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): 2868-2872 (2022) - [j37]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): 3-19 (2022) - [j36]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): 202-219 (2022) - [j35]Derek Mikesell, Illya V. Hicks:
Minimum k-cores and the k-core polytope. Networks 80(1): 93-108 (2022) - [c2]Stuart Baxley, Deniz Gurkan, Hamidreza Validi, Illya V. Hicks:
Graph Representation of Computer Network Resources for Precise Allocations. ICCCN 2022: 1-10 - [i10]Bochuan Lyu, Illya V. Hicks:
Finding Bipartite Partitions on Co-Chordal Graphs. CoRR abs/2203.02837 (2022) - [i9]Brandon Alston, Hamidreza Validi, Illya V. Hicks:
Mixed integer linear optimization formulations for learning optimal binary classification trees. CoRR abs/2206.04857 (2022) - 2021
- [j34]Boris Brimkov, Derek Mikesell, Illya V. Hicks:
Improved Computational Approaches and Heuristics for Zero Forcing. INFORMS J. Comput. 33(4): 1384-1399 (2021) - [j33]Illya V. Hicks, Boris Brimkov:
Tangle bases: Revisited. Networks 77(1): 161-172 (2021) - 2020
- [j32]Logan A. Smith, Derek Mikesell, Illya V. Hicks:
An integer program for positive semidefinite zero forcing in graphs. Networks 76(3): 366-380 (2020) - [i8]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 abs/2006.02988 (2020) - [i7]Logan A. Smith, Illya V. Hicks:
Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts. CoRR abs/2006.03460 (2020)
2010 – 2019
- 2019
- [j31]Boris Brimkov, Caleb C. Fast, Illya V. Hicks:
Computational approaches for zero forcing and related problems. Eur. J. Oper. Res. 273(3): 889-903 (2019) - [j30]Boris Brimkov, Joshua Carlson, Illya V. Hicks, Rutvik Patel, Logan A. Smith:
Power domination throttling. Theor. Comput. Sci. 795: 142-153 (2019) - [i6]Logan A. Smith, David T. Mildebrath, Illya V. Hicks:
A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti. CoRR abs/1912.11906 (2019) - 2018
- [j29]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: 215-226 (2018) - 2017
- [j28]Boris Brimkov, Illya V. Hicks:
Memory efficient algorithms for cactus graphs and block graphs. Discret. Appl. Math. 216: 393-407 (2017) - [j27]Boris Brimkov, Illya V. Hicks:
Complexity and computation of connected zero forcing. Discret. Appl. Math. 229: 31-45 (2017) - [j26]Caleb C. Fast, Illya V. Hicks:
A Branch Decomposition Algorithm for the p-Median Problem. INFORMS J. Comput. 29(3): 474-488 (2017) - [c1]Derek Mikesell, Illya V. Hicks:
Image Segmentation via Weighted Carving Decompositions. IWCIA 2017: 268-279 - [i5]Boris Brimkov, Caleb C. Fast, Illya V. Hicks:
Graphs with Extremal Connected Forcing Numbers. CoRR abs/1701.08500 (2017) - [i4]Boris Brimkov, Caleb C. Fast, Illya V. Hicks:
Computational Approaches for Zero Forcing and Related Problems. CoRR abs/1704.02065 (2017) - 2016
- [j25]Boris Brimkov, Illya V. Hicks:
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. Discret. Appl. Math. 204: 13-21 (2016) - [j24]Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks:
On the 2-Club Polytope of Graphs. Oper. Res. 64(6): 1466-1481 (2016) - [i3]Boris Brimkov, Illya V. Hicks:
On the logspace shortest path problem. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j23]Sibel B. Sonuc, J. Cole Smith, Illya V. Hicks:
A branch-and-price-and-cut method for computing an optimal bramble. Discret. Optim. 18: 168-188 (2015) - [j22]Keerti Choudhary, Susan Margulies, Illya V. Hicks:
Integer domination of Cartesian product graphs. Discret. Math. 338(7): 1239-1242 (2015) - [j21]Benjamin McClosky, John D. Arellano, Illya V. Hicks:
Co-2-plex vertex partitions. J. Comb. Optim. 30(3): 729-746 (2015) - [i2]Boris Brimkov, Illya V. Hicks:
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. CoRR abs/1501.04388 (2015) - 2014
- [j20]John D. Arellano, Illya V. Hicks:
Degree of Redundancy of Linear Systems Using Implicit Set Covering. IEEE Trans Autom. Sci. Eng. 11(1): 274-279 (2014) - 2013
- [j19]Keerti Choudhary, Susan Margulies, Illya V. Hicks:
A Note on Total and Paired Domination of Cartesian Product Graphs. Electron. J. Comb. 20(3): 25 (2013) - [j18]Jing Ma, Susan Margulies, Illya V. Hicks, Edray Goins:
Branch decomposition heuristics for linear matroids. Discret. Optim. 10(2): 102-119 (2013) - [j17]Susan Margulies, Jing Ma, Illya V. Hicks:
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming. INFORMS J. Comput. 25(4): 599-610 (2013) - 2012
- [j16]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): 683-705 (2012) - [j15]J. Cole Smith, Elif Ulusal, Illya V. Hicks:
A combinatorial optimization algorithm for solving the branchwidth problem. Comput. Optim. Appl. 51(3): 1211-1229 (2012) - [j14]Susan Margulies, Illya V. Hicks:
An Algebraic Exploration of Dominating Sets and Vizing's Conjecture. Electron. J. Comb. 19(2): 1 (2012) - [j13]Benjamin McClosky, Illya V. Hicks:
Combinatorial algorithms for the maximum k-plex problem. J. Comb. Optim. 23(1): 29-49 (2012) - 2011
- [j12]Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks:
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem. Oper. Res. 59(1): 133-142 (2011) - [j11]Benjamin McClosky, Anthony Simms, Illya V. Hicks:
Co-2-plex polynomials. J. Comb. Optim. 22(4): 640-650 (2011) - [i1]K. Choudhary, Susan Margulies, Illya V. Hicks:
A Note on Total and Paired Domination of Cartesian Product Graphs. CoRR abs/1109.2174 (2011)
2000 – 2009
- 2009
- [j10]Benjamin McClosky, Illya V. Hicks:
The Co-2-plex Polytope and Integral Systems. SIAM J. Discret. Math. 23(3): 1135-1148 (2009) - [r1]Illya V. Hicks:
Branchwidth and Branch Decompositions. Encyclopedia of Optimization 2009: 332-339 - 2008
- [j9]Illya V. Hicks:
New facets for the planar subgraph polytope. Networks 51(2): 120-132 (2008) - [j8]Benjamin McClosky, Illya V. Hicks:
Composition of stable set polyhedra. Oper. Res. Lett. 36(5): 615-617 (2008) - 2007
- [j7]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): 211-218 (2007) - [j6]Illya V. Hicks, Nolan B. McMurray Jr.:
The branchwidth of graphs and their cycle matroids. J. Comb. Theory B 97(5): 681-692 (2007) - 2005
- [j5]Illya V. Hicks:
Planar Branch Decompositions I: The Ratcatcher. INFORMS J. Comput. 17(4): 402-412 (2005) - [j4]Illya V. Hicks:
Planar Branch Decompositions II: The Cycle Method. INFORMS J. Comput. 17(4): 413-421 (2005) - [j3]Illya V. Hicks:
Graphs, branchwidth, and tangles! Oh my! Networks 45(2): 55-60 (2005) - [j2]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): 198-209 (2005) - 2004
- [j1]Illya V. Hicks:
Branch decompositions and minor containment. Networks 43(1): 1-9 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
