A list of publications by members of the institute since 1997 sorted by year.

2019

  • Amnon Rosenmann, Franz Lehner and Aljosa Peperko, Polynomial convolutions in max-plus algebra, Linear algebra and its applications, Elsevier Inc., 578, (2019), 370–401. [doi]
  • C. Dowden, M. Kang, M. Mosshammer and P. Sprüssel, The evolution of random graphs on surfaces of non-constant genus, Acta Mathematica Universitatis Comenianae, Comenius University Press, 88(3), (2019), 631–636.
  • Gutierrez Sanchez, Abraham and Sebastian Müller, Quality analysis in acyclic production networks, Stochastics and Quality Control, deGruyter, (2019).
  • O. Cooley, Del Giudice, N., M. Kang and P. Sprüssel, Cohomology groups of non-uniform random simplicial complexes, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2019), (2019), 553–560.
  • Christoph Aistleitner, Daniele D'Angeli, Abraham Gutierrez, Emanuele Rodaro and Amnon Rosenmann, Circular automata synchronize with high probability, arXiv.org e-Print archive, Cornell University Library, (2019).
  • Amnon Rosenmann, The Timestamp of Timed Automata, In FORMATS 2019 (É. André, Stoelinga, M., eds.), Springer, Cham, 11750, (2019), 181–198. [doi]
  • Oliver Cooley and Abraham Gutiérrez, Multi-coloured jigsaw percolation on random graphs, Journal of combinatorics, (2019).
  • Amnon Rosenmann, On the Distance Between Timed Automata., In FORMATS 2019 (É André, M. Stoelinga, eds.), Springer, Cham, 11750, (2019), 199–215. [doi]
  • Abraham Gutierrez, Mickaël Buchet and Sylvain Clair, Persistent Homology To Quantify the Quality of Surface-Supported Covalent Networks, ChemPhysChem, Wiley-VCH, (2019). [doi]
  • Judith Kloas and Wolfgang Woess, Multidimensional random walk with reflections, Stochastic processes and their applications, Elsevier B.V., 129(1), (2019), 336–354. [doi]
  • Bendikov, Alexander D., Wojciech Cygan and Wolfgang Woess, Oscillating heat kernels on ultrametric spaces, Journal of spectral theory, European Mathematical Society, 9(1), (2019), 195–226. [doi]
  • Alexander Grigoriev, Tim Hartmann, Stefan Lendl and Gerhard Woeginger, Dispersing obnoxious facilities on a graph, (2019). [url] [doi]
  • Wojciech Cygan, Nikola Sandrić and Stjepan Sebek, The growth of the range of stable random walks, arXiv.org e-Print archive, Cornell University Library, (2019).
  • Picardello, Angelo Massimo and Wolfgang Woess, Boundary Representations of λ-Harmonic and Polyharmonic Functions on Trees, Potential analysis, Springer Netherlands, 51(4), (2019), 541–561. [doi]
  • M. Kang, Michael Moßhammer and P. Sprüssel, Phase transitions in graphs on orientable surfaces, Random structures & algorithms, John Wiley and Sons Ltd, (2019).
  • Wenjie Fang, Cesar Ceballos and Henri Mühle, The steep-bounce zeta map in parabolic Cataland, (2019).
  • O. Cooley, M. Kang and C. Koch, The size of the giant component in random hypergraphs: A short proof, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 26(3), (2019). [doi]
  • C. Dowden, M. Kang and M. Krivelevich, The genus of the Erdős-Rényi random graph and the fragile genus property, Random structures & algorithms, John Wiley and Sons Ltd, (2019). [doi]
  • Stefan Lendl, Ante Custic and Abraham Punnen, Combinatorial Optimization with Interaction Costs: Complexity and Solvable Cases, Discrete optimization, Elsevier B.V., 33, (2019). [doi]
  • Wojciech Cygan and Stjepan Sebek, Transition probability estimates for subordinate random walks, arXiv.org e-Print archive, Cornell University Library, (2019).
  • Mihyun Kang, Dowden, Christopher Thomas, Mirjana Mikalacki and Milos Stojakovic, The Toucher-Isolator game, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 26(4), (2019).
  • Cooley, Oliver Josef Nikolaus, Wenjie Fang, Del Giudice, Nicola and Mihyun Kang, Subcritical random hypergraphs, high-order components, and hypertrees, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, (2019), 111–118. [doi]
  • O. Cooley, T. Kapetanopoulos and T. Makai, The sharp threshold for jigsaw percolation in random graphs, Advances in Applied Probability, Cambridge University Press, 51(2), (2019), 378–407. [doi]
  • Wojciech Cygan, Nikola Sandrić and Stjepan Sebek, CLT for the capacity of the range of stable random walks, arXiv.org e-Print archive, Cornell University Library, (2019).
  • O. Cooley, Del Giudice, Nicola, M. Kang and P. Sprüssel, Vanishing of cohomology groups of random simplicial complexes, Random structures & algorithms, John Wiley and Sons Ltd, (2019). [doi]
  • Cooley, Oliver Josef Nikolaus, Wenjie Fang, Del Giudice, Nicola and Mihyun Kang, Subcritical random hypergraphs, high-order components, and hypertrees, In 16th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019 (Munro, J. Ian, Marni Michna, eds.), (2019), 111–118.
  • Wojciech Cygan, Nikola Sandrić and Stjepan Sebek, Functional CLT for the range of stable random walks, arXiv.org e-Print archive, Cornell University Library, (2019).
  • Daniele D'Angeli, Emanuele Rodaro and Alfredo Donno, Catalan fragile words, International Journal of Group Theory, University of Isfahan, (2019).
  • A. Coja-Oghlan, O. Cooley, M. Kang and K. Skubch, Core forging and local limit theorems for the k-core of random graphs, Journal of Combinatorial Theory / B, Elsevier B.V., (2019). [doi]

2018

  • Wenjie Fang, A trinity of duality: Non-separable planar maps, β(1,0)-trees and synchronized intervals, Advances in Applied Mathematics, Elsevier B.V., 95, (2018), 1–30. [doi]
  • Ecaterina Sava-Huss and Wilfried Huss, Divisible sandpile on Sierpinski gasket graphs, Fractals, World Scientific Publ., (2018).
  • Wenjie Fang, Fighting Fish and Two-Stack Sortable Permutations, In Séminaire Lotharingien de Combinatoire, European Mathematical Society, 80B, (2018).
  • Michael Moßhammer, Phase transitions and structural properties of random graphs on surfaces, PhD thesis, Graz University of Technology (90000), (2018).
  • Johannes Cuno and Ecaterina Sava-Huss, Random walks on Baumslag-Solitar groups, Israel journal of mathematics, Springer New York, (2018), 1–37.
  • H.-K. Hwang, M. Kang and G.-H. Duh, Asymptotic expansions for sub-critical lagrangean forms, In Leibniz International Proceedings in Informatics, LIPIcs, (2018). [doi]
  • Eranda Dragoti-Cela, Vladimir Deineko and Gerhard Woeginger, New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices, European journal of operational research, Elsevier B.V., 267(3), (2018), 818–834. [doi]
  • Daniele D'Angeli and Alfredo Donno, Structure Polynomials and Subgraphs of Rooted Regular Trees, Algebra Colloquium, World Scientific, 25(1), (2018), 45–70. [doi]
  • A. Coja-Oghlan, C. Efthymiou, N. Jaafari, M. Kang and T. Kapetanopoulos, Charting the Replica Symmetric Phase, Communications in Mathematical Physics, Springer, (2018). [doi]
  • Thomas Hirschler and Wolfgang Woess, Comparing entropy rates on finite and infinite rooted trees with length functions, IEEE transactions on information theory, Institute of Electrical and Electronics Engineers, 64(8), (2018), 5570–5580. [doi]
  • Mihyun Kang, Pachon Pinzon, Angélica Yohana and Pablo Rodriguez, Evolution of a modified binomial random graph by agglomeration, Journal of statistical physics, Springer New York, 17, (2018), 509. [doi]
  • Mihyun Kang and Philipp Sprüssel, Symmetries of unlabelled planar triangulations, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 25(1), (2018).
  • Dowden, Christopher Thomas, Mihyun Kang and Philipp Sprüssel, The evolution of random graphs on surfaces, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 32(1), (2018), 695–727. [doi]
  • Daniele D'Angeli and Emanuele Rodaro, Fragile words and Cayley type transducers, International Journal of Group Theory, University of Isfahan, 7(3), (2018), 95–109. [doi]
  • Cooley, Oliver Josef Nikolaus, Mihyun Kang and Koch, Christoph Jörg, The size of the giant high-order component in random hypergraphs, Random structures & algorithms, John Wiley and Sons Ltd, 53, (2018), 238. [doi]
  • Cooley, Oliver Josef Nikolaus, Mihyun Kang and Yury Person, Largest components in random hypergraphs, Combinatorics, Probability & Computing, Cambridge University Press, (2018).
  • Leonardo Alese, Stefan Lendl and Paul Tabatabai, On sequences covering all rainbow k-progressions, Journal of combinatorics, 9(4), (2018). [doi]
  • Wenjie Fang, Mihyun Kang, Michael Moßhammer and Philipp Sprüssel, Cubic graphs and related triangulations on orientable surfaces, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 25(1), (2018).
  • Dowden, Christopher Thomas, Mihyun Kang and Michael Krivelevich, The genus of the Erdos-Renyi random graph and the fragile genus property, In Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), (2018), 17:1.
  • Cooley, Oliver Josef Nikolaus, Del Giudice, Nicola, Mihyun Kang and Philipp Sprüssel, Vanishing of cohomology groups of random simplicial complexes, In Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), (2018), 7:1–7:14.
  • Ecaterina Sava-Huss, Wilfried Huss and Lionel Levine, Interpolating between random walk and rotor walk, Random structures & algorithms, John Wiley and Sons Ltd, 52(2), (2018), 263–282. [doi]
  • Nikolaos Fountoulakis, Mihyun Kang, Koch, Christoph Jörg and Tamas Makai, A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs, The annals of applied probability, Institute of Mathematical Statistics, 28(2), (2018), 990–1051. [doi]
  • Dijana Kreso and Robert Tichy, Diophantine equations in separated variables, Periodica mathematica Hungarica, Springer Netherlands, (2018), 47–67. [doi]

2017

  • Gilch, Lorenz A. and Sebastian Müller, Counting self-avoiding walks on free products of graphs, Discrete Mathematics, Elsevier B.V., 340(3), (2017), 325–332. [doi]
  • Konrad Schrempf, On the Factorization of Non-Commutative Polynomials (in Free Associative Algebras), arXiv.org e-Print archive, Cornell University Library, (2017), 1–22.
  • Konrad Schrempf, Linearizing the Word Problem in (some) Free Fields, arXiv.org e-Print archive, Cornell University Library, (2017), 1–24.
  • Lorber, Florian Lukas, Amnon Rosenmann, Dejan Nickovic and Bernhard Aichernig, Bounded determinization of timed automata with silent transitions, Real-time systems, Springer Netherlands, 53(3), (2017), 291–326. [doi]
  • Wiktor Ejsmont and Franz Lehner, Sample variance in free probability, Journal of Functional Analysis, Academic Press, 273(7), (2017), 2488–2520. [doi]
  • Wenjie Fang and Uwe Beckert, Parallel Tree Search in Volunteer Computing: a Case Study, Journal of Grid Computing, Springer Science+Business Media B.V, (2017). [doi]
  • Daniele D'Angeli and Alfredo Donno, Wreath product of matrices, Linear algebra and its applications, Elsevier Inc., 513, (2017), 276–303. [doi]
  • A. Coja-Oghlan, O. Cooley, M. Kang and K. Skubch, How does the core sit inside the mantle?, Random structures & algorithms, John Wiley and Sons Ltd, (2017). [doi]
  • Cooley, Oliver Josef Nikolaus and Richard Mycroft, The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph, Discrete Mathematics, Elsevier B.V., (2017).
  • Daniele D'Angeli and Alfredo Donno, Shuffling matrices, Kronecker product and Discrete Fourier Transform, Discrete applied mathematics, Elsevier B.V., 233, (2017).
  • Eranda Dragoti-Cela, Vladimir Deineko and Woeginger, Gerhard Johannes, The multi-stripe travelling salesman problem, Annals of Operations Research, Springer Netherlands, 259(1-2), (2017), 21–34.
  • Béla Bollobás, Cooley, Oliver Josef Nikolaus, Mihyun Kang and Koch, Christoph Jörg, Jigsaw percolation on random hypergraphs, Journal of applied probability, University of Sheffield, 54(4), (2017), 1261. [doi]
  • A. Coja-Oghlan, O. Cooley, M. Kang and K. Skubch, The minimum bisection in the planted bisection model, Theory of Computing, University of Chicago, Department of Computer Science, (2017). [doi]
  • Alexander Bendikov, Wojciech Cygan and Bartosz Trojan, Limit theorems for random walks, Stochastic processes and their applications, Elsevier B.V., 127(10), (2017), 3268–3290. [doi]
  • Dowden, Christopher Thomas, Mihyun Kang and Philipp Sprüssel, The evolution of random graphs on surfaces, Electronic Notes in Discrete Mathematics, Elsevier B.V., 61, (2017), 367–373. [doi]
  • Wojciech Cygan, Heat content for convolution semigroups, Journal of mathematical analysis and applications, Academic Press, 446(2), (2017), 1393–1414. [doi]
  • Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang and Tobias Kapetanopoulos, Charting the replica symmetric phase, In Proceedings of the 21th International Workshop on Randomization and Computation (RANDOM 2017), (2017), 1–17.
  • Wiegel, Gundelinde Maria, The relation between quenched and annealed Lyapunov exponents in random potential on trees, Stochastic processes and their applications, Elsevier B.V., (2017). [doi]
  • Daniele D'Angeli, Emanuele Rodaro and Wächter, Jan Philipp, On the Complexity of the Word Problem of Automaton Semigroups and Automaton Groups, Advances in Applied Mathematics, Elsevier B.V., 90, (2017), 160–187. [doi]
  • Peter Allen, Julia Böttcher, Cooley, Oliver Josef Nikolaus and Richard Mycroft, Tight cycles and regular slices in dense hypergraphs, Journal of Combinatorial Theory / A, Elsevier B.V., 149, (2017), 30–100.
  • Cooley, Oliver Josef Nikolaus, Penny Haxell, Mihyun Kang and Philipp Sprüssel, Homological connectedness of random hypergraphs, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics, (2017), 279–285.
  • Dowden, Christopher Thomas, Mihyun Kang and Philipp Sprüssel, The evolution of random graphs on surfaces, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics, (2017), 367–373.
  • Daniele D'Angeli, Ievgen Bondarenko and Tatiana Nagnibeda, Ends of Schreier graphs and cut-points of limit spaces of self-similar groups, Journal of Fractal Geometry, EMS Publishing House, 4(4), (2017), 369.
  • Mihyun Kang, Michael Moßhammer and Philipp Sprüssel, Evolution of the giant component in graphs on orientable surfaces, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics, (2017), 287–293.
  • Mihyun Kang, Tamas Makai and Oleg Pikhurko, Supersaturation Problem for the Bowtie, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics, (2017), 679–685.

2016

  • Daniele D'Angeli, Groups and Graphs froma Automata, (2016).
  • Wilfried Huss, A functional limit law for p-rotor walk, (2016).
  • Wiktor Ejsmont and Franz Lehner, Sample Variance in Free Probability, arXiv.org e-Print archive, Cornell University Library, (2016).
  • Michael Martin, Arno Eichberger and Eranda Dragoti-Cela, Optimization Approach to Handle Global CO2 Fleet Emission Standards, (2016). [doi]
  • Koch, Christoph Jörg, Mihyun Kang and Cooley, Oliver Josef Nikolaus, Threshold and hitting time for high-order connectedness in random hypergraphs, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 23(2), (2016).
  • Daniele D'Angeli and Emanuele Rodaro, Freeness of automaton groups vs boundary dynamics, Journal of algebra, Academic Press, 462, (2016), 115–136. [doi]
  • Wilfried Huss, Rotor-router walks on Galton-Watson trees, (2016).
  • Koch, Christoph Jörg, Phase transition phenomena in random graphs and hypergraphs, PhD thesis, Graz University of Technology (90000), (2016).
  • Daniele D'Angeli, Freeness and fragile words in automata, (2016).
  • Gilch, Lorenz Alexander, Asymptotic Properties of Random Walks via Generating Functions, PhD thesis, , (2016).
  • Gilch, Lorenz Alexander and Sebastian Müller, Ends of branching random walks on planar hyperbolic Cayley graphs, In Groups, Graphs, and Random Walks (Tullio Ceccherini-Silberstein, Maura Salvatori, Ecaterina Sava-Huss, eds.), Cambridge University Press, (2016).
  • Ante Custic and Bettina Klinz, The constant objective value property for multidimensional assignment problems, Discrete optimization, Elsevier B.V., (2016), 23–35. [doi]
  • Daniele D'Angeli, Ievgen Bondarenko and Emanuele Rodaro, The lamplighter group ℤ3≀ℤ generated by a bireversible automaton, Communications in Algebra, Taylor and Francis Ltd., 44(12), (2016), 5257–5268.
  • Amnon Rosenmann, A multiple-valued logic approach to the design and verification of hardware circuits, Journal of applied logic, Elsevier B.V., 15, (2016), 69–93. [doi]
  • Eranda Dragoti-Cela, Vladimir Deineko and Woeginger, Gerhard J., Linearizable special cases of the QAP, Journal of combinatorial optimization, Springer Netherlands, 31(3), (2016), 1269–1279. [doi]
  • Alexander Bendikov, Laurent Saloff-Coste, Maura Salvatori and Wolfgang Woess, Brownian motion on treebolic space: positive harmonic functions, Annales de l’Institut Fourier, Association des Annales de l'Institut Fourier, 66(4), (2016), 1691–1731. [doi]
  • Mihyun Kang, Andrea Jiménez and Martin Loebl, Cubic bridgeless graphs and braces, Graphs and combinatorics, Springer Japan, 32(6), (2016), 2473–2495. [doi]
  • Daniele D'Angeli and Alfredo Donno, Metric compactification of infinite Sierpiński carpet graphs, Discrete Mathematics, Elsevier B.V., 339(11), (2016), 2693–2705. [doi]
  • Koch, Christoph Jörg and Johannes Lengler, Bootstrap Percolation on Geometric Inhomogeneous Random Graphs, In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), (2016).
  • Tamas Makai and Mihyun Kang, Bootstrap percolation on G(n,p) revisited, In Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, (2016).
  • Tetiana Boiko, Johannes Cuno, Wilfried Imrich, Florian Lehner and Woestijne, Christiaan E. van de, The Cartesian product of graphs with loops, Ars Mathematica Contemporanea, DMFA Slovenije, 11(1), (2016), 1–9.
  • Gilch, Lorenz Alexander, Asymptotic Entropy of Random Walks on Regular Languages over a Finite Alphabet, Electronic Journal of Probability, Institute of Mathematical Statistics, 21(8), (2016), 1–42.
  • Daniele D'Angeli, Ecaterina Sava-Huss and Alfredo Donno, Connectedness and isomorphism properties of the zig-zag product of graphs, Journal of graph theory, Wiley-Liss Inc., 83(2), (2016), 120. [doi]

2015

  • Mihyun Kang, Michael Behrisch and Amin Coja-Oghlan, Corrigendum 'The asymptotic number of connected d-uniform hypergraphs', Combinatorics, Probability & Computing, Cambridge University Press, 24(1), (2015), 373–375. [doi]
  • Mihyun Kang, Tamas Makai, Koch, Christoph Jörg and Michal Karonski, Properties of stochastic Kronecker graphs, Journal of combinatorics, 6, (2015), 395–432.
  • Lorber, Florian Lukas, Amnon Rosenmann, Dejan Nickovic and Bernhard Aichernig, Bounded Determinization of Timed Automata with Silent Transitions, In Formal Modeling and Analysis of Timed Systems, FORMATS 13, 2015, Madrid, Spain, Springer Verlag, 9268, (2015), 288–304. [doi]
  • Mihyun Kang, Cooley, Oliver Josef Nikolaus and Koch, Christoph Jörg, Evolution of high-order connected components in random hypergraphs, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15), Electronic Notes in Discrete Mathematics, (2015), 569–575.
  • Franz Lehner, Relations between cumulants in noncommutative probability, Advances in Mathematics, Elsevier B.V., 282(1), (2015), 56–92. [doi]
  • James Parkinson and Wolfgang Woess, Regular sequences and random walks in affine buildings, Annales de l’Institut Fourier, Association des Annales de l'Institut Fourier, 65(2), (2015), 675–707.
  • Ron Aharoni, Ron Holzman, David Howard and Philipp Sprüssel, Cooperative colorings and independent systems of representatives, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 22(2), (2015), 1–14.
  • Johannes Cuno and Jörg Lehnert, The Tits alternative for non-spherical triangles of groups, Transactions of the London Mathematical Society, 2(1), (2015), 93–124.
  • Eranda Dragoti-Cela, Vladimir Deineko and Woeginger, Gerhard J., Well-solvable cases of the QAP with block-structured matrices, Discrete applied mathematics, Elsevier B.V., 186, (2015), 56–65. [doi]
  • Mihyun Kang, Philipp Sprüssel, Michael Moßhammer and Wenjie Fang, Enumeration of cubic multigraphs on orientable surfaces, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15),, Electronic Notes in Discrete Mathematics, (2015), 603–610.
  • Mihyun Kang, Koch, Christoph Jörg and Pachon Pinzon, Angélica Yohana, The phase transition in a multi-type binomial random graph, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 29, (2015), 1042–1064.
  • Mihyun Kang, Cooley, Oliver Josef Nikolaus, Amin Coja-Oghlan and Kathrin Skubch, How does the core sit inside the mantle?, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15), Electronic Notes in Discrete Mathematics, (2015), 489–495.
  • Alexander Bendikov, Laurent Saloff-Coste, Maura Salvatori and Wolfgang Woess, Brownian motion on treebolic space: escape to infinity, Revista matematica iberoamericana, Universidad Autonoma de Madrid, 31(3), (2015), 935–976. [doi]
  • Peter Allen, Julia Böttcher, Cooley, Oliver Josef Nikolaus and Richard Mycroft, Tight Cycles in Hypergraphs, (2015).
  • Ecaterina Sava-Huss, Wilfried Huss and Sebastian Müller, Rotor-routing on Galton-Watson trees, Electronic Communications in Probability, Institute of Mathematical Statistics, 20, (2015).
  • Eranda Dragoti-Cela and Rostislav Stanek, Heuristics for the data arrangement problem on regular trees, Journal of combinatorial optimization, Springer Netherlands, 30(3), (2015), 768–802. [doi]
  • Tetiana Boiko and Wolfgang Woess, Moments of Riesz measures on Poincaré disk and homogeneous tree—a comparative study, Expositiones mathematicae, Urban und Fischer Verlag Jena, 33(3), (2015), 353–374. [doi]
  • Ante Custic, Bettina Klinz and Wöginger, Gerhard Johannes, Geometric versions of the 3-dimensional assignment problem under general norms, Discrete optimization, Elsevier B.V., 18, (2015), 38–55. [doi]
  • Mihyun Kang and Philipp Sprüssel, Charaterisation of symmetries of unlabelled triangulations, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15), Electronic Notes in Discrete Mathematics, (2015), 587–594.
  • Ron Aharoni, Eli Berger and Philipp Sprüssel, Two disjoint independent bases in matroid-graph pairs, Graphs and combinatorics, Springer Japan, 31(5), (2015), 1107–1116.
  • Daniele D'Angeli and Emanuele Rodaro, A geometric approach to (semi)-groups defined by automata via dual transducers, Geometriae dedicata, Springer Netherlands, no. 17;1, (2015), 375–400. [doi]
  • Eranda Dragoti-Cela, Vladimir Deineko and Woeginger, Gerhard J., A new tractable case of the QAP with a Robinson matrix,, In Proceedings of the 9th International Conference on Combinatorial Optimization and Applications (COCOA'2015), Springer, 9486, (2015), 709–720.
  • Mihyun Kang, Koch, Christoph Jörg and Tamas Makai, Bootstrap percolation in random k-uniform hypergraphs, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15), Electronic Notes in Discrete Mathematics, (2015), 595–601.
  • Mihyun Kang, Cooley, Oliver Josef Nikolaus, Amin Coja-Oghlan and Kathrin Skubch, The minimum bisection in the planted bisection model, In Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM'2015), Leibniz International Proceedings in Informatics (LIPIcs) series, (2015), 710–725.
  • Mihyun Kang, Will Perkins and Joel Spencer, Erratum to “The Bohman-Frieze process near criticality”, Random structures & algorithms, John Wiley and Sons Ltd, 46(4), (2015), 801–801. [doi]
  • Mihyun Kang, Giant components in random graphs, Chapter in , Springer, (2015).
  • Peter Allen, Julia Böttcher, Cooley, Oliver Josef Nikolaus and Richard Mycroft, Regular slices for hypergraphs, (2015).

2014

  • Amnon Rosenmann, The Timestamp of Timed Automata, arXiv.org e-Print archive, Cornell University Library, (2014).
  • Michael Behrisch,, Amin Coja-Oghlan and Mihyun Kang, Local limit theorems for the giant component of random hypergraphs, Combinatorics, Probability & Computing, Cambridge University Press, no. 23, (2014), 331–366.
  • Johannes Cuno, Wilfried Imrich and Florian Lehner, Distinguishing graphs with infinite motion and nonlinear growth, Ars Mathematica Contemporanea, DMFA Slovenije, 7(1), (2014), 201–213.
  • Ecaterina Sava-Huss and Wilfried Huss, Erratum: Transience and recurrence of rotor-router walks on directed covers of graphs, Electronic Communications in Probability, Institute of Mathematical Statistics, 19(71), (2014), 1–6. [doi]
  • Mihyun Kang, Pachon Pinzon, Angélica Yohana and Pablo Rodriguez, Connectivity for a modified binomial random graph by agglomeration, In Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA2014), ., (2014).
  • Mihyun Kang and Konstantinos Panagiotou, On the connectivity threshold of Achlioptas processes, Journal of combinatorics, 5(3), (2014), 291–304. [doi]
  • Daniele D'Angeli and Alfredo Donno, Isomorphism classification of infinite Sierpinski carpet graph, In Proceedings of the First Minisymposium on Mathematics in Engineering and Technology, ICNAAM 2014,, ., (2014).
  • Johannes Cuno and Jörg Lehnert, The Tits alternative for non-spherical triangles of groups, arXiv.org e-Print archive, Cornell University Library, (2014).
  • Johannes Cuno, Random walks and deterministic ways to explore discrete groups, (2014).
  • Clemens Heuberger, Daniel Krenn and Sara Kropf, Automata and transducers in the computer algebra system Sage, arXiv.org e-Print archive, Cornell University Library, (2014).
  • Johannes Cuno, Random walks and deterministic ways to explore discrete groups, (2014).
  • Vladimir Deineko, Bettina Klinz, Alexander Tiskin and Wöginger, Gerhard Johannes, Four-point conditions for the TSP: The complete complexity classification, Discrete optimization, Elsevier B.V., 14, (2014), 147–159. [doi]
  • Daniele D'Angeli, Chacón, Gerardo R. and Renato Colucci, Recurrence analysis on Julia sets of semigroups of complex polynomials, Journal of Applied Mathematics and Computing, Springer Verlag, Volume 46(1), (2014), 201–214. [doi]
  • Daniele D'Angeli, Horofunctions on Sierpinski type triangles, Utilitas mathematica, Utilitas Mathematica Publishing Inc., 105, (2014), 267–277.
  • Christoph Temmel, Shearer's measure and stochastic domination of product measures, Journal of theoretical probability, Springer New York, 27(1), (2014), 22–40. [doi]
  • Mihyun Kang and Zdenek Petrasek, Random Graphs: Theory and Applications from Nature to Society to the Brain, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 227, (2014), 1–24.
  • Roswitha Rissner and Rainer Burkard, Bounds on the radius and status of graphs, Networks, Wiley-Liss Inc., 64(2), (2014), 76–83. [doi]
  • Bendikov, Alexander D., Grigor'yan, Alexander A., Christophe Pittet and Wolfgang Woess, Isotropic Markov semigroups on ultra-metric spaces, Russian mathematical surveys, IOP Publishing Ltd., 69(4), (2014), 589–680. [doi]
  • Chacón, Gerardo R., Renato Colucci and Daniele D'Angeli, Density of Backward Branches on the Julia Set of a Semigroup, Sarajevo journal of mathematics, 10(1), (2014), 77–85. [doi]
  • Johannes Cuno, Tetiana Boiko, Wilfried Imrich, Florian Lehner and Woestijne, Christiaan E. van de, The Cartesian product of graphs with loops, arXiv.org e-Print archive, Cornell University Library, (2014).
  • Daniele D'Angeli, Schreier Graphs of an Extended Version of the Binary Adding Machine, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 21(4), (2014), 4–20.
  • Mihyun Kang, Random Graphs: from Nature to Society to the Brain, In a special issue of the Mathematical Intelligencer to SEOUL ICM 2014, Springer, (2014), 42–44.
  • Daniele D'Angeli and Emanuele Rodaro, Groups and semigroups defined by colorings of synchronizing automata, International journal of algebra and computation, World Scientific Publishing Co Pte Ltd, 24(6), (2014), 773–793. [doi]
  • Michael Behrisch, Amin Coja-Oghlan and Mihyun Kang, The asymptotic number of connected d-uniform hypergraphs, Combinatorics, Probability & Computing, Cambridge University Press, no. 23, (2014), 367–385.

2013

  • Amnon Rosenmann, On the intersection of subgroups in free groups: echelon subgroups are inert, Groups, Complexity, Cryptology, de Gruyter, 5(2), (2013), 211–221. [doi]
  • Roswitha Rissner and Rainer Burkard, Bounds on the radius and status of graphs, arXiv.org e-Print archive, Cornell University Library, (2013).
  • Christian Elsholtz, Clemens Heuberger and Helmut Prodinger, The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions, IEEE transactions on information theory, Institute of Electrical and Electronics Engineers, 59(2), (2013), 1065–1075. [doi]
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Uniqueness in quadratic and hyperbolic 0–1 programming problems, Operations research letters, Elsevier B.V., 41(6), (2013), 633–635. [doi]
  • Daniel Krenn, Analysis of the width-w non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices, Theoretical computer science, Elsevier B.V., 491, (2013), 47–70.
  • Daniel Krenn, Digit Expansions with Applications in Cryptography, PhD thesis, , (2013).
  • Franz Lehner, Free Lamplighter Groups and a Question of Atiyah, American Journal of Mathematics, Johns Hopkins University Press, 135(3), (2013), 835–849. [doi]
  • Clemens Heuberger and Daniel Krenn, Existence and Optimality of w-non-adjacent Forms with an Algebraic Integer Base, Acta Mathematica Hungarica, Springer Netherlands, 140(1-2), (2013), 90–104. [doi]
  • Johannes Cuno, Wilfried Imrich and Florian Lehner, Distinguishing graphs with infinite motion and nonlinear growth, arXiv.org e-Print archive, Cornell University Library, (2013).
  • Andrea Jiménez, Mihyun Kang and Martin Loebl, Directed Cycle Double Covers: Hexagon Graphs, In Proceedings of European Conference on Combinatorics, Graph Theory and Applications, ., (2013), –.
  • Franz Lehner, Free Nested Cumulants and an Analogue of a Formula of Brillinger, Probability and mathematical statistics, PWN-Polish Scientific Publishers, 33(2), (2013), 327–339.
  • Wolfgang Woess, What is a horocyclic product, and how is it related to lamplighters ?, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 224, (2013), 1–27.
  • Clemens Heuberger and Daniel Krenn, Optimality of the Width-w Non-adjacent Form: General Characterisation and the Case of Imaginary Quadratic Bases, Journal de théorie des nombres de Bordeaux, Université Bordeaux 1, 25(2), (2013), 353–386. [doi]
  • Sophie Frisch and Daniel Krenn, Sylow p-groups of polynomial permutations on the integers mod p^n, Journal of Number Theory, Academic Press, 133(12), (2013), 4188–4199.
  • Mihyun Kang, Will Perkins and Joel Spencer, The Bohman-Frieze process near criticality, Random structures & algorithms, John Wiley and Sons Ltd, 43, (2013), 221–250. [doi]
  • Clemens Heuberger, Daniel Krenn and Stephan Wagner, Analysis of parameters of trees corresponding to huffman codes and sums of unit fractions, In Proceedings of the Meeting on Analytic Algorithmics & Combinatorics (ANALCO), New Orleans, Louisiana, USA, January 6, 2013, SIAM, (2013), 33–42.
  • Bernhard Geiger and Christoph Temmel, Information-Preserving Markov Aggregation, In Proc. IEEE Information Theory Workshop, Institute of Electrical and Electronics Engineers, (2013), 258–262. [doi]
  • Daniele D'Angeli and Alfredo Donno, The lumpability property for a family of Markov chains on poset block structures, Advances in Applied Probability, Cambridge University Press, 51(3), (2013), 367–391. [doi]
  • Simon Walk, Jan Pöschko, Markus Strohmaier, Keith Andrews, Tania Tudorache, Natalya Noy, Csongor Nyulas and Mark Musen, PragmatiX: An Interactive Tool for Visualizing the Creation Process Behind Collaboratively Engineered Ontologies, International journal on semantic web and information systems, IGI Publishing, 9(1), (2013), 45–78. [doi]
  • Gilch, Lorenz Alexander and Francois Ledrappier, Regularity of the Drift and Entropy of Random Walks on Groups, Publicaciones matematicas del Uruguay, 14, (2013), 147–158.
  • Daniel Krenn, Jörg Thuswaldner and Volker Ziegler, On linear combinations of units with bounded coefficients and double-base digit expansions, Monatshefte für Mathematik, Springer Wien, 171(3–4), (2013), 377–394.
  • Clemens Heuberger and Daniel Krenn, Analysis of width-w non-adjacent forms to imaginary quadratic bases, Journal of Number Theory, Academic Press, 133, (2013), 1752–1808. [doi]
  • Mihyun Kang and Konstantinos Panagiotou, On the connectivity of random graphs from addable classes, Journal of Combinatorial Theory / B, Elsevier B.V., 103, (2013), 306–312. [doi]

2012

  • Ecaterina Sava-Huss, DK Discrete Mathematics, (2012).
  • Rainer Burkard and Zimmermann, Uwe T., Einführung in die Mathematische Optimierung, Springer Verlag, (2012). [doi]
  • Wilfried Huss and Ecaterina Sava-Huss, The Rotor-Router Group of Directed Covers of Graphs, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 19(3), (2012), 1–19.
  • Rainer Burkard, Mauro Dell'Amico and Silvano Martello, Assignment Problems. Revised reprint., SIAM - Society of Industrial and Applied Mathematics, (2012).
  • Wilfried Huss and Ecaterina Sava, Internal aggregation models on comb lattices, Electronic Journal of Probability, Institute of Mathematical Statistics, 17(30), (2012), 1–21. [doi]
  • Wilfried Huss and Ecaterina Sava-Huss, Transience and recurrence of rotor-router walks on directed covers of graphs, Electronic Communications in Probability, Institute of Mathematical Statistics, 17(41), (2012), 1–13.
  • Eranda Dragoti-Cela, Vladimir. Deineko and Woeginger, Gerhard Johannes, The x-and-y-axes travelling salesman problem, European journal of operational research, Elsevier B.V., 223, (2012), 333–345. [doi]
  • Angelos Georgakopoulos and Matthias Hamann, On fixing boundary points of transitive hyperbolic graphs, Archiv der Mathematik, Springer International Publishing AG, 99, (2012), 91–99.
  • Mihyun Kang, The 2012 Abel laureate Endre Szemerédi and his celebrated work, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, no. 221, (2012), 1–19.
  • Christoph Temmel, Properties and applications of Bernoulli random fields with strong dependency graph, PhD thesis, , (2012).
  • Schmuck, Nina Sabine, Stephan Wagner and Hua Wang, Greedy Trees, Caterpillars, and Wiener-Type Graph Invariants, Match - communications in mathematical and in computer chemistry, University of Kragujevac, Faculty of Science, 68, (2012), 273–292.
  • Clemens Heuberger and Daniel Krenn, Existence and Optimality of w-Non-adjacent Forms with an Algebraic Integer Base, arXiv.org e-Print archive, Cornell University Library, (2012).
  • Daniel Krenn, Jörg Thuswaldner and Volker Ziegler, On linear Combinations of Units with bounded Coefficients and double-Base Digit Expansions, arXiv.org e-Print archive, Cornell University Library, (2012).
  • Wolfgang Woess, Context-free pairs of groups. II - Cuts, tree sets, and random walks, Discrete Mathematics, Elsevier B.V., 312, (2012), 157–173. [doi]
  • Elisabetta Candellero, Gilch, Lorenz Alexander and Sebastian Müller, Branching Random Walks on Free Products of Groups, Proceedings of the London Mathematical Society, Oxford University Press, 104(6), (2012), 1085–1120.
  • Johannes Hatzl, 2-balanced Flows and the Inverse 1-median Problem in the Chebyshev Space, Discrete optimization, Elsevier B.V., 9(3), (2012), 137–148. [doi]
  • Angelos Georgakopoulos, Cycle decompositions: from graphs to continua, Advances in Mathematics, Elsevier B.V., 229, (2012), 935–967.
  • Rainer Burkard and Behrooz Alizadeh, A linear time algorithm for inverse obnoxious center location problems on networks, Central European Journal of Operations Research, Springer, (2012), 1–10. [doi]
  • Tullio Ceccherini-Silberstein and Wolfgang Woess, Context-free pairs of groups. I - Context-free pairs and graphs, European journal of combinatorics, Academic Press, 33, (2012), 1449–1466. [doi]
  • Eranda Dragoti-Cela, Vladimir. Deineko and Woeginger, Gerhard Johannes, Another well-solvable case of the QAP: Maximizing the job completion time variance,, Operations research letters, Elsevier B.V., 40, (2012), 356–359. [doi]
  • Daniel Krenn, Analysis of the width-w non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices, arXiv.org e-Print archive, Cornell University Library, (2012).
  • Elisabetta Candellero and Gilch, Lorenz Alexander, Phase Transitions for Random Walk Asymptotics on Free Products of Groups, Random structures & algorithms, John Wiley and Sons Ltd, 40(2), (2012), 150–181.
  • Clemens Heuberger and Florian Heigl, Analysis of Digital Expansions of Minimal Weight, In AofA'12, ., AQ, (2012), 399–412.
  • Clemens Heuberger, Daniel Krenn and Sara Kropf, Finite state machines, automata, transducers, nicht erfasst, (2012).
  • Sara Brofferio, Maura Salvatori and Wolfgang Woess, Brownian motion and harmonic functions on Sol(p,q), International mathematics research notices, Oxford University Press, 22, (2012), 5182–5218. [doi]
  • Daniel Krenn, Digital Expansions in Conjunction with Hyperelliptic Curve Cryptography, (2012).
  • Schmuck, Nina Sabine, Stephan Wagner and Hua Wang, Greedy Trees, Caterpillars, and Wiener-Type Graph Invariants, Chapter in , University of Kragujevac and Faculty of Science Kragujevac, 12, (2012), 195–214.
  • Elisabeth Gassner, An inverse approach to convex ordered median problems in trees, Journal of combinatorial optimization, Springer Netherlands, 23, (2012), 262–273.
  • Pierre Mathieu and Christoph Temmel, K-independent percolation on trees, Stochastic processes and their applications, Elsevier B.V., 122(3), (2012), 1129–1153. [doi]
  • Mihyun Kang and Tomasz Luczak, Two critical periods in the evolution of random planar graphs, Transactions of the American Mathematical Society, American Mathematical Society, no. 364, (2012), 4239–4265. [doi]

2011

  • Alexander Bendikov, Laurent Saloff-Coste, Maura Salvatori and Wolfgang Woess, The heat semigroup and Brownian motion on strip complexes, Advances in Mathematics, Elsevier B.V., 226(1), (2011), 992–1055. [doi]
  • Daniel Krenn and Sophie Frisch, Sylow $p$-groups of polynomial permutations on the integers mod $p^n$, arXiv.org e-Print archive, Cornell University Library, (2011).
  • Roberto Avanzi, Clemens Heuberger and Helmut Prodinger, Redundant τ-adic Expansions I: Non-Adjacent Digit Sets and their Applications to Scalar Multiplication, Designs, codes and cryptography, Springer Netherlands, 58(2), (2011), 173–202. [doi]
  • Franz Lehner, Freeness of Linear and Quadratic Forms in von Neumann Algebras, Journal of Functional Analysis, Academic Press, 261(10), (2011), 2829–2844. [doi]
  • Gilch, Lorenz Alexander, Random Walks on Directed Covers of Graphs, Journal of theoretical probability, Springer New York, 24(1), (2011), 118–149. [doi]
  • Serban Belinschi, Marek Bozejko, Franz Lehner and Roland Speicher, The normal distribution is $\boxplus$-infinitely divisible, Advances in Mathematics, Elsevier B.V., 226(4), (2011), 3677–3698. [doi]
  • Johannes Cuno, The Tits-alternative for non-spherical triangles of groups, (2011).
  • Clemens Heuberger and Stephan Wagner, The number of maximum matchings in a tree, Discrete Mathematics, Elsevier B.V., 311, (2011), 2512–2542. [doi]
  • Clemens Heuberger and Helmut Prodinger, A precise description of the p-adic valuation of the number of alternating sign matrices, International journal of number theory, World Scientific Publishing Co Pte Ltd, 7, (2011), 57–69. [doi]
  • Franz Lehner, A noncrossing basis for noncommutative invariants of SL(2,C), Journal of Combinatorial Theory / A, Elsevier B.V., 118(1), (2011), 257–269. [doi]
  • Marc Peigne and Wolfgang Woess, Stochastic dynamical systems with weak contractivity properties, I. Strong and local contractivity. With a chapter featuring results of Martin Benda, Colloquium Mathematicum, Institute of Mathematics, Polish Academy of Sciences, 125, (2011), 31–54. [doi]
  • Mihyun Kang, O. Pikhurko, A. Ravsky, M. Schacht and O. Verbitsky, Untangling planar graphs from a specified vertex position—Hard cases, Discrete applied mathematics, Elsevier B.V., 59(8), (2011), 789–799. [doi]
  • Michael Drmota, Eric Fusy, Mihyun Kang, Veronika Kraus and Juanjo Rué, Asymptotic study of subcritical graph classes, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 25(4), (2011), 1615–1651. [doi]
  • Roberto Avanzi and Clemens Heuberger, Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three, Chapter in (Dario Catalano, Nelly Fazio, Rosario Gennaro, Antonio Nicolosi, eds.), Springer, 6571, (2011), 109–127. [doi]
  • Gilch, Lorenz Alexander, Asymptotic Entropy of Random Walks on Free Products, Electronic Journal of Probability, Institute of Mathematical Statistics, 16, (2011), 76–105.
  • Christian Sattlecker, Free multiplicative central limit theorems and the free multiplicative normal distribution on the unit circle, (2011).
  • Rainer Burkard, Baroughi Bonap, Fahimeh and Elisabeth Gassner, Inverse p-median problems with variable edge lengths, Mathematical Methods of Operations Research, Physica-Verlag, 73(2), (2011), 263–280. [doi]
  • Johannes Hatzl, Toufik Mansour and Mark Shattuck, Maximizing a Sum Related to Image Segmentation Evaluation, Journal of mathematical modelling and algorithms, Springer Netherlands, 10, (2011), 193–203. [doi]
  • Bettina Klinz and Wöginger, Gerhard Johannes, The Northwest corner rule revisited, Discrete applied mathematics, Elsevier B.V., 159(12), (2011), 1284–1289. [doi]
  • Schmuck, Nina Sabine, The Wiener maximum quadratic assignment problem, (2011).
  • Mihyun Kang and Colin McDiarmid, Random unlabelled graphs containing few disjoint cycles, Random structures & algorithms, John Wiley and Sons Ltd, 38(1-2), (2011), 174–204. [doi]
  • Ecaterina Sava and Wilfried Huss, Rotor-Router Aggregation on the Comb, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 18(P224), (2011), 1–23.
  • Eranda Dragoti-Cela, Schmuck, Nina Sabine, Shmuel Wimer and Wöginger, Gerhard Johannes, The Wiener maximum quadratic assignment problem, Discrete optimization, Elsevier B.V., 8, (2011), 411–416. [doi]
  • Angelos Georgakopoulos, Bases and closures under infinite sums, Linear algebra and its applications, Elsevier Inc., 435, (2011), 2007–2018.
  • Marc Peigne and Wolfgang Woess, Stochastic dynamical systems with weak contractivity properties, II. Iteration of Lipschitz mappings, Colloquium Mathematicum, Institute of Mathematics, Polish Academy of Sciences, 125, (2011), 55–81. [doi]
  • Random Walks, Boundaries and Spectra, (Daniel Lenz, Florian Sobieczky, Wolfgang Woess, eds.), Birkhäuser, 64, (2011). [doi]
  • Rainer Burkard and Behrooz Alizadeh, Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees, Discrete applied mathematics, Elsevier B.V., 159, (2011), 706–716. [doi]
  • Clemens Heuberger and Daniel Krenn, Optimality of the Width-w Non-adjacent Form: General Characterisation and the Case of Imaginary Quadratic Bases, arXiv.org e-Print archive, Cornell University Library, (2011).
  • Franz Lehner, Cumulants as iterated integrals, Journal of statistical planning and inference, Elsevier B.V., 141(4), (2011), 1448–1454. [doi]
  • Angelos Georgakopoulos, Graph topologies induced by edge lengths, Discrete Mathematics, Elsevier B.V., 311, (2011), 1523–1542.
  • Rainer Burkard and Roswitha Rissner, Polynomially solvable special cases of the quadratic bottleneck assignment problem, Journal of combinatorial optimization, Springer Netherlands, 22, (2011), 845–856. [doi]
  • Manuel Bodirsky, Eric Fusy, Mihyun Kang and Stefan Vigerske, Boltzmann samplers, Pólya theory and cycle pointing, SIAM journal on computing, Society for Industrial and Applied Mathematics Publications, 40(3), (2011), 721–769. [doi]

2010

  • Elisabetta Candellero, Limit Behaviour of Random Walks and Branching Random Walks on Free Products, (2010).
  • Clemens Heuberger, Redundant τ-adic Expansions II: Non-Optimality and Chaotic Behaviour, Mathematics in computer science, Birkhauser Verlag Basel, 3, (2010), 141–157. [doi]
  • Elisabeth Gassner, The Steiner Forest Problem Revisited, Journal of discrete algorithms, Elsevier B.V., 8, (2010), 154–163. [doi]
  • Michael Anshelevich, Serban Belinschi, Marek Bozejko and Franz Lehner, Free Infinite Divisibility for Q-Gaussians, Mathematical research letters, International Press of Boston, Inc., 17(5), (2010), 905–916.
  • Wilfried Huss, Ecaterina Sava and Wolfgang Woess, Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions, Theoretical computer science, Elsevier B.V., 411(44-46), (2010), 3917–3922. [doi]
  • Elisabeth Gassner and Bettina Klinz, A Fast Parametric Assignment Algorithm with Applications in Max-Algebra, Networks, Wiley-Liss Inc., 55(2), (2010), 61–77. [doi]
  • Angelos Georgakopoulos, An eberhard-like theorem for pentagons and heptagons, Discrete & computational geometry, Springer, 44(4), (2010), 931–945.
  • Angelos Georgakopoulos, Every rayless graph has an unfriendly partition, Combinatorica, Springer, 5, (2010), 521–532.
  • Angelos Georgakopoulos, Uniqueness of electrical currents in a network of finite total resistance, Journal of the London Mathematical Society, Oxford University Press, 82(14), (2010), 256–272. [doi]
  • Rainer Burkard, Mohammadreza Galavii and Elisabeth Gassner, The inverse Fermat-Weber problem, European journal of operational research, Elsevier B.V., 206, (2010), 11–17. [doi]
  • Daniel Krenn, Analysis of Digital Expansions in Conjunction with Koblitz Curves in Characteristic Three, (2010).
  • Ecaterina Sava, A note on The Poisson boundary of lamplighter random walks, Monatshefte für Mathematik, Springer Wien, 159(4), (2010), 379–396. [doi]
  • Clemens Heuberger and Stephan Wagner, The number of maximum matchings in a tree, nicht erfasst, (2010).
  • Rainer Burkard and Johannes Hatzl, Median problems with positive and negative weights on cycles and cacti, Journal of combinatorial optimization, Springer Netherlands, 20, (2010), 27–46. [doi]
  • Michael Behrisch, Amin Coja-Oghlan and Mihyun Kang, The order of the giant component of random hypergraphs, Random structures & algorithms, John Wiley and Sons Ltd, 36(2), (2010), 149–184. [doi]
  • Rainer Burkard and Behrooz Alizadeh, Inverse center location problems, Electronic Notes in Discrete Mathematics, Elsevier B.V., 36, (2010), 105–110. [doi]
  • Johannes Hatzl, The Inverse 1-median Problem in R^d with the Chebyshev-Norm, In 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, ., (2010), 87–90.
  • Schmuck, Nina Sabine, The Wiener index of a graph, PhD thesis, , (2010).
  • Johannes Hatzl, The 1-median Problem in R^d with the Chebyshev-norm and its inverse problem, In Electronic Notes in Discrete Mathematics, ., (2010), 1137–1144.
  • Noga Alon, Amin Coja-Oghlan, Hiep Hàn, Mihyun Kang, Vojtech Rödl and Michael Schacht, Quasi-randomness and algorithmic regularity for graphs with general degree distributions, SIAM journal on computing, Society for Industrial and Applied Mathematics Publications, 39, (2010), 2336–2362. [doi]
  • Peter Cameron, Mihyun Kang and Dudley Stark, Random preorders and alignments, Discrete Mathematics, Elsevier B.V., 310(6), (2010), 591–603. [doi]
  • Johannes Hatzl and Andreas Karrenbauer, A Combinatorial Algorithm for the 1-Median Problem in R^d with the Chebyshev-Norm, Operations research letters, Elsevier B.V., 38, (2010), 383–385.
  • Clemens Heuberger and Stephan Wagner, Asymptotics of the extremal values of certain graph parameters in trees with bounded degree, Publicationes Mathematicae, Kossuth Lajos Tudomanyegyetem, 77, (2010), 347–367.
  • Elisabeth Gassner, Johannes Hatzl, Krumke, Sven O. and Sleman Saliba, CLEVER or SMART: Strategies for the Online Target Date Assignement Problem, Discrete applied mathematics, Elsevier B.V., 158 (1), (2010), 71–79. [doi]
  • Daniel Krenn, Analysis of Digital Expansions to Imaginary Quadratic Bases, PhD thesis, , (2010).
  • Ecaterina Sava, Lamplighter Random Walks and Entropy-Sensitivity of Languages, PhD thesis, , (2010).
  • Angelos Georgakopoulos, Lamplighter graphs do not admit harmonic functions of finite energy, Proceedings of the American Mathematical Society, American Mathematical Society, 138, (2010), 3057–3061. [doi]
  • Clemens Heuberger and Daniel Krenn, Analysis of Width-$w$ Non-adjacent Forms to Imaginary Quadratic Bases, arXiv.org e-Print archive, Cornell University Library, (2010).
  • Florian Sobieczky, Gerhard Rappitsch and Ernst Stadlober, Tandem queues for inventory management under random perturbations, Quality and reliability engineering international, John Wiley and Sons Ltd, 26, (2010), 899–905. [doi]
  • Baroughi Bonab, Fahimeh, Rainer Burkard and Behrooz Alizadeh, Inverse median location problems with variable coordinates, Central European Journal of Operations Research, Springer, 18, (2010), 365–381. [doi]

2009

  • Behrooz Alizadeh, Rainer Burkard and Ulrich Pferschy, Optimal algorithms for inverse center location problems with edge length augmentation on trees, (2009).
  • Elisabeth Gassner and Günter Rote, The Inverse Fermat-Weber Problem, (2009).
  • Baroughi Bonab, Fahimeh, Behrooz Alizadeh and Rainer Burkard, Inverse median optimization problems with variable coordinates under different norms, (2009).
  • Elisabeth Gassner, Johannes Hatzl, Krumke, Sven O., Heike Sperber and Woeginger, Gerhard J., How hard is it to find extreme Nash equilibria in network congestion games?, Theoretical computer science, Elsevier B.V., 410 (47-4), (2009), 4989–4999.
  • Elisabetta Candellero, Asymptotics of Return Probabilities of Random Walks on Free Products of Lattices, (2009).
  • Rainer Burkard, Communication network assignment problem (CAP), Chapter in , Springer, (2009), 394–396.
  • Elisabeth Gassner, Location Problems with Variable Input Data, PhD thesis, , (2009).
  • Fahimeh Baroughi-Bonab, Burkard, Rainer Ernest and Behrooz Alizadeh, Inverse median location problems with variable coordinates, ., (2009).
  • O. Cooley, Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs, Discrete Mathematics, Elsevier B.V., (2009). [doi]
  • Clemens Heuberger, Graphen, Ziffern und Kryptographie, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 212, (2009), 1–10.
  • Fahimeh Baroughi, Rainer Burkard and Behrooz Alizadeh, Inverse Median Location Problems with Variable Coordinates, ., (2009).
  • Laurent Saloff-Coste and Wolfgang Woess, Computations of spectral radii on G-spaces, Chapter in (Motoko Kotani, Hisashi Naito, Tatsuya Tate, eds.), American Mathematical Society, 484, (2009), 195–218.
  • Elisabeth Gassner, A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric, Annals of Operations Research, Springer Netherlands, 172(1), (2009), 393–404. [doi]
  • O. Cooley, J. Hladký and D. Piguet, Loebl-Komlós-Sós Conjecture: dense case, Electronic Notes in Discrete Mathematics, Elsevier B.V., (2009). [doi]
  • Elisabeth Gassner and Bettina Klinz, The computational complexity of bilevel assignment problems, 4OR, Springer Verlag, 7, (2009), 379–394. [doi]
  • Clemens Heuberger and Helmut Prodinger, Analysis of Complements in Multi-Exponentiation Algorithms Using Signed Digit Representations, International journal of foundations of computer science, World Scientific Publishing Co Pte Ltd, 20(3), (2009), 443–453. [doi]
  • Wolfgang Woess, Denumerable Markov Chains, European Mathematical Society, (2009).
  • Elisabetta Candellero, Phase Transitions for Random Walk Asymptotics on Free Products of Groups, (2009).
  • Österreichische Mathematik Olympiaden 2000-2008, (Gerd Baron, Schmidt, Birgit Vera, eds.), ., (2009).
  • Behrooz Alizadeh and Rainer Burkard, Uniform-cost inverse absolute and vertex center location problems on trees, ., (2009).
  • Rainer Burkard, Mauro Dell'Amico and Silvano Martello, Assignment Problems, SIAM - Society of Industrial and Applied Mathematics, (2009).
  • Gilch, Lorenz Alexander, Rate of Escape on the Lamplighter Tree, Journal of mathematical sciences (New York, NY), Springer Science and Business Media Deutschland GmbH, 156(1), (2009), 173–186.
  • Gilch, Lorenz Alexander, Asymptotics of Return Probabilities of Random Walks on Free Products of Lattices (joint work with Elisabetta Candellero), (2009).
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, The complexity of computing the Muirhead–Dalton distance, Mathematical social sciences, Elsevier B.V., 57(2), (2009), 282–284. [doi]
  • Sara Brofferio, Poisson boundary for finitely generated groups of rational affinities, Journal of mathematical sciences (New York, NY), Springer Science and Business Media Deutschland GmbH, 156(1), (2009), 1–10. [doi]
  • Daniel Krenn, Analytische Lösungen für das Vorwärtsproblem der Elektrischen Impedanztomographie auf einem Zylinder, PhD thesis, , (2009).
  • Behrooz Alizadeh, Burkard, Rainer Ernest and Ulrich Pferschy, Inverse 1-center location problems with edge length augmentation on trees, ., (2009).
  • Gilch, Lorenz Alexander, Random Walks on Directed Covers of Graphs (joint work with Sebastian Müller), (2009).
  • Clemens Heuberger and Stephan Wagner, Chemical trees minimizing energy and Hosoya index, Journal of mathematical chemistry, Springer Netherlands, 46, (2009), 214–230. [doi]
  • Gilch, Lorenz Alexander, Asymptotics of Return Probabilities of Random Walks on Free Products of Lattices (joint work with Elisabetta Candellero), (2009).
  • Elisabeth Gassner, Up- and downgrading the 1-center in a network, European journal of operational research, Elsevier B.V., 198, (2009), 370–377.
  • Mihyun Kang and Martin Loebl, The enumeration of planar graphs via Wick's theorem, Advances in Mathematics, Elsevier B.V., 221(5), (2009), 1703–1724. [doi]
  • Behrooz Alizadeh and Rainer Burkard, Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees, ., (2009).
  • Clemens Heuberger and James Muir, Unbalanced digit sets and the closest choice strategy for minimal weight integer representations, Designs, codes and cryptography, Springer Netherlands, 52, (2009), 185–208. [doi]
  • Dominik Kortschak and Hansjörg Albrecher, Asymptotic Results for the Sum of Dependent Non-identically Distributed Random Variables, Methodology and computing in applied probability, Springer Netherlands, 11(3), (2009), 279–306. [doi]
  • O. Cooley, N. Fountoulakis, D. Kühn and D. Osthus, Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs, Combinatorica, Springer, (2009). [doi]
  • Ecaterina Sava, Languages associated with graphs - entropy sensitivity via Markov chains, (2009).
  • P. Allen, J. Böttcher, J. Hladký and O. Cooley, Minimum degree conditions for large subgraphs, Electronic Notes in Discrete Mathematics, Elsevier B.V., (2009). [doi]
  • Wilfried Huss, Internal diffusion limited aggregation, (2009).
  • Elisabetta Candellero, Asymptotics of Return Probabilities of Random Walks on Free Products of Lattices, (2009).
  • Behrooz Alizadeh, Rainer Burkard and Ulrich Pferschy, Inverse 1-center location problems with edge length augmentation on trees, Computing , Springer Wien, 86, (2009), 331–343. [doi]
  • Behrooz Alizadeh, Rainer Burkard and Ulrich Pferschy, Inverse 1-center location problems with edge length augmentation on trees, ., (2009).
  • Hansjörg Albrecher, Andreas Binder and Philipp Mayer, Einführung in die Finanzmathematik, Birkhäuser Verlag, (2009).
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Polygons with inscribed circles and prescribed side lengths, Applied Mathematics Letters, Elsevier Limited, 22(5), (2009), 704–706. [doi]
  • Amin Coja-Oghlan and Mihyun Kang, The evolution of the min-min random graph process, Discrete Mathematics, Elsevier B.V., 309(13), (2009), 4527–4544. [doi]
  • Clemens Heuberger and Stephan Wagner, On a Class of Extremal Trees for Various Indices, Match - communications in mathematical and in computer chemistry, University of Kragujevac, Faculty of Science, 62, (2009), 437–464.
  • Franz Lehner, On the eigenspaces of lamplighter random walks and percolation clusters on graphs, Proceedings of the American Mathematical Society, American Mathematical Society, 137(8), (2009), 2631–2637.
  • Hansjörg Albrecher, S. Borst, O. Boxma and J. Resing, The tax identity in risk theory - a simple proof and an extension, Insurance / Mathematics & economics, Elsevier B.V., 44(2), (2009), 304–306. [doi]

