| Publication | Date of Publication | Type |
|---|
| The many face(t)s of zero forcing | 2024-09-26 | Paper |
| A polytime preprocess algorithm for the maximum independent set problem | 2024-03-11 | Paper |
| Modeling combinatorial disjunctive constraints via junction trees | 2024-02-21 | Paper |
| The set partitioning problem in a quantum context | 2024-01-22 | Paper |
| Linear-size formulations for connected planar graph partitioning and political districting | 2024-01-22 | Paper |
| Minimum k‐cores and the k‐core polytope | 2023-12-12 | Paper |
| Tangle bases: Revisited | 2023-12-11 | Paper |
| An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs | 2023-12-11 | Paper |
| New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts | 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 | 2023-11-23 | Paper |
| On relaxations of the max $k$-cut problem formulations | 2023-08-02 | Paper |
| Finding biclique partitions of co-chordal graphs | 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 | 2023-01-11 | Paper |
| Improved Computational Approaches and Heuristics for Zero Forcing | 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 | 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 | 2019-10-18 | Paper |
| Computational approaches for zero forcing and related problems | 2018-12-06 | Paper |
| Effects of vertex degrees on the zero-forcing number and propagation time of a graph | 2018-10-26 | Paper |
| A branch-and-price-and-cut method for computing an optimal bramble | 2018-05-24 | Paper |
| A Branch Decomposition Algorithm for the p-Median Problem | 2017-12-29 | Paper |
| Complexity and computation of connected zero forcing | 2017-07-27 | Paper |
| Memory efficient algorithms for cactus graphs and block graphs | 2017-05-12 | Paper |
| Graphs with Extremal Connected Forcing Numbers | 2017-01-30 | Paper |
| On the 2-Club Polytope of Graphs | 2017-01-26 | Paper |
| The minimal \(k\)-core problem for modeling \(k\)-assemblies | 2016-05-12 | Paper |
| Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs | 2016-04-07 | Paper |
| Co-2-plex vertex partitions | 2015-09-28 | Paper |
| A note on total and paired domination of Cartesian product graphs | 2014-08-14 | Paper |
| Branch decomposition heuristics for linear matroids | 2014-04-15 | Paper |
| Scheduling the adjuvant endocrine therapy for early stage breast cancer | 2012-11-15 | Paper |
| Combinatorial algorithms for the maximum \(k\)-plex problem | 2012-07-10 | Paper |
| A combinatorial optimization algorithm for solving the branchwidth problem | 2012-06-19 | Paper |
| Planar branch decompositions. I: The ratcatcher | 2012-06-18 | Paper |
| Planar branch decompositions. II: The cycle method | 2012-06-18 | Paper |
| An algebraic exploration of dominating sets and Vizing's conjecture | 2012-06-12 | Paper |
| Co-2-plex polynomials | 2012-04-04 | Paper |
| Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem | 2011-07-19 | Paper |
| The Co-2-plex Polytope and Integral Systems | 2010-08-27 | Paper |
| Composition of stable set polyhedra | 2008-11-27 | Paper |
| New facets for the planar subgraph polytope | 2008-03-12 | Paper |
| The branchwidth of graphs and their cycle matroids | 2007-08-20 | Paper |
| Restricted b‐factors in bipartite graphs and t‐designs | 2006-06-06 | Paper |
| A branch-and-price approach for the maximum weight independent set problem | 2006-01-10 | Paper |
| Graphs, branchwidth, and tangles! Oh my! | 2005-04-21 | Paper |
| Branch decompositions and minor containment | 2004-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430877 | 2003-10-13 | Paper |
