| Publication | Date of Publication | Type |
|---|
Efficient total domination and related invariants in torus graphs
Discrete Applied Mathematics | 2026-06-12 | Paper |
| On the complexity of robust transshipment under consistent flow constraints | 2025-10-31 | Paper |
Complexity of the directed robust b-matching problem and its variants on different graph classes
Networks | 2025-09-01 | Paper |
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
Upper bounds and approximation results for the \(k\)-slow burning problem
Discrete Applied Mathematics | 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
Discrete Applied Mathematics | 2024-08-09 | Paper |
Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations
Networks | 2024-05-03 | Paper |
Robust transshipment problem under consistent flow constraints
Networks | 2024-01-18 | Paper |
\(\Gamma\)-robust optimization of project scheduling problems
Computers & Operations Research | 2023-11-15 | Paper |
Recycling inequalities for robust combinatorial optimization with budget uncertainty
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Optimal vaccination strategies for multiple dose vaccinations
Lecture Notes in Computer Science | 2023-08-03 | Paper |
A branch and bound algorithm for robust binary optimization with budget uncertainty
Mathematical Programming Computation | 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
Annals of Operations Research | 2022-06-13 | Paper |
On the burning number of \(p\)-caterpillars
(available as arXiv preprint) | 2021-12-08 | Paper |
An adaptive discretization algorithm for the design of water usage and treatment networks
Optimization and Engineering | 2019-10-29 | Paper |
Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
EURO Journal on Computational Optimization | 2019-10-18 | Paper |
| scientific article; zbMATH DE number 7042539 (Why is no real title available?) | 2019-03-26 | Paper |
A flow based pruning scheme for enumerative equitable coloring algorithms
Annals of Operations Research | 2019-03-06 | Paper |
Lot sizing with storage losses under demand uncertainty
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Accurate optimization models for interference constrained bandwidth allocation in cellular networks
Computers & Operations Research | 2018-12-03 | Paper |
Robust flows over time: models and complexity results
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
The budgeted minimum cost flow problem with unit upgrading cost
Networks | 2018-06-13 | Paper |
The multi-band robust knapsack problem -- a dynamic programming approach
Discrete Optimization | 2018-05-24 | Paper |
The matching extension problem in general graphs is co-NP-complete
Journal of Combinatorial Optimization | 2018-04-13 | Paper |
Improved handling of uncertainty and robustness in set covering problems
European Journal of Operational Research | 2018-02-06 | Paper |
On robust lot sizing problems with storage deterioration, with applications to heat and power cogeneration
Lecture Notes in Computer Science | 2016-11-30 | Paper |
A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
Computers & Operations Research | 2016-11-11 | Paper |
| On the computational complexity of the virtual network embedding problem | 2016-10-18 | Paper |
| Treewidth: computational experiments | 2016-07-01 | Paper |
Robust Metric Inequalities for Network Loading Under Demand Uncertainty
Asia-Pacific Journal of Operational Research | 2015-12-11 | Paper |
Chance-constrained optimization of reliable fixed broadband wireless networks
INFORMS Journal on Computing | 2015-01-26 | Paper |
On exact algorithms for treewidth
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Speeding up column generation for robust wireless network planning
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control
Theoretical Computer Science | 2014-09-18 | Paper |
Robust network design: formulations, valid inequalities, and computations
Networks | 2013-08-06 | Paper |
A note on exact algorithms for vertex ordering problems on graphs
Theory of Computing Systems | 2012-12-06 | Paper |
Recoverable robust knapsacks: the discrete scenario case
Optimization Letters | 2012-11-30 | Paper |
A chance-constrained model and cutting planes for fixed broadband wireless networks
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Cutset inequalities for robust network design
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Designing AC power grids using integer linear programming
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Recoverable robust knapsacks: -scenarios
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Treewidth computations. II. Lower bounds
Information and Computation | 2011-07-18 | Paper |
On cut-based inequalities for capacitated network design polyhedra
Networks | 2011-03-16 | Paper |
Comparing imperfection ratio and imperfection index for graph classes
RAIRO - Operations Research | 2010-10-26 | Paper |
Comparing imperfection ratio and imperfection index for graph classes
RAIRO - Operations Research | 2010-10-26 | Paper |
Treewidth computations. I: Upper bounds
Information and Computation | 2010-04-14 | Paper |
Graphs and algorithms in communication networks on seven league boots
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
Algorithmica | 2009-08-27 | Paper |
Contraction and Treewidth Lower Bounds
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Contraction and Treewidth Lower Bounds
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Treewidth lower bounds with brambles
Algorithmica | 2008-05-27 | Paper |
Models and solution techniques for frequency assignment problems
Annals of Operations Research | 2008-03-31 | Paper |
On Exact Algorithms for Treewidth
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Tight LP‐based lower bounds for wavelength conversion in optical networks
Statistica Neerlandica | 2007-10-26 | Paper |
On the maximum cardinality search lower bound for treewidth
Discrete Applied Mathematics | 2007-07-19 | Paper |
On determining the imperfection ratio
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Safe separators for treewidth
Discrete Mathematics | 2006-03-29 | Paper |
On cycles and the stable multi-set polytope
Discrete Optimization | 2006-01-09 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Models and solution techniques for frequency assignment problems
4OR | 2004-02-19 | Paper |
Bidirected and unidirected capacity installation in telecommunication networks.
Discrete Applied Mathematics | 2004-01-05 | Paper |
Stable multi-sets
Mathematical Methods of Operations Research | 2003-07-14 | Paper |
Solving partial constraint satisfaction problems with tree decomposition
Networks | 2002-12-17 | Paper |
Polyhedral results for the edge capacity polytope.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
Frequency planning and ramifications of coloring
Discussiones Mathematicae Graph Theory | 2002-01-01 | Paper |
| Solving frequency assignment problems via tree-decomposition | 2001-09-23 | Paper |
A dynamic programming algorithm for the local access telecommunication network expansion problem
European Journal of Operational Research | 2000-12-21 | Paper |
The partial constraint satisfaction problem: Facets and lifting theorems
Operations Research Letters | 1998-01-01 | Paper |
