Остановите войну!
for scientists:
default search action
Sascha Kurz
- > Home > Persons > Sascha Kurz
Publications
- 2020
- [j54]Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma:
Simple games versus weighted voting games: bounding the critical threshold value. Soc. Choice Welf. 54(4): 609-621 (2020) - 2018
- [j39]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group activity selection problem with approval preferences. Int. J. Game Theory 47(3): 767-796 (2018) - [c10]Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma:
Simple Games Versus Weighted Voting Games. SAGT 2018: 69-81 - [i45]Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma:
Simple Games versus Weighted Voting Games. CoRR abs/1805.02192 (2018) - [i41]Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma:
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. CoRR abs/1810.08841 (2018) - 2015
- [j29]Sascha Kurz, Jörg Rambau, Jörg Schlüchtermann, Rainer Wolf:
The Top-Dog Index: a new measurement for the demand consistency of the size distribution in pre-pack orders for a fashion discounter with many small branches. Ann. Oper. Res. 229(1): 541-563 (2015) - [j27]Rainer Hegselmann, Stefan König, Sascha Kurz, Christoph Niemann, Jörg Rambau:
Optimal Opinion Control: The Campaign Problem. J. Artif. Soc. Soc. Simul. 18(3) (2015) - [c7]Isabella Hoffmann, Sascha Kurz, Jörg Rambau:
The Maximum Scatter TSP on a Regular Grid. OR 2015: 63-70 - [i24]Isabella Hoffmann, Sascha Kurz, Jörg Rambau:
The Maximum Scatter TSP on a Regular Grid. CoRR abs/1512.02054 (2015) - 2014
- [i19]Sascha Kurz, Jörg Rambau:
On the Hegselmann-Krause conjecture in opinion dynamics. CoRR abs/1401.4383 (2014) - [i18]Miriam Kießling, Sascha Kurz, Jörg Rambau:
An exact column-generation approach for the lot-type design problem - extended abstract. CoRR abs/1401.8071 (2014) - [i16]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. CoRR abs/1401.8151 (2014) - 2012
- [c4]Miriam Kießling, Tobias Kreisel, Sascha Kurz, Jörg Rambau:
Evaluation of a New Supply Strategy for a Fashion Discounter. OR 2012: 515-520 - [c3]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. WINE 2012: 156-169 - 2010
- [j11]Constantin Gaul, Sascha Kurz, Jörg Rambau:
On the lot-type design problem. Optim. Methods Softw. 25(2): 217-227 (2010) - 2009
- [i2]Constantin Gaul, Sascha Kurz, Jörg Rambau:
The Combinatorics of (S, M, L, XL) or the best fitting delivery of T-shirts. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j5]Tobias Kreisel, Sascha Kurz:
There Are Integral Heptagons, no Three Points on a Line, no Four on a Circle. Discret. Comput. Geom. 39(4): 786-790 (2008) - 2007
- [c1]Sascha Kurz, Jörg Rambau:
Demand Forecasting for Companies with Many Branches, Low Sales Numbers per Product, and Non-Recurring Orderings. ISDA 2007: 196-204
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-11 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint