Остановите войну!
for scientists:
default search action
Karl Bringmann
- > Home > Persons > Karl Bringmann
Publications
- 2018
- [j22]Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Algorithmica 80(11): 3397-3427 (2018) - 2017
- [j19]S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 77(2): 515-536 (2017) - 2015
- [j9]Markus Wagner, Karl Bringmann, Tobias Friedrich, Frank Neumann:
Efficient optimization of many objectives by approximation-guided evolution. Eur. J. Oper. Res. 243(2): 465-479 (2015) - [c33]Karl Bringmann, Tobias Friedrich, Patrick Klitzke:
Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator. CEC 2015: 970-977 - [c30]Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald:
Ultra-Fast Load Balancing on Scale-Free Networks. ICALP (2) 2015: 516-527 - 2014
- [j7]Karl Bringmann, Tobias Friedrich:
Convergence of Hypervolume-Based Archiving Algorithms. IEEE Trans. Evol. Comput. 18(5): 643-657 (2014) - [c27]Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. ESA 2014: 197-208 - [c25]Karl Bringmann, Tobias Friedrich, Patrick Klitzke:
Two-dimensional subset selection for hypervolume and epsilon-indicator. GECCO 2014: 589-596 - [c23]Karl Bringmann, Tobias Friedrich, Patrick Klitzke:
Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator. PPSN 2014: 518-527 - 2013
- [j6]Karl Bringmann, Tobias Friedrich:
Approximation quality of the hypervolume indicator. Artif. Intell. 195: 265-290 (2013) - [j5]Karl Bringmann, Tobias Friedrich, Christian Igel, Thomas Voß:
Speeding up many-objective optimization by Monte Carlo approximations. Artif. Intell. 204: 22-29 (2013) - [c20]Karl Bringmann, Tobias Friedrich:
Parameterized average-case complexity of the hypervolume indicator. GECCO 2013: 575-582 - [c19]S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. ICALP (1) 2013: 13-24 - [c17]Karl Bringmann, Tobias Friedrich:
Exact and Efficient Generation of Geometric Random Variates and Random Graphs. ICALP (1) 2013: 267-278 - 2012
- [j3]Karl Bringmann, Tobias Friedrich:
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theor. Comput. Sci. 425: 104-116 (2012) - [c12]Karl Bringmann, Tobias Friedrich:
Convergence of hypervolume-based archiving algorithms ii: competitiveness. GECCO 2012: 457-464 - 2011
- [c10]Tobias Friedrich, Karl Bringmann, Thomas Voß, Christian Igel:
The logarithmic hypervolume indicator. FOGA 2011: 81-92 - [c9]Karl Bringmann, Tobias Friedrich:
Convergence of hypervolume-based archiving algorithms I: effectiveness. GECCO 2011: 745-752 - [c8]Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner:
Approximation-Guided Evolutionary Multi-Objective Optimization. IJCAI 2011: 1198-1203 - 2010
- [j2]Karl Bringmann, Tobias Friedrich:
Approximating the volume of unions and intersections of high-dimensional geometric objects. Comput. Geom. 43(6-7): 601-610 (2010) - [j1]Karl Bringmann, Tobias Friedrich:
An Efficient Algorithm for Computing Hypervolume Contributions. Evol. Comput. 18(3): 383-402 (2010) - [c6]Karl Bringmann, Tobias Friedrich:
The maximum hypervolume set yields near-optimal approximation. GECCO 2010: 511-518 - [c5]Thomas Voß, Tobias Friedrich, Karl Bringmann, Christian Igel:
Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study. GECCO (Companion) 2010: 1975-1978 - [c4]Karl Bringmann, Tobias Friedrich:
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. PPSN (1) 2010: 607-616 - 2009
- [c3]Karl Bringmann, Tobias Friedrich:
Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. EMO 2009: 6-20 - [c2]Karl Bringmann, Tobias Friedrich:
Don't be greedy when calculating hypervolume contributions. FOGA 2009: 103-112 - 2008
- [c1]Karl Bringmann, Tobias Friedrich:
Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. ISAAC 2008: 436-447 - [i2]Karl Bringmann, Tobias Friedrich:
Approximating the volume of unions and intersections of high-dimensional geometric objects. CoRR abs/0809.0835 (2008) - [i1]Karl Bringmann, Tobias Friedrich:
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. CoRR abs/0812.2636 (2008)
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-25 05: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