Illya V. Hicks

From MaRDI portal
Person:266793

Available identifiers

zbMath Open hicks.illya-vMaRDI QIDQ266793

List of research outcomes

PublicationDate of PublicationType
A polytime preprocess algorithm for the maximum independent set problem2024-03-11Paper
Modeling combinatorial disjunctive constraints via junction trees2024-02-21Paper
The set partitioning problem in a quantum context2024-01-22Paper
Linear-size formulations for connected planar graph partitioning and political districting2024-01-22Paper
Minimum k‐cores and the k‐core polytope2023-12-12Paper
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs2023-12-11Paper
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts2023-12-11Paper
Tangle bases: Revisited2023-12-11Paper
Combinatorial Disjunctive Constraints for Obstacle Avoidance in Path Planning2023-12-04Paper
An integer program for positive semidefinite zero forcing in graphs2023-11-23Paper
On relaxations of the max $k$-cut problem formulations2023-08-02Paper
Finding biclique partitions of co-chordal graphs2023-06-15Paper
Building Formulations for Piecewise Linear Relaxations of Nonlinear Functions2023-04-27Paper
Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number2023-02-24Paper
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph2023-01-11Paper
Improved Computational Approaches and Heuristics for Zero Forcing2022-06-28Paper
Mixed integer linear optimization formulations for learning optimal binary classification trees2022-06-09Paper
Image Segmentation via Weighted Carving Decompositions2022-05-18Paper
A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti2019-12-26Paper
Power domination throttling2019-10-18Paper
Computational approaches for zero forcing and related problems2018-12-06Paper
Effects of vertex degrees on the zero-forcing number and propagation time of a graph2018-10-26Paper
A branch-and-price-and-cut method for computing an optimal bramble2018-05-24Paper
A Branch Decomposition Algorithm for the p-Median Problem2017-12-29Paper
Complexity and computation of connected zero forcing2017-07-27Paper
Memory efficient algorithms for cactus graphs and block graphs2017-05-12Paper
Graphs with Extremal Connected Forcing Numbers2017-01-30Paper
On the 2-Club Polytope of Graphs2017-01-26Paper
The minimal \(k\)-core problem for modeling \(k\)-assemblies2016-05-12Paper
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs2016-04-07Paper
Co-2-plex vertex partitions2015-09-28Paper
Branch decomposition heuristics for linear matroids2014-04-15Paper
Scheduling the adjuvant endocrine therapy for early stage breast cancer2012-11-15Paper
Combinatorial algorithms for the maximum \(k\)-plex problem2012-07-10Paper
A combinatorial optimization algorithm for solving the branchwidth problem2012-06-19Paper
Planar Branch Decompositions I: The Ratcatcher2012-06-18Paper
Planar Branch Decompositions II: The Cycle Method2012-06-18Paper
An algebraic exploration of dominating sets and Vizing's conjecture2012-06-12Paper
Co-2-plex polynomials2012-04-04Paper
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem2011-07-19Paper
The Co-2-plex Polytope and Integral Systems2010-08-27Paper
Composition of stable set polyhedra2008-11-27Paper
New facets for the planar subgraph polytope2008-03-12Paper
The branchwidth of graphs and their cycle matroids2007-08-20Paper
Restricted b‐factors in bipartite graphs and t‐designs2006-06-06Paper
A branch-and-price approach for the maximum weight independent set problem2006-01-10Paper
Graphs, branchwidth, and tangles! Oh my!2005-04-21Paper
Branch decompositions and minor containment2004-02-03Paper
https://portal.mardi4nfdi.de/entity/Q44308772003-10-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Illya V. Hicks