Lehr- und Forschungsgebiet Diskrete Optimierung

Prof. Dr. Ir. Arie M.C.A. Koster

general / CV / research / publications / teaching / supervision / resources /

Alternatively to the publication list below, you can use my citations page on Google Scholar.

2025

Wehrmann, M. and Koster, A. M. C. A., "Efficient Total Domination and related Invariants in Torus Graphs", Preprint at SSRN, 2025. [doi]
Vladimir Stadnichuk, Jenny Segschneider, Arie M.C.A. Koster and Grit Walther, "Integrated optimization of timetabling and Electric Vehicle Scheduling", EURO Journal on Transportation and Logistics, vol. 14, pp. 100168, 2025. [doi]
Segschneider, J. and Koster, A. M. C. A., "Complexity of the Directed Robust $b$-Matching Problem and Its Variants on Different Graph Classes", Networks, vol. 86, no. 2, pp. 220–237, 2025. [doi]
Hiller, M., Koster, A. M. C. A. and Pabst, P., "Upper bounds and approximation results for the $k$-slow burning problem", Discrete Applied Mathematics, vol. 363, pp. 88–104, 2025. [doi]
Büsing, C., Gersing, T. and Koster, A. M. C. A., "Recycling Valid Inequalities for Robust Combinatorial Optimization with Budgeted Uncertainty", Mathematical Programming, vol. 210, pp. 97–146, 2025. [doi]

2024

Stadnichuk, V. and Koster, A. M. C. A., "Solving Multi-Follower Mixed-Integer Bilevel Problems with Binary Linking Variables", Optimization Online, 2024. [url]
Segschneider, J. and Koster, A. M. C. A., "Robust two-dose vaccination schemes and the directed $b$-matching problem", Discrete Applied Mathematics, vol. 356, pp. 369–392, 2024. [doi]
Koster, A. M. C. A., Segschneider, J. and Ventsch, N., "$\Gamma$-robust optimization of project scheduling problems", Computers & Operations Research, vol. 161, pp. 106453, 2024. [doi]
Hiller, M., Koster, A. M. C. A. and Pabst, P., "$k$-Slow Burning: Complexity and Upper Bounds", Chapter in Graphs and Combinatorial Optimization: from Theory to Applications, Springer, pp. 67–79, 2024. [doi]
Büsing, C., Koster, A. M. C. A. and Schmitz, S., "Robust transshipment problem under consistent flow constraints", Networks, vol. 83, no. 1, pp. 53–82, 2024. [doi]

2023

Büsing, C., Gersing, T. and Koster, A. M. C. A., "Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty", Chapter in Proceedings of Integer Programming and Combinatorial Optimization (IPCO), Springer, pp. 58–71, 2023. [doi]
Büsing, C., Gersing, T. and Koster, A. M. C. A., "A branch and bound algorithm for robust binary optimization with budget uncertainty", Mathematical Programming Computation, vol. 15, pp. 269–326, 2023. [doi]

2022

