Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Thyssen
Person information
- affiliation (former): TU Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j6]Tobias Friedrich, Frank Neumann
, Christian Thyssen:
Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. Evol. Comput. 23(1): 131-159 (2015)- 2013
- [i2]Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen:
Evolutionary Algorithms and Dynamic Programming. CoRR abs/1301.4096 (2013) - [i1]Tobias Friedrich, Frank Neumann, Christian Thyssen:
Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. CoRR abs/1309.3816 (2013) - 2012
- [j5]Dirk Sudholt, Christian Thyssen:
A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems. Algorithmica 64(4): 643-672 (2012) - [j4]Dirk Sudholt, Christian Thyssen:
Running time analysis of Ant Colony Optimization for shortest path problems. J. Discrete Algorithms 10: 165-180 (2012) - 2011
- [j3]Tobias Friedrich, Christian Horoba, Frank Neumann:
Illustration of fairness in evolutionary multi-objective optimization. Theor. Comput. Sci. 412(17): 1546-1556 (2011) - [j2]Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen:
Evolutionary algorithms and dynamic programming. Theor. Comput. Sci. 412(43): 6020-6035 (2011) - 2010
- [b1]Christian Thyssen:
Zur Analyse der Optimierungszeit randomisierter Suchheuristiken für kombinatorische Probleme. Dortmund University of Technology, 2010 - [j1]Christian Horoba:
Exploring the Runtime of an Evolutionary Algorithm for the Multi-Objective Shortest Path Problem. Evol. Comput. 18(3): 357-381 (2010) - [c9]Christian Horoba, Dirk Sudholt:
Ant colony optimization for stochastic shortest path problems. GECCO 2010: 1465-1472 - [p1]Christian Horoba, Frank Neumann:
Approximating Pareto-Optimal Sets Using Diversity Strategies in Evolutionary Multi-Objective Optimization. Advances in Multi-Objective Nature Inspired Computing 2010: 23-44
2000 – 2009
- 2009
- [c8]Christian Horoba, Frank Neumann:
Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. FOGA 2009: 79-86 - [c7]Christian Horoba:
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem. FOGA 2009: 113-120 - [c6]Tobias Friedrich, Christian Horoba, Frank Neumann:
Multiplicative approximations and the hypervolume indicator. GECCO 2009: 571-578 - [c5]Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile:
Evolutionary algorithms and dynamic programming. GECCO 2009: 771-778 - [c4]Christian Horoba, Thomas Jansen, Christine Zarges:
Maximal age in randomized search heuristics with aging. GECCO 2009: 803-810 - [c3]Christian Horoba, Dirk Sudholt:
Running Time Analysis of ACO Systems for Shortest Path Problems. SLS 2009: 76-91 - 2008
- [c2]Christian Horoba, Frank Neumann:
Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. GECCO 2008: 641-648 - [c1]Tobias Friedrich, Christian Horoba, Frank Neumann:
Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. PPSN 2008: 671-680
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-04-21 17:52 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:
