| Publication | Date of Publication | Type |
|---|
| Exact and heuristic solutions for the prize‐collecting geometric enclosure problem | 2024-03-12 | Paper |
| Lagrangian relaxation for maximum service in multicast routing with QoS constraints | 2023-11-29 | Paper |
| A heuristic for the convex recoloring problem in graphs | 2023-11-27 | Paper |
| A matheuristic for the firefighter problem on graphs | 2023-11-17 | Paper |
| Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic | 2023-11-16 | Paper |
| Scalable timing-aware network design via Lagrangian decomposition | 2023-07-10 | Paper |
| Triangle-Based Heuristics for Area Optimal Polygonizations | 2022-09-06 | Paper |
| Optimal area polygonization problems: exact solutions through geometric duality | 2022-06-22 | Paper |
| A GRASP for the convex recoloring problem in graphs | 2022-04-27 | Paper |
| Solving the minimum convex partition of point sets with integer programming | 2021-12-15 | Paper |
| Minimum convex partition of point sets | 2020-02-06 | Paper |
| Solving dynamic labeling problems to optimality using solution space reductions | 2019-09-10 | Paper |
| Solving the geometric firefighter routing problem via integer programming | 2019-01-09 | Paper |
| Minimum stabbing rectangular partitions of rectilinear polygons | 2018-07-11 | Paper |
| Finding exact solutions for the geometric firefighter problem in practice | 2018-07-11 | Paper |
| Arc-based integer programming formulations for three variants of proportional symbol maps | 2018-05-24 | Paper |
| Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph | 2018-05-24 | Paper |
| Scheduling activities at oil wells with resource displacement | 2018-01-12 | Paper |
| Algorithm 966 | 2017-06-30 | Paper |
| Fast Optimal Labelings for Rotating Maps | 2017-05-05 | Paper |
| Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation | 2017-02-17 | Paper |
| A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps | 2017-01-05 | Paper |
| Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm | 2016-11-17 | Paper |
| Partitions of rectilinear polygons with minimum stabbing number | 2016-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740776 | 2016-07-20 | Paper |
| Computing Minimum Dilation Spanning Trees in Geometric Graphs | 2015-10-29 | Paper |
| An Integer Programming Formulation for the Maximum k-Subset Intersection Problem | 2015-10-16 | Paper |
| Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic | 2015-07-29 | Paper |
| The eternal dominating set problem for proper interval graphs | 2015-05-21 | Paper |
| Solving the natural wireless localization problem to optimality efficiently | 2015-04-27 | Paper |
| On the complexity of the traveling umpire problem | 2014-12-02 | Paper |
| Integer programming approaches for minimum stabbing problems | 2014-05-26 | Paper |
| New branch-and-bound algorithms for k-cardinality tree problems | 2013-07-23 | Paper |
| A branch&cut algorithm for the maximum common edge subgraph problem | 2013-07-19 | Paper |
| Upper and lower bounding procedures for the minimum caterpillar spanning problem | 2013-07-19 | Paper |
| A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem | 2013-07-19 | Paper |
| An exact algorithm for minimizing vertex guards on art galleries | 2013-03-19 | Paper |
| The maximum common edge subgraph problem: A polyhedral investigation | 2012-11-22 | Paper |
| A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem | 2012-11-22 | Paper |
| Polyhedral study of the maximum common induced subgraph problem | 2012-11-15 | Paper |
| The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation | 2012-11-02 | Paper |
| A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem | 2012-05-13 | Paper |
| The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm | 2011-10-27 | Paper |
| A branch-and-price approach for the partition coloring problem | 2011-08-09 | Paper |
| Exact algorithms for the vertex separator problem in graphs | 2011-06-22 | Paper |
| Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs | 2011-06-10 | Paper |
| An exact approach to the problem of extracting an embedded network matrix | 2011-04-28 | Paper |
| Acyclic Orientations with Path Constraints | 2010-10-26 | Paper |
| Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem | 2009-03-03 | Paper |
| Column Generation Algorithms for the Capacitated m-Ring-Star Problem | 2008-07-10 | Paper |
| The datapath merging problem in reconfigurable systems | 2008-06-20 | Paper |
| A note on characterizing canonical cuts using geometry | 2008-03-19 | Paper |
| A relax-and-cut algorithm for the set partitioning problem | 2007-11-30 | Paper |
| A column generation approach for SONET ring assignment | 2006-06-06 | Paper |
| Multiprocessor scheduling under precedence constraints: polyhedral results | 2006-04-28 | Paper |
| Vehicle and crew scheduling for urban bus lines | 2005-12-05 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| The vertex separator problem: algorithms and computations | 2005-08-08 | Paper |
| The vertex separator problem: a polyhedral investigation | 2005-08-08 | Paper |
| Constructing nurse schedules at large hospitals | 2004-08-10 | Paper |
| Optimal rectangular partitions | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776558 | 2002-02-28 | Paper |
| Scheduling projects with labor constraints | 2002-02-27 | Paper |
| Rearrangement of DNA fragments: a branch-and-cut algorithm. | 2002-01-01 | Paper |
| Scheduling under labour resource constraints | 2001-07-05 | Paper |
| The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations | 2001-06-07 | Paper |
| A new formulation for scheduling unrelated processor under precedence constraints | 2001-04-19 | Paper |
| EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING | 2001-02-22 | Paper |
| The node capacitated graph partitioning problem: A computational study | 1999-06-03 | Paper |
| Static output feedback controllers: stability and convexity | 1999-05-05 | Paper |
| Formulations and valid inequalities of the node capacitated graph partitioning problem | 1996-10-31 | Paper |
| A new approach to minimising the frontwidth in finite element calculations | 1996-09-23 | Paper |
| Some new classes of facets for the equicut polytope | 1996-05-30 | Paper |
| Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study | 1994-03-21 | Paper |
| A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem | 1990-01-01 | Paper |