Segschneider, J. and Koster, A. M. C. A., "Optimal Vaccination Strategies for Multiple Dose Vaccinations", Chapter in Combinatorial Optimzation (ISCO 2022) (Ljubić, I., Barahona, F., Dey, S. S., Mahjoub, A. R., eds.), pp. 272–283, 2022. [doi]
Leithäuser, N., Adelhütte, D., Braun, K., Büsing, C., Comis, M., Gersing, T., Johann, S., Koster, A. M. C. A., Krumke, S. O., Liers, F., Schmidt, E., Schneider, J., Streicher, M., Tschuppik, S. and Wrede, S., "Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions", BMC Medical Informatics and Decision Making, vol. 22, no. 132, 2022. [doi]
Gupte, A., Koster, A. M. C. A. and Kuhnke, S., "An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP", Chapter in 20th International Symposium on Experimental Algorithms (SEA 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 24:1–24:14, 2022. [doi]
Büsing, C., Koster, A. M. C. A. and Schmitz, S., "Robust minimum cost flow problem under consistent flow constraints", Annals of Operations Research, vol. 312, pp. 691–722, 2022. [doi]

2021

Koster, A. M. C. A. and Schmidt, D. R., "Robust Network Design", Chapter in Network Design with Applications to Transportation and Logistics (Crainic, T. G., Gendreau, M., Gendron, B., eds.), Springer, 2021. [doi]
Hiller, M., Triesch, E. and Koster, A. M. C. A., "On the burning number of $p$-caterpillars", Chapter in Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 Proceedings (Gentile, C., Stecca, G., Ventura, P., eds.), pp. 145–156, 2021. [doi]

2020

Kuhnke, S., Richter, P., Kepp, F., Cumpston, J., Koster, A. M. C. A. and Büsing, C., "Robust optimal aiming strategies in central receiver systems", Renewable Energy, vol. 152, pp. 198–207, 2020. [doi]
Büsing, C., Gersing, T. and Koster, A. M. C. A., "Planning out-of-hours services for pharmacies", Operations Research for Health Care, vol. 27, pp. 100277, 2020. [doi]

2019

Koster, A. M. C. A., Scheidweiler, R. and Tieves, M., "A flow based pruning scheme for enumerative equitable coloring algorithms", Annals of Operations Research, vol. 272, no. 1–2, pp. 3–28, 2019. [doi]
Koster, A. M. C. A. and Kuhnke, S., "An adaptive discretization algorithm for the design of water usage and treatment networks", Optimization and Engineering, vol. 20, no. 2, pp. 497–542, 2019. [doi]
Ecker, G., Yuan, D., Koster, A. M. C. A. and Schmeink, A., "Accurate Optimization Models for Interference Constrained Bandwidth Allocation in Cellular Networks", Computers & Operations Research, vol. 101, pp. 1–12, 2019. [doi]
C. Büsing, Koster, A. M. C. A., Kutschka, M. and Goderbauer, S., "Formulations and Algorithms for the Recoverable $\Gamma$-Robust Knapsack", EURO Journal on Computational Optimization, vol. 7, no. 1, pp. 15-45, 2019. [doi]

2018

J. Hackfeld and Koster, A. M. C. A., "The matching extension problem in general graphs is co-NP-complete", Journal of Combinatorial Optimization, vol. 35, no. 3, pp. 853–859, 2018. [doi]
C. Gottschalk, Koster, A. M. C. A., Liers, F., Peis, B., Schmand, D. and Wierz, A., "Robust Flows over Time: Models and Complexity Results", Mathematical Programming, vol. 171, no. 1–2, pp. 55–85, 2018. [doi]
S. Coniglio, Koster, A. M. C. A. and N. Spiekermann, "Lot sizing with storage losses under demand uncertainty", Journal of Combinatorial Optimization, vol. 36, no. 3, pp. 763–788, 2018. [doi]

2017

P. Lutter, D. Degel, Büsing, C., Koster, A. M. C. A. and Werners, B., "Improved Handling of Uncertainty and Robustness in Set Covering Problems", European Journal of Operational Research, vol. 263, pp. 35–49, 2017. [doi]
C. Büsing, Kirchner, S., Koster, A. M. C. A. and Thome, A., "The Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost", Networks, vol. 69, no. 1, pp. 67–82, 2017. [doi]
C. Büsing, A. Grub, Koster, A. M. C. A., W. Laube and M. Tieves, "Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations", Networks, vol. 70, no. 4, pp. 342–359, 2017. [doi]
A. Baumgartner, T. Bauschert, Koster, A. M. C. A. and Reddy, V. S., "Optimisation Models for Robust and Survivable Network Slice Design: A Comparative Analysis", In 2017 IEEE Global Communiations Conference, GLOBECOM, 2017. [doi]

2016

S. Goderbauer, B. Bahl, P. Voll, M. E. Lübbecke, Bardow, A. and Koster, A. M. C. A., "An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems", Computers & Chemical Engineering, vol. 95, pp. 38–48, 2016. [doi]
Coniglio, S., Koster, A. M. C. A. and Tieves, M., "Data uncertainty in virtual network embedding: robust optimization and protection levels", Journal of Network and Systems Management, vol. 24, no. 3, pp. 681–710, 2016. [doi]
S. Coniglio, Koster, A. M. C. A. and N. Spiekermann, "On robust Lot Sizing problems with storage deterioration, considering heat and power co-generation", In International Symposium on Combinatorial Optimization (ISCO 2016), pp. 26–37, 2016. [doi]
Büsing, C., Koster, A. M. C. A. and Tieves, M., "Robust Plans for Spectrum Allocation in Elastic Flexgrid Optical Networks", In Resilient Networks Design and Modelling (RNDM 2016), pp. 108–115, 2016. [doi]
Amaldi, E., Coniglio, S., Koster, A. M. C. A. and Tieves, M., "On the computational complexity of the virtual network embedding problem", Electronic Notes in Discrete Mathematics, vol. 52, pp. 213–220, 2016. [doi]

2015

Rak, J., Pickavet, M., Trivedi, K., Alonso Lopez, J., Koster, A. M. C. A., Sterbenz, J. P. G., \,Cetinkaya, E. K., Gomes, T., Gunkel, M., Walkowiak, K. and Staessens, D., "Future research directions in design of reliable communication systems", Telecommunication Systems, vol. 60, pp. 423–450, 2015. [doi]
Koster, A. M. C. A. and Tieves, M., "Network Design with Compression: Complexity and Algorithms", In Operations Research and Computing: Algorithms and Software for Analytics – Proceedings of the 14th INFORMS Computing Society Conference (ICS 2015), Richmond, VA, pp. 74–87, 2015. [doi]
Coniglio, S., Koster, A. M. C. A. and Tieves, M., "Virtual Network Embedding under Uncertainty: Exact and Heuristic Approaches", In Proceedings of 11th International Conference on Design of Reliable Communication Networks (DRCN 2015), pp. 1–8, 2015. [doi]
Claßen, G., Koster, A. M. C. A. and Schmeink, A., "The Multi-Band Robust Knapsack Problem – A Dynamic Programming Approach –", Discrete Optimization, vol. 18, pp. 123–149, 2015. [doi]
Claßen, G., Koster, A. M. C. A., Kutschka, M. and Tahiri, I., "Robust Metric Inequalities for Network Loading Under Demand Uncertainty", Asia-Pacific Journal of Operational Research, vol. 32, no. 5, pp. 1550038 1–27, 2015. [doi]

2014

Claßen, G., Koster, A. M. C. A., Coudert, D. and Nepomuceno, N., "Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Neworks", INFORMS Journal on Computing, vol. 26, no. 4, pp. 893–909, 2014. [doi]
L. Belke, T. Kesselheim, Koster, A. M. C. A. and B. Vöcking, "Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control", Theoretical Computer Science, vol. 553, pp. 64–73, 2014. [doi]
Bauschert, T., Büsing, C., D'Andreagiovanni, F., Koster, A. M. C. A., Kutschka, M. and Steglich, U., "Network Planning under Demand Uncertainty with Robust Optimization", IEEE Communications Magazine, vol. 52, no. 2, pp. 178–185, 2014. [doi]

2013

Koster, A. M. C. A., Phan, T. K. and M. Tieves, "Extended Cutset Inequalities for the Network Power Consumption Problem", Electronic Notes in Discrete Mathematics, vol. 41, no. 0, pp. 69 - 76, 2013. [doi]
Koster, A. M. C. A., Kutschka, M. and Raack, C., "Robust network design: Formulations, valid inequalities, and computations", Networks, Wiley Subscription Services, Inc., A Wiley Company, vol. 61, no. 2, pp. 128–149, 2013. [doi]
S. Duhovnikov, Koster, A. M. C. A., M. Kutschka, F. Rambach and D. Schupke, "$\Gamma$-Robust Network Design for Mixed-Line-Rate-Planning of Optical Networks", In Optical Fiber Communication Conference/National Fiber Optic Engineers Conference 2013, Optical Society of America, pp. JTh2A.02, 2013. [doi]
Coudert, D., Koster, A. M. C. A., Phan, T. K. and Tieves, M., "Robust Redundancy Elimination for Energy-Aware Routing", In Proceedings of IEEE GreenCom 2013, Beijing, China, pp. 179–186, 2013. [doi]
G. Claßen, Koster, A. M. C. A. and Schmeink, A., "Speeding Up Column Generation for Robust Wireless Network Planning", EURO Journal on Computational Optimization, vol. 1, no. 3, pp. 253–281, 2013. [doi]
G. Claßen, Koster, A. M. C. A. and A. Schmeink, "A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks", Computers & Operations Research, vol. 40, no. 1, pp. 80 - 90, 2013. [doi]
Belke, L., Kesselheim, T., Koster, A. M. C. A. and Vöcking, B., "Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control", Chapter in Algorithms for Sensor Systems, Springer Berlin Heidelberg, pp. 30-41, 2013. [doi]

2012

Bodlaender, H. L., Fomin, F. V., Koster, A. M. C. A., Kratsch, D. and Thilikos, D. M., "On exact algorithms for treewidth", ACM Trans. Algorithms, ACM, vol. 9, no. 1, New York, NY, USA, pp. 12:1–12:23, dec, 2012. [doi]
Koster, A. M. C. A. and Tieves, M., "Column generation for frequency assignment in slow frequency hopping networks", EURASIP Journal on Wireless Communications and Networking, vol. 2012, no. 253, 2012. [doi]
Koster, A. M. C. A., Helmberg, C., Bley, A., Grötschel, M. and Bauschert, T., "BMBF project ROBUKOM: Robust Communication Networks", In Proceedings of the 12th Würzburg Workshop on IP: ITG workshop Vision of Future Generation Networks (EuroView 2012), 2012.
Kazmi, N.A., Koster, A. M. C. A. and Branke, J., "Formulations and algorithms for the multi-path selection problem in network routing", In Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2012 4th International Congress on, pp. 738-744, 2012. [doi]
H. L. Bodlaender, F. V. Fomin, Koster, A. M. C. A., D. Kratsch and D. M. Thilikos, "A Note on Exact Algorithms for Vertex Ordering Problems on Graphs", Theory of Computing Systems, vol. 50, pp. 420–432, 2012. [doi]

2011

Raack, C., Koster, A. M. C. A., Orlowski, S. and Wessäly, R., "On cut-based inequalities for capacitated network design polyhedra", Networks, vol. 57, pp. 141–156, 2011. [doi]
Koster, A. M. C. A. and Lemkens, S., "Designing AC Power Grids using Integer Linear Programming", In Network Optimization, 5th International Conference, INOC 2011, Hamburg, Germany (Julia Pahl, Thorsten Reiners, Stefan Voss, eds.), pp. 478–483, 2011. [doi]
Koster, A. M. C. A., Kutschka, M. and Raack, C., "On the robustness of optimal network designs", In Proceedings IEEE International Conference on Communications, ICC 2011, pp. 1–5, 2011. [doi]
Koster, A. M. C. A., Kutschka, M. and Raack, C., "Cutset Inequalities for Robust Network Design", In Proceedings of INOC 2011, International Network Optimization Conference, pp. 118–123, 2011. [doi]
Koster, A. M. C. A. and Kutschka, M., "Network Design Under Demand Uncertainties: A Case Study on the Abilene and GEANT network data", In Tagungsband der 12. ITG-Fachtagung Photonische Netze, Leipzig, Germany, pp. 154–161, 2011. [url]
Koster, A. M. C. A. and Kutschka, M., "An integrated model for survivable network design under demand uncertainty", In Proceedings of 8th International Workshop on the Design of Reliable Communication Networks (DRCN 2011), pp. 54–61, 2011. [doi]
Koster, A. M. C. A., "Treewidth, Tree Decompositions, and Brambles", pp. online, 2011. [doi]
Kazmi, N. A. and Koster, A. M. C. A., "An Integer Linear Programming Model for Optimal Self Protection Multi-Path Selection", In Proceedings of RNDM 2011, 2011. [url]
Hein, A. and Koster, A. M. C. A., "An Experimental Evaluation of Treewidth at most Four Reductions", In Proceedings of International Symposium on Experimental Algorithms (SEA 2011), pp. 218–229, 2011. [doi]
Claßen, G., Koster, A. M. C. A. and Schmeink, A., "Robust Planning of Green Wireless Networks", In Proceedings of 5th International Conference on NETwork Games, COntrol and OPtimization (NetGCooP 2011), pp. 1–5, 2011. [url]
Claßen, G., Coudert, D., Koster, A. M. C. A. and Nepomuceno, N., "Bandwidth assignment for reliable fixed broadband wireless networks", In 12th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM), Lucca, Italy, 2011. [doi]
Claßen, G., Coudert, D., Koster, A. M. C. A. and Nepomuceno, N., "A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks", In Network Optimization, 5th International Conference, INOC 2011, Hamburg, Germany, June 2011, Proceedings (Julia Pahl, Thorsten Reiners, Stefan Voss, eds.), pp. 37–42, 2011. [doi]
Caillouet, C. and Koster, A. M. C. A., "Routage et Ordonnancement Robustes dans les Réseaux Radio Maillés", In 13èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel11), Cap Esterel, France, pp. 119-122, 2011. [url]
Büsing, C., Koster, A. M. C. A. and Kutschka, M., "Recoverable Robust Knapsacks: $\Gamma$-Scenarios", In Proceedings of INOC 2011, International Network Optimization Conference, pp. 583–588, 2011. [doi]
Büsing, C., Koster, A. M. C. A. and Kutschka, M., "Recoverable Robust Knapsacks: the Discrete Scenario Case", Optimization Letters, vol. 5, no. 3, pp. 379–392, 2011. [doi]
Bodlaender, H. L. and Koster, A. M. C. A., "Treewidth Computations II. Lower Bounds", Information and Computation, vol. 209, no. 7, pp. 1103–1119, 2011. [doi]

