Arie M. C. A. Koster

3.6k total citations
104 papers, 1.7k citations indexed

About

Arie M. C. A. Koster is a scholar working on Electrical and Electronic Engineering, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Arie M. C. A. Koster has authored 104 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Electrical and Electronic Engineering, 38 papers in Computational Theory and Mathematics and 33 papers in Computer Networks and Communications. Recurrent topics in Arie M. C. A. Koster's work include Advanced Graph Theory Research (33 papers), Advanced Optical Network Technologies (27 papers) and Vehicle Routing Optimization Methods (19 papers). Arie M. C. A. Koster is often cited by papers focused on Advanced Graph Theory Research (33 papers), Advanced Optical Network Technologies (27 papers) and Vehicle Routing Optimization Methods (19 papers). Arie M. C. A. Koster collaborates with scholars based in Germany, Netherlands and United Kingdom. Arie M. C. A. Koster's co-authors include Hans L. Bodlaender, Stan P.M. van Hoesel, Christian Raack, Antoon Kolen, Antonio Sassano, Carlo Mannino, Karen Aardal, Stefano Coniglio, Christina Büsing and Roland Wessäly and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Expert Systems with Applications.

In The Last Decade

Arie M. C. A. Koster

98 papers receiving 1.6k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Arie M. C. A. Koster Germany	22	802	651	526	261	219	104	1.7k
Piotr Berman United States	25	1.2k 1.5×	470 0.7×	860 1.6×	205 0.8×	410 1.9×	110	2.2k
Naveen Garg India	21	1.4k 1.8×	411 0.6×	1.0k 2.0×	459 1.8×	277 1.3×	63	2.4k
Tobias Achterberg Germany	13	383 0.5×	299 0.5×	528 1.0×	586 2.2×	284 1.3×	25	1.8k
Gruiă Cälinescu United States	22	1.7k 2.1×	630 1.0×	652 1.2×	84 0.3×	256 1.2×	59	2.3k
Francesco Maffioli Italy	23	439 0.5×	223 0.3×	550 1.0×	825 3.2×	286 1.3×	87	1.8k
Reuven Bar-Yehuda Israel	23	1.2k 1.5×	290 0.4×	757 1.4×	253 1.0×	220 1.0×	58	1.9k
Hanoch Levy Israel	22	1.1k 1.4×	650 1.0×	142 0.3×	118 0.5×	143 0.7×	111	1.8k
Asaf Levin Israel	18	596 0.7×	146 0.2×	358 0.7×	574 2.2×	155 0.7×	130	1.3k
Mechthild Stoer Germany	10	442 0.6×	353 0.5×	412 0.8×	296 1.1×	106 0.5×	10	1.1k
Martin Skutella Germany	23	899 1.1×	162 0.2×	360 0.7×	816 3.1×	155 0.7×	94	1.8k

Countries citing papers authored by Arie M. C. A. Koster

Since Specialization

Citations

This map shows the geographic impact of Arie M. C. A. Koster's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Arie M. C. A. Koster with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arie M. C. A. Koster more than expected).

Fields of papers citing papers by Arie M. C. A. Koster

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Arie M. C. A. Koster. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Arie M. C. A. Koster. The network helps show where Arie M. C. A. Koster may publish in the future.

Co-authorship network of co-authors of Arie M. C. A. Koster

This figure shows the co-authorship network connecting the top 25 collaborators of Arie M. C. A. Koster. A scholar is included among the top collaborators of Arie M. C. A. Koster based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Arie M. C. A. Koster. Arie M. C. A. Koster is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Büsing, Christina, et al.. (2024). Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty. Mathematical Programming. 210(1-2). 97–146.

Büsing, Christina, et al.. (2023). Robust transshipment problem under consistent flow constraints. Networks. 83(1). 53–82. 1 indexed citations

Amaldi, E., et al.. (2016). On the computational complexity of the virtual network embedding problem. Electronic Notes in Discrete Mathematics. 52. 213–220. 103 indexed citations

Coniglio, Stefano, et al.. (2015). Virtual network embedding under uncertainty: Exact and heuristic approaches. Aisberg (University of Bergamo). 1–8. 11 indexed citations

Keßelheim, Thomas, et al.. (2014). Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theoretical Computer Science. 553. 64–73. 2 indexed citations

Bodlaender, Hans L., et al.. (2013). Pre-processing for Triangulation of Probabilistic Networks. arXiv (Cornell University). 32–39. 3 indexed citations

Koster, Arie M. C. A., et al.. (2011). An integer linear programming model for optimal self protection multi-path selection. RWTH Publications (RWTH Aachen). 1–7.

Büsing, Christina, et al.. (2011). Recoverable robust knapsacks: the discrete scenario case. Optimization Letters. 5(3). 379–392. 30 indexed citations

Koster, Arie M. C. A., et al.. (2009). Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks. Springer eBooks. 19 indexed citations

10.

Koster, Arie M. C. A. & Vadim Lozin. (2009). DIMAP Workshop on Algorithmic Graph Theory. Electronic Notes in Discrete Mathematics. 32. 1–1. 2 indexed citations

11.

Raack, Christian, Arie M. C. A. Koster, & Roland Wessäly. (2007). On the strength of cut-based inequalities for capacitated network design polyhedra. 5 indexed citations

12.

Bodlaender, Hans L., et al.. (2007). Safe Reduction Rules for Weighted Treewidth. Algorithmica. 47(2). 139–158. 17 indexed citations

13.

Koster, Arie M. C. A. & Annegret K. Wagler. (2006). The extreme points of QSTAB(G) and its implications. 2 indexed citations

14.

Koster, Arie M. C. A., et al.. (2005). On cycles and the stable multi-set polytope. Discrete Optimization. 2(3). 241–255. 3 indexed citations

15.

Wolle, Thomas, Arie M. C. A. Koster, & Hans L. Bodlaender. (2004). A Note on Contraction Degeneracy. Utrecht University Repository (Utrecht University). 7 indexed citations

16.

Koster, Arie M. C. A., et al.. (2002). Transparent optical network design with sparse wavelength conversion. 18 indexed citations

17.

Hoesel, Stan P.M. van, et al.. (2002). Polyhedral results for the edge capacity polytope. Mathematical Programming. 92(2). 335–358. 18 indexed citations

18.

Koster, Arie M. C. A., Stan P.M. van Hoesel, & Antoon Kolen. (2002). Solving partial constraint satisfaction problems with tree decomposition. Networks. 40(3). 170–180. 30 indexed citations

19.

Aardal, Karen, C.P.M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, & Antonio Sassano. (2001). Models and Solution Techniques for Frequency Assignment Problems. TU/e Research Portal. 19 indexed citations

20.

Koster, Arie M. C. A., C.P.M. van Hoesel, & Antoon Kolen. (1997). The partial constraint satisfaction problem : facets and lifting theorems. RePEc: Research Papers in Economics. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact