PD Dr. Sascha Kurz

Lehrstuhl für Wirtschaftsmathematik
Mathematisches Institut, Fakultät für Mathematik, Physik und Informatik

Publikationen

• Kontakt
• Forschung
• Lehre
• Projekte

• Publikationen
• Vorträge
• Interessen
• Zahlenfolgen

Publikationen

• S. Kurz and V. Michkine: Open sets avoiding integral distances, erscheint in Discrete and Computational Geometry arXiv (doi)
• J. Freixas and S. Kurz: Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum, erscheint in Annals of Operations Research
• S. Kurz and S. Napel: Heuristic and exact solutions to the inverse power index problem for small voting bodies, erscheint in Annals of Operations Research arXiv (PCRC 58) (online)
• M. Kießling, T. Kreisel, S. Kurz, and J. Rambau: Evaluation of a new supply strategy based on stochastic programming for a fashion discounter, erscheint in Operations Research Proceedings 2012
• J. Freixas and S. Kurz: On alpha-roughly weighted games, erscheint in International Journal of Game Theory arXiv
• J. Freixas and S. Kurz: The golden number and Fibonacci sequences in the design of voting structures, erscheint in European Journal of Operational Research (.pdf) (doi)

• S. Kurz and V. Michkine: Large-volume open sets in normed spaces without integral distances, präsentiert auf EuroCG13, Seiten 209-212 (online)
• S. Kurz and N. Tautenhahn: On Dedekind's problem for complete simple games, International Journal of Game Theory, Vol. 42, Nr. 2 (2013), Pages 411-437 (.pdf) arXiv (online)

• A. Darmann, E. Elkind, J. Lang, S. Kurz, J. Schauer, G. Woeginger: Group Activity Selection Problem, präsentiert auf WINE-2012, Lecture Notes in Computer Science Vol. 7695 (2012), Pages 157-170 (.pdf)
• M. Kießling, S. Kurz, and J. Rambau: The integrated size and price optimization problem, Numerical Algebra, Control and Optimization, Vol. 2, Nr. 4, Pages 669-693, 2012 (opus)
• A. Darmann, E. Elkind, J. Lang, S. Kurz, J. Schauer, G. Woeginger: Group Activity Selection Problem, präsentiert auf COMSOC-2012 (.pdf)
• S. Kurz: On the inverse power index problem, Optimization, Vol. 61, Nr. 8 (2012), Pages 989-1011 (online Version) arXiv
• S. Kurz: Squaring the square with integer linear programming, Journal of Information Processing, Vol. 20, Nr. 3 (2012), Pages 680-685 (online) (.pdf)
• S. Kurz: Competitive learning of monotone Boolean functions (extended abstract), in Suhl, Leena; Mitra, Gautam et al. (Hrsg.): Applied Mathematical Optimization and Modelling, APMOD 2012 Extended Abstracts, DS&OR Lab, Band 8, University of Paderborn, Germany 2012, Seiten 416-421 (.pdf)
• M. Kießling, S. Kurz, and J. Rambau: An exact column-generation approach for the lot-type design problem (extended abstract) präsentiert auf ISCO 2012 (.pdf) (opus)
• S. Kurz: On minimum sum representations for weighted voting games, Annals of Operations Research, Volume 196, Nr 1 (2012), Pages 361-369 arXiv (.pdf) (online)
• S. Kurz and M. Lätsch: Bounds for the minimum oriented diameter, Discrete Mathematics & Theoretical Computer Science, Vol. 14, Nr. 1 (2012), Pages 109-142 (.pdf) (extended version) arXiv
• M. Kießling, T. Kreisel, S. Kurz, J. Rambau, K. Schade and C. Schwarz: Das Optimierungslabor – ein Erfahrungsbericht, Der Mathematikunterricht, Jahrgang 58, Heft 2 (2012), Seiten 18-29 (.pdf)

• S. Kurz: A lower bound for 4-regular planar unit distance graphs, Geombinatorics Quarterly, Vol. 21, Nr. 2 (2011), Pages 63-72 (.pdf)
• S. Kurz and A. Wassermann: On the minimum diameter of plane integral point sets, Ars Combinatoria, Vol. 101 (2011), Pages 265-287 (.pdf) arXiv
• S. Kurz: Fast regocnition of planar non unit distance graphs, Geombinatorics Quarterly, Vol. 21, Nr. 1 (2011), Pages 25-33 (.pdf)
• S. Kurz and J. Rambau: On the Hegselmann-Krause conjecture in opinion dynamics, Journal of Difference Equations and Applications, Vol. 17, Nr. 6 (2011), Pages 859-876 (.pdf)
• S. Kurz and R. Pinchasi: Regular matchstick graphs, The American Mathematical Monthly, Vol. 118, Nr. 3 (2011), Pages 264-267 (.pdf)
  Long version containing an alternative proof: No finite 5-regular matchstick graph exists. (.pdf), Old manuscript of Aart Blokhuis containing another alternative proof: Regular finite planar maps with equal edges. (.pdf)
• M.Kiermaier, M. Koch and S.Kurz: 2-arcs of maximal size in the affine and the projective Hjelmslev plane over Z₂₅, Advances in Mathematics of Communications, Vol. 5, Nr. 2 (2011), Pages 287-301 (.pdf)

• A. R. Antonov and S. Kurz: Maximal integral point sets over $\mathbb{Z}^2$, International Journal of Computer Mathematics Volume 87, Issue 12 (2010), Pages 2653-2676 (.pdf) arXiv
• C. Gaul, S. Kurz and J. Rambau: On the lot-type design problem,Optimization Methods and Software Volume 25, Issue 2 (2010), Pages 217-227 (.pdf)

• S. Kurz and G. Mazzuoccolo: 3-regular matchstick graphs with given girth, Geombinatorics Quarterly Vol. XIX, Nr. 4 (2009), Pages 156-173 (.pdf)
• C. Gaul, S. Kurz and J. Rambau: The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts, In: Models and Algorithms for Optimization in Logistics, Dagstuhl Seminar Proceedings, 2009, 5 pages (online version)
• S. Kurz and J. Rambau: Mathematische Grundlagen für Wirtschaftswissenschaftler, Kohlhammer Verlag, 273 Seiten.
• S. Kurz: Caps in \mathbb{Z}_n^2, Serdica Journal of Computing Vol. 3 (2009), Pages 159-178 (.pdf)
• H. Meyer and S. Kurz: Integral point sets in higher dimensional affine spaces over finite fields. Journal of Combinatorial Theory, Series A Vol. 116, Nr. 6 (2009), Pages 1120-1139 (online version)
• M. Kiermaier and S.Kurz: Maximal integral point sets in affine planes over finite fields, Discrete Mathematics Vol. 309, Nr. 13 (2009), Pages 4564-4575 (.pdf) (online version)
• A. Kohnert and S. Kurz: Integral point sets over $\mathbb{Z}_n^m$, Discrete Applied Mathematics Vol. 157 (2009), Pages 2105-2117 (online) (.pdf) arXiv
• S. Kurz: Integral point sets over finite fields, The Australasian Journal of Combinatorics Vol. 43 (2009), Pages 3-29 (.pdf) arXiv

• A. Kohnert and S. Kurz: Construction of large constant dimension codes with a prescribed minimum distance, MMICS 2008 in Lecture Notes in Computer Science Vol. 5393 (2008), Pages 31-42 arXiv
• S. Kurz: On the generation of Heronian triangles, Serdica Journal of Computing Vol. 2 (2008), Pages 181-196. (.pdf)
• T. Kreisel and S. Kurz: There are integral heptagons, no three points on a line, no four on a circle, Discrete and Computational Geometry Vol. 39, No. 4 (2008), Pages 786-790 (online Version) (.pdf) arXiv
• S. Kurz: Counting polyominoes with minimum perimeter, Ars Combinatoria Vol. 88 (2008), Pages 161-174 (.pdf) (.ps) (.cpp) arXiv
• S. Kurz: Convex hulls of polyominoes, Beiträge zur Algebra und Geometrie Vol. 49, No. 1 (2008), Pages 125-136 (online Version) (.pdf) arXiv

• S. Kurz and J. Rambau: Demand forecasting for companies with many branches, low sales numbers per product, and non-recurring orderings, Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications, 22-24.10.2007, Rio de Janeiro, Brazil, Pages 196-201 (.pdf) arXiv
• S. Kurz and R. Laue: Bounds for the minimum diameter of integral point sets, The Australasian Journal of Combinatorics, Vol. 39, Pages 233-240 (.pdf) (.ps) arXiv
• S. Kurz: Enumeration of integral tetrahedra , Journal of Integer Sequences Vol. 10, Artikel 07.9.3 (.pdf) arXiv
• A. Kohnert and S. Kurz: A note on Erdös-Diophantine graphs and Diophantine carpets, Mathematica Balkanica Fasc. 1-2 of Vol. 21 (2007), Pages 1-5 (.pdf) (.ps) arXiv

• S. Kurz: On the characteristic of integral point sets in $\mathbb{E}^m$, The Australasian Journal of Combinatorics, Vol. 36, Pages 241-248 (.pdf) (.ps) arXiv
• A. Kohnert and S. Kurz: Integral point sets over $\mathbb{Z}_n^m$ (Abstrakt, nicht referiert), Electronic Notes in Discrete Mathematics Vol 27 (2006), Pages 65-66 (.pdf)
• C. Haase and S. Kurz: A bijection between the d-dimensional simplices with distances in {1,2} and the partitions of d+1, Journal of Combinatorial Theory, Series A, Volume 113, Issue 4 , May 2006, Pages 736-738 doi (.pdf) (.ps) arXiv
• S. Kurz: Konstruktion und Eigenschaften ganzzahliger Punktmengen. (Integral point sets). PhD Thesis (in german), Bayreuther Mathematische Schriften Vol. 76 (March 2006) (.pdf) (.ps) Abstract (in English) (.pdf) (.ps)

Die hier zum Download angebotenen Dateien sind nicht die Originalfassung wie sie in den Zeitschriften erscheinen und sind nur als Ergänzung gedacht.

• S. Kurz, N. Maaser, and S. Napel: On the Democratic Weights of Nations (.pdf) arXiv (PCRC 66)
• S. Kurz, J. Rambau, J. Schlüchtermann, and R. 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 (.pdf) arXiv
• J. Freixas and S. Kurz: On minimal integer representations of weighted games arXiv

• M. Kießling, S. Kurz, and J. Rambau: An exact column-generation approach for the lot-type design problem (.pdf)
• M. Koster, S. Kurz, I. Lindner and S. Napel: Conditional Prediction Values
• S. Kurz and A. Rund: Optimal population allocations for the continuous Schelling segregation model
• R. Hegselmann and S. Kurz: Schelling reconsidered, -- A forgotten pioneer, and the idea of a generalized network configuration game
• R. Hegselmann, S. Kurz, and J. Rambau: Optimal Control in Opinion Dynamics: Concepts, Structures, Pitfalls, Algorithms
• M. Koch and S. Kurz: Enumeration of generalized polyominoes (.pdf) (.ps) arXiv

• S. Kurz: Mathematik zur Entspannung, Beitrag zu Spektrum 01/08 der Universität Bayreuth (pdf)

• S. Kurz: No finite 5-regular matchstick graph exists. (.pdf)
• S. Kurz and A. Moritz: Strukturisomere der Alkane (ausführliche Fassung) (in german) (.pdf) (.doc) (.cpp) (.exe) Tabelle
• S. Kurz: Anzahl von Strukturisomeren der Alkane - ein Entwurf (in german) (.pdf) (.ps) (.cpp) (.exe) Tabelle
• S. Kurz: Discrete Structures, Algorithms, and Applications, Habitilationsschrift, Universität Bayreuth, 2008. (.pdf)
• S. Kurz: Polyominoes with maximum convex hull, Diploma thesis, Universität Bayreuth, March 2004. (.pdf) (.ps)

• Diskrete Geometrie, Sommersemester 2006, S. Kurz
• Skript für Funktionalanalysis II nach Prof. Dr. C. G. Simader im Sommersemester 2002. Ge LaTeX't von Sonja Ertel, Martin Kreis, Sascha Kurz, Thomas Lehmann, Frank Liczba, Armin Rund und Stefan Tuffner. (.pdf) (.ps)

© 2005 Lehrstuhl Wirtschaftsmathematik — Imprint
Webmaster
Letztes Update am: 22.04.2013