default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Johannsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c16]Christian Krause, Daniel Johannsen, Radwan Deeb, Kai-Uwe Sattler, David Knacker, Anton Niadzelka:
An SQL-Based Query Language and Engine for Graph Pattern Matching. ICGT 2016: 153-169- 2015
- [i5]Laurent Hoeltgen, Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Simon Setzer, Daniel Johannsen, Frank Neumann, Benjamin Doerr:
Optimising Spatial and Tonal Data for PDE-based Inpainting. CoRR abs/1506.04566 (2015) - 2014
- [j6]Daniel Johannsen, Piyush P. Kurur, Johannes Lengler
:
Evolutionary Algorithms for Quantum Computers. Algorithmica 68(1): 152-189 (2014) - 2013
- [j5]Daniel Johannsen, Michael Krivelevich, Wojciech Samotij:
Expanders Are Universal for the Class of All Spanning Trees. Comb. Probab. Comput. 22(2): 253-281 (2013) - [j4]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile:
More effective crossover operators for the all-pairs shortest path problem. Theor. Comput. Sci. 471: 12-26 (2013) - 2012
- [j3]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Multiplicative Drift Analysis. Algorithmica 64(4): 673-697 (2012) - [j2]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Non-existence of linear universal drift functions. Theor. Comput. Sci. 436: 71-86 (2012) - [c15]Daniel Johannsen, Michael Krivelevich, Wojciech Samotij:
Expanders are universal for the class of all spanning trees. SODA 2012: 1539-1551 - [i4]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile:
More Effective Crossover Operators for the All-Pairs Shortest Path Problem. CoRR abs/1207.0369 (2012) - 2011
- [c14]Benjamin Doerr, Daniel Johannsen, Martin Schmidt:
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. FOGA 2011: 119-126 - [c13]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen:
Faster black-box algorithms through higher arity operators. FOGA 2011: 163-172 - [c12]Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr:
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. SSVM 2011: 26-37 - [p1]Daniel Johannsen:
Evolutionary Computation in Combinatorial Optimization. Theory of Randomized Search Heuristics 2011: 53-99 - [i3]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Multiplicative Drift Analysis. CoRR abs/1101.0776 (2011) - 2010
- [b1]Daniel Johannsen:
Random combinatorial structures and randomized search heuristics. Saarland University, 2010 - [c11]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Drift analysis and linear functions revisited. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c10]Benjamin Doerr, Daniel Johannsen:
Edge-based representation beats vertex-based representation in shortest path problems. GECCO 2010: 759-766 - [c9]Daniel Johannsen, Piyush P. Kurur, Johannes Lengler:
Can quantum search accelerate evolutionary algorithms? GECCO 2010: 1433-1440 - [c8]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Multiplicative drift analysis. GECCO 2010: 1449-1456 - [c7]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile:
More Effective Crossover Operators for the All-Pairs Shortest Path Problem. PPSN (1) 2010: 184-193 - [c6]Daniel Johannsen, Konstantinos Panagiotou:
Vertices of Degree k in Random Maps. SODA 2010: 1436-1447 - [i2]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Non-Existence of Linear Universal Drift Functions. CoRR abs/1011.3466 (2010) - [i1]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen:
Faster Black-Box Algorithms Through Higher Arity Operators. CoRR abs/1012.0952 (2010)
2000 – 2009
- 2009
- [c5]Daniel Johannsen, Igor Razgon, Magnus Wahlström:
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. SAT 2009: 80-85 - 2008
- [j1]Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer:
Counting Defective Parking Functions. Electron. J. Comb. 15(1) (2008) - [c4]Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann:
Rigorous analyses of fitness-proportional selection for optimizing linear functions. GECCO 2008: 953-960 - [c3]Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang:
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. PPSN 2008: 378-388 - 2007
- [c2]Benjamin Doerr, Daniel Johannsen:
Refined runtime analysis of a basic ant colony optimization algorithm. IEEE Congress on Evolutionary Computation 2007: 501-507 - [c1]Benjamin Doerr, Daniel Johannsen:
Adjacency list matchings: an ideal genotype for cycle covers. GECCO 2007: 1203-1210
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-05-08 21:51 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:
