2026 Arie M. C. A. Koster: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	30	14005	13573	678	663	154	4535

Arie M. C. A. Koster publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Arie M. C. A. Koster sits on this spectrum.

32 publications 991+

This scientist: 154 publications — 28th percentile

28% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Arie M. C. A. Koster D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Arie M. C. A. Koster sits on this spectrum.

30 D-Index 131+

This scientist: 30 D-Index — 3rd percentile

3% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Arie M. C. A. Koster is affiliated with RWTH Aachen University in Germany. Their research predominantly focuses on optimization problems in operations research, with a strong emphasis on robust and combinatorial optimization techniques.

The scientist's recent publications highlight various aspects of robust optimization and project scheduling. Notable papers include:

Γ-robust optimization of project scheduling problems, 2023, published in Computers & Operations Research
A branch and bound algorithm for robust binary optimization with budget uncertainty, 2023, published in Mathematical Programming Computation
Robust minimum cost flow problem under consistent flow constraints, 2021, published in Annals of Operations Research
Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty, 2022, published in Zenodo (CERN European Organization for Nuclear Research)
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions, 2022, published in BMC Medical Informatics and Decision Making

Frequent co-authors collaborating with Arie M. C. A. Koster include:

Christina Büsing
Timo Gersing
Jenny Segschneider
Michaela Hiller
Sabrina Schmitz

Their work has been published in various venues, including:

Zenodo (CERN European Organization for Nuclear Research)
Discrete Applied Mathematics
Networks
Mathematical Programming Computation
Annals of Operations Research

Arie M. C. A. Koster's research spans multiple subfields of study such as:

Management Science and Operations Research
Industrial and Manufacturing Engineering
Statistical and Nonlinear Physics
Computational Theory and Mathematics
Organizational Behavior and Human Resource Management

Their principal research topics cover areas including:

Risk and Portfolio Optimization
Vehicle Routing Optimization Methods
Facility Location and Emergency Management
Complex Network Analysis Techniques
Optimization and Mathematical Programming
Scheduling and Timetabling Solutions
Data Management and Algorithms

Best Publications

Models and Solution Techniques for Frequency Assignment Problems

Karen I. Aardal;Stan P. M. van Hoesel;Arie M. C. A. Koster;Carlo Mannino

661
Citations
Models and solution techniques for frequency assignment problems

Karen I. Aardal;Stan P. M. van Hoesel;Arie M. C. A. Koster;Carlo Mannino

499
Citations
Combinatorial Optimization on Graphs of Bounded Treewidth

Hans L. Bodlaender;Arie M. C. A. Koster

349
Citations
Treewidth computations I. Upper bounds

Hans L. Bodlaender;Arie M. C. A. Koster

283
Citations
Frequency assignment : models and algorithms

Arie M. C. A. Koster

244
Citations
On the computational complexity of the virtual network embedding problem

Edoardo Amaldi;Stefano Coniglio;Arie M.C.A. Koster;Martin Tieves

177
Citations
Treewidth: Computational Experiments

Arie M. C.A. Koster;Hans L. Bodlaender;Stan P.M. van Hoesel

168
Citations
Frequency Planning and Ramifications of Coloring

Andreas Eisenblätter;Martin Grötschel;Arie M.C.A. Koster

146
Citations
On cut-based inequalities for capacitated network design polyhedra

Christian Raack;Arie M. C. A. Koster;Sebastian Orlowski;Roland Wessäly

131
Citations
The partial constraint satisfaction problem: Facets and lifting theorems

Arie M. C. A. Koster;Stan P. M. Van Hoesel;Antoon W. J. Kolen

128
Citations
Safe separators for treewidth

Hans L. Bodlaender;Arie M. C. A. Koster

125
Citations
Robust network design: Formulations, valid inequalities, and computations

Arie M.C.A. Koster;Manuel Kutschka;Christian Raack

104
Citations
Treewidth computations II. Lower bounds

Hans L. Bodlaender;Arie M. C. A. Koster

102
Citations
Demand-wise Shared Protection for Meshed Optical Networks

Arie M. Koster;Adrian Zymolka;Monika Jäger;Ralf Hülsermann

99
Citations
Network planning under demand uncertainty with robust optimization

Thomas Bauschert;Christina Büsing;Fabio D'Andreagiovanni;Arie C. A. Koster

90
Citations
Branch and Tree Decomposition Techniques for Discrete Optimization

Illya V. Hicks;Arie M. C. A. Koster;Elif Koloto ˘ glu

89
Citations
Modelling Feasible Network Configurations for UMTS

Andreas Eisenblätter;Roland Wessäly;Alexander Martin;Armin Fügenschuh

87
Citations
Solving partial constraint satisfaction problems with tree decomposition

Arie M. C. A. Koster;Stan P. M. van Hoesel;Antoon W. J. Kolen

84
Citations
On exact algorithms for treewidth

Hans L. Bodlaender;Fedor V. Fomin;Arie M. C. A. Koster;Dieter Kratsch

80
Citations
PREPROCESSING RULES FOR TRIANGULATION OF PROBABILISTIC NETWORKS

Hans L. Bodlaender;Arie M.C.A. Koster;Frank van den Eijkhof

79
Citations
Treewidth Lower Bounds with Brambles

Hans L. Bodlaender;Alexander Grigoriev;Arie M. C. A. Koster

75
Citations
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

Hans L. Bodlaender;Fedor V. Fomin;Arie M. C. A. Koster;Dieter Kratsch

74
Citations
Contraction and Treewidth Lower Bounds

Hans L. Bodlaender;Thomas Wolle;Arie M. C. A. Koster

71
Citations

Frequent Co-Authors

Hans L. Bodlaender Utrecht University

Anke Schmeink RWTH Aachen University

André Bardow ETH Zurich

Dimitrios M. Thilikos National and Kapodistrian University of Athens

Dieter Kratsch University of Lorraine

Fedor V. Fomin University of Bergen

Martin W. P. Savelsbergh Georgia Institute of Technology

Di Yuan Uppsala University

Berthold Vöcking RWTH Aachen University

Alex Martin National Institutes of Health

External Links

Personal website of Arie M. C. A. Koster

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Expanding your computer science studies in the USA opens numerous career pathways, both on campus and online. Many students explore related fields such as electrical engineering—an area closely connected to tech innovation. If you’re interested in this direction, check out the top online electrical engineering schools for flexible and reputable degree options.

Earning certifications for jobs is a quick way to boost your credentials and improve job prospects. Many tech certifications require less time than a degree and can qualify you for well-paying positions in IT, networking, and software development.

For those looking to advance quickly, consider the shortest masters degree pathways, which let you earn a graduate credential in a fraction of the usual time. Before you decide, review the best masters degree to get for your career goals, as these programs tend to offer strong job placement and salary potential.