2010

"Graphs and Algorithms in Communication Networks", dec, 2010. [doi]
Koster, A. M. C. A. and X. Muñoz, "Graphs and Algorithms in Communication Networks on Seven League Boots", Chapter in Graphs and Algorithms in Communication Networks (Koster, A. M. C. A., X. Muñoz, eds.), pp. 1–59, dec, 2010. [doi]
S. Orlowski, C. Raack, Koster, A. M. C. A., G. Baier, T. Engel and P. Belotti, "Branch-and-cut techniques for solving realistic two-layer network design problems", Chapter in Graphs and Algorithms in Communication Networks (Koster, A. M. C. A., X. Muñoz, eds.), pp. 95–118, dec, 2010. [doi]
Koster, A. M. C. A., M. Kutschka and C. Raack, "Towards Robust Network Design using Integer Linear Programming Techniques", In Proceedings Next Generation Internet, NGI 2010, 2010. [doi]
H. L. Bodlaender and Koster, A. M. C. A., "Treewidth Computations I: Upper Bounds", Information and Computation, vol. 208, pp. 259–275, 2010. [doi]

2009

C. Raack and Koster, A. M. C. A., "An integer set-packing problem arising in two-layer network design", In Proceedings of INOC 2009, Pisa, Italy, 2009.
Koster, A. M. C. A., A. Zymolka and M. Kutschka, "Algorithms to separate $\{0,\frac{1}{2}\}$ Chvátal-Gomory cuts", Algorithmica, vol. 55, pp. 375–391, 2009. [doi]
Koster, A. M. C. A. and M. Kutschka, "Multi-commodity Single Path Routing with submodular bandwidth consumption", In Proceedings of INOC 2009, Pisa, Italy, 2009.

2008

Koster, A. M. C. A. and Wagler, A. K., "Comparing Imperfection Ratio and Imperfection Index for Graph Classes", RAIRO – Operations Research, vol. 42, pp. 485–500, 2008. [doi]
Koster, A. M. C. A. and S. Ruepp, "Benchmarking RWA Strategies for Dynamically Controlled Optical Networks", In Proceedings of the 13th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2008) (T. Cinkler, ed.), Budapest, Hungary, 2008. [doi]
Koster, A. M. C. A., Orlowski, S., Raack, C., Baier, G. and Engel, T., "Single-layer Cuts for Multi-Layer Network Design Problems", In Telecommunications Modeling, Policy, and Technology (S. Raghavan, B. Golden, E. Wasil, eds.), College Park, MD, U.S.A., pp. 1–23, 2008. [doi]
H. L. Bodlaender and Koster, A. M. C. A., "Combinatorial Optimisation on Graphs of bounded Treewidth", The Computer Journal, vol. 51, no. 3, pp. 255–269, 2008. [doi]
H. L. Bodlaender, A. Grigoriev and Koster, A. M. C. A., "Treewidth Lower Bounds with Brambles", Algorithmica, vol. 51, pp. 81–98, 2008. [doi]

2007

C. Raack, Koster, A. M. C. A., S. Orlowski and R. Wessäly, "Capacitated network design using general flow-cutset inequalities", In Proceedings of INOC 2007, Spa, Belgium, 2007. [pdf]
S. Orlowski, Koster, A. M. C. A., C. Raack and R. Wessäly, "Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics", In Proceedings of INOC 2007, Spa, Belgium, 2007. [url]
M. Menth, R. Martin, Koster, A. M. C. A. and S. Orlowski, "Protection Switching and Rerouting based on Multipath Structures", In Proceedings of DRCN 2007, 2007. [url]
Koster, A. M. C. A., A. Zymolka and M. Kutschka, "Algorithms to separate $\{0,\frac{1}{2}\}$ Chvátal-Gomory cuts", In Proceedings 15th Annual European Symposium on Algorithms, ESA2007, pp. 693–704, 2007. [doi]
Koster, A. M. C. A. and A. Zymolka, "Demand-wise Shared Protection and Multiple Failures", In Proceedings of INOC 2007, Spa, Belgium, 2007. [pdf]
Koster, A. M. C. A. and A. Zymolka, "Tight LP-based Lower Bounds for Wavelength Conversion in Optical Networks", Statistica Neerlandica, vol. 61, no. 1, pp. 115–136, 2007. [doi]
Koster, A. M. C. A. and M. Scheffel, "A Routing and Network Dimensioning Strategy to reduce Wavelength Continuity Conflicts in All-Optical Networks", In Proceedings of INOC 2007, Spa, Belgium, 2007. [html]
Eijkhof, F. van den, H. L. Bodlaender and Koster, A. M. C. A., "Safe reduction rules for weighted treewidth", Algorithmica, vol. 47, no. 2, pp. 139–158, 2007. [doi]
Bodlaender, H. L. and Koster, A. M. C. A., "On the Maximum Cardinality Search Lower Bound for Treewidth", Discrete Applied Mathematics, vol. 155, pp. 1348–1372, 2007. [doi]
K. I. Aardal, Hoesel, C. P. M. van, Koster, A. M. C. A., C. Mannino and A. Sassano, "Models and Solution Techniques for the Frequency Assignment Problem", Annals of Operations Research, vol. 153, pp. 79–129, 2007. [doi]

2006

Koster, A. M. C. A. and A. K. Wagler, "On determining the imperfection ratio", Electronic Notes in Discrete Mathematics, vol. 25, pp. 177–181, 2006. [doi]
Koster, A. M. C. A., "Cost-efficient transparent optical networks with high connection availabilities", In Proceedings 8th International Conference on Transparent Optical Networks, ICTON 2006 (M. Marciniak, ed.), pp. 101-104, 2006. [doi]
Hülsermann, R., Jäger, M., Koster, A. M. C. A., Orlowski, S., Wessäly, R. and Zymolka, A., "Availability and Cost Based Evaluation of Demand-wise Shared Protection", In Proceedings 7th ITG-Workshop on Photonic Networks, Leipzig, Germany, pp. 161–168, 2006. [url]
Bodlaender, H. L., Wolle, T. and Koster, A. M. C. A., "Contraction and Treewidth Lower Bounds", Journal of Graph Algorithms and Applications, vol. 10, no. 1, pp. 5–49, 2006. [doi]
Bodlaender, H. L. and Koster, A. M. C. A., "Safe Separators for Treewidth", Discrete Mathematics, vol. 306, no. 3, pp. 337–350, 2006. [doi]
H. L. Bodlaender, F. V. Fomin, Koster, A. M. C. A., D. Kratsch and D. M. Thilikos, "On exact algorithms for treewidth", In Proceedings 14th Annual European Symposium on Algorithms, ESA 2006 (Y. Azar, T. Erlebach, eds.), pp. 672–683, 2006. [doi]

2005

Wessäly, R., Orlowski, S., Zymolka, A., Koster, A. M. C. A. and Gruber, C., "Demand-wise Shared Protection revisited: A new model for survivable network design", In Proceedings of INOC 2005, Lisbon, Portugal, pp. 100–105, 2005.
Koster, A. M. C. A., Zymolka, A. and Jäger, M. and Hülsermann, R., "Demand-wise Shared Protection for Meshed Optical Networks", Journal of Network and Systems Management, vol. 13, no. 1, pp. 35–55, 2005. [doi]
Koster, A. M. C. A. and A. Zymolka, "On cycles and the stable multi-set polytope", Discrete Optimization, vol. 2, no. 3, pp. 241–255, 2005. [doi]
Koster, A. M. C. A. and Zymolka, A., "Linear Programming Lower Bounds for Minimum Converter Wavelength Assignment in Optical Networks", In Proceedings of INOC 2005, Lisbon, Portugal, pp. 44–51, 2005.
Koster, A. M. C. A. and Zymolka, A., "Provably Good Solutions for Wavelength Assignment in Optical Networks", In Proceedings of ONDM 2005, Milan, Italy, pp. 335–345, 2005. [doi]
Koster, A. M. C. A., T. Wolle and H. L. Bodlaender, "Degree-Based Treewidth Lower Bounds", In Proceedings of 4th International Workshop on Efficient and Experimental Algorithms, WEA 2005, pp. 101–112, 2005. [doi]
Koster, A. M. C. A., "Wavelength Assignment in Multifiber WDM Networks", In Proceedings of INOC 2005, Lisbon, Portugal, pp. 60–66, 2005.
Hicks, I. V. and Koster, A. M. C. A., "Branch and Tree Decomposition Techniques for Discrete Optimization", Chapter in TutORials 2005 (J. Cole Smith, ed.), pp. 1–29, 2005. [doi]
Gruber, C., Koster, A. M. C. A., Orlowski, S., Wessäly, R. and Zymolka, A., "A Computational Study for Demand-wise Shared Protection", In Proceedings of DRCN 2005, Naples, Italy, pp. 421–428, 2005. [doi]
H. L. Bodlaender and Koster, A. M. C. A., "Pre-processing rules for triangulation of probabilistic networks", Computational Intelligence, vol. 21, no. 3, pp. 286–305, 2005. [doi]
H. L. Bodlaender, A. Grigoriev and Koster, A. M. C. A., "Treewidth Lower Bounds with Brambles", In Proceedings 13th Annual European Symposium on Algorithms, ESA 2005 (G. S. Brodal, S. Leonardi, eds.), pp. 391–402, 2005. [doi]

2004

Koster, A. M. C. A. and Zymolka, A., "Minimum Converter Wavelength Assignment in All-Optical Networks", In Proceedings of ONDM 2004, Ghent, Belgium, pp. 517–535, 2004.
Bodlaender, H. L., Koster, A. M. C. A. and Wolle, T., "Contraction and Treewidth Lower Bounds", In Proceedings of 12th Annual European Symposium on Algorithms, ESA 2004, Bergen, Norway, pp. 628–639, 2004. [doi]
Bodlaender, H. L. and Koster, A. M. C. A., "On the Maximum Cardinality Search Lower Bound for Treewidth", In Proceedings of International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, pp. 81–92, 2004. [doi]
Bodlaender, H. L. and Koster, A. M. C. A., "Safe Separators for Treewidth", In Joint Proceedings of the workshop on Algorithm Engineering and Experiments (ALENEX'04) and the workshop on Analytic Algorithmics and Combinatorics (ANALCO'04), New Orleans, pp. 70–78, 2004.
Bley, A., Koster, A. M. C. A., Wessäly, R. and Zymolka, A., "Kostenoptimierung mit Garantie: Konfiguration und Design von Kommunikationsnetzen", In Tagungsband der 5. ITG-Fachtagung Photonische Netze, Leipzig, Germany, pp. 121–128, 2004. [pdf]

2003

A. Zymolka and Koster, A. M. C. A., "Transparent optical network design with sparse wavelength conversion", In Proceedings of ONDM 2003, Budapest, Hungary, pp. 61–80, 2003.
Koster, A. M. C. A., Zymolka, A., Jäger, M. and Hülsermann, R. and Gerlach, C., "Demand-wise Shared Protection for Meshed Optical Networks", In Proceedings of the 4th International Workshop on Design of Reliable Communication Networks (DRCN 2003), Banff, Canada, pp. 85–92, 2003. [url]
Hoesel, C. P. M. van, Koster, A. M. C. A., Leensel, R. L. M. J. van de and M. W. P. Savelsbergh, "Bidirected/unidirected capacity installation in telecommunication networks", Discrete Applied Mathematics, vol. 133, pp. 103–121, 2003. [doi]
Bley, A., Koster, A. M. C. A., Kröller, A. and Wessäly, R. and Zymolka, A., "Kosten- und Qualitätsoptimierung in Kommunikationsnetzen", TeleKommunikation Aktuell, vol. 57, no. 07+08, pp. 1–62, 2003. [pdf]
K. I. Aardal, Hoesel, C. P. M. van, Koster, A. M. C. A., C. Mannino and A. Sassano, "Models and Solution Techniques for the Frequency Assignment Problem", 4OR, vol. 1, no. 4, pp. 261–317, 2003. [doi]

2002

Koster, A. M. C. A. and A. Zymolka, "Stable Multi-Sets", Mathematical Methods of Operations Research, vol. 56, no. 1, pp. 45–65, 2002. [doi]
Koster, A. M. C. A., Hoesel, C. P. M. van and A. W. J. Kolen, "Solving partial constraint satisfaction problems with tree decomposition", Networks, vol. 40, no. 3, pp. 170–180, 2002. [doi]
Hoesel, C. P. M. van, Koster, A. M. C. A., Leensel, R. L. M. J. van de and M. W. P. Savelsbergh, "Polyhedral Results for the Edge Capacity Polytope", Mathematical Programming, series A, vol. 92, no. 2, pp. 335–358, 2002. [doi]
Eisenblätter, A., Koster, A. M. C. A. and R. Wallbaum, "Load Balancing in Signaling Transfer Points", Technical report, Zuse Institute Berlin 02–50, Berlin, Germany, 2002. [url]
Eisenblätter, A., Koch, T., Martin, A., Achterberg, T., Fügenschuh, A., Koster, A. and Wegel, O., "Modelling Feasible Network Configurations for UMTS", In Telecommunications Network Design and Management (G. Anandalingam, S. Raghavan, eds.), Boston/Dordrecht/London, pp. 1–24, 2002. [doi]
Eisenblätter, A. and Grötschel, M. and Koster, A. M. C. A., "Frequency Planning and Ramifications of Coloring", Discussiones Mathematicae Graph Theory, vol. 22, no. 1, pp. 51–88, 2002. [doi]
Eisenblätter, A. and Grötschel, M. and Koster, A. M. C. A., "Frequenzplanung im Mobilfunk", DMV-Mitteilungen, no. 1, pp. 18–25, 2002. [url]

2001

Koster, A. M. C. A. and H. L. Bodlaender, "Treewidth: Computational Experiments", Technical report, Zuse Institute Berlin 01–38, Berlin, Germany, 2001. [url]
Koster, A. M. C. A. and H. L. Bodlaender, "Treewidth: Computational Experiments", Electronic Notes in Discrete Mathematics (H. Broersma, U. Faigle, J. Hurink, S. Pickl, eds.), vol. 8, pp. 54–57, 2001. [doi]
H. L. Bodlaender, Koster, A. M. C. A. and Eijkhof, F. van den and Gaag, L. C. van der, "Pre-processing for Triangulation of Probabilistic Networks", In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (J. Breese, D. Koller, eds.), San Francisco, pp. 32 – 39, 2001. [url]

2000

Koster, A. M. C. A., Hoesel, C. P. M. van and A. W. J. Kolen, "Lower Bounds for Minimum Interference Frequency Assignment Problems", Ricerca Operativa, vol. 30, no. 94–95, pp. 101–116, 2000.
O. E. Flippo, A. W. J. Kolen and Koster, A. M. C. A., "A Dynamic Programming Algorithm for the Local Access Telecommunication Network Expansion Problem", European Journal of Operational Research, vol. 127, pp. 189–202, 2000. [doi]

1999

Koster, A. M. C. A., Hoesel, C. P. M. van and A. W. J. Kolen, "Solving Frequency Assignment Problems Via Tree-Decomposition", Electronic Notes in Discrete Mathematics, vol. 3, pp. 102–105, 1999. [doi]
Koster, A. M. C. A., Hoesel, C. P. M. van and A. W. J. Kolen, "Optimal Solutions for a Frequency Assignment Problem Via Tree-Decomposition", In Graph-Theoretic Concepts in Computer Science (WG '99) (P. Widmayer, G. Neyer, S. Eidenbenz, eds.), pp. 338–349, 1999. [doi]
Koster, A. M. C. A., "Frequency Assignment—Models and Algorithms", PhD thesis, Universiteit Maastricht, Maastricht, The Netherlands, 1999. [url]

1998

Koster, A. M. C. A., Hoesel, C. P. M. van and A. W. J. Kolen, "The Partial Constraint Satisfaction Problem: Facets and Lifting Theorems", Operations Research Letters, vol. 23, no. 3–5, pp. 89–97, 1998. [doi]

1995

Koster, A. M. C. A., "DualNet: een grafische interface voor het oplossen van netwerk problemen", Master's thesis, Technische Universiteit Delft, Delft, The Netherlands, 1995. [url]

last modified: 20/03/2026 - 13:33