Arie M. C. A. Koster

102 papers A 5B 6C 9Journal 65Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Efficient total domination and related invariants in torus graphs. Discret. Appl. Math. Moritz Wehrmann, Arie M. C. A. Koster
2025	J	`jnl`	Complexity of the Directed Robust b-Matching Problem and Its Variants on Different Graph Classes. Networks Jenny Segschneider, Arie M. C. A. Koster
2025	J	`jnl`	Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty. Math. Program. Christina Büsing, Timo Gersing, Arie M. C. A. Koster
2025	J	`jnl`	Upper bounds and approximation results for the k-slow burning problem. Discret. Appl. Math. Michaela Hiller, Arie M. C. A. Koster, Philipp Pabst
2024	J	`jnl`	Robust transshipment problem under consistent flow constraints. Networks Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz
2024	J	`jnl`	Robust two-dose vaccination schemes and the directed b-matching problem. Discret. Appl. Math. Jenny Segschneider, Arie M. C. A. Koster
2023	J	`jnl`	A branch and bound algorithm for robust binary optimization with budget uncertainty. Math. Program. Comput. Christina Büsing, Timo Gersing, Arie M. C. A. Koster
2023	B	`conf`	Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. IPCO Christina Büsing, Timo Gersing, Arie M. C. A. Koster
2022	B	`conf`	An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP. SEA Akshay Gupte, Arie M. C. A. Koster, Sascha Kuhnke
2022	J	`jnl`	Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions. BMC Medical Informatics Decis. Mak. Neele Leithäuser, Dennis Adelhütte, Kristin Braun, Christina Büsing, Martin Comis, Timo Gersing, Sebastian S. Johann, Arie M. C. A. Koster, Sven O. Krumke, Frauke Liers, Eva Schmidt, Johanna Schneider, Manuel Streicher, Sebastian Tschuppik, Sophia Wrede
2022	C	`conf`	Foreword. INOC Christina Büsing, Arie M. C. A. Koster
2022	C	`conf`	Optimal Vaccination Strategies for Multiple Dose Vaccinations. ISCO Jenny Segschneider, Arie M. C. A. Koster
2022	C	`ed.`	Proceedings of the 10th International Network Optimization Conference, INOC 2022, Aachen, Germany, June 7-10, 2022. INOC Christina Büsing, Arie M. C. A. Koster
2022	J	`jnl`	Robust minimum cost flow problem under consistent flow constraints. Ann. Oper. Res. Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz
2020	J	`jnl`	Robust Minimum Cost Flow Problem Under Consistent Flow Constraints. CoRR Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz
2020	J	`jnl`	Special issue on: Computational discrete optimization. EURO J. Comput. Optim. Arie M. C. A. Koster, Clemens Thielen
2019	J	`jnl`	A flow based pruning scheme for enumerative equitable coloring algorithms. Ann. Oper. Res. Arie M. C. A. Koster, Robert Scheidweiler, Martin Tieves
2019	J	`jnl`	Accurate optimization models for interference constrained bandwidth allocation in cellular networks. Comput. Oper. Res. Grit Ecker, Di Yuan, Arie M. C. A. Koster, Anke Schmeink
2019	J	`jnl`	Formulations and algorithms for the recoverable Γ-robust knapsack problem. EURO J. Comput. Optim. Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster, Manuel Kutschka
2019	J	`jnl`	On the Burning Number of p-Caterpillars. CoRR Michaela Hiller, Eberhard Triesch, Arie M. C. A. Koster
2018	J	`jnl`	Lot sizing with storage losses under demand uncertainty. J. Comb. Optim. Stefano Coniglio, Arie M. C. A. Koster, Nils Spiekermann
2018	J	`jnl`	Robust flows over time: models and complexity results. Math. Program. Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
2018	J	`jnl`	Special issue on: robust combinatorial optimization. EURO J. Comput. Optim. Arie M. C. A. Koster, Michael Poss
2018	J	`jnl`	The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim. Jan Hackfeld, Arie M. C. A. Koster
2017	J	`jnl`	Improved handling of uncertainty and robustness in set covering problems. Eur. J. Oper. Res. Pascal Lutter, Dirk Degel, Christina Büsing, Arie M. C. A. Koster, Brigitte Werners
2017	B	`conf`	Optimisation Models for Robust and Survivable Network Slice Design: A Comparative Analysis. GLOBECOM Andreas Baumgartner, Thomas Bauschert, Arie M. C. A. Koster, Varun S. Reddy
2017	J	`jnl`	Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations. Networks Christina Büsing, Alexandra Grub, Arie M. C. A. Koster, Waldemar Laube, Martin Tieves
2016	J	`jnl`	An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems. Comput. Chem. Eng. Sebastian Goderbauer, Björn Bahl, Philip Voll, Marco E. Lübbecke, André Bardow, Arie M. C. A. Koster
2016	J	`jnl`	On the computational complexity of the virtual network embedding problem. Electron. Notes Discret. Math. Edoardo Amaldi, Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves
2016	J	`jnl`	Robust Flows over Time: Models and Complexity Results. CoRR Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
2016	—	`conf`	Robust plans for spectrum allocation in elastic flexgrid optical networks. RNDM Christina Büsing, Arie M. C. A. Koster, Martin Tieves
2015	J	`jnl`	Future research directions in design of reliable communication systems. Telecommun. Syst. Jacek Rak, Mario Pickavet, Kishor S. Trivedi, Javier Alonso Lopez, Arie M. C. A. Koster, James P. G. Sterbenz, Egemen K. Çetinkaya, Teresa Gomes, Matthias Gunkel, Krzysztof Walkowiak, Dimitri Staessens
2015	J	`jnl`	Optimal offline virtual network embedding with rent-at-bulk aspects. CoRR Stefano Coniglio, Boris Grimm, Arie M. C. A. Koster, Martin Tieves, Axel Werner
2015	J	`jnl`	Robust Metric Inequalities for Network Loading Under Demand Uncertainty. Asia Pac. J. Oper. Res. Grit Claßen, Arie M. C. A. Koster, Manuel Kutschka, Issam Tahiri
2015	J	`jnl`	The multi-band robust knapsack problem - A dynamic programming approach. Discret. Optim. Grit Claßen, Arie M. C. A. Koster, Anke Schmeink
2015	—	`conf`	Virtual network embedding under uncertainty: Exact and heuristic approaches. DRCN Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves
2014	J	`jnl`	Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. INFORMS J. Comput. Grit Claßen, Arie M. C. A. Koster, David Coudert, Napoleão Nepomuceno
2014	J	`jnl`	Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theor. Comput. Sci. Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
2014	J	`jnl`	Network planning under demand uncertainty with robust optimization. IEEE Commun. Mag. Thomas Bauschert, Christina Büsing, Fabio D'Andreagiovanni, Arie M. C. A. Koster, Manuel Kutschka, Uwe Steglich
2013	J	`jnl`	A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks. Comput. Oper. Res. Grit Claßen, Arie M. C. A. Koster, Anke Schmeink
2013	J	`jnl`	Pre-processing for Triangulation of Probabilistic Networks CoRR Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag
2013	—	`conf`	Robust Redundancy Elimination for Energy-Aware Routing. GreenCom/iThings/CPScom David Coudert, Arie M. C. A. Koster, Truong Khoa Phan, Martin Tieves
2013	J	`jnl`	Robust network design: Formulations, valid inequalities, and computations. Networks Arie M. C. A. Koster, Manuel Kutschka, Christian Raack
2013	J	`jnl`	Speeding up column generation for robust wireless network planning. EURO J. Comput. Optim. Grit Claßen, Arie M. C. A. Koster, Anke Schmeink
2013	—	`conf`	Γ-robust network design for Mixed-Line-Rate-Planning of Optical Networks. OFC/NFOEC Svetoslav Duhovnikov, Arie M. C. A. Koster, Manuel Kutschka, Franz Rambach, Dominic Schupke
2012	J	`jnl`	A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2012	C	`conf`	Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
2012	—	`conf`	Formulations and algorithms for the multi-path selection problem in network routing. ICUMT Nayyar Almas Kazmi, Arie M. C. A. Koster, Jürgen Branke
2012	J	`jnl`	On exact algorithms for treewidth. ACM Trans. Algorithms Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2011	C	`conf`	A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks. INOC Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno
2011	B	`conf`	An Experimental Evaluation of Treewidth at Most Four Reductions. SEA Alexander Hein, Arie M. C. A. Koster
2011	—	`conf`	An integer linear programming model for optimal self protection multi-path selection. ICUMT Nayyar Almas Kazmi, Arie M. C. A. Koster
2011	—	`conf`	An integrated model for survivable network design under demand uncertainty. DRCN Arie M. C. A. Koster, Manuel Kutschka
2011	C	`conf`	Bandwidth assignment for reliable fixed broadband wireless networks. WOWMOM Grit Classen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno
2011	C	`conf`	Cutset Inequalities for Robust Network Design. INOC Arie M. C. A. Koster, Manuel Kutschka, Christian Raack
2011	C	`conf`	Designing AC Power Grids Using Integer Linear Programming. INOC Arie M. C. A. Koster, Stephan Lemkens
2011	J	`jnl`	On cut-based inequalities for capacitated network design polyhedra. Networks Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly
2011	—	`conf`	On the Robustness of Optimal Network Designs. ICC Arie M. C. A. Koster, Manuel Kutschka, Christian Raack
2011	C	`conf`	Recoverable Robust Knapsacks: Γ-Scenarios. INOC Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka
2011	J	`jnl`	Recoverable robust knapsacks: the discrete scenario case. Optim. Lett. Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka
2011	—	`conf`	Robust planning of green wireless networks. NetGCoop Grit Classen, Arie M. C. A. Koster, Anke Schmeink
2011	J	`jnl`	Treewidth computations II. Lower bounds. Inf. Comput. Hans L. Bodlaender, Arie M. C. A. Koster
2010	—	`ch.`	Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems. Graphs and Algorithms in Communication Networks Sebastian Orlowski, Christian Raack, Arie M. C. A. Koster, Georg Baier, Thomas Engel, Pietro Belotti
2010	—	`ch.`	Graphs and Algorithms in Communication Networks on Seven League Boots. Graphs and Algorithms in Communication Networks Arie M. C. A. Koster, Xavier Muñoz
2010	—	`conf`	Towards robust network design using integer linear programming techniques. NGI Arie M. C. A. Koster, Manuel Kutschka, Christian Raack
2010	J	`jnl`	Treewidth computations I. Upper bounds. Inf. Comput. Hans L. Bodlaender, Arie M. C. A. Koster
2009	J	`jnl`	Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts. Algorithmica Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka
2009	J	`jnl`	DIMAP Workshop on Algorithmic Graph Theory. Electron. Notes Discret. Math. Arie M. C. A. Koster, Vadim V. Lozin
2008	J	`jnl`	Combinatorial Optimization on Graphs of Bounded Treewidth. Comput. J. Hans L. Bodlaender, Arie M. C. A. Koster
2008	J	`jnl`	Comparing Imperfection Ratio and Imperfection Index for Graph Classes. RAIRO Oper. Res. Arie M. C. A. Koster, Annegret K. Wagler
2008	J	`jnl`	Treewidth Lower Bounds with Brambles. Algorithmica Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
2007	A	`conf`	Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts. ESA Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka
2007	J	`jnl`	Models and solution techniques for frequency assignment problems. Ann. Oper. Res. Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
2007	J	`jnl`	On the maximum cardinality search lower bound for treewidth. Discret. Appl. Math. Hans L. Bodlaender, Arie M. C. A. Koster
2007	—	`conf`	Overview of resilience mechanisms based on multipath structures. DRCN Michael Menth, Rüdiger Martin, Arie M. C. A. Koster, Sebastian Orlowski
2007	J	`jnl`	Safe Reduction Rules for Weighted Treewidth. Algorithmica Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster
2006	J	`jnl`	Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster
2006	A	`conf`	On Exact Algorithms for Treewidth. ESA Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2006	J	`jnl`	On determining the imperfection ratio. Electron. Notes Discret. Math. Arie M. C. A. Koster, Annegret K. Wagler
2006	J	`jnl`	Safe separators for treewidth. Discret. Math. Hans L. Bodlaender, Arie M. C. A. Koster
2005	—	`conf`	A computational study for demand-wise shared protection. DRCN Claus G. Gruber, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly, Adrian Zymolka
2005	—	`conf`	Degree-Based Treewidth Lower Bounds. WEA Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender
2005	J	`jnl`	Demand-wise Shared Protection for Meshed Optical Networks. J. Netw. Syst. Manag. Arie M. C. A. Koster, Adrian Zymolka, Monika Jäger, Ralf Huelsermann
2005	J	`jnl`	On cycles and the stable multi-set polytope. Discret. Optim. Arie M. C. A. Koster, Adrian Zymolka
2005	J	`jnl`	Preprocessing Rules for Triangulation of Probabilistic Networks. Comput. Intell. Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof
2005	A	`conf`	Treewidth Lower Bounds with Brambles. ESA Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
2004	A	`conf`	Contraction and Treewidth Lower Bounds. ESA Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle
2004	B	`conf`	On the Maximum Cardinality Search Lower Bound for Treewidth. WG Hans L. Bodlaender, Arie M. C. A. Koster
2004	—	`conf`	Safe Seperators for Treewidth. ALENEX/ANALC Hans L. Bodlaender, Arie M. C. A. Koster
2003	J	`jnl`	Bidirected and unidirected capacity installation in telecommunication networks. Discret. Appl. Math. Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh
2003	—	`conf`	Demand-wise shared protection for meshed optical networks. DRCN Arie M. C. A. Koster
2003	J	`jnl`	Models and solution techniques for frequency assignment problems. 4OR Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
2002	J	`jnl`	Frequency planning and ramifications of coloring. Discuss. Math. Graph Theory Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster
2002	J	`jnl`	Polyhedral results for the edge capacity polytope. Math. Program. Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh
2002	J	`jnl`	Solving partial constraint satisfaction problems with tree decomposition. Networks Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
2002	J	`jnl`	Stable multi-sets. Math. Methods Oper. Res. Arie M. C. A. Koster, Adrian Zymolka
2001	A	`conf`	Pre-processing for Triangulation of Probabilistic Networks. UAI Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag
2001	J	`jnl`	Treewidth: Computational Experiments. Electron. Notes Discret. Math. Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel
2000	J	`jnl`	A dynamic programming algorithm for the local access telecommunication network expansion problem. Eur. J. Oper. Res. Olaf E. Flippo, Antoon W. J. Kolen, Arie M. C. A. Koster, Robert L. M. J. van de Leensel
1999	B	`conf`	Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. WG Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
1999	J	`jnl`	Solving Frequency Assignment Problems via Tree-Decomposition Electron. Notes Discret. Math. Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
1998	J	`jnl`	The partial constraint satisfaction problem: Facets and lifting theorems. Oper. Res. Lett. Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen