Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5 Publications
2021 | Conference Paper | LibreCat-ID: 48876
Bossek, J., & Wagner, M. (2021). Generating Instances with Performance Differences for More than Just Two Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1423–1432. https://doi.org/10.1145/3449726.3463165
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 10586
Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150
LibreCat
| Files available
| DOI
2016 | Conference Paper | LibreCat-ID: 48873
Bossek, J., & Trautmann, H. (2016). Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In P. Festa, M. Sellmann, & J. Vanschoren (Eds.), Learning and Intelligent Optimization (pp. 48–59). Springer International Publishing. https://doi.org/10.1007/978-3-319-50349-3_4
LibreCat
| DOI
2016 | Conference Paper | LibreCat-ID: 48874
Bossek, J., & Trautmann, H. (2016). Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference. Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, 3–12. https://doi.org/10.1007/978-3-319-49130-1_1
LibreCat
| DOI
2014 | Journal Article | LibreCat-ID: 8171 | 
Gharibian, S., & Kempe, J. (2014). Hardness of approximation for quantum problems. Quantum Information & Computation, 14(5–6), 517–540.
LibreCat
| Download (ext.)
| arXiv