Models and solution techniques for frequency assignment problems KI Aardal, SPM van Hoesel, AMCA Koster, C Mannino, A Sassano Annals of Operations Research 153 (1), 79-129, 2007 | 502 | 2007 |
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008 | 344 | 2008 |
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010 | 296 | 2010 |
Frequency assignment: Models and algorithms AMCA Koster Arie Koster, 1999 | 253 | 1999 |
On the computational complexity of the virtual network embedding problem E Amaldi, S Coniglio, AMCA Koster, M Tieves Electronic Notes in Discrete Mathematics 52, 213-220, 2016 | 188 | 2016 |
Treewidth: computational experiments AMCA Koster, HL Bodlaender, SPM Van Hoesel Electronic Notes in Discrete Mathematics 8, 54-57, 2001 | 183 | 2001 |
Models and solution techniques for frequency assignment problems KI Aardal, SPM Van Hoesel, AMCA Koster, C Mannino, A Sassano Quarterly Journal of the Belgian, French and Italian Operations Research …, 2003 | 155 | 2003 |
Frequency planning and ramifications of coloring A Eisenblatter, M Grotschel, A Koster Discussiones Mathematicae Graph Theory 22 (1), 51-88, 2002 | 142 | 2002 |
The partial constraint satisfaction problem: Facets and lifting theorems AMCA Koster, SPM Van Hoesel, AWJ Kolen Operations research letters 23 (3-5), 89-97, 1998 | 128 | 1998 |
Safe separators for treewidth HL Bodlaender, AMCA Koster Discrete mathematics 306 (3), 337-350, 2006 | 123 | 2006 |
On cut‐based inequalities for capacitated network design polyhedra C Raack, AMCA Koster, S Orlowski, R Wessäly Networks 57 (2), 141-156, 2011 | 122 | 2011 |
Treewidth computations II. Lower bounds HL Bodlaender, AMCA Koster Information and Computation 209 (7), 1103-1119, 2011 | 109 | 2011 |
Robust network design: Formulations, valid inequalities, and computations AMCA Koster, M Kutschka, C Raack Networks 61 (2), 128-149, 2013 | 104 | 2013 |
Demand-wise shared protection for meshed optical networks AMCA Koster, A Zymolka, M Jäger, R Hülsermann Journal of Network and Systems Management 13 (1), 35-55, 2005 | 98 | 2005 |
Network planning under demand uncertainty with robust optimization. T Bauschert, C Büsing, F D'Andreagiovanni, AMCA Koster, M Kutschka, ... IEEE Communications Magazine 52 (2), 178-185, 2014 | 90 | 2014 |
Solving partial constraint satisfaction problems with tree decomposition AMCA Koster, SPM van Hoesel, AWJ Kolen Networks 40 (3), 170-180, 2002 | 86 | 2002 |
Branch and tree decomposition techniques for discrete optimization IV Hicks, A Koster, E Kolotoglu TutORials in Operation Research: INFORMS–New Orleans 2005, 1-29, 2005 | 84 | 2005 |
Modelling Feasible Network Configurations for UMTS A Eisenblatter, R Wessaly, A Martin, A Fiigenschuh, O Wegel, T Koch, ... Telecommunications network design and management 23, 1-24, 2002 | 84 | 2002 |
On exact algorithms for treewidth HL Bodlaender, FV Fomin, AMCA Koster, D Kratsch, DM Thilikos European Symposium on Algorithms, 672-683, 2006 | 83 | 2006 |
A note on exact algorithms for vertex ordering problems on graphs HL Bodlaender, FV Fomin, AMCA Koster, D Kratsch, DM Thilikos Theory of Computing Systems, 1-13, 2011 | 73 | 2011 |