Skip to content

Arie M. C. A. Koster

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

17

Venues

9

Active years

1999–2023

Best venue rank

C

Where they publish

Papers

17 indexed papers, newest first.

YearVenueTitleAuthors
2023IPCORecycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty.Christina Bsing, Timo Gersing, Arie M. C. A. Koster
2022INOCForeword.Christina Bsing, Arie M. C. A. Koster
2017GLOBECOMOptimisation Models for Robust and Survivable Network Slice Design: A Comparative Analysis.Andreas Baumgartner, Thomas Bauschert, Arie M. C. A. Koster, Varun S. Reddy
2012AlgosensorsComparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control.Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vcking
2011INOCRecoverable Robust Knapsacks: Γ-Scenarios.Christina Bsing, Arie M. C. A. Koster, Manuel Kutschka
2011INOCA Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks.Grit Claen, David Coudert, Arie M. C. A. Koster, Napoleo Nepomuceno
2011INOCCutset Inequalities for Robust Network Design.Arie M. C. A. Koster, Manuel Kutschka, Christian Raack
2011INOCDesigning AC Power Grids Using Integer Linear Programming.Arie M. C. A. Koster, Stephan Lemkens
2011WoWMoMBandwidth assignment for reliable fixed broadband wireless networks.Grit Classen, David Coudert, Arie M. C. A. Koster, Napoleo Nepomuceno
2007ESAAlgorithms to Separate {0, 1/2}-Chvtal-Gomory Cuts.Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka
2006ESAOn Exact Algorithms for Treewidth.Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2005ESATreewidth Lower Bounds with Brambles.Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
2004ALENEXSafe Seperators for Treewidth.Hans L. Bodlaender, Arie M. C. A. Koster
2004ESAContraction and Treewidth Lower Bounds.Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle
2004WGOn the Maximum Cardinality Search Lower Bound for Treewidth.Hans L. Bodlaender, Arie M. C. A. Koster
2001UAIPre-processing for Triangulation of Probabilistic Networks.Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag
1999WGOptimal Solutions for Frequency Assignment Problems via Tree Decomposition.Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen