![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Holger Danielsiek
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j3]Holger Danielsiek, Laura Toma, Jan Vahrenhold:
An instrument to assess self-efficacy in introductory algorithms courses. Inroads 9(1): 56-65 (2018) - 2017
- [c9]Holger Danielsiek, Jan Vahrenhold, Peter Hubwieser, Johannes Krugel
, Johannes Magenheim, Laura Ohrndorf, Daniel Ossenschmidt, Niclas Schaper:
Undergraduate teaching assistants in computer science: Teaching-related beliefs, tasks, and competences. EDUCON 2017: 718-725 - [c8]Holger Danielsiek, Peter Hubwieser, Johannes Krugel
, Johannes Magenheim, Laura Ohrndorf, Daniel Ossenschmidt, Niclas Schaper, Jan Vahrenhold:
Kompetenzbasierte Gestaltungsempfehlungen für Informatik-Tutorenschulungen. GI-Jahrestagung 2017: 241-254 - [c7]Holger Danielsiek, Laura Toma, Jan Vahrenhold:
An Instrument to Assess Self-Efficacy in Introductory Algorithms Courses. ICER 2017: 217-225 - 2016
- [c6]Holger Danielsiek, Jan Vahrenhold:
Stay on These Roads: Potential Factors Indicating Students' Performance in a CS2 Course. SIGCSE 2016: 12-17 - 2013
- [c5]Holger Danielsiek, Ludger Humbert
, Jan Vahrenhold:
Research-Based Learning Revisited: On Using a Delphi Process in Informatics Teacher Education. ISSEP 2013: 196-208 - 2012
- [c4]Holger Danielsiek, Wolfgang Paul, Jan Vahrenhold:
Detecting and understanding students' misconceptions related to algorithms and data structures. SIGCSE 2012: 21-26 - 2011
- [j2]Oliver Kramer, Holger Danielsiek:
A Clustering-Based Niching Framework for the Approximation of Equivalent Pareto-Subsets. Int. J. Comput. Intell. Appl. 10(3): 295-311 (2011) - 2010
- [j1]Mike Preuss
, Nicola Beume, Holger Danielsiek, Tobias Hein, Boris Naujoks
, Nico Piatkowski
, Raphael Stür, Andreas Thom, Simon Wessing:
Towards Intelligent Team Composition and Maneuvering in Real-Time Strategy Games. IEEE Trans. Comput. Intell. AI Games 2(2): 82-98 (2010) - [c3]Oliver Kramer, Holger Danielsiek:
DBSCAN-based multi-objective niching to approximate equivalent pareto-subsets. GECCO 2010: 503-510
2000 – 2009
- 2008
- [c2]Nicola Beume, Holger Danielsiek, Christian Eichhorn
, Boris Naujoks
, Mike Preuss, Klaus D. Stiller
, Simon Wessing:
Measuring flow as concept for detecting game fun in the Pac-Man game. IEEE Congress on Evolutionary Computation 2008: 3448-3455 - [c1]Holger Danielsiek, Raphael Stür, Andreas Thom, Nicola Beume, Boris Naujoks
, Mike Preuss:
Intelligent moving of groups in real-time strategy games. CIG 2008: 71-78
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint