| Publication | Date of Publication | Type |
|---|
| Upper bounds and approximation results for the \(k\)-slow burning problem | 2025-01-27 | Paper |
| Efficient Implementation of a Novel Decomposition Approach for the Hazmat Network Design Problem with Capacity Constraints in Java Including Computational Results | 2024-12-01 | Dataset |
| Robust two-dose vaccination schemes and the directed \(b\)-matching problem | 2024-08-09 | Paper |
| Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations | 2024-05-03 | Paper |
| Robust transshipment problem under consistent flow constraints | 2024-01-18 | Paper |
| \(\Gamma\)-robust optimization of project scheduling problems | 2023-11-15 | Paper |
| Recycling inequalities for robust combinatorial optimization with budget uncertainty | 2023-11-09 | Paper |
| Optimal vaccination strategies for multiple dose vaccinations | 2023-08-03 | Paper |
| A branch and bound algorithm for robust binary optimization with budget uncertainty | 2023-07-24 | Paper |
| Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty | 2022-12-12 | Dataset |
| Robust minimum cost flow problem under consistent flow constraints | 2022-06-13 | Paper |
| On the burning number of \(p\)-caterpillars | 2021-12-08 | Paper |
| An adaptive discretization algorithm for the design of water usage and treatment networks | 2019-10-29 | Paper |
| Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem | 2019-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4630487 | 2019-03-26 | Paper |
| A flow based pruning scheme for enumerative equitable coloring algorithms | 2019-03-06 | Paper |
| Lot sizing with storage losses under demand uncertainty | 2018-12-06 | Paper |
| Accurate optimization models for interference constrained bandwidth allocation in cellular networks | 2018-12-03 | Paper |
| Robust flows over time: models and complexity results | 2018-09-28 | Paper |
| The budgeted minimum cost flow problem with unit upgrading cost | 2018-06-13 | Paper |
| The multi-band robust knapsack problem -- a dynamic programming approach | 2018-05-24 | Paper |
| The matching extension problem in general graphs is co-NP-complete | 2018-04-13 | Paper |
| Improved handling of uncertainty and robustness in set covering problems | 2018-02-06 | Paper |
| On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration | 2016-11-30 | Paper |
| A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks | 2016-11-11 | Paper |
| On the computational complexity of the virtual network embedding problem | 2016-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816028 | 2016-07-01 | Paper |
| Robust Metric Inequalities for Network Loading Under Demand Uncertainty | 2015-12-11 | Paper |
| Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks | 2015-01-26 | Paper |
| On exact algorithms for treewidth | 2014-12-05 | Paper |
| Speeding up column generation for robust wireless network planning | 2014-09-30 | Paper |
| Comparative study of approximation algorithms and heuristics for SINR scheduling with power control | 2014-09-18 | Paper |
| Robust network design: Formulations, valid inequalities, and computations | 2013-08-06 | Paper |
| A note on exact algorithms for vertex ordering problems on graphs | 2012-12-06 | Paper |
| Recoverable robust knapsacks: the discrete scenario case | 2012-11-30 | Paper |
| A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks | 2011-09-09 | Paper |
| Cutset Inequalities for Robust Network Design | 2011-09-09 | Paper |
| Designing AC Power Grids Using Integer Linear Programming | 2011-09-09 | Paper |
| Recoverable Robust Knapsacks: Γ-Scenarios | 2011-09-09 | Paper |
| Treewidth computations. II. Lower bounds | 2011-07-18 | Paper |
| On cut-based inequalities for capacitated network design polyhedra | 2011-03-16 | Paper |
| Comparing Imperfection Ratio and Imperfection Index for Graph Classes | 2010-10-26 | Paper |
| Treewidth computations. I: Upper bounds | 2010-04-14 | Paper |
| Graphs and Algorithms in Communication Networks on Seven League Boots | 2010-02-09 | Paper |
| Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems | 2010-02-09 | Paper |
| Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts | 2009-08-27 | Paper |
| Contraction and Treewidth Lower Bounds | 2009-01-19 | Paper |
| Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts | 2008-09-25 | Paper |
| Treewidth lower bounds with brambles | 2008-05-27 | Paper |
| Models and solution techniques for frequency assignment problems | 2008-03-31 | Paper |
| On Exact Algorithms for Treewidth | 2008-03-11 | Paper |
| Tight LP‐based lower bounds for wavelength conversion in optical networks | 2007-10-26 | Paper |
| On the maximum cardinality search lower bound for treewidth | 2007-07-19 | Paper |
| On determining the imperfection ratio | 2007-05-29 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Safe separators for treewidth | 2006-03-29 | Paper |
| On cycles and the stable multi-set polytope | 2006-01-09 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Models and solution techniques for frequency assignment problems | 2004-02-19 | Paper |
| Bidirected and unidirected capacity installation in telecommunication networks. | 2004-01-05 | Paper |
| Stable multi-sets | 2003-07-14 | Paper |
| Solving partial constraint satisfaction problems with tree decomposition | 2002-12-17 | Paper |
| Polyhedral results for the edge capacity polytope. | 2002-01-01 | Paper |
| Frequency planning and ramifications of coloring | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741347 | 2001-09-23 | Paper |
| A dynamic programming algorithm for the local access telecommunication network expansion problem | 2000-12-21 | Paper |
| The partial constraint satisfaction problem: Facets and lifting theorems | 1998-01-01 | Paper |
