The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Arie M. C. A. Koster Arie Koster ( http://dblp.L3S.de/Authors/Arie_M._C._A._Koster )

Publication years (Num. hits)
1998-2004 (15) 2005-2008 (16) 2009-2011 (20) 2012-2015 (19) 2016-2018 (16) 2019 (3)
Publication types (Num. hits)
article(58) book(1) incollection(2) inproceedings(27) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15 occurrences of 11 keywords

Results
Found 90 publication records. Showing 89 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Arie M. C. A. Koster, Robert Scheidweiler, Martin Tieves A flow based pruning scheme for enumerative equitable coloring algorithms. Search on Bibsonomy Annals OR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster, Manuel Kutschka Formulations and algorithms for the recoverable Γ-robust knapsack problem. Search on Bibsonomy EURO J. Computational Optimization The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Grit Ecker, Di Yuan, Arie M. C. A. Koster, Anke Schmeink Accurate optimization models for interference constrained bandwidth allocation in cellular networks. Search on Bibsonomy Computers & OR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Michael Poss Special issue on: robust combinatorial optimization. Search on Bibsonomy EURO J. Computational Optimization The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz Robust flows over time: models and complexity results. Search on Bibsonomy Math. Program. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jan Hackfeld, Arie M. C. A. Koster The matching extension problem in general graphs is co-NP-complete. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefano Coniglio, Arie M. C. A. Koster, Nils Spiekermann Lot sizing with storage losses under demand uncertainty. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christina Büsing, Arie Koster, Sarah Kirchner, Annika Thome The budgeted minimum cost flow problem with unit upgrading cost. Search on Bibsonomy Networks The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pascal Lutter, Dirk Degel, Christina Büsing, Arie M. C. A. Koster, Brigitte Werners Improved handling of uncertainty and robustness in set covering problems. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christina Büsing, Alexandra Grub, Arie M. C. A. Koster, Waldemar Laube, Martin Tieves Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations. Search on Bibsonomy Networks The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andreas Baumgartner, Thomas Bauschert, Arie M. C. A. Koster, Varun S. Reddy Optimisation Models for Robust and Survivable Network Slice Design: A Comparative Analysis. Search on Bibsonomy GLOBECOM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stefano Coniglio, Arie Koster, Martin Tieves Data Uncertainty in Virtual Network Embedding: Robust Optimization and Protection Levels. Search on Bibsonomy J. Network Syst. Manage. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Arie Koster, Robert Scheidweiler, Martin Tieves A flow based pruning scheme for enumerative equitable coloring algorithms. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Stefano Coniglio, Arie Koster, Nils Spiekermann On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration. Search on Bibsonomy ISCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Marco E. Lübbecke, Arie Koster, Peter Letmathe, Reinhard Madlener, Britta Peis, Grit Walther (eds.) 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 Search on Bibsonomy OR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sebastian 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. Search on Bibsonomy Computers & Chemical Engineering The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Edoardo Amaldi, Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves On the computational complexity of the virtual network embedding problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz Robust Flows over Time: Models and Complexity Results. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Christina Büsing, Arie M. C. A. Koster, Martin Tieves Robust plans for spectrum allocation in elastic flexgrid optical networks. Search on Bibsonomy RNDM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Grit Claßen, Arie M. C. A. Koster, Manuel Kutschka, Issam Tahiri Robust Metric Inequalities for Network Loading Under Demand Uncertainty. Search on Bibsonomy APJOR The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefano Coniglio, Boris Grimm, Arie M. C. A. Koster, Martin Tieves, Axel Werner Optimal offline virtual network embedding with rent-at-bulk aspects. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Grit Claßen, Arie M. C. A. Koster, Anke Schmeink The multi-band robust knapsack problem - A dynamic programming approach. Search on Bibsonomy Discrete Optimization The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jacek 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. Search on Bibsonomy Telecommunication Systems The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves Virtual network embedding under uncertainty: Exact and heuristic approaches. Search on Bibsonomy DRCN The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Grit Claßen, Arie M. C. A. Koster, David Coudert, Napoleão Nepomuceno Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. Search on Bibsonomy INFORMS Journal on Computing The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Thomas Bauschert, Christina Büsing, Fabio D'Andreagiovanni, Arie M. C. A. Koster, Manuel Kutschka, Uwe Steglich Network planning under demand uncertainty with robust optimization. Search on Bibsonomy IEEE Communications Magazine The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Arie Koster, Truong Khoa Phan, Martin Tieves Extended Cutset Inequalities for the Network Power Consumption Problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Grit Claßen, Arie M. C. A. Koster, Anke Schmeink Speeding up column generation for robust wireless network planning. Search on Bibsonomy EURO J. Computational Optimization The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Grit Claßen, Arie M. C. A. Koster, Anke Schmeink A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks. Search on Bibsonomy Computers & OR The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag Pre-processing for Triangulation of Probabilistic Networks Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Arie M. C. A. Koster, Manuel Kutschka, Christian Raack Robust network design: Formulations, valid inequalities, and computations. Search on Bibsonomy Networks The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1David Coudert, Arie M. C. A. Koster, Truong Khoa Phan, Martin Tieves Robust Redundancy Elimination for Energy-Aware Routing. Search on Bibsonomy GreenCom/iThings/CPScom The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Arie Koster, Martin Tieves Column Generation for Frequency Assignment in Slow Frequency Hopping Networks. Search on Bibsonomy EURASIP J. Wireless Comm. and Networking The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos On exact algorithms for treewidth. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hans 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. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nayyar Almas Kazmi, Arie M. C. A. Koster, Jürgen Branke Formulations and algorithms for the multi-path selection problem in network routing. Search on Bibsonomy ICUMT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. Search on Bibsonomy ALGOSENSORS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka Recoverable robust knapsacks: the discrete scenario case. Search on Bibsonomy Optimization Letters The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly On cut-based inequalities for capacitated network design polyhedra. Search on Bibsonomy Networks The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster Treewidth computations II. Lower bounds. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander Hein, Arie M. C. A. Koster An Experimental Evaluation of Treewidth at Most Four Reductions. Search on Bibsonomy SEA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nayyar Almas Kazmi, Arie M. C. A. Koster An integer linear programming model for optimal self protection multi-path selection. Search on Bibsonomy ICUMT The full citation details ... 2011 DBLP  BibTeX  RDF
1Arie M. C. A. Koster, Manuel Kutschka, Christian Raack On the Robustness of Optimal Network Designs. Search on Bibsonomy ICC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Grit Classen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno Bandwidth assignment for reliable fixed broadband wireless networks. Search on Bibsonomy WOWMOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Grit Classen, Arie M. C. A. Koster, Anke Schmeink Robust planning of green wireless networks. Search on Bibsonomy NetGCoop The full citation details ... 2011 DBLP  BibTeX  RDF
1Arie M. C. A. Koster, Manuel Kutschka, Christian Raack Cutset Inequalities for Robust Network Design. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Stephan Lemkens Designing AC Power Grids Using Integer Linear Programming. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka Recoverable Robust Knapsacks: Γ-Scenarios. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Manuel Kutschka An integrated model for survivable network design under demand uncertainty. Search on Bibsonomy DRCN The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arie Koster, Xavier Muñoz (eds.) Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks Search on Bibsonomy 2010 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster Treewidth computations I. Upper bounds. Search on Bibsonomy Inf. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sebastian Orlowski, Christian Raack, Arie M. C. A. Koster, Georg Baier, Thomas Engel 0006, Pietro Belotti Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems. Search on Bibsonomy Graphs and Algorithms in Communication Networks The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Xavier Muñoz Graphs and Algorithms in Communication Networks on Seven League Boots. Search on Bibsonomy Graphs and Algorithms in Communication Networks The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Manuel Kutschka, Christian Raack Towards robust network design using integer linear programming techniques. Search on Bibsonomy NGI The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Vadim V. Lozin DIMAP Workshop on Algorithmic Graph Theory. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Chvátal-Gomory cuts, Separation algorithms, Integer programming
1Arie M. C. A. Koster, Annegret Katrin Wagler Comparing Imperfection Ratio and Imperfection Index for Graph Classes. Search on Bibsonomy RAIRO - Operations Research The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster Treewidth Lower Bounds with Brambles. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Bramble, Grid minor, Approximation algorithm, Lower bound, Planar graph, Treewidth
1Hans L. Bodlaender, Arie M. C. A. Koster Combinatorial Optimization on Graphs of Bounded Treewidth. Search on Bibsonomy Comput. J. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano Models and solution techniques for frequency assignment problems. Search on Bibsonomy Annals OR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematical optimization models, Wireless networks, Heuristics, Channel assignment, Frequency assignment, Exact methods
1Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster Safe Reduction Rules for Weighted Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster On the maximum cardinality search lower bound for treewidth. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Annegret Wagler On determining the imperfection ratio. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster Contraction and Treewidth Lower Bounds. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster Safe separators for treewidth. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos On Exact Algorithms for Treewidth. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Adrian Zymolka, Monika Jäger, Ralf Huelsermann Demand-wise Shared Protection for Meshed Optical Networks. Search on Bibsonomy J. Network Syst. Manage. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Adrian Zymolka On cycles and the stable multi-set polytope. Search on Bibsonomy Discrete Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof Preprocessing Rules for Triangulation of Probabilistic Networks. Search on Bibsonomy Computational Intelligence The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender Degree-Based Treewidth Lower Bounds. Search on Bibsonomy WEA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster Treewidth Lower Bounds with Brambles. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle Contraction and Treewidth Lower Bounds. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster On the Maximum Cardinality Search Lower Bound for Treewidth. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster Safe Seperators for Treewidth. Search on Bibsonomy ALENEX/ANALC The full citation details ... 2004 DBLP  BibTeX  RDF
1Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano Models and solution techniques for frequency assignment problems. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF models, heuristics, channel assignment, Frequency assignment, exact methods
1Stan 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. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster Frequency planning and ramifications of coloring. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Adrian Zymolka Stable multi-sets. Search on Bibsonomy Math. Meth. of OR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Stan 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. Search on Bibsonomy Math. Program. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen Solving partial constraint satisfaction problems with tree decomposition. Search on Bibsonomy Networks The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel Treewidth: Computational Experiments. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag Pre-processing for Triangulation of Probabilistic Networks. Search on Bibsonomy UAI The full citation details ... 2001 DBLP  BibTeX  RDF
1Olaf 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. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen Solving Frequency Assignment Problems via Tree-Decomposition1. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen The partial constraint satisfaction problem: Facets and lifting theorems. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #89 of 89 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license