default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArie M. C. A. Koster
Arie Koster
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j61]Arie M. C. A. Koster
, Jenny Segschneider, Nicole Ventsch:
Γ-robust optimization of project scheduling problems. Comput. Oper. Res. 161: 106453 (2024)- [j60]Jenny Segschneider, Arie M. C. A. Koster:
Robust two-dose vaccination schemes and the directed b-matching problem. Discret. Appl. Math. 356: 369-392 (2024) - [j59]Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust transshipment problem under consistent flow constraints. Networks 83(1): 53-82 (2024) - 2023
- [j58]Christina Büsing, Timo Gersing, Arie M. C. A. Koster:
A branch and bound algorithm for robust binary optimization with budget uncertainty. Math. Program. Comput. 15(2): 269-326 (2023) - 2022
- [j57]Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust minimum cost flow problem under consistent flow constraints. Ann. Oper. Res. 312(2): 691-722 (2022) - [j56]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:
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions. BMC Medical Informatics Decis. Mak. 22(1): 132 (2022) - 2020
- [j55]Arie M. C. A. Koster, Clemens Thielen:
Special issue on: Computational discrete optimization. EURO J. Comput. Optim. 8(3): 201-203 (2020) - 2019
- [j54]Arie M. C. A. Koster, Robert Scheidweiler, Martin Tieves:
A flow based pruning scheme for enumerative equitable coloring algorithms. Ann. Oper. Res. 272(1-2): 3-28 (2019) - [j53]Grit Ecker, Di Yuan, Arie M. C. A. Koster, Anke Schmeink:
Accurate optimization models for interference constrained bandwidth allocation in cellular networks. Comput. Oper. Res. 101: 1-12 (2019) - [j52]Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster, Manuel Kutschka:
Formulations and algorithms for the recoverable Γ-robust knapsack problem. EURO J. Comput. Optim. 7(1): 15-45 (2019) - 2018
- [j51]Arie M. C. A. Koster, Michael Poss:
Special issue on: robust combinatorial optimization. EURO J. Comput. Optim. 6(3): 207-209 (2018) - [j50]Jan Hackfeld, Arie M. C. A. Koster:
The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim. 35(3): 853-859 (2018) - [j49]Stefano Coniglio, Arie M. C. A. Koster, Nils Spiekermann:
Lot sizing with storage losses under demand uncertainty. J. Comb. Optim. 36(3): 763-788 (2018) - [j48]Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz:
Robust flows over time: models and complexity results. Math. Program. 171(1-2): 55-85 (2018) - 2017
- [j47]Pascal Lutter, Dirk Degel, Christina Büsing, Arie M. C. A. Koster, Brigitte Werners:
Improved handling of uncertainty and robustness in set covering problems. Eur. J. Oper. Res. 263(1): 35-49 (2017) - [j46]Christina Büsing, Arie Koster, Sarah Kirchner, Annika Thome:
The budgeted minimum cost flow problem with unit upgrading cost. Networks 69(1): 67-82 (2017) - [j45]Christina Büsing, Alexandra Grub, Arie M. C. A. Koster, Waldemar Laube, Martin Tieves:
Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations. Networks 70(4): 342-359 (2017) - 2016
- [j44]Sebastian Goderbauer, Björn Bahl, Philip Voll, Marco E. Lübbecke, André Bardow, Arie M. C. A. Koster:
An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems. Comput. Chem. Eng. 95: 38-48 (2016) - [j43]Edoardo Amaldi, Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves:
On the computational complexity of the virtual network embedding problem. Electron. Notes Discret. Math. 52: 213-220 (2016) - [j42]Stefano Coniglio, Arie Koster, Martin Tieves:
Data Uncertainty in Virtual Network Embedding: Robust Optimization and Protection Levels. J. Netw. Syst. Manag. 24(2): 681-710 (2016) - 2015
- [j41]Grit Claßen, Arie M. C. A. Koster, Manuel Kutschka, Issam Tahiri:
Robust Metric Inequalities for Network Loading Under Demand Uncertainty. Asia Pac. J. Oper. Res. 32(5): 1550038:1-1550038:27 (2015) - [j40]Grit Claßen, Arie M. C. A. Koster, Anke Schmeink:
The multi-band robust knapsack problem - A dynamic programming approach. Discret. Optim. 18: 123-149 (2015) - [j39]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:
Future research directions in design of reliable communication systems. Telecommun. Syst. 60(4): 423-450 (2015) - 2014
- [j38]Thomas Bauschert, Christina Büsing, Fabio D'Andreagiovanni, Arie M. C. A. Koster, Manuel Kutschka, Uwe Steglich:
Network planning under demand uncertainty with robust optimization. IEEE Commun. Mag. 52(2): 178-185 (2014) - [j37]Grit Claßen, Arie M. C. A. Koster, David Coudert, Napoleão Nepomuceno:
Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. INFORMS J. Comput. 26(4): 893-909 (2014) - [j36]Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking:
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theor. Comput. Sci. 553: 64-73 (2014) - 2013
- [j35]Grit Claßen, Arie M. C. A. Koster, Anke Schmeink:
A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks. Comput. Oper. Res. 40(1): 80-90 (2013) - [j34]Grit Claßen, Arie M. C. A. Koster, Anke Schmeink:
Speeding up column generation for robust wireless network planning. EURO J. Comput. Optim. 1(3-4): 253-281 (2013) - [j33]Arie Koster, Truong Khoa Phan, Martin Tieves:
Extended Cutset Inequalities for the Network Power Consumption Problem. Electron. Notes Discret. Math. 41: 69-76 (2013) - [j32]Arie M. C. A. Koster, Manuel Kutschka, Christian Raack:
Robust network design: Formulations, valid inequalities, and computations. Networks 61(2): 128-149 (2013) - 2012
- [j31]Arie Koster, Martin Tieves:
Column Generation for Frequency Assignment in Slow Frequency Hopping Networks. EURASIP J. Wirel. Commun. Netw. 2012: 253 (2012) - [j30]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. 50(3): 420-432 (2012) - [j29]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
On exact algorithms for treewidth. ACM Trans. Algorithms 9(1): 12:1-12:23 (2012) - 2011
- [j28]Hans L. Bodlaender, Arie M. C. A. Koster:
Treewidth computations II. Lower bounds. Inf. Comput. 209(7): 1103-1119 (2011) - [j27]Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly:
On cut-based inequalities for capacitated network design polyhedra. Networks 57(2): 141-156 (2011) - [j26]Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka:
Recoverable robust knapsacks: the discrete scenario case. Optim. Lett. 5(3): 379-392 (2011) - 2010
- [j25]Hans L. Bodlaender, Arie M. C. A. Koster:
Treewidth computations I. Upper bounds. Inf. Comput. 208(3): 259-275 (2010) - 2009
- [j24]Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka:
Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts. Algorithmica 55(2): 375-391 (2009) - [j23]Arie M. C. A. Koster, Vadim V. Lozin:
DIMAP Workshop on Algorithmic Graph Theory. Electron. Notes Discret. Math. 32: 1 (2009) - 2008
- [j22]Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster:
Treewidth Lower Bounds with Brambles. Algorithmica 51(1): 81-98 (2008) - [j21]Hans L. Bodlaender, Arie M. C. A. Koster:
Combinatorial Optimization on Graphs of Bounded Treewidth. Comput. J. 51(3): 255-269 (2008) - [j20]Arie M. C. A. Koster, Annegret Katrin Wagler:
Comparing Imperfection Ratio and Imperfection Index for Graph Classes. RAIRO Oper. Res. 42(4): 485-500 (2008) - 2007
- [j19]Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster:
Safe Reduction Rules for Weighted Treewidth. Algorithmica 47(2): 139-158 (2007) - [j18]Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano:
Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1): 79-129 (2007) - [j17]Hans L. Bodlaender, Arie M. C. A. Koster:
On the maximum cardinality search lower bound for treewidth. Discret. Appl. Math. 155(11): 1348-1372 (2007) - 2006
- [j16]Hans L. Bodlaender, Arie M. C. A. Koster:
Safe separators for treewidth. Discret. Math. 306(3): 337-350 (2006) - [j15]Arie M. C. A. Koster, Annegret Wagler:
On determining the imperfection ratio. Electron. Notes Discret. Math. 25: 177-181 (2006) - [j14]Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster:
Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. 10(1): 5-49 (2006) - 2005
- [j13]Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof:
Preprocessing Rules for Triangulation of Probabilistic Networks. Comput. Intell. 21(3): 286-305 (2005) - [j12]Arie M. C. A. Koster, Adrian Zymolka:
On cycles and the stable multi-set polytope. Discret. Optim. 2(3): 241-255 (2005) - [j11]Arie M. C. A. Koster, Adrian Zymolka, Monika Jäger, Ralf Huelsermann:
Demand-wise Shared Protection for Meshed Optical Networks. J. Netw. Syst. Manag. 13(1): 35-55 (2005) - 2003
- [j10]Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano:
Models and solution techniques for frequency assignment problems. 4OR 1(4): 261-317 (2003) - [j9]Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh:
Bidirected and unidirected capacity installation in telecommunication networks. Discret. Appl. Math. 133(1-3): 103-121 (2003) - 2002
- [j8]Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster:
Frequency planning and ramifications of coloring. Discuss. Math. Graph Theory 22(1): 51-88 (2002) - [j7]Arie M. C. A. Koster, Adrian Zymolka:
Stable multi-sets. Math. Methods Oper. Res. 56(1): 45-65 (2002) - [j6]Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh:
Polyhedral results for the edge capacity polytope. Math. Program. 92(2): 335-358 (2002) - [j5]Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
Solving partial constraint satisfaction problems with tree decomposition. Networks 40(3): 170-180 (2002) - 2001
- [j4]Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel:
Treewidth: Computational Experiments. Electron. Notes Discret. Math. 8: 54-57 (2001) - 2000
- [j3]Olaf E. Flippo, Antoon W. J. Kolen, Arie M. C. A. Koster, Robert L. M. J. van de Leensel:
A dynamic programming algorithm for the local access telecommunication network expansion problem. Eur. J. Oper. Res. 127(1): 189-202 (2000) - 1999
- [j2]Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
Solving Frequency Assignment Problems via Tree-Decomposition1. Electron. Notes Discret. Math. 3: 102-105 (1999) - 1998
- [j1]Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
The partial constraint satisfaction problem: Facets and lifting theorems. Oper. Res. Lett. 23(3-5): 89-97 (1998)
Conference and Workshop Papers
- 2023
- [c36]Christina Büsing, Timo Gersing, Arie M. C. A. Koster:
Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. IPCO 2023: 58-71 - 2022
- [c35]Christina Büsing, Arie M. C. A. Koster:
Foreword. INOC 2022: 1-4 - [c34]Christina Büsing, Arie Koster, Sabrina Schmitz:
On the complexity of robust transshipment under consistent flow constraints. INOC 2022: 1-6 - [c33]Jenny Segschneider, Arie M. C. A. Koster:
Optimal Vaccination Strategies for Multiple Dose Vaccinations. ISCO 2022: 272-283 - [c32]Akshay Gupte, Arie M. C. A. Koster, Sascha Kuhnke:
An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP. SEA 2022: 24:1-24:14 - 2017
- [c31]Andreas Baumgartner, Thomas Bauschert, Arie M. C. A. Koster, Varun S. Reddy:
Optimisation Models for Robust and Survivable Network Slice Design: A Comparative Analysis. GLOBECOM 2017: 1-7 - 2016
- [c30]Stefano Coniglio, Arie Koster, Nils Spiekermann:
On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration. ISCO 2016: 26-37 - [c29]Christina Büsing, Arie M. C. A. Koster, Martin Tieves:
Robust plans for spectrum allocation in elastic flexgrid optical networks. RNDM 2016: 108-115 - 2015
- [c28]Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves:
Virtual network embedding under uncertainty: Exact and heuristic approaches. DRCN 2015: 1-8 - 2013
- [c27]David Coudert, Arie M. C. A. Koster, Truong Khoa Phan, Martin Tieves:
Robust Redundancy Elimination for Energy-Aware Routing. GreenCom/iThings/CPScom 2013: 179-186 - [c26]Svetoslav Duhovnikov, Arie M. C. A. Koster, Manuel Kutschka, Franz Rambach, Dominic Schupke:
Γ-robust network design for Mixed-Line-Rate-Planning of Optical Networks. OFC/NFOEC 2013: 1-3 - 2012
- [c25]Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking:
Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS 2012: 30-41 - [c24]Nayyar Almas Kazmi, Arie M. C. A. Koster, Jürgen Branke:
Formulations and algorithms for the multi-path selection problem in network routing. ICUMT 2012: 738-744 - 2011
- [c23]Arie M. C. A. Koster, Manuel Kutschka:
An integrated model for survivable network design under demand uncertainty. DRCN 2011: 54-61 - [c22]Arie M. C. A. Koster, Manuel Kutschka, Christian Raack:
On the Robustness of Optimal Network Designs. ICC 2011: 1-5 - [c21]Nayyar Almas Kazmi, Arie M. C. A. Koster:
An integer linear programming model for optimal self protection multi-path selection. ICUMT 2011: 1-7 - [c20]Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno:
A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks. INOC 2011: 37-42 - [c19]Arie M. C. A. Koster, Manuel Kutschka, Christian Raack:
Cutset Inequalities for Robust Network Design. INOC 2011: 118-123 - [c18]Arie M. C. A. Koster, Stephan Lemkens:
Designing AC Power Grids Using Integer Linear Programming. INOC 2011: 478-483 - [c17]Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka:
Recoverable Robust Knapsacks: Γ-Scenarios. INOC 2011: 583-588 - [c16]Grit Classen, Arie M. C. A. Koster, Anke Schmeink:
Robust planning of green wireless networks. NetGCoop 2011: 1-5 - [c15]Alexander Hein, Arie M. C. A. Koster:
An Experimental Evaluation of Treewidth at Most Four Reductions. SEA 2011: 218-229 - [c14]Grit Classen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno:
Bandwidth assignment for reliable fixed broadband wireless networks. WOWMOM 2011: 1-6 - 2010
- [c13]Arie M. C. A. Koster, Manuel Kutschka, Christian Raack:
Towards robust network design using integer linear programming techniques. NGI 2010: 1-8 - 2007
- [c12]Michael Menth, Rüdiger Martin, Arie M. C. A. Koster, Sebastian Orlowski:
Overview of resilience mechanisms based on multipath structures. DRCN 2007: 1-9 - [c11]Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka:
Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts. ESA 2007: 693-704 - 2006
- [c10]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
On Exact Algorithms for Treewidth. ESA 2006: 672-683 - 2005
- [c9]Claus G. Gruber, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly, Adrian Zymolka:
A computational study for demand-wise shared protection. DRCN 2005: 421-428 - [c8]Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster:
Treewidth Lower Bounds with Brambles. ESA 2005: 391-402 - [c7]Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender:
Degree-Based Treewidth Lower Bounds. WEA 2005: 101-112 - 2004
- [c6]Hans L. Bodlaender, Arie M. C. A. Koster:
Safe Seperators for Treewidth. ALENEX/ANALC 2004: 70-78 - [c5]Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle:
Contraction and Treewidth Lower Bounds. ESA 2004: 628-639 - [c4]Hans L. Bodlaender, Arie M. C. A. Koster:
On the Maximum Cardinality Search Lower Bound for Treewidth. WG 2004: 81-92 - 2003
- [c3]Arie M. C. A. Koster:
Demand-wise shared protection for meshed optical networks. DRCN 2003: 85-92 - 2001
- [c2]Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag:
Pre-processing for Triangulation of Probabilistic Networks. UAI 2001: 32-39 - 1999
- [c1]Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. WG 1999: 338-349
Parts in Books or Collections
- 2010
- [p2]Arie M. C. A. Koster, Xavier Muñoz:
Graphs and Algorithms in Communication Networks on Seven League Boots. Graphs and Algorithms in Communication Networks 2010: 1-59 - [p1]Sebastian Orlowski, Christian Raack, Arie M. C. A. Koster, Georg Baier, Thomas Engel, Pietro Belotti:
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems. Graphs and Algorithms in Communication Networks 2010: 95-118
Editorship
- 2022
- [e3]Christina Büsing, Arie M. C. A. Koster:
Proceedings of the 10th International Network Optimization Conference, INOC 2022, Aachen, Germany, June 7-10, 2022. OpenProceedings.org 2022, ISBN 978-3-89318-090-5 [contents] - 2016
- [e2]Marco E. Lübbecke, Arie Koster, Peter Letmathe, Reinhard Madlener, Britta Peis, Grit Walther:
Operations Research Proceedings 2014, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), RWTH Aachen University, Germany, September 2-5, 2014. Springer 2016, ISBN 978-3-319-28695-2 [contents] - 2010
- [e1]Arie Koster, Xavier Muñoz:
Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks. Texts in Theoretical Computer Science. An EATCS Series, Springer 2010, ISBN 978-3-642-02249-4 [contents]
Informal and Other Publications
- 2020
- [i6]Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust Minimum Cost Flow Problem Under Consistent Flow Constraints. CoRR abs/2008.02035 (2020) - 2019
- [i5]Michaela Hiller, Eberhard Triesch, Arie M. C. A. Koster:
On the Burning Number of p-Caterpillars. CoRR abs/1912.10897 (2019) - 2016
- [i4]Arie Koster, Robert Scheidweiler, Martin Tieves:
A flow based pruning scheme for enumerative equitable coloring algorithms. CoRR abs/1607.08754 (2016) - [i3]Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz:
Robust Flows over Time: Models and Complexity Results. CoRR abs/1608.06520 (2016) - 2015
- [i2]Stefano Coniglio, Boris Grimm, Arie M. C. A. Koster, Martin Tieves, Axel Werner:
Optimal offline virtual network embedding with rent-at-bulk aspects. CoRR abs/1501.07887 (2015) - 2013
- [i1]Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag:
Pre-processing for Triangulation of Probabilistic Networks. CoRR abs/1301.2256 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
