| Publication | Date of Publication | Type |
|---|
The many face(t)s of zero forcing
Notices of the American Mathematical Society | 2024-09-26 | Paper |
A polytime preprocess algorithm for the maximum independent set problem
Optimization Letters | 2024-03-11 | Paper |
Modeling combinatorial disjunctive constraints via junction trees
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
The set partitioning problem in a quantum context
Optimization Letters | 2024-01-22 | Paper |
Linear-size formulations for connected planar graph partitioning and political districting
Optimization Letters | 2024-01-22 | Paper |
Minimum k‐cores and the k‐core polytope
Networks | 2023-12-12 | Paper |
Tangle bases: Revisited
Networks | 2023-12-11 | Paper |
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
Networks | 2023-12-11 | Paper |
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
Networks | 2023-12-11 | Paper |
Combinatorial Disjunctive Constraints for Obstacle Avoidance in Path Planning
| 2023-12-04 | Paper |
An integer program for positive semidefinite zero forcing in graphs
Networks | 2023-11-23 | Paper |
On relaxations of the max $k$-cut problem formulations
| 2023-08-02 | Paper |
Finding biclique partitions of co-chordal graphs
Discrete Applied Mathematics | 2023-06-15 | Paper |
Building Formulations for Piecewise Linear Relaxations of Nonlinear Functions
| 2023-04-27 | Paper |
Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number
| 2023-02-24 | Paper |
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
INFORMS Journal on Computing | 2023-01-11 | Paper |
Improved Computational Approaches and Heuristics for Zero Forcing
INFORMS Journal on Computing | 2022-06-28 | Paper |
Mixed integer linear optimization formulations for learning optimal binary classification trees
| 2022-06-09 | Paper |
Image segmentation via weighted carving decompositions
Lecture Notes in Computer Science | 2022-05-18 | Paper |
A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti
| 2019-12-26 | Paper |
Power domination throttling
Theoretical Computer Science | 2019-10-18 | Paper |
Computational approaches for zero forcing and related problems
European Journal of Operational Research | 2018-12-06 | Paper |
Effects of vertex degrees on the zero-forcing number and propagation time of a graph
Discrete Applied Mathematics | 2018-10-26 | Paper |
A branch-and-price-and-cut method for computing an optimal bramble
Discrete Optimization | 2018-05-24 | Paper |
A branch decomposition algorithm for the \(p\)-median problem
INFORMS Journal on Computing | 2017-12-29 | Paper |
Complexity and computation of connected zero forcing
Discrete Applied Mathematics | 2017-07-27 | Paper |
Memory efficient algorithms for cactus graphs and block graphs
Discrete Applied Mathematics | 2017-05-12 | Paper |
Graphs with Extremal Connected Forcing Numbers
| 2017-01-30 | Paper |
On the 2-club polytope of graphs
Operations Research | 2017-01-26 | Paper |
The minimal \(k\)-core problem for modeling \(k\)-assemblies
The Journal of Mathematical Neuroscience | 2016-05-12 | Paper |
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
Discrete Applied Mathematics | 2016-04-07 | Paper |
Co-2-plex vertex partitions
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
A note on total and paired domination of Cartesian product graphs
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Branch decomposition heuristics for linear matroids
Discrete Optimization | 2014-04-15 | Paper |
Scheduling the adjuvant endocrine therapy for early stage breast cancer
Annals of Operations Research | 2012-11-15 | Paper |
Combinatorial algorithms for the maximum \(k\)-plex problem
Journal of Combinatorial Optimization | 2012-07-10 | Paper |
A combinatorial optimization algorithm for solving the branchwidth problem
Computational Optimization and Applications | 2012-06-19 | Paper |
Planar branch decompositions. I: The ratcatcher
INFORMS Journal on Computing | 2012-06-18 | Paper |
Planar branch decompositions. II: The cycle method
INFORMS Journal on Computing | 2012-06-18 | Paper |
An algebraic exploration of dominating sets and Vizing's conjecture
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Co-2-plex polynomials
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
Clique relaxations in social network analysis: the maximum \(k\)-plex problem
Operations Research | 2011-07-19 | Paper |
The Co-2-plex Polytope and Integral Systems
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Composition of stable set polyhedra
Operations Research Letters | 2008-11-27 | Paper |
New facets for the planar subgraph polytope
Networks | 2008-03-12 | Paper |
The branchwidth of graphs and their cycle matroids
Journal of Combinatorial Theory. Series B | 2007-08-20 | Paper |
Restricted b‐factors in bipartite graphs and t‐designs
Journal of Combinatorial Designs | 2006-06-06 | Paper |
A branch-and-price approach for the maximum weight independent set problem
Networks | 2006-01-10 | Paper |
Graphs, branchwidth, and tangles! Oh my!
Networks | 2005-04-21 | Paper |
Branch decompositions and minor containment
Networks | 2004-02-03 | Paper |
scientific article; zbMATH DE number 1990711 (Why is no real title available?)
| 2003-10-13 | Paper |