2008

  • Behrooz Alizadeh and Rainer Burkard, Exact Algorithms for Inverse Center Location Optimization on Trees, (2008).
  • Behrooz Alizadeh and Rainer Burkard, Inverse Network Center Location Problem with Edge Length Modification, (2008).
  • Baroughi Bonab, Fahimeh, Rainer Burkard and Behrooz Alizadeh, Inverse Median Location Problems with Point Coordinates Modification on a d-dimensional Real Spaces, (2008).
  • Elisabeth Gassner and Johannes Hatzl, How hard is it to find extreme Nash equilibria in network congestion games?, (2008).
  • Baroughi Bonab, Fahimeh, Behrooz Alizadeh and Rainer Burkard, Inverse median optimization problems with point coordinates variations, (2008).
  • Elisabeth Gassner and Johannes Hatzl, Clever or Smart: Strategies for the Online Target Date Assignment Problem, (2008).
  • Gilch, Lorenz Alexander, Acceleration of Lamplighter Random Walks, Markov processes and related fields, Polymat, 14, (2008), 465–486.
  • Guillaume Chapuy, Eric Fusy, Mihyun Kang and Bilyana Shoilekova, A complete grammar for decomposing a family of graphs into 3-connected components, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 15, (2008), R148–R148.
  • Elisabeth Gassner, Up- and downgrading the 1-median in a network, TU Graz, Institut für Optimierung und Diskrete Mathematik (Math B), (2008).
  • Sebastian Müller, Recurrence and Transience for Branching Random Walks in an iid Random Environment, Markov processes and related fields, Polymat, 14(1), (2008), 115–130.
  • Gilch, Lorenz Alexander, Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups, In Proceedings to 5th Colloquium on Mathematics and Computer Science, Blaubeuren, DMTCS, DMTCS, (2008), 409–424.
  • Rainer Burkard, Elisabeth Gassner and Johannes Hatzl, Reverse 2-median problem on trees, Discrete applied mathematics, Elsevier B.V., 156(11), (2008), 1963–1976. [doi]
  • Mihyun Kang and Seierstad, T. G., The critical phase for random graphs with a given degree sequence, Combinatorics, Probability & Computing, Cambridge University Press, 17(1), (2008), 67–86. [doi]
  • Hansjörg Albrecher, Mayer, Philipp Arnold and Wim Schoutens, General lower bounds for arithmetic Asian option prices, Applied Mathematical Finance, Routledge, 15(2), (2008), 123–149. [doi]
  • Wolfgang Woess, Random Walks on Infinite Graphs and Groups, Cambridge University Press, 138, (2008).
  • Ecaterina Sava, The Poisson boundary of lamplighter random walks on general graphs, (2008).
  • Hansjörg Albrecher and S. Thonhauser, Optimal dividend strategies for a risk process under force of interest, Insurance / Mathematics & economics, Elsevier B.V., 43(1), (2008), 134–149. [doi]
  • Ecaterina Sava, The half-space method for the determination of the Poisson Boundary, (2008).
  • Elisabeth Gassner, Johannes Hatzl, Sven Krumke, Heike Sperber and Wöginger, Gerhard Johannes, How hard is it to find extreme Nash equilibria in network congestion games? (extended abstract), Lecture notes in computer science, Springer Verlag, 5385, (2008), 82–93.
  • van de Woestijne, Christiaan, Noncanonical number systems in the integers, Journal of Number Theory, Academic Press, 128, (2008), 2914–2938. [doi]
  • Laurent Bartholdi, Markus Neuhauser and Wolfgang Woess, Horocyclic products of trees, Journal of the European Mathematical Society, European Mathematical Society, 10(3), (2008), 771–816.
  • O. Cooley, N. Fountoulakis, D. Kühn and D. Osthus, 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers, Journal of Combinatorial Theory / B, Elsevier B.V., (2008). [doi]
  • Rainer Burkard, Galavii, Mohammadreza, [No Value] and Elisabeth Gassner, Inverse 1-median problems, In Oberwolfach Reports, ., 51/2008, (2008), 2908–2909.
  • Manuel Bodirsky, Clemens Gröpl and Mihyun Kang, Generating unlabeled connected cubic planar graphs uniformly at random, Random structures & algorithms, John Wiley and Sons Ltd, 32(2), (2008), 157–180. [doi]
  • Konrad Schrempf, Gekoppelte Finite Elemente- und Randelemente-Formulierungen für Akustik-Struktur Interaktionen, PhD thesis, , (2008).
  • Johannes Hatzl and Stephan Wagner, Combinatorial properties of a domination problem with parity constraints, Discrete Mathematics, Elsevier B.V., 308, (2008), 6355–6367. [doi]
  • Elisabeth Gassner, The Inverse 1-Maxian Problem with edge length modification, Journal of combinatorial optimization, Springer Netherlands, 16, (2008), 50–67.
  • Franz Lehner, Markus Neuhauser and Wolfgang Woess, On the spectrum of lamplighter groups and percolation clusters, Mathematische Annalen, Springer New York, 342(1), (2008), 69–89. [doi]
  • Rainer Burkard, Carmen Pleschiutschnig and Jason Zhang, The inverse 1-median problem in a cycle, Discrete optimization, Elsevier B.V., 5(2), (2008), 242–253. [doi]
  • Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer and Michael Schulz, Simultaneous Geometric Graph Embeddings, Lecture notes in computer science, Springer Verlag, 4875, (2008), 280–290. [doi]
  • S. Kindermann, Mayer, Philipp Arnold, Hansjörg Albrecher and H. Engl, Identification of the local speed function in a Levy model for option pricing, Journal of integral equations and applications, Rocky Mountain Mathematics Consortium, 20(2), (2008), 161–200. [doi]
  • Daniel Krenn, Polynomfunktionen und Polynompermutationen auf Z/p^nZ, PhD thesis, , (2008).
  • Christoph Temmel, K-independent percolation on trees after the works of Bollobas & Balister, PhD thesis, , (2008).
  • Clemens Heuberger, Helmut Prodinger and Stephan Wagner, Positional Number Systems with Digits Forming an Arithmetic Progression, Monatshefte für Mathematik, Springer Wien, 155, (2008), 349–375. [doi]
  • Clemens Heuberger and Stephan Wagner, Maximizing the number of independent subsets over trees with bounded degree, Journal of graph theory, Wiley-Liss Inc., 58, (2008), 49–68. [doi]
  • Hansjörg Albrecher, J. Renaud and X. Zhou, A Levy insurance risk process with tax, Journal of applied probability, University of Sheffield, 45(2), (2008), 363–375. [doi]
  • Margaret Archibald, Vasco Brattka and Clemens Heuberger, Randomness with respect to the Signed-Digit Representation, Fundamenta informaticae, IOS Press, 83, (2008), 1–19.
  • Wilfried Huss, Internal diffusion-limited aggregation, (2008).
  • Wilfried Huss, Internal Diffusion-Limited Aggregation on non-amenable graphs, Electronic Communications in Probability, Institute of Mathematical Statistics, 13, (2008), 272–279.
  • Gilch, Lorenz Alexander, Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups, (2008).
  • Elisabeth Gassner and Johannes Hatzl, A Parity Domination Problem in Graphs with Bounded Treewidth and Distance-hereditary Graphs, Computing , Springer Wien, 82, (2008), 171–187. [doi]
  • Hansjörg Albrecher, A. Badescu and D. Landriault, On the dual risk model with taxation, Insurance / Mathematics & economics, Elsevier B.V., 42(3), (2008), 1086–1094. [doi]

2007

  • Burkard, Rainer Ernst, Behrooz Alizadeh and Baroughi Bonab, Fahimeh, Semi-Infinite Programming for solving Linear Fractional Programming with Fuzzy Parameters in Constraints, (2007).
  • Ronald Ortner and Wolfgang Woess, Non-backtracking random walks and cogrowth of graphs, Canadian Journal of Mathematics, Cambridge University Press, 59, (2007), 828–844.
  • Manuel Bodirsky, Mihyun Kang, Mike Löffler and Colin McDiarmid, Random cubic planar graphs, Random Structures and Algorithms, Random structures & algorithms, John Wiley and Sons Ltd, 30(1-2), (2007), 78–94. [doi]
  • Hansjörg Albrecher and Juergen Hartinger, Reply to Discussions on the Paper "A risk model with multi-layer dividend strategy", North American Actuarial Journal, Routledge, Taylor & Francis Group, 11(4), (2007), 141–142.
  • D. Kühn, O. Cooley, N. Fountoulakis and D. Osthus, Ramsey numbers of sparse hypergraphs, Electronic Notes in Discrete Mathematics, Elsevier B.V., (2007). [doi]
  • Mihyun Kang, Evolution of random graph processes with degree constraints, In Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, ., 28, (2007), 493–500.
  • Manuel Bodirsky, Eric Fusy, Mihyun Kang and Stefan Vigerske, Enumeration and asymptotic properties of unlabeled outerplanar graphs, The electronic journal of combinatorics, Electronic Journal of Combinatorics, 14, (2007), R66–R66.
  • O. Cooley, D. Kühn and D. Osthus, Perfect packings with complete graphs minus an edge, European journal of combinatorics, Academic Press, (2007). [doi]
  • Dominik Kortschak, Asymptotic results for the sum of dependent non-identically distributed random variables, (2007).
  • Burkard, Rainer Ernst, Behrooz Alizadeh and Baroughi Bonab, Fahimeh, Semi-infinite optimization for solving linear fractional programming with fuzzy coefficients, (2007).
  • Burkard, Rainer Ernst, Discrete optimization:an Austrian view, Annals of Operations Research, Springer Netherlands, 149, (2007), 43–48.
  • Johannes Hatzl, Mixed Integer Linear Programs for Batch Processes, (2007).
  • B. Kushavand, H. Aghababei and Behrooz Alizadeh, Application of Kriging with Omni Directional Variogram to Finding the Direction of Anisotropy Axes, Journal of applied sciences, Asian Network for Scientific Information, 7(4), (2007), 589–592.
  • Anders Karlsson and Wolfgang Woess, The Poisson boundary of lamplighter random walks on trees, Geometriae dedicata, Springer Netherlands, 124, (2007), 95–107. [doi]
  • Burkard, Rainer Ernst, Monge properties, discrete convexity and applications, European journal of operational research, Elsevier B.V., 176, (2007), 1–14.
  • Burkard, Rainer Ernst, Jafar Fathali and Kakhki, Hossein Taghizadeh, The p-maxian problem on a tree, Operations research letters, Elsevier B.V., 35, (2007), 331–335. [doi]
  • Johannes Hatzl and Stephan Wagner, Combinatorial properties of a general domination problem with parity constraints, (2007).
  • Clemens Heuberger, Hwang's Quasi-Power-Theorem in Dimension Two, Quaestiones mathematicae, Taylor and Francis Ltd., 30, (2007), 507–512.
  • Clemens Heuberger and Helmut Prodinger, On α-greedy expansions of numbers, Advances in Applied Mathematics, Elsevier B.V., 38(4), (2007), 505–525. [doi]
  • Thonhauser, Stefan Michael and Hansjörg Albrecher, Dividend maximization under consideration of the time value of ruin, Insurance / Mathematics & economics, Elsevier B.V., 41, (2007), 163–184.
  • Clemens Heuberger and James Muir, Minimal Weight and Colexicographically Minimal Integer Representation, Journal of mathematical cryptology, de Gruyter, (2007), 297–328.
  • Burkard, Rainer Ernst and Jafar Fathali, A polynomial method for the pos/neg weighted 3-median problem on a tree, Mathematical Methods of Operations Research, Physica-Verlag, 65, (2007), 229–238. [doi]
  • Manuel Bodirsky, Clemens Gröpl, Daniel Johannsen and Mihyun Kang, A direct decomposition of 3-connected planar graphs, Séminaire Lotharingien de Combinatoire, 54A, (2007), B54AK–B54AK.
  • Rainer Burkard, Admissible transformations and assignment problems, Vietnam journal of mathematics, 35(4), (2007), 373–386.
  • Hansjörg Albrecher, Michael Drmota, Martin Goldstern, Peter Grabner and Reinhard Winkler, Robert F, Tichy: 50 years - the unreasonable effectiveness of a number theorist, Uniform Distribution Theory, Slovak Academy of Sciences, 2, (2007), 115–124.
  • Clemens Heuberger and Helmut Prodinger, The Hamming Weight of the Non-Adjacent-Form under Various Input Statistics, Periodica mathematica Hungarica, Springer Netherlands, 55, (2007), 81–96. [doi]
  • Hansjörg Albrecher, Mayer, Philipp Arnold, Wim Schoutens and Jurgen Tistaert, The little Heston trap, Wilmott, no. 1, (2007), 83–92.
  • Johannes Hatzl, Median problems on wheels and cactus graphs, Computing , Springer Wien, 80(4), (2007), 377–393.
  • Hansjörg Albrecher, The next step: collateralized debt obligations for catastrophe risks, Wilmott, no. 6, (2007), 16–18.
  • Mihyun Kang and Seierstad, Taral Guldahl, The phase transition of the minimum degree random multi-graph process, Random structures & algorithms, John Wiley and Sons Ltd, 31(3), (2007), 330–353. [doi]
  • Hansjörg Albrecher and Juergen Hartinger, A risk model with multi-layer dividend strategy, North American Actuarial Journal, Routledge, Taylor & Francis Group, 11(2), (2007), 43–64.
  • Manuel Bodirsky, Eric Fusy, Mihyun Kang and Stefan Vigerske, An unbiased pointing operator for unlabeled structures, with applications to counting and sampling, In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Association of Computing Machinery, (2007), 356–365.
  • Michael Behrisch, Amin Coja-Oghlan and Mihyun Kang, Local Limit Theorems for the Giant Component of Random Hypergraphs, In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Springer, 4627, (2007), 341–352. [doi]
  • Manuel Bodirsky, Omer Giménez, Mihyun Kang and Marc Noy, Enumeration and limit laws of series-parallel graphs, European journal of combinatorics, Academic Press, 28(8), (2007), 2091–2105. [doi]
  • Noga Alon, Amin Coja-Oghlan, Hiep Hàn, Mihyun Kang, Vojtech Rödl and Michael Schacht, Quasi-randomness and algorithmic regularity for graphs with general degree distributions, In Automata, Languages and Programming, Springer, 4596, (2007), 789–800. [doi]
  • Sebastian Müller, Types of branching Markov chains, (2007).
  • Cartwright, Donald I. and Wolfgang Woess, The spectrum of the averaging operator on a network (metric graph), Illinois journal of mathematics, University of Illinois at Urbana-Champaign, 71, (2007), 805–830.
  • Roberto Avanzi, Clemens Heuberger and Helmut Prodinger, On Redundant τ-adic Expansions and Non-Adjacent Digit Sets, In Selected Areas in Cryptography: 13th International Workshop, SAC 2006, Montreal, Canada, August 2006, Revised Selected Papers, Springer, 4356, (2007), 285–301.
  • Manuel Bodirsky, Clemens Gröpl and Mihyun Kang, Generating labeled planar graphs uniformly at random, Theoretical computer science, Elsevier B.V., 379(3), (2007), 377–386. [doi]
  • Hansjörg Albrecher and Christian Hipp, Lundberg's risk process with tax, Blätter der DGVFM, Springer Verlag, 28(1), (2007), 13–28.
  • Gilch, Lorenz Alexander, Rate of Escape of Random Walks, PhD thesis, , (2007).
  • Hansjörg Albrecher, Juergen Hartinger and Thonhauser, Stefan Michael, On exact solutions for dividend strategies of threshold and linear barrier type in a Sparre Andersen model, ASTIN Bulletin, Cambridge University Press, 37(2), (2007), 203–233.
  • Gilch, Lorenz Alexander, Rate of Escape of Random Walks on Free Products, The journal of the Australian Mathematical Society, Cambridge University Press, 83(1), (2007), 31–54.
  • Wilfried Huss, Internal diffusion-limited aggregation, (2007).
  • Hansjörg Albrecher and Thonhauser, Stefan Michael, Discussion of "On the Merger of Two Companies" by H. Gerber and E. Shiu, North American Actuarial Journal, Routledge, Taylor & Francis Group, 11(2), (2007), 157–159.
  • Van de Woestijne, Christiaan, The Casas-Alvero Conjecture for Infinitely Many Degrees, Journal of algebra, Academic Press, 316, (2007), 224–230.

2006

  • Roberto Avanzi, Clemens Heuberger and Helmut Prodinger, On Redundant $\tau$-adic Expansions and Non-Adjacent Digit Sets, (2006).
  • J Fathali, Taghizadeh Kakhki, H and Burkard, Rainer Ernst, An ant colony algorithm for the pos/neg weighted p-median problem, Central European Journal of Operations Research, Springer, 14, (2006), 229–246.
  • Franz Lehner, Cumulants in Noncommutative Probability Theory IV. Noncrossing Cumulants, Journal of Functional Analysis, Academic Press, 239, (2006), 214–246. [doi]
  • Roberto Avanzi, Clemens Heuberger and Helmut Prodinger, Minimality of the Hamming Weight of the τ-NAF for Koblitz Curves and Improved Combination with Point Halving, In Selected Areas in Cryptography : selected papers, Springer, 3897, (2006), 332–344. [doi]
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Exact algorithms for the Hamiltonian cycle problem in planar graphs, Operations research letters, Elsevier B.V., 34(3), (2006), 269–274. [doi]
  • Burkard, Rainer Ernst, Elisabeth Gassner and Johannes Hatzl, A linear time algorithm for the reverse 1-median problem on a cycle, Networks, Wiley-Liss Inc., 48(1), (2006), 16–23.
  • Hansjörg Albrecher and J. Teugels, Exponential behavior in the presence of dependence in risk theory, Journal of applied probability, University of Sheffield, 43(1), (2006), 257–273.
  • Sara Brofferio and Wolfgang Woess, Positive harmonic functions for semi-isotropic random walks on trees, lamplighter groups, and DL-graphs, Potential analysis, Springer Netherlands, 24(3), (2006), 245–265. [doi]
  • G Chen, G Zhang and Burkard, Rainer Ernst, The web proxy location problem in general tree of rings networks, Journal of combinatorial optimization, Springer Netherlands, 12, (2006), 327–336.
  • Clemens Heuberger, Attila Pethö and Robert Tichy, Thomas' Family of Thue Equations over Imaginary Quadratic Fields, II, Sitzungsberichte und Anzeiger / Österreichische Akademie der Wissenschaften, Mathematisch-Naturwissenschaftliche Klasse : Abteilung I, Biologische Wissenschaften und Erdwissenschaften ; Abteilung II, Mathematische, Physikalische und Technische Wissenschaften, Verlag der Österreichischen Akademie der Wissenschaften, 142, (2006), 3–7.
  • Eranda Dragoti-Cela, Bettina Klinz and Christophe Meyer, Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, Journal of combinatorial optimization, Springer Netherlands, 12, (2006), 187–215. [doi]
  • Burkard, Rainer Ernst and Johannes Hatzl, Modelling and optimizing batch processes in the chemical industry, Chapter in , Springer, (2006), 279–290.
  • Sebastien Blachère and Sara Brofferio, Internal diffusion limited aggregation on goups having exponential growth, Probability theory and related fields, Springer New York, (2006), 1–20.
  • Roberto Avanzi, Clemens Heuberger and Helmut Prodinger, Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and its Combination with Point Halving: Extensions and Mathematical Analysis, Algorithmica, Springer New York, 46, (2006), 249–270. [doi]
  • Hansjörg Albrecher, Burkard, Rainer Ernst and Eranda Dragoti-Cela, An asymptotical study of combinatorial optimization problems by means of statistical mechanics, Journal of computational and applied mathematics, Elsevier B.V., 186(1), (2006), 148–162.
  • Van de Woestijne, Christiaan, Surface Parametrisation without Diagonalisation, In International Symposium on Symbolic and Algebraic Computation, Association of Computing Machinery, (2006), 340–344. [doi]
  • Sara Brofferio, The Poisson boundary of random rational affinities, Annales de l’Institut Fourier, Association des Annales de l'Institut Fourier, 56(2), (2006), 499–515.
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Four point conditions and exponential neighborhoods for symmetric TSP, In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, Association of Computing Machinery, (2006), 544–553. [doi]
  • Clemens Heuberger and Helmut Prodinger, Analysis of Alternative Digit Sets for Nonadjacent Representations, Monatshefte für Mathematik, Springer Wien, 147, (2006), 219–248. [doi]
  • Mihyun Kang, Youngmee Koh, Sangwook Ree and Tomasz Luczak, The connectivity threshold for the min-degree random graph process, Random structures & algorithms, John Wiley and Sons Ltd, 29(1), (2006), 105–120. [doi]
  • Hansjörg Albrecher and Sören Asmussen, Ruin probabilities and aggregate claims distributions for shot noise Cox processes, Scandinavian Actuarial Journal, Taylor and Francis Ltd., no. 2, (2006), 86–110.
  • Laurent Saloff-Coste and Wolfgang Woess, Transition operators on co-compact G-spaces, Revista matematica iberoamericana, Universidad Autonoma de Madrid, 22, (2006), 747–799.
  • Elisabeth Gassner, Michael Jünger, Merijam Percan, Michael Schulz and Marcus Schaefer, Simultaneous Graph Embeddings with Fixed Edges, Lecture notes in computer science, Springer Verlag, 4271, (2006), 325–335. [doi]
  • Van de Woestijne, Christiaan, Deterministic Equation Solving over Finite Fields, PhD thesis, , (2006).
  • Burkard, Rainer Ernst and Johannes Hatzl, A complex time based construction heuristic for batch scheduling problems in the chemical industry, European journal of operational research, Elsevier B.V., 174(2), (2006), 1162–1183.
  • Manuel Bodirsky and Mihyun Kang, Generating outerplanar graphs uniformly at random, Combinatorics, Probability & Computing, Cambridge University Press, 15(3), (2006), 333–343. [doi]
  • Elisabeth Gassner and Sven Krumke, Deterministic Online Optical Call Admission Revisited, In Approximation and Online Algorithms, Springer, 3879, (2006), 190–202. [doi]
  • Hansjörg Albrecher and J. Hartinger, On the non-optimality of horizontal barrier strategies in the Sparre Andersen model, HERMIS - the international journal of computer mathematics and its applications, 7, (2006), 109–122.
  • Hansjörg Albrecher and J.L. Teugels, Asymptotic Analysis of a Measure of Variation, Theory of probability and mathematical statistics, American Mathematical Society, 74, (2006), 1–9.
  • Clemens Heuberger, All Solutions to Thomas' Family of Thue Equations over Imaginary Quadratic Number Fields, Journal of symbolic computation, Academic Press, 41(9), (2006), 980–998. [doi]
  • Marek Bozejko, Kenneth Dykema and Franz Lehner, Isomorphisms of Cayley graphs of surface groups, Algebra and Discrete Mathematics, Institute of Applied Mathematics And Mechanics of the National Academy of Sciences of Ukraine, no. 1, (2006), 18–37.
  • Hansjörg Albrecher and Thonhauser, Stefan Michael, Discussion of "Optimal Dividend Strategies in the Compound Poisson Model" by H. Gerber and E. Shiu, North American Actuarial Journal, Routledge, Taylor & Francis Group, 10(3), (2006), 68–71.
  • Van de Woestijne, Christiaan and Andrew Shallue, Construction of Rational Points on Elliptic Curves over Finite Fields, Chapter in , Springer, 4076, (2006), 510–524. [doi]
  • Ecaterina Sava-Huss, Stochastic models in finance, PhD thesis, , (2006).
  • Hansjörg Albrecher, Sören Asmussen and Dominik Kortschak, Tail asymptotics for the sum of two heavy-tailed dependent risks, Extremes, Springer Netherlands, 9(2), (2006), 107–130.
  • Peter Grabner and Clemens Heuberger, On the number of optimal base 2 representations of integers, Designs, codes and cryptography, Springer Netherlands, 40, (2006), 25–39.
  • Clemens Heuberger, Parametrized Thue Equations — A survey, In Proceedings of the RIMS symposium “Analytic Number Theory and Surrounding Areas”, ., 1511, (2006), 82–91.
  • Bettina Klinz, Ulrich Pferschy and Joachim Schauer, ILP Models for a Nurse Scheduling Problem, In Operations Research Proceedings 2006, Springer, (2006), 319–324.

2005

  • Sara Brofferio and Wolfgang Woess, Green kernel estimates and the full Martin boundary for random walks on lamplighter groups and Diestel-Leader graphs, Annales de l'Institut Henri Poincaré / Probabilités et Statistiques, Institut Henri Poincaré, 41(6), (2005), 1101–1123. [doi]
  • Hansjörg Albrecher and O.J. Boxma, On the discounted penalty function in a Markov-dependent risk model, Insurance / Mathematics & economics, Elsevier B.V., 37(3), (2005), 650–672.
  • Hansjörg Albrecher, Jan Dhaene, Marc Goovaerts and Wim Schoutens, Static hedging of Asian options under Levy models: the comonotonicity approach, The journal of derivatives, Institutional Investor, Inc, 12(3), (2005), 63–72.
  • Hansjörg Albrecher, Some Extensions of the Classical Ruin Model in Risk Theory, Grazer mathematische Berichte, 348, (2005), 1–14.
  • Franz Lehner, Cumulants in Noncommutative Probability III: Creation and Annihilation Operators on Fock Spaces, Infinite dimensional analysis, quantum probability and related topics, World Scientific Publishing Co Pte Ltd, 8(3), (2005), 407–437. [doi]
  • Laurent Bartholdi and Wolfgang Woess, Spectral computations on lamplighter groups and Diestel-Leader graphs, The journal of Fourier analysis and applications, Birkhause Boston, 11(2), (2005), 175–202. [doi]
  • Bettina Klinz and Wöginger, Gerhard Johannes, Faster algorithms for computing power indices in weighted voting games, Mathematical social sciences, Elsevier B.V., 49, (2005), 111–116. [doi]
  • Manuel Bodirsky, Clemens Gröpl and Mihyun Kang, Sampling unlabeled biconnected planar graphs, In Algorithms and computation, Springer, 3827, (2005), 593–603. [doi]
  • Hansjörg Albrecher, M.M. Claramunt and M. Marmol, On the distribution of dividend payments in a Sparre Andersen model with generalized Erlang(n) interclaim times, Insurance / Mathematics & economics, Elsevier B.V., 37(2), (2005), 324–334.
  • Elisabeth Gassner, Deterministic Online Optical Call Admission Revisited, In Oberwolfach reports, Mathematisches Forschungsinstitut Oberwolfach, (2005), 2918–2920.
  • Clemens Heuberger, Rajendra Katti, Helmut Prodinger and Xiaoyu Ruan, The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography, Theoretical computer science, Elsevier B.V., 341, (2005), 55–72. [doi]
  • Manuel Bodirsky, Omer Giménez, Mihyun Kang and Marc Noy, On the number of series-parallel and outerplanar graphs, In Discrete Mathematics and Theoretical Computer Science Proceedings, AE, ., (2005), 383–388.
  • Johann Linhart and Ronald Ortner, An arrangement of pseudocircles not realizable with circles, Beiträge zur Algebra und Geometrie, Springer, 46(2), (2005), 351–356.
  • Christian Zelle and Burkard, Rainer Ernst, The reel and sheet cutting problem in paper industry, Central European Journal of Operations Research, Springer, 13, (2005), 147–167.
  • Hansjörg Albrecher, Discussion of "The Time Value of Ruin in a Sparre Andersen Model" by H. Gerber and E. Shiu, North American Actuarial Journal, Routledge, Taylor & Francis Group, 9(2), (2005), 71–74.
  • Sophie Frisch, Polynomial separation of points in algebras, In Arithmetical Properties of Commutative Rings and Monoids (Chapman, Scott T., ed.), Chapman & Hall / CRC, 241, (2005), 253–259.
  • Wolfgang Woess, Lamplighters, Diestel-Leader graphs, random walks, and harmonic functions, Combinatorics, Probability & Computing, Cambridge University Press, 14(3), (2005), 415–433. [doi]
  • Hansjörg Albrecher, Jürgen Hartinger and Robert Tichy, On the distribution of dividend payments and the discounted penalty function in a risk model with linear dividend barrier, Scandinavian Actuarial Journal, Taylor and Francis Ltd., no. No. 2, (2005), 103–126.
  • Mihyun Kang and O. Pikhurko, Maximum Kr+1-free graphs which are not r-partite, Matematychni studii, VNTL Publishers, 24(1), (2005), 12–20.
  • Peter Grabner, Clemens Heuberger and Helmut Prodinger, Counting optimal joint digit expansions, INTEGERS: Electronic Journal of Combinatorial Number Theory, de Gruyter, 5, (2005), A09–A09.
  • Hansjörg Albrecher, A note on the asymptotic behaviour of bottleneck problems, Operations research letters, Elsevier B.V., 33(2), (2005), 183–186.
  • Behrang Kushavand, Hamid Aghababaee and Behrooz Alizadeh, Semivariogram Fitting with a Simple Optimizing Algorithm, Journal of applied sciences, Asian Network for Scientific Information, 5, (2005), 1405–1407.
  • Markus Neuhauser, Relative property (T) and related properties of wreath products, Mathematische Zeitschrift, Springer New York, 251(1), (2005), 167–177. [doi]
  • Burkard, Rainer Ernst, (Generalized) Convexity and Discrete Optimization, Chapter in (Andrew Eberhard, Nicolas Hadjisavvas, Luc, Dinh The, eds.), Springer, (2005), 23–37.
  • Peter Grabner, Clemens Heuberger, Helmut Prodinger and Jörg Thuswaldner, Analysis of linear combination algorithms in cryptography, ACM Transactions on Algorithms, Association of Computing Machinery, 1(1), (2005), 123–142.
  • Johannes Hatzl, Reverse Median Problems on Graphs, In Oberwolfach Report No. 50/2005, ., (2005), 2854–2856.
  • Wolfgang Woess, A note on the norms of transition operators on lamplighter graphs and groups, International journal of algebra and computation, World Scientific Publishing Co Pte Ltd, 15(5-6), (2005), 1261–1272. [doi]
  • Burkard, Rainer Ernst and Johannes Hatzl, Review, extensions and computational comparison of MILP formulations for scheduling of batch processes, Computers & chemical engineering, Elsevier B.V., 29, (2005), 1752–1769.
  • Hansjörg Albrecher and Wim Schoutens, Static hedging of Asian options under stochastic volatility models using Fast Fourier transform, Chapter in , Wiley, (2005), 129–148.

2004

  • Sara Brofferio, Renewal theory on the affine group of an oriented tree, Journal of theoretical probability, Springer New York, 17(4), (2004), 819–859. [doi]
  • Hansjörg Albrecher, The Valuation of Asian Options in Market Models of Exponential Levy Type, In Proceedings of the 2nd Actuarial and Financial Mathematics Day, Royal Flemish Academy of Belgium for Arts and Sciences, ., (2004), 11–20.
  • Burkard, Rainer Ernst and Vladimir Deineko, On the Euclidean TSPwith a permuted Van der Veen matrix, Information Processing Letters, Elsevier B.V., 91, (2004), 259–262.
  • Hansjörg Albrecher, Risk Measures in Finance and Insurance: Mathematical and Practical Aspects, PhD thesis, , (2004).
  • Anders Karlsson and Markus Neuhauser, The Bass conjecture and growth in groups, Colloquium Mathematicum, Institute of Mathematics, Polish Academy of Sciences, 100, (2004), 23–27.
  • Cartwright, Donald Ian and Wolfgang Woess, Isotropic random walks in a building of type A_d , Mathematische Zeitschrift, Springer New York, 247, (2004), 101–135. [doi]
  • Burkard, Rainer Ernst, Y. Lin and Z. Zhang, Weight reduction problems with certain bottleneck objectives, European journal of operational research, Elsevier B.V., 153, (2004), 191–199.
  • Peter Grabner, Clemens Heuberger and Helmut Prodinger, Distribution results for low-weight binary representations for pairs of integers, Theoretical computer science, Elsevier B.V., 319, (2004), 307–331. [doi]
  • Elisabeth Gassner, Variants of the Assignment Problem and of the Transportation Problem, PhD thesis, , (2004).
  • Clemens Heuberger, Alain Togbé and Volker Ziegler, Automatic solution of families of thue equations and an example of degree 8, Journal of symbolic computation, Academic Press, 38, (2004), 1145–1163. [doi]
  • Hansjörg Albrecher, Jürgen Hartinger and Robert Tichy, Quasi-Monte Carlo techniques for CAT bond pricing, Monte Carlo methods and applications, de Gruyter, 10(3-4), (2004), 197–212.
  • Hansjörg Albrecher and Martin Predota, On Asian Option Pricing for NIG Levy Processes, Journal of computational and applied mathematics, Elsevier B.V., 172(1), (2004), 153–168.
  • Bettina Klinz and Wöginger, Gerhard Johannes, Minimum cost dynamic flow problems: The series-parallel case, Networks, Wiley-Liss Inc., 43, (2004), 153–162.
  • Mihyun Kang, Random walks on finite graphs with congestion points, Applied Mathematics and Computation, Elsevier Inc., 153(2), (2004), 601–610. [doi]
  • Barbara Angermeier, Inhomogeneous Markov chains, Monte Carlo simulation, and their application in Combinatorial Optimization, PhD thesis, , (2004).
  • Hansjörg Albrecher, Markov Models in Actuarial Science, Chapter in , Wiley, (2004), 1094–1096.
  • Hansjörg Albrecher and O. Boxma, A ruin model with dependence between claim sizes and claim intervals, Insurance / Mathematics & economics, Elsevier B.V., 35(2), (2004), 245–254.
  • Burkard, Rainer Ernst, Carmen Pleschiutschnig and Jianzhong Zhang, Inverse p-median problems, Discrete optimization, Elsevier B.V., no. 1, (2004), 23–39.
  • Burkard, Rainer Ernst and Johannes Hatzl, Mixed-integer linear programs for batch processes, In Discrete optimization methods in production and logistics (DOM'2004), ., (2004), 108–113.
  • Random Walks and Geometry, (Kaimanovich, Vadim A., Klaus Schmidt, Wolfgang Woess, eds.), de Gruyter, (2004).
  • Bernhard Krön and Elmar Teufl, Asymptotics of the Transition Probabilities of the Simple Random Walk on Self-Similar Graphs, Transactions of the American Mathematical Society, American Mathematical Society, 356, (2004), 393–414.
  • Hansjörg Albrecher, Operational Time, Chapter in , Wiley, (2004), 1207–1208.
  • Bernhard Krön, Growth of self-similar graphs, Journal of graph theory, Wiley-Liss Inc., 45, (2004), 224–239.
  • Gilch, Lorenz Alexander and Andreas Dolzmann, Generic Hermitian Quantifier Elimination, In Artificial Intelligence and Symbolic Computation, 7th International Conference, AISC 2004, Proceedings (Bruno Buchberger, John Campbell, eds.), Springer, (2004), 80–93.
  • Clemens Heuberger, Minimal Expansions in Redundant Number Systems: Fibonacci Bases and Greedy Algorithms, Periodica mathematica Hungarica, Springer Netherlands, 49, (2004), 65–89.
  • Sophie Frisch, Integrally closed domains, minimal polynomials, and null ideals of matrices, Communications in Algebra, Taylor and Francis Ltd., 32(5), (2004), 2015–2017. [doi]
  • Mihyun Kang, Efficiency test of pseudorandom number generators using random walks, Journal of computational and applied mathematics, Elsevier B.V., 174(1), (2004), 165–177. [doi]
  • Franz Lehner, Cumulants in Noncommutative Probability Theory I. Noncommutative Exchangeability Systems, Mathematische Zeitschrift, Springer New York, 248, (2004), 67–100. [doi]
  • Hansjörg Albrecher, Discussion of "Optimal Dividends: Analysis with Brownian Motion" by H. Gerber and E. Shiu, North American Actuarial Journal, Routledge, Taylor & Francis Group, 8(2), (2004), 111–113.
  • Ecaterina Sava-Huss, Nonparametrical statistical tests, PhD thesis, , (2004).
  • Clemens Heuberger, Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results, Journal of combinatorial optimization, Springer Netherlands, 8, (2004), 329–361. [doi]

2003

  • Hansjörg Albrecher, Reinhold Kainhofer and Robert Tichy, Simulation Methods in Ruin Models with Non-linear Dividend Barriers, Mathematics and Computers in Simulation, Elsevier B.V., 62, (2003), 277–287.
  • Burkard, Rainer Ernst and P. Butkovic, Max-algebra and the linear assignment problem, Mathematical programming, Springer Verlag, 98, (2003), 415–429.
  • Markus Neuhauser, Kazhdan's property T for the symplectic group over a ring, Bulletin of the Belgian Mathematical Society - Simon Stevin, Belgian Mathematical Society, 10(4), (2003), 537–550.
  • Peter Grabner, Clemens Heuberger and Helmut Prodinger, Subblock occurrences in signed digit representations, Glasgow mathematical journal, Cambridge University Press, 45, (2003), 427–440. [doi]
  • Clemens Heuberger, On planarity and colorability of circulant graphs, Discrete Mathematics, Elsevier B.V., 268, (2003), 153–169. [doi]
  • Guangting Chen and Burkard, Rainer Ernst, Constrained Steiner trees in Halin graphs, RAIRO / Operations research, EDP Sciences, 37, (2003), 179–194.
  • Franz Lehner, Cumulants, lattice paths, and orthogonal polynomials, Discrete Mathematics, Elsevier B.V., 270, (2003), 177–191. [doi]
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Which cost matrices are immune against the transportation paradox?, Discrete applied mathematics, Elsevier B.V., 130, (2003), 495–501. [doi]
  • Manuel Bodirsky, Clemens Gröpl and Mihyun Kang, Generating labeled planar graphs uniformly at random, In Automata, Languages and Programming, Springer, 2719, (2003), 1095–1107. [doi]
  • Tullio Ceccherini-Silberstein and Wolfgang Woess, Growth sensitivity of context-free languages, Theoretical computer science, Elsevier B.V., 307, (2003), 103–116.
  • Matthias Ehrgott and Dagmar Tenfelde-Podehl, Computation of ideal and Nadir values and implications for their use in MCDM methods, European journal of operational research, Elsevier B.V., 151, (2003), 119–139.
  • Fractals in Graz 2001: Analysis - Dynamics - Geometry - Stochastics, (Peter Grabner, Wolfgang Woess, eds.), Birkhäuser, (2003).
  • Hansjörg Albrecher, Jürgen Hartinger and Robert Tichy, Multivariate approximation methods for the pricing of catastrophe-linked bonds, International series of numerical mathematics, 145, (2003), 21–39.
  • Sara Brofferio, Speed of stochastic locally contractive systems, The annals of probability, Institute of Mathematical Statistics, 31(4), (2003), 2040–2067. [doi]
  • Mihyun Kang, First hitting times of simple random walks on graphs with congestion points, International journal of mathematics and mathematical sciences, Hindawi Publishing Corporation, no. 30, (2003), 1911–1922. [doi]
  • Franz Lehner, Cumulants in noncommutative probability theory II.Generalized Gaussian random variables, Probability theory and related fields, Springer New York, 127(3), (2003), 407–422. [doi]
  • Manuel Bodirsky, Clemens Gröpl and Mihyun Kang, Decomposing, counting and generating unlabeled cubic planar graphs uniformly at random, In European Conference on Combinatorics, Graph Theory and Applications, ., (2003), 61–66.
  • Clemens Heuberger and Helmut Prodinger, Carry propagation in signed digit representations, European journal of combinatorics, Academic Press, 24(3), (2003), 293–320. [doi]
  • Burkard, Rainer Ernst and Helidon Dollani, Center Problems with pos/neg weights on trees, European journal of operational research, Elsevier B.V., 145, (2003), 483–495.
  • Burkard, Rainer Ernst and Peter Butkovic, Finding all essential terms of characteristic maxpolynomial, Discrete applied mathematics, Elsevier B.V., 130, (2003), 367–380.
  • Wolfgang Woess, Generating function techniques for random walks on graphs, Chapter in , American Mathematical Society, 338, (2003), 380–414.

2002

  • Kaimanovich, Vadim A. and Wolfgang Woess, Boundary and entropy of space homogeneous Markov chains, The annals of probability, Institute of Mathematical Statistics, 30, (2002), 323–363.
  • Elisabeth Gassner, Maximal spannende Baumprobleme mit einer Hierarchie von zwei Entscheidungsträgern, PhD thesis, , (2002).
  • Burkard, Rainer Ernst, Selected topics in assignment problems, Discrete applied mathematics, Elsevier B.V., 123, (2002), 257–302.
  • Hansjörg Albrecher, Reinhold Kainhofer and Robert Tichy, Efficient Simulation Techniques for a Generalized Ruin Model, Grazer mathematische Berichte, 245, (2002), 79–110.
  • Franz Lehner, Free cumulants and enumeration of connected partitions, European journal of combinatorics, Academic Press, 23(8), (2002), 1025–1031. [doi]
  • Dagmar Tenfelde-Podehl and H.W. Hamacher, Entropie und Chaos in Stadt und Verkehr, Shaker-Verlag GmbH, (2002).
  • Clemens Heuberger, Minimal Redundant Digit Expansions in the Gaussian Integers, Journal de théorie des nombres de Bordeaux, Université Bordeaux 1, 14, (2002), 517–528.
  • Burkard, Rainer Ernst, T. Fortuna and C.A.J. Hurkens, Makespan minimization of chemical batch processes using non-uniform time-grids, Computers & chemical engineering, Elsevier B.V., 26, (2002), 1321–1332.
  • Burkard, Rainer Ernst and H. Dollani, A note on the robust 1-center problem on trees, Annals of Operations Research, Springer Netherlands, 110, (2002), 68–82.
  • Hansjörg Albrecher and Josef Kantor, Simulation of ruin probabilities for risk processes of Markovian type, Monte Carlo methods and applications, de Gruyter, 8(2), (2002), 111–127.
  • Amnon Rosenmann and Ziyad Hanna, Alignability equivalence of synchronous sequential circuits, In Seventh IEEE International High-Level Design Validation and Test Workshop 2002, Cannes, France, (2002), 111–114. [doi]
  • Tullio Ceccherini-Silberstein and Wolfgang Woess, Growth and ergodicity of context-free languages, Transactions of the American Mathematical Society, American Mathematical Society, 354, (2002), 4597–4625.
  • Clemens Heuberger, Attila Pethö and Robert Tichy, Thomas' family of Thue equations over imaginary quadratic fields, Journal of symbolic computation, Academic Press, 34, (2002), 437–449. [doi]
  • Wolfgang Woess, Erratum: Heat diffusion on homogeneous trees (Note on a paper by Medolla and Setti), Bolletino della Unione Matematica Italiana / B, Zanichelli Editore SpA, 5-B, (2002), 259–260.
  • Eranda Dragoti-Cela, Assignment problems, Chapter in , Oxford University Press, (2002), 661–678.
  • Clemens Heuberger, On Hamiltonian Toeplitz Graphs, Discrete Mathematics, Elsevier B.V., 245, (2002), 107–125. [doi]
  • Hansjörg Albrecher and Martin Predota, Bounds and approximations for discrete Asian options in a variance-gamma model, Grazer mathematische Berichte, 345, (2002), 35–57.
  • Hansjörg Albrecher, Metric distribution results for sequences (q_n a), Mathematica Slovaca, deGruyter, 52(2), (2002), 195–206.
  • Tatiana Nagnibeda and Wolfgang Woess, Random walks on trees with finitely many cone types, Journal of theoretical probability, Springer New York, 15, (2002), 383–422.
  • Burkard, Rainer Ernst, The travelling salesman problem, Chapter in , Oxford University Press, (2002), 616–624.
  • Dagmar Tenfelde-Podehl and H.W. Hamacher, Gentechnologie - Fluch oder Segen?, Shaker-Verlag GmbH, (2002).
  • Combinatorial and global optimization, (P. Pardalos, A. Migdalas, Burkard, Rainer Ernst, eds.), World Scientific, 14, (2002).
  • Hansjörg Albrecher and Reinhold Kainhofer, Risk Theory with a Nonlinear Dividend Barrier, Computing , Springer Wien, 68, (2002), 289–311. [doi]

2001

  • Mathematics of industrial systems V, (Burkard, Rainer Ernst, T. Ibaraki, W.R. Pulleyblank, H. Blank, G. Mirta, S. Noble, eds.), Kluwer Academic Publishers, 107, (2001).
  • Burkard, Rainer Ernst, Transportation problems, Chapter in , Physica-Verlag, (2001), 249–261.
  • Eranda Dragoti-Cela, NP-hard location problems: efficiently solvable special cases and lower bounds, PhD thesis, , (2001).
  • Clemens Heuberger and Helmut Prodinger, On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis, Computing , Springer Wien, 66, (2001), 377–393.
  • Clemens Heuberger, On Explicit Bounds for the Solutions of a Class of Parametrized Thue Equations of Arbitrary Degree, Monatshefte für Mathematik, Springer Wien, 132, (2001), 325–339.
  • Burkard, Rainer Ernst, Helidon Dollani and Thach, Phan Thien, Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave network flow problem in acyclic networks, Journal of global optimization, Springer Netherlands, 19, (2001), 121–139.
  • Burkard, Rainer Ernst, H. Dollani, Yixun Lin and Günther Rothe, The obnoxious center problem on a tree, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 14, (2001), 498–509.
  • Burkard, Rainer Ernst, Bettina Klinz and Jianzhong Zhang, Bottleneck capacity expansion problems with general budget constraints, RAIRO / Operations research, EDP Sciences, 35, (2001), 1–20.
  • Franz Lehner and Philippe Biane, Computation of some examples of Brown's spectral measure in free probability, Colloquium Mathematicum, Institute of Mathematics, Polish Academy of Sciences, 90(2), (2001), 181–211.
  • Burkard, Rainer Ernst, Bettina Klinz, Yixun Lin and Jason Zhang, Capacity expansion and weight reduction problems, In Proceedings of the 6th International Symposium on Operational Research, Slovenian Society Informatika, (2001), 119–124.
  • Rainer Burkard, Trees and paths: graph optimization problems with industrial applications, Chapter in , Springer, 1739, (2001), 1–38.
  • Bernhard Krön, End compactifications in non-locally-finite-graphs, Mathematical proceedings of the Cambridge Philosophical Society, Cambridge University Press, 131, (2001), 427–443.
  • Burkard, Rainer Ernst and Helidon Dollani, Robust problems with pos/neg weights on a tree, Networks, Wiley-Liss Inc., 38, (2001), 102–113.
  • Amnon Rosenmann, Subgroups of finite index and the fc-localization, Communications in Algebra, Taylor and Francis Ltd., 29(5), (2001), 1983–1991. [doi]
  • Hansjörg Albrecher, Jozef Teugels and Robert Tichy, On a gamma series expansion for the time-dependent probability of collective ruin, Insurance / Mathematics & economics, Elsevier B.V., 29(3), (2001), 345–355.
  • Clemens Heuberger, On a conjecture of E. Thomas concerning parametrized Thue equations, Acta Arithmetica, Instytut Matematyczny, 98, (2001), 375–394.
  • Sophie Frisch, Nullstellensatz and Skolem properties for integer-valued polynomials, Journal für die reine und angewandte Mathematik, de Gruyter, 536, (2001), 31–42. [doi]
  • Clemens Heuberger, Graphen und Minimale Ziffernentwicklungen, PhD thesis, , (2001).
  • Hansjörg Albrecher, Ruin Models in Finance and Insurance: Exact Solutions and Simulation Methodology, PhD thesis, , (2001).
  • Franz Lehner, On the Computation of Spectra in Free Probability, Journal of Functional Analysis, Academic Press, 183(2), (2001), 451–471. [doi]
  • Amnon Rosenmann, On rank, root and equations in free groups, International journal of algebra and computation, World Scientific Publishing Co Pte Ltd, 11(3), (2001), 375–390. [doi]
  • Wolfgang Woess, Heat diffusion on homogenous trees (Note on a paper by Medolla and Setti), Bolletino della Unione Matematica Italiana / B, Zanichelli Editore SpA, no. 4-B, (2001), 703–709.

2000

  • Rainer Burkard, Location problems: from classical geometry to managerial decisions, Central European Journal of Operations Research, Springer, 8, (2000), 3–11.
  • Clemens Heuberger, On general families of parametrized Thue equations, In Algebraic number theory and Diophantine analysis, Walter de Gruyter & Co., (2000), 215–238.
  • Wolfgang Woess, Random Walks on Infinite Graphs and Groups, Cambridge University Press, 138, (2000).
  • Burkard, Rainer Ernst and Eranda Dragoti-Cela, Optimal location of facilities for a two stage production process, ECMI newsletter, 28, (2000), 14–16.
  • Sophie Frisch, Paul-Jean Cahen and Jean-Luc Chabert, Interpolation domains, Journal of algebra, Academic Press, 225, (2000), 794–803.
  • Burkard, Rainer Ernst, Eranda Dragoti-Cela and Helidon Dollani, 2-Medians in networks with pos/neg weights, Discrete applied mathematics, Elsevier B.V., 105, (2000), 51–71.
  • Mathematics of industrial systems IV, (Burkard, Rainer Ernst, T. Ibararki, W.R. Pulleyblank, E. Santibanez-Gonzalez, eds.), Baltzer, 96, (2000).
  • Zur Kunst des Formalen Denkens, (Burkard, Rainer Ernst, W. Maass, Peter Weibel, eds.), Passagen Verlag, (2000).
  • Sara Brofferio and Wolfgang Woess, On transience of card shuffling, Proceedings of the American Mathematical Society, American Mathematical Society, no. 129, (2000), 1513–1519.
  • Norbert Seifter and Wolfgang Woess, Approximating graphs with polynomial growth, Glasgow mathematical journal, Cambridge University Press, 42, (2000), 1–8.
  • Hansjörg Albrecher, Jiri Matousek and Robert Tichy, Discrepancy of point sequences on fractal sets, Publicationes Mathematicae, Kossuth Lajos Tudomanyegyetem, 56(3-4), (2000), 233–249.
  • Amnon Rosenmann, An asymptotic invariant of surface groups, In Computational and geometric aspects of modern algebra (Edinburgh, 1998), Cambridge University Press, (2000), 246–253.
  • Burkard, Rainer Ernst, P. Deuflhard, A. Jameson, J.-L. Lions and G. Strang, Computational mathematics driven by industrial problems, Springer, 1739, (2000).
  • Hansjörg Albrecher and Robert Tichy, Zur Konvergenz eines Lösungsverfahrens für ein Risikomodell mit gammaverteilten Schäden, Schweizerische Aktuarvereinigung: Mitteilungen, no. 2, (2000), 115–127.
  • Burkard, Rainer Ernst, Zuordnungsprobleme: Ein Streifzug durch die kombinatorische Optimierung, Chapter in , Passagen Verlag, (2000), 193–207.

1999

  • Burkard, Rainer Ernst, Karin Feldbacher, Bettina Klinz and Wöginger, Gerhard Johannes, Minimum cost strong network orientation problems: Classification, algorithms and complexity, Networks, Wiley-Liss Inc., 33(1), (1999), 57–70. [doi]
  • Clemens Heuberger and Robert Tichy, Effective solution of families of Thue Equations containing several parameters, Acta Arithmetica, Instytut Matematyczny, 91, (1999), 147–163.
  • Eranda Dragoti-Cela, Karisch, Stefan E., Jens Clausen and Torn Espersen, A dual framework for lower bounds of the quadratic assignment problem based on linearization, Computing , Springer Wien, 63, (1999), 351–403.
  • Burkard, Rainer Ernst and Eranda Dragoti-Cela, Linear assignment problems and extensions, Chapter in , Kluwer Academic Publishers, (1999), 75–149.
  • Clemens Heuberger and Maohua Le, On the generalized Ramanujan-Nagell equation x^2+D=p^z, Journal of Number Theory, Academic Press, 78, (1999), 312–331. [doi]
  • Mihali Hujter, Bettina Klinz and Wöginger, Gerhard Johannes, A note on the complexity of the transportation problem with a permutable demand vector, Mathematical Methods of Operations Research, Physica-Verlag, 50, (1999), 9–16.
  • Sophie Frisch, Reinhard Winkler, Robert Tichy and Milan Pasteka, Finitely Additive Measures on Groups and Rings, Rendiconti del Circolo Matematico di Palermo, Circolo Matematico di Palermo, 48, (1999), 323–340.
  • Clemens Heuberger, On Families of parametrized Thue Equations, Journal of Number Theory, Academic Press, (1999), 45–61. [doi]
  • Sophie Frisch, Polynomial functions on finite commutative rings, In Advances in Commutative Ring Theory, Dekker, 205, (1999), 323–336.
  • Stefan Meusel and Burkard, Rainer Ernst, A transportation problem with a permuted demand vector, Mathematical Methods of Operations Research, Physica-Verlag, 50, (1999), 1–8.
  • Burkard, Rainer Ernst, S. Karisch and Franz Rendl, QAPLIB- A quadratic assignment problem libraray, European journal of operational research, Elsevier B.V., 55, (1999), 115–119.
  • Bettina Klinz, Well-solvable Cases of Hard Combinatorial Optimization Problems - the Role of Special Cost Matrices and Related Input Restrictions, PhD thesis, , (1999).
  • Hansjörg Albrecher, Dynamische Systeme und Fraktale, PhD thesis, , (1999).
  • Franz Lehner, Computing norms of free operators with matrix coefficients, American Journal of Mathematics, Johns Hopkins University Press, 121(3), (1999), 453–486.
  • Clemens Heuberger, Effective Solution of Diophantine Equations, PhD thesis, , (1999).
  • Clemens Heuberger, Minimal expansions in redundant number systems and shortest paths in graphs, Computing , Springer Wien, 63, (1999), 341–349. [doi]
  • Bettina Klinz and Wöginger, Gerhard Johannes, A note on the bottleneck graph partition problem, Networks, Wiley-Liss Inc., 33(3), (1999), 189–191.
  • Burkard, Rainer Ernst and Tiziana Fortuna, Batch processing in the chemical industry: a model based on nonuniform time discretization., In Proceedings of the 5th International Symposium on Operational Research, Slovenian Society Informatika, (1999), 1–6.
  • Sophie Frisch, Interpolation by integer-valued polynomials, Journal of algebra, Academic Press, 211, (1999), 562–577.
  • Burkard, Rainer Ernst, OR Utopia, European journal of operational research, Elsevier B.V., 119, (1999), 224–234.
  • Integer programming and combinatorial optimization, (Burkard, Rainer Ernst, G. Cornuejols, G.J. Woeginger, eds.), Springer, 1610, (1999).
  • Burkard, Rainer Ernst, Vladimir Deineko and Wöginger, Gerhard Johannes, The traveling salesman problem on permuted Monge matrices, Journal of combinatorial optimization, Springer Netherlands, 2, (1999), 333–350.
  • Burkard, Rainer Ernst and M.M. Miatselski, Volume maximization and orthoconvex approximation of orthogons, Computing , Springer Wien, 63, (1999), 317–330.
  • Amnon Rosenmann, When Schreier transversals grow wild, In Groups St. Andrews 1997 in Bath, II, Cambridge University Press, (1999), 639–647.
  • Bettina Klinz and Wöginger, Gerhard Johannes, The Steiner tree problem in Kalmanson matrices and in circulant matrices, Journal of combinatorial optimization, Springer Netherlands, 3, (1999), 51–58.

1998

  • Rainer Burkard, Assignment problems, In Fundamentals - Foundations of Computer Science, Österreichische Computer Gesellschaft, (1998), 49–61.
  • Burkard, Rainer Ernst, Bettina Klinz, Rüdiger Rudolf and Marc Wennink, A process scheduling problem arising from chemical production planning, Optimization methods & software, Taylor and Francis Ltd., (1998), 175–196.
  • Sophie Frisch, Binomial coefficients generalized with respect to a discrete valuation, In Applications of Fibonacci Numbers, vol 7, Kluwer, 7, (1998), 133–144.
  • Burkard, Rainer Ernst, Michael Kocher and Rüdiger Rudolf, Rounding strategies of mixed integer programs arising from chemical production planning, Yugoslav journal of operations research, University of Belgrade, 8, (1998), 9–23.
  • Bettina Klinz and Wöginger, Gerhard Johannes, One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs, Operations research letters, Elsevier B.V., 22, (1998), 119–127. [doi]
  • Burkard, Rainer Ernst, Eranda Dragoti-Cela, Günther Rothe and Wöginger, Gerhard Johannes, The quadratic assignment problem with a monotone anti-Monge matrix and a symmetric toeplitz matrix: Easy and hard cases, Mathematical programming, Springer Verlag, 82, (1998), 128–158.
  • Burkard, Rainer Ernst and Vladimir Deineko, On the traveling salesman problem with a relaxed Monge matrix, Information Processing Letters, Elsevier B.V., 67, (1998), 231–237.
  • Z. Tan and Burkard, Rainer Ernst, The simple block iterative algorithm of an extended entropy model and its convergence, Acta mathematicae applicatae Sinica / English series, Springer Verlag, 14, (1998), 96–105.
  • Burkard, Rainer Ernst, Eranda Dragoti-Cela, V.M. Demidenko, N.N. Metelski and Wöginger, Gerhard Johannes, A unified approach to simple special cases of extremal permutations, Optimization, Taylor and Francis Ltd., 44, (1998), 123–138.
  • Eranda Dragoti-Cela, Quadratic Assignment Problems: Theory and Applications, Kluwer Academic Publichers, (1998).
  • Tibor Dudas, Bettina Klinz and Wöginger, Gerhard Johannes, The k-minimum spanning tree problem in graded matrices, Computers & mathematics with applications, Elsevier Limited, 36, (1998), 61–67.
  • Burkard, Rainer Ernst, Vladimir Deineko and Wöginger, Gerhard Johannes, The Travelling Salesman and the PQ-Tree, Mathematics of operations research, INFORMS Inst.for Operations Res.and the Management Sciences, 23, (1998), 613–623.
  • Burkard, Rainer Ernst and Jakob Krarup, A linear Algorithm for the pos/neg-weighted 1-median problem on a cactus, Computing , Springer Wien, 60, (1998), 193–215.
  • Burkard, Rainer Ernst and Yong He, A note on multifit scheduling for uniform machines, Computing , Springer Wien, 61, (1998), 277–283.
  • Burkard, Rainer Ernst, Yong He and Hans Kellerer, A linear compound algorithm for uniform machines, Computing , Springer Wien, 61, (1998), 1–9.
  • Burkard, Rainer Ernst, Vladimir Deineko, van Dal, R., van der Veen, J. and Wöginger, Gerhard Johannes, Well-solvable special cases of the TSP, SIAM review, Society for Industrial and Applied Mathematics Publications, 40, (1998), 496–546.
  • Burkard, Rainer Ernst, Eranda Dragoti-Cela, P.M. Pardalos and L.S. Pitsoulis, The quadratic assignment problem, Chapter in , Kluwer Academic Publishers, 2, (1998), 241–337.
  • Hansjörg Albrecher, Dependent risks and ruin probabilities in insurance, ., (1998).
  • Tibor Dudas, Bettina Klinz and Wöginger, Gerhard Johannes, The computational complexity of multi-level programming problems revisited, Chapter in , Kluwer Academic Publishers, 20, (1998), 165–179.
  • Rainer Burkard, Communication network assignment problem (CAP), Chapter in , Kluwer, (1998), 268–270.
  • Clemens Heuberger, Attila Pethö and Robert Tichy, Complete solution of parametrized Thue equations, Acta mathematica et informatica Universitatis Ostraviensis, Ostravská univerzita, 6, (1998), 93–113.
  • Clemens Heuberger, On a Family of Quintic Thue Equations, Journal of symbolic computation, Academic Press, 26(2), (1998), 173–185. [doi]
  • Mathematics of industrial systems III, (Burkard, Rainer Ernst, T. Ibararki, W.R. Pulleyblank, eds.), Baltzer, 76, (1998).

1997

  • Sophie Frisch, On the minimal distance between group tables, Acta scientiarum mathematicarum, University of Szeged, 63, (1997), 341–351.
  • Burkard, Rainer Ernst, V.M. Demidenko and Rüdiger Rudolf, A general approach for identifying special cases of the traveling salesman problem with a fixed optimal tur, OR transactions, 1, (1997), 41–53.
  • Burkard, Rainer Ernst and Eranda Dragoti-Cela, Quadratic and three-dimensional assignments: An annotated bibliography, Chapter in , J. Wiley, (1997), 373–391.
  • Bettina Klinz, Wöginger, Gerhard Johannes and Tibor Dudas, The computational complexity of Steiner tree problems in graded matrices, Applied Mathematics Letters, Elsevier Limited, 10(4), (1997), 35–39. [doi]
  • Clemens Heuberger, Algorithmische Lösung parametrisierter Thue-Gleichungen, PhD thesis, , (1997).
  • Burkard, Rainer Ernst, S. Karisch and Franz Rendl, QAPLIB- A quadratic assignment problem library. Update, Journal of global optimization, Springer Netherlands, 10, (1997), 391–403.
  • Burkard, Rainer Ernst, Ulrich Pferschy and Rüdiger Rudolf, Waste treatment in a metal-processing plant, In Operations Research Proceedings, Springer, (1997), 392–397.
  • Mathematics of Industrial systems II, (Burkard, Rainer Ernst, T. Ibararki, M. Queyranne, eds.), Baltzer, 69, (1997).
  • Burkard, Rainer Ernst, Eranda Dragoti-Cela and Tibor Dudas, A communication assignment problem on trees: Heuristics and asymptotic behaviour, Chapter in (Pardalos, Panos M., ed.), Springer, 450, (1997), 127–155.
  • Franz Lehner, A characterization of the Leinert property, Proceedings of the American Mathematical Society, American Mathematical Society, 125(11), (1997), 3423–3431.
  • Burkard, Rainer Ernst, Efficiently solvable special cases of hard combinatorial optimization problems, Mathematical programming, Springer Verlag, 79, (1997), 55–69.
  • Burkard, Rainer Ernst and G. Zhang, Bounded space on-line variable-sized bin packing, Acta Cybernetica, University of Szeged, 13, (1997), 63–76.
  • Algorithms- ESA '97, (Burkard, Rainer Ernst, G.J. Wöginger, eds.), Springer, 1284, (1997).
  • Amnon Rosenmann, The normalized cyclomatic quotient associated with presentations of finitely generated groups, Israel journal of mathematics, Springer New York, 99, (1997), 285–313.
  • Franz Lehner, Free operators with operator coefficients, Colloquium Mathematicum, Institute of Mathematics, Polish Academy of Sciences, 74(2), (1997), 321–328.
  • Burkard, Rainer Ernst, Waste water minimization in metal industry, In Proceedings of the 4th International Symposium on Operational Research, Slovenian Society Informatika, (1997), 77–82.
  • Burkard, Rainer Ernst, Ulrich Pferschy and Rüdiger Rudolf, On-line waste management in a galvanization plant, Yugoslav journal of operations research, University of Belgrade, 7, (1997), 1–13.
  • Yang, Qi Fan., Burkard, Rainer Ernst, Eranda Dragoti-Cela and Wöginger, Gerhard Johannes, Hamiltonian cycles in circulant digraphs with two stripes, Discrete Mathematics, Elsevier B.V., 176, (1997), 233–254.