| Publication | Date of Publication | Type |
|---|
| Solution strategies for integrated distribution, production, and relocation problems arising in modular manufacturing | 2024-06-17 | Paper |
| Asymptotic bounds for clustering problems in random graphs | 2024-03-15 | Paper |
| On maximum ratio clique relaxations | 2023-12-12 | Paper |
| Can fast food eating patterns be healthy? An optimization-based analysis of popular US fast-food chains | 2023-06-05 | Paper |
| Continuous cubic formulations for cluster detection problems in networks | 2022-11-14 | Paper |
| A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem | 2022-09-14 | Paper |
| Networks of causal relationships in the U.S. stock market | 2022-06-24 | Paper |
| An improved approximation for maximum \(k\)-dependent set on bipartite graphs | 2021-12-07 | Paper |
| Polyhedral properties of the induced cluster subgraphs | 2021-04-29 | Paper |
| A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem | 2021-01-07 | Paper |
| The maximum independent union of cliques problem: complexity and exact approaches | 2020-04-21 | Paper |
| The maximum number of induced open triangles in graphs of a given order | 2019-12-03 | Paper |
| Algorithms for the generalized independent set problem based on a quadratic optimization approach | 2019-10-18 | Paper |
| Exact algorithms for the minimum \(s\)-club partitioning problem | 2019-10-18 | Paper |
| Scale reduction techniques for computing maximum induced bicliques | 2019-05-08 | Paper |
| A nonconvex quadratic optimization approach to the maximum edge weight clique problem | 2018-12-21 | Paper |
| Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph | 2018-10-04 | Paper |
| Detecting robust cliques in graphs subject to uncertain edge failures | 2018-06-13 | Paper |
| On provably best construction heuristics for hard combinatorial optimization problems | 2018-05-11 | Paper |
| On biconnected and fragile subgraphs of low diameter | 2018-02-06 | Paper |
| On imposing connectivity constraints in integer programs | 2017-12-01 | Paper |
| On robust clusters of minimum cardinality in networks | 2017-03-07 | Paper |
| Distance-Based Clique Relaxations in Networks: s-Clique and s-Club | 2016-09-13 | Paper |
| Book review of: Y. D. Sergeyev et al., Introduction to global optimization exploiting space-filling curves | 2016-05-20 | Paper |
| Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs | 2016-05-04 | Paper |
| Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks | 2015-09-11 | Paper |
| An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets | 2015-09-11 | Paper |
| On connected dominating sets of restricted diameter | 2015-07-29 | Paper |
| The maximum ratio clique problem | 2015-07-29 | Paper |
| Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs | 2014-12-05 | Paper |
| A network-based data mining approach to portfolio selection via weighted clique relaxations | 2014-09-26 | Paper |
| On clique relaxation models in network analysis | 2014-07-27 | Paper |
| Computational study of the US stock market evolution: a rank correlation-based network model | 2014-03-10 | Paper |
| Approximating 2-cliques in unit disk graphs | 2014-02-18 | Paper |
| Algorithms for the maximum \(k\)-club problem in graphs | 2013-12-02 | Paper |
| Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations | 2013-08-26 | Paper |
| A global optimization algorithm for solving the minimum multiple ratio spanning tree problem | 2013-08-01 | Paper |
| Numerical methods and optimization. An introduction | 2013-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5298938 | 2013-06-25 | Paper |
| A distributed approximation algorithm for the bottleneck connected dominating set problem | 2012-12-28 | Paper |
| On the maximum quasi-clique problem | 2012-11-22 | Paper |
| Scheduling the adjuvant endocrine therapy for early stage breast cancer | 2012-11-15 | Paper |
| Clique Relaxation Models in Social Network Analysis | 2012-09-28 | Paper |
| Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem | 2011-07-19 | Paper |
| On connected domination in unit ball graphs | 2011-05-20 | Paper |
| Estimating the size of correcting codes using extremal graph problems | 2010-03-04 | Paper |
| Comments on: Optimization and data mining in biomedicine | 2010-01-29 | Paper |
| Checking solvability of systems of interval linear equations and inequalities via mixed integer programming | 2009-12-07 | Paper |
| Statistical analysis of financial networks | 2008-11-26 | Paper |
| Using critical sets to solve the maximum independent set problem | 2007-10-30 | Paper |
| On a polynomial fractional formulation for independence number of a graph | 2007-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294075 | 2007-07-23 | Paper |
| ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING | 2007-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5493638 | 2006-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5493660 | 2006-10-16 | Paper |
| Mining market data: a network approach | 2006-08-14 | Paper |
| Clique-detection models in computational biochemistry and genomics | 2006-05-29 | Paper |
| Constructing test functions for global optimization using continuous formulations of graph problems | 2006-01-10 | Paper |
| Novel approaches for analyzing biological networks | 2005-12-13 | Paper |
| Optimal security liquidation algorithms | 2005-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3155246 | 2005-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429163 | 2003-09-24 | Paper |
| Nonlinear dynamical systems and adaptive filters in biomedicine | 2003-05-11 | Paper |
| A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere | 2002-08-20 | Paper |
| On the chromatic number of graphs | 2001-08-28 | Paper |
| Finding independent sets in a graph using continuous multivariable polynomial formulations. | 2001-01-01 | Paper |
