Arie Koster
Arie Koster
Professor of Discrete Optimization, RWTH Aachen University
Verified email at math2.rwth-aachen.de - Homepage
Title
Cited by
Cited by
Year
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
546*2007
Combinatorial optimization on graphs of bounded treewidth
HL Bodlaender, AMCA Koster
The Computer Journal 51 (3), 255-269, 2008
2692008
Frequency assignment: Models and algorithms
AMCA Koster
Arie Koster, 1999
2201999
Treewidth computations I. Upper bounds
HL Bodlaender, AMCA Koster
Information and Computation 208 (3), 259-275, 2010
2182010
Treewidth: computational experiments
AMCA Koster, HL Bodlaender, SPM Van Hoesel
Electronic Notes in Discrete Mathematics 8, 54-57, 2001
1422001
Frequency planning and ramifications of coloring
A Eisenblatter, M Grotschel, A Koster
Discussiones Mathematicae Graph Theory 22 (1), 51-88, 2002
1262002
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
1141998
On exact algorithms for treewidth
HL Bodlaender, FV Fomin, AMCA Koster, D Kratsch, DM Thilikos
ACM Transactions on Algorithms (TALG) 9 (1), 12, 2012
112*2012
Preprocessing Rules for Triangulation of Probabilistic Networks*
HL Bodlaender, AMCA Koster, F Eijkhof
Computational Intelligence 21 (3), 286-305, 2005
98*2005
On cut‐based inequalities for capacitated network design polyhedra
C Raack, AMCA Koster, S Orlowski, R Wessäly
Networks 57 (2), 141-156, 2011
962011
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
922005
Safe separators for treewidth
HL Bodlaender, AMCA Koster
Discrete mathematics 306 (3), 337-350, 2006
882006
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
812002
Treewidth computations II. Lower bounds
HL Bodlaender, AMCA Koster
Information and Computation 209 (7), 1103-1119, 2011
802011
Robust network design: Formulations, valid inequalities, and computations
AMCA Koster, M Kutschka, C Raack
Networks 61 (2), 128-149, 2013
782013
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
772005
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
752016
Contraction and treewidth lower bounds
H Bodlaender, A Koster, T Wolle
Algorithms–ESA 2004, 628-639, 2004
722004
Solving partial constraint satisfaction problems with tree decomposition
AMCA Koster, SPM van Hoesel, AWJ Kolen
Networks 40 (3), 170-180, 2002
722002
Safe reduction rules for weighted treewidth
F van den Eijkhof, HL Bodlaender, MCA Koster
Algorithmica 47 (2), 139-158, 2007
62*2007
The system can't perform the operation now. Try again later.
Articles 1–20