@inbook{48404,
  author       = {{Wessel, Lena and Moser-Fendel, J.}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2018}},
  pages        = {{2107--2108}},
  title        = {{{Entwicklung und Erforschung von e-Selbstlernmodulen im Service-Bereich Mathematik}}},
  year         = {{2018}},
}

@article{48403,
  author       = {{Wessel, Lena}},
  journal      = {{mathematik lehren}},
  pages        = {{38--42}},
  title        = {{{Strukturierte Aufgabenfolgen. Begründen üben und Ableitungsregeln trainieren}}},
  volume       = {{209}},
  year         = {{2018}},
}

@inbook{48997,
  author       = {{Lankeit, Elisa and Biehler, Rolf}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2018}},
  pages        = {{1135--1138}},
  publisher    = {{WTM-Verlag}},
  title        = {{{Wirkungen von Mathematikvorkursen auf Einstellungen und Selbstkonzepte von Studierenden}}},
  year         = {{2018}},
}

@book{53595,
  editor       = {{Bringmann, Oliver and Ecker, Wolfgang and Müller, Wolfgang and Müller-Gridschneder, Daniel}},
  title        = {{{Proceedings of the 1st International Workshop on Embedded Software for Industrial IoT - ESIIT}}},
  year         = {{2018}},
}

@inbook{8572,
  author       = {{Frühbis-Krüger, Anne and Kemper, Gregor and Koepf, Wolfram and Liebendörfer, Michael}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2018}},
  pages        = {{83--84}},
  publisher    = {{WTM-Verlag}},
  title        = {{{CAS in der Hochschullehre - Ein Blick in die Praxis}}},
  year         = {{2018}},
}

@article{8571,
  author       = {{Frühbis-Krüger, Anne and Liebendörfer, Michael}},
  journal      = {{Computeralgebra-Rundbrief}},
  number       = {{63}},
  title        = {{{Minisymposium CAS in der Hochschullehre - ein Blick in die Praxis}}},
  year         = {{2018}},
}

@inproceedings{47253,
  author       = {{Wu, Yuxi and Gupta, Panya and Wei, Miranda and Acar, Yasemin and Fahl, Sascha and Ur, Blase}},
  booktitle    = {{Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18}},
  publisher    = {{ACM Press}},
  title        = {{{Your Secrets Are Safe}}},
  doi          = {{10.1145/3178876.3186088}},
  year         = {{2018}},
}

@inproceedings{47255,
  author       = {{Haney, Julie M. and Theofanos, Mary and Acar, Yasemin and Prettyman, Sandra Spickard}},
  booktitle    = {{Fourteenth Symposium on Usable Privacy and Security, SOUPS 2018, Baltimore, MD, USA, August 12-14, 2018}},
  editor       = {{Zurko, Mary Ellen and Lipford, Heather Richter}},
  pages        = {{357–373}},
  publisher    = {{USENIX Association}},
  title        = {{{"We make it a big deal in the company": Security Mindsets in Organizations that Develop Cryptographic Products}}},
  year         = {{2018}},
}

@techreport{47876,
  author       = {{Haney, Julie and Theofanos, Mary and Acar, Yasemin and Prettyman, Sandra Spickard}},
  publisher    = {{National Institute of Standards and Technology}},
  title        = {{{Organizational views of NIST cryptographic standards and testing and validation programs}}},
  doi          = {{10.6028/nist.ir.8241}},
  year         = {{2018}},
}

@inproceedings{47256,
  author       = {{Gorski, Peter Leo and Iacono, Luigi Lo and Wermke, Dominik and Stransky, Christian and Möller, Sebastian and Acar, Yasemin and Fahl, Sascha}},
  booktitle    = {{Fourteenth Symposium on Usable Privacy and Security, SOUPS 2018, Baltimore, MD, USA, August 12-14, 2018}},
  editor       = {{Zurko, Mary Ellen and Lipford, Heather Richter}},
  pages        = {{265–281}},
  publisher    = {{USENIX Association}},
  title        = {{{Developers Deserve Security Warnings, Too: On the Effect of Integrated Security Advice on Cryptographic API Misuse}}},
  year         = {{2018}},
}

@inproceedings{47254,
  author       = {{Oltrogge, Marten and Derr, Erik and Stransky, Christian and Acar, Yasemin and Fahl, Sascha and Rossow, Christian and Pellegrino, Giancarlo and Bugiel, Sven and Backes, Michael}},
  booktitle    = {{2018 IEEE Symposium on Security and Privacy (SP)}},
  publisher    = {{IEEE}},
  title        = {{{The Rise of the Citizen Developer: Assessing the Security Impact of Online App Generators}}},
  doi          = {{10.1109/sp.2018.00005}},
  year         = {{2018}},
}

@inproceedings{47252,
  author       = {{Wermke, Dominik and Huaman, Nicolas and Acar, Yasemin and Reaves, Bradley and Traynor, Patrick and Fahl, Sascha}},
  booktitle    = {{Proceedings of the 34th Annual Computer Security Applications Conference, ACSAC 2018, San Juan, PR, USA, December 03-07, 2018}},
  pages        = {{222–235}},
  publisher    = {{ACM}},
  title        = {{{A Large Scale Investigation of Obfuscation Use in Google Play}}},
  doi          = {{10.1145/3274694.3274726}},
  year         = {{2018}},
}

@inproceedings{46348,
  abstract     = {{We analyze the effects of including local search techniques into a multi-objective evolutionary algorithm for solving a bi-objective orienteering problem with a single vehicle while the two conflicting objectives are minimization of travel time and maximization of the number of visited customer locations. Experiments are based on a large set of specifically designed problem instances with different characteristics and it is shown that local search techniques focusing on one of the objectives only improve the performance of the evolutionary algorithm in terms of both objectives. The analysis also shows that local search techniques are capable of sending locally optimal solutions to foremost fronts of the multi-objective optimization process, and that these solutions then become the leading factors of the evolutionary process.}},
  author       = {{Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Guenter and Trautmann, Heike}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-5618-3}},
  pages        = {{585–592}},
  publisher    = {{ACM}},
  title        = {{{Local Search Effects in Bi-Objective Orienteering}}},
  doi          = {{10.1145/3205455.3205548}},
  year         = {{2018}},
}

@article{46352,
  abstract     = {{The Travelling Salesperson Problem (TSP) is one of the best-studied NP-hard problems. Over the years, many different solution approaches and solvers have been developed. For the first time, we directly compare five state-of-the-art inexact solvers—namely, LKH, EAX, restart variants of those, and MAOS—on a large set of well-known benchmark instances and demonstrate complementary performance, in that different instances may be solved most effectively by different algorithms. We leverage this complementarity to build an algorithm selector, which selects the best TSP solver on a per-instance basis and thus achieves significantly improved performance compared to the single best solver, representing an advance in the state of the art in solving the Euclidean TSP. Our in-depth analysis of the selectors provides insight into what drives this performance improvement.}},
  author       = {{Kerschke, Pascal and Kotthoff, Lars and Bossek, Jakob and Hoos, Holger H. and Trautmann, Heike}},
  journal      = {{Evolutionary Computation (ECJ)}},
  number       = {{4}},
  pages        = {{597–620}},
  title        = {{{Leveraging TSP Solver Complementarity through Machine Learning}}},
  doi          = {{10.1162/evco_a_00215}},
  volume       = {{26}},
  year         = {{2018}},
}

@inproceedings{46349,
  abstract     = {{Performance comparisons of optimization algorithms are heavily influenced by the underlying indicator(s). In this paper we investigate commonly used performance indicators for single-objective stochastic solvers, such as the Penalized Average Runtime (e.g., PAR10) or the Expected Running Time (ERT), based on exemplary benchmark performances of state-of-the-art inexact TSP solvers. Thereby, we introduce a methodology for analyzing the effects of (usually heuristically set) indicator parametrizations - such as the penalty factor and the method used for aggregating across multiple runs - w.r.t. the robustness of the considered optimization algorithms.}},
  author       = {{Kerschke, Pascal and Bossek, Jakob and Trautmann, Heike}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’18) Companion}},
  isbn         = {{978-1-4503-5764-7/18/07}},
  pages        = {{1737–1744}},
  title        = {{{Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers}}},
  doi          = {{10.1145/3205651.3208233}},
  year         = {{2018}},
}

@phdthesis{1209,
  abstract     = {{My dissertation deals with the Gathering problem for swarms of n point-shaped robots on a grid, in which all robots of the swarm are supposed to gather at a previously undefined point. Special attention is paid to the strong limitation of robot capabilities. These include in particular the lack of global control, a global compass, global visibility and (global) communication skills. Furthermore, all robots are identical. The robots are given only local abilities. This includes a constant range of vision. The robots all work completely synchronously. In this work we present and analyze three different Gathering strategies in different robot models. We formally prove correctness and total running time: Chapter 4 focuses on minimizing the available robot capabilities. The underlying strategy completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the aim is to optimize the total running time under using only local robot capabilities: We additionally allow a constant-sized memory and a constant number of locally visible statuses (lights, flags). For the strategies of both chapters we show an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we additionally restrict connectivity and vision to an initially given chain connectivity in Chapter 6, where two chain neighbors must have a distance of 1 from each other. A robot can only see and interact with a constant number of its direct chain neighbors.}},
  author       = {{Jung, Daniel}},
  isbn         = {{978-3-942647-99-1}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Local Strategies for Swarm Formations on a Grid}}},
  doi          = {{10.17619/UNIPB/1-271}},
  year         = {{2018}},
}

@phdthesis{55291,
  author       = {{Technau, Marc}},
  publisher    = {{University of Würzburg}},
  title        = {{{On Beatty sets and some generalisations thereof}}},
  doi          = {{10.25972/WUP-978-3-95826-089-4}},
  year         = {{2018}},
}

@inproceedings{8575,
  abstract     = {{The transition from high school to university mathematics has proven to be difficult for many students but especially for pre-service secondary teachers. To support these students at mastering this transition, various universities have introduced support measures of various kinds. The WiGeMath project developed a taxonomy that makes it possible to describe and compare these measures concerning their goals as well as their frame characteristics. We will exemplify the use of the taxonomy in the description of one specific innovative measure that was part of the WiGeMath evaluations. Moreover, we will present first results concerning the goal-fulfilment of this measure concerning affective characteristics of the student cohort and their predominant beliefs.}},
  author       = {{Kuklinski, Christiane and Leis, Elena and Liebendörfer, Michael and Hochmuth, Reinhard and Biehler, Rolf and Lankeit, Elisa and Neuhaus, Silke and Schaper, Niclas and Schürmann, Mirko}},
  booktitle    = {{Proceedings of the Second Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2018, 5-7 April 2018)}},
  editor       = {{Durand-Guerrier, V. and Hochmuth, R. and Goodchild, S. and Hogstad, N.M.}},
  keywords     = {{Beliefs., Motivational developments, Novel approaches to teaching, Teacher education, Transition to and across university mathematics}},
  pages        = {{527--536}},
  publisher    = {{INDRUM Network, University of Agder}},
  title        = {{{Evaluating Innovative Measures in University Mathematics – The Case of Affective Outcomes in a Lecture focused on Problem-Solving}}},
  year         = {{2018}},
}

@inbook{8569,
  author       = {{Biehler, Rolf and Hochmuth, Reinhard and Schaper, Niclas and Kuklinski, Christiane and Lankeit, Elisa and Leis, Elena and Liebendörfer, Michael and Schürmann, Mirko}},
  booktitle    = {{3. Auswertungsworkshop der Begleitforschung. Dokumentation der Projektbeiträge.}},
  editor       = {{Hanft, Anke and Bischoff, Franziska and Kretschmer, Stefanie}},
  pages        = {{32--41}},
  publisher    = {{Carl von Ossietzky Universität Oldenburg}},
  title        = {{{Verbundprojekt WiGeMath: Wirkung und Gelingensbedingungen von Unterstützungsmaßnahmen für mathematikbezogenes Lernen in der Studieneingangsphase}}},
  year         = {{2018}},
}

@techreport{16967,
  author       = {{Hochmuth, Reinhard and Biehler, Rolf and Schaper, Niclas and Kuklinski, Christiane and Lankeit, Elisa and Leis, Elena and Liebendörfer, Michael and Schürmann, Mirko}},
  title        = {{{Wirkung und Gelingensbedingungen von Unterstützungsmaßnahmen für mathmatikbezogenes Lernen in der Studieneingangsphase : Schlussbericht: Teilprojekt A der Leibniz Universität Hannover, Teilprojekte B und C der Universität Paderborn: Berichtszeitraum: 01.03.2015-31.08.2018}}},
  doi          = {{10.2314/KXP:1689534117}},
  year         = {{2018}},
}