Illya V. Hicks

According to our database1, Illya V. Hicks authored at least 41 papers between 2004 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Tangle bases: Revisited.
Networks, 2021

2020
An integer program for positive semidefinite zero forcing in graphs.
Networks, 2020

Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts.
CoRR, 2020

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs.
CoRR, 2020

2019
Power domination throttling.
Theor. Comput. Sci., 2019

Computational approaches for zero forcing and related problems.
Eur. J. Oper. Res., 2019

A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti.
CoRR, 2019

2018
Effects of vertex degrees on the zero-forcing number and propagation time of a graph.
Discret. Appl. Math., 2018

2017
A Branch Decomposition Algorithm for the <i>p</i>-Median Problem.
INFORMS J. Comput., 2017

Complexity and computation of connected zero forcing.
Discret. Appl. Math., 2017

Memory efficient algorithms for cactus graphs and block graphs.
Discret. Appl. Math., 2017

Graphs with Extremal Connected Forcing Numbers.
CoRR, 2017

Image Segmentation via Weighted Carving Decompositions.
Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

2016
On the 2-Club Polytope of Graphs.
Oper. Res., 2016

On the logspace shortest path problem.
Electron. Colloquium Comput. Complex., 2016

Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs.
Discret. Appl. Math., 2016

2015
Co-2-plex vertex partitions.
J. Comb. Optim., 2015

Integer domination of Cartesian product graphs.
Discret. Math., 2015

A branch-and-price-and-cut method for computing an optimal bramble.
Discret. Optim., 2015

2014
Degree of Redundancy of Linear Systems Using Implicit Set Covering.
IEEE Trans Autom. Sci. Eng., 2014

2013
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming.
INFORMS J. Comput., 2013

Branch decomposition heuristics for linear matroids.
Discret. Optim., 2013

A Note on Total and Paired Domination of Cartesian Product Graphs.
Electron. J. Comb., 2013

2012
Combinatorial algorithms for the maximum k-plex problem.
J. Comb. Optim., 2012

An Algebraic Exploration of Dominating Sets and Vizing's Conjecture.
Electron. J. Comb., 2012

A combinatorial optimization algorithm for solving the branchwidth problem.
Comput. Optim. Appl., 2012

Scheduling the adjuvant endocrine therapy for early stage breast cancer.
Ann. Oper. Res., 2012

2011
Co-2-plex polynomials.
J. Comb. Optim., 2011

Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem.
Oper. Res., 2011

A Note on Total and Paired Domination of Cartesian Product Graphs
CoRR, 2011

2009
Branchwidth and Branch Decompositions.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

The Co-2-plex Polytope and Integral Systems.
SIAM J. Discret. Math., 2009

2008
Composition of stable set polyhedra.
Oper. Res. Lett., 2008

New facets for the planar subgraph polytope.
Networks, 2008

2007
The branchwidth of graphs and their cycle matroids.
J. Comb. Theory, Ser. B, 2007

On greedy construction heuristics for the MAX-CUT problem.
Int. J. Comput. Sci. Eng., 2007

2005
A branch-and-price approach for the maximum weight independent set problem.
Networks, 2005

Graphs, branchwidth, and tangles! Oh my!
Networks, 2005

Planar Branch Decompositions II: The Cycle Method.
INFORMS J. Comput., 2005

Planar Branch Decompositions I: The Ratcatcher.
INFORMS J. Comput., 2005

2004
Branch decompositions and minor containment.
Networks, 2004


  Loading...