Institute of Discrete Mathematics

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

1997

P.J. Grabner and W. Woess, Functional iterations and periodic oscillations for simple random walk on the Sierpiński graph, Stochastic Processes and their Applications, Elsevier B.V., (1997).
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.
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.
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.
Franz Lehner, Free operators with operator coefficients, Colloquium Mathematicum, Institute of Mathematics, Polish Academy of Sciences, 74(2), (1997), 321–328.
Amnon Rosenmann, The normalized cyclomatic quotient associated with presentations of finitely generated groups, Israel Journal of Mathematics, Springer, 99, (1997), 285–313.
Algorithms- ESA '97, (Burkard, Rainer Ernst, G.J. Wöginger, eds.), Springer, 1284, (1997).
Burkard, Rainer Ernst and G. Zhang, Bounded space on-line variable-sized bin packing, Acta Cybernetica, University of Szeged, 13, (1997), 63–76.
Burkard, Rainer Ernst, Efficiently solvable special cases of hard combinatorial optimization problems, Mathematical Programming, Springer, 79, (1997), 55–69.
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, Eranda Çela and Tibor Dudas, A communication assignment problem on trees: Heuristics and asymptotic behaviour, Chapter in (Pardalos, Panos M., ed.), Springer, 450, (1997), 127–155.
Mathematics of Industrial systems II, (Burkard, Rainer Ernst, T. Ibararki, M. Queyranne, eds.), Baltzer, 69, (1997).
Burkard, Rainer Ernst, Ulrich Pferschy and Rüdiger Rudolf, Waste treatment in a metal-processing plant, In Operations Research Proceedings, Springer, (1997), 392–397.
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.
Clemens Heuberger, Algorithmische Lösung parametrisierter Thue-Gleichungen, PhD thesis, , (1997).
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]
Burkard, Rainer Ernst and Eranda Çela, Quadratic and three-dimensional assignments: An annotated bibliography, Chapter in , J. Wiley, (1997), 373–391.
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.
Sophie Frisch, On the minimal distance between group tables, Acta scientiarum mathematicarum, University of Szeged, 63, (1997), 341–351.
T. Herendi, T. Siegl and Tichy, R. F., Fast Gaussian random number generation using linear transformations, Computing, Springer Wien, 59(2), (1997), 163–181. [doi]
Bernhard Klinger and Tichy, Robert F., Polynomial discrepancy of sequences, Journal of Computational and Applied Mathematics, Elsevier B.V., 84(1), (1997), 107–117. [doi]

1998

Mathematics of industrial systems III, (Burkard, Rainer Ernst, T. Ibararki, W.R. Pulleyblank, eds.), Baltzer, 76, (1998).
Clemens Heuberger, On a Family of Quintic Thue Equations, Journal of Symbolic Computation, Elsevier B.V., 26(2), (1998), 173–185. [doi]
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.
Rainer Burkard, Communication network assignment problem (CAP), Chapter in , Kluwer, (1998), 268–270.
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.
Hansjörg Albrecher, Dependent risks and ruin probabilities in insurance, ., (1998).
Burkard, Rainer Ernst, Eranda Çela, P.M. Pardalos and L.S. Pitsoulis, The quadratic assignment problem, Chapter in , Kluwer Academic Publishers, 2, (1998), 241–337.
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, Yong He and Hans Kellerer, A linear compound algorithm for uniform machines, Computing, Springer Wien, 61, (1998), 1–9.
Burkard, Rainer Ernst and Yong He, A note on multifit scheduling for uniform machines, Computing, Springer Wien, 61, (1998), 277–283.
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, 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.
Tibor Dudas, Bettina Klinz and Wöginger, Gerhard Johannes, The k-minimum spanning tree problem in graded matrices, Computers & Mathematics with Applications, Elsevier B.V., 36, (1998), 61–67.
Eranda Dragoti-Cela, Quadratic Assignment Problems: Theory and Applications, Kluwer Academic Publishers, (1998).
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.
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 and Vladimir Deineko, On the traveling salesman problem with a relaxed Monge matrix, Information Processing Letters, Elsevier B.V., 67, (1998), 231–237.
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, 82, (1998), 128–158.
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, 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.
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, 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.
Rainer Burkard, Assignment problems, In Fundamentals - Foundations of Computer Science, Österreichische Computer Gesellschaft, (1998), 49–61.
Grabner, Peter J. and Tichy, Robert F., Equidistribution and Brownian motion on the Sierpiński gasket, Monatshefte fur Mathematik, Springer Wien, 125(2), (1998), 147–164. [doi]
Tichy, Robert F., Numerical analysis of Jacobi series - A quasi-Monte-Carlo approach, Mathematics and Computers in Simulation, Elsevier B.V., 47(2-5), (1998), 473–481. [doi]

1999

Bettina Klinz and Wöginger, Gerhard Johannes, The Steiner tree problem in Kalmanson matrices and in circulant matrices, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 3, (1999), 51–58.
Amnon Rosenmann, When Schreier transversals grow wild, In Groups St. Andrews 1997 in Bath, II, Cambridge University Press, (1999), 639–647.
Burkard, Rainer Ernst and M.M. Miatselski, Volume maximization and orthoconvex approximation of orthogons, Computing, Springer Wien, 63, (1999), 317–330.
Burkard, Rainer Ernst, Vladimir Deineko and Wöginger, Gerhard Johannes, The traveling salesman problem on permuted Monge matrices, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 2, (1999), 333–350.
Integer programming and combinatorial optimization, (Burkard, Rainer Ernst, G. Cornuejols, G.J. Woeginger, eds.), Springer, 1610, (1999).
Burkard, Rainer Ernst, OR Utopia, European Journal of Operational Research, Elsevier B.V., 119, (1999), 224–234.
Sophie Frisch, Interpolation by integer-valued polynomials, Journal of Algebra, Elsevier B.V., 211, (1999), 562–577.
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.
Bettina Klinz and Wöginger, Gerhard Johannes, A note on the bottleneck graph partition problem, Networks, Wiley-Liss Inc., 33(3), (1999), 189–191.
Clemens Heuberger, Minimal expansions in redundant number systems and shortest paths in graphs, Computing, Springer Wien, 63, (1999), 341–349. [doi]
Clemens Heuberger, Effective Solution of Diophantine Equations, 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.
Hansjörg Albrecher, Dynamische Systeme und Fraktale, PhD thesis, , (1999).
Bettina Klinz, Well-solvable Cases of Hard Combinatorial Optimization Problems - the Role of Special Cost Matrices and Related Input Restrictions, PhD thesis, , (1999).
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.
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.
Sophie Frisch, Polynomial functions on finite commutative rings, In Advances in Commutative Ring Theory, Dekker, 205, (1999), 323–336.
Clemens Heuberger, On Families of parametrized Thue Equations, Journal of Number Theory, Academic Press, (1999), 45–61. [doi]
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.
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.
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]
Burkard, Rainer Ernst and Eranda Çela, Linear assignment problems and extensions, Chapter in , Kluwer Academic Publishers, (1999), 75–149.
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.
Clemens Heuberger and Robert Tichy, Effective solution of families of Thue Equations containing several parameters, Acta Arithmetica, Instytut Matematyczny, 91, (1999), 147–163.
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]
Grabner, Peter J., Oto Strauch and Tichy, Robert F., LP-discrepancy and statistical independence of sequences, Czechoslovak Mathematical Journal, Academy of Sciences of the Czech Republic, 49(1), (1999), 97–110. [doi]
Thomas Siegl and Tichy, Robert F., A process with stochastic claim frequency and a linear dividend barrier, Insurance: Mathematics and Economics, Elsevier B.V., 24(1-2), (1999), 51–65. [doi]
F. Halter-Koch, G. Lettl, A. Pethö and Tichy, R. F., Thue equations associated with Ankeny - Brauer - Chowla number fields, Journal of the London Mathematical Society, Wiley, 60(1), (1999), 1–20. [doi]

2000

Burkard, Rainer Ernst, Zuordnungsprobleme: Ein Streifzug durch die kombinatorische Optimierung, Chapter in , Passagen Verlag, (2000), 193–207.
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, P. Deuflhard, A. Jameson, J.-L. Lions and G. Strang, Computational mathematics driven by industrial problems, Springer, 1739, (2000).
Amnon Rosenmann, An asymptotic invariant of surface groups, In Computational and geometric aspects of modern algebra (Edinburgh, 1998), Cambridge University Press, (2000), 246–253.
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.
Norbert Seifter and Wolfgang Woess, Approximating graphs with polynomial growth, Glasgow Mathematical Journal, Cambridge University Press, 42, (2000), 1–8.
Sara Brofferio and Wolfgang Woess, On transience of card shuffling, Proceedings of the American Mathematical Society, American Mathematical Society, no. 129, (2000), 1513–1519.
Zur Kunst des Formalen Denkens, (Burkard, Rainer Ernst, W. Maass, Peter Weibel, eds.), Passagen Verlag, (2000).
Mathematics of industrial systems IV, (Burkard, Rainer Ernst, T. Ibararki, W.R. Pulleyblank, E. Santibanez-Gonzalez, eds.), Baltzer, 96, (2000).
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.
Sophie Frisch, Paul-Jean Cahen and Jean-Luc Chabert, Interpolation domains, Journal of Algebra, Elsevier B.V., 225, (2000), 794–803.
Burkard, Rainer Ernst and Eranda Dragoti-Cela, Optimal location of facilities for a two stage production process, ECMI newsletter, 28, (2000), 14–16.
Wolfgang Woess, Random Walks on Infinite Graphs and Groups, Cambridge University Press, 138, (2000).
Clemens Heuberger, On general families of parametrized Thue equations, In Algebraic number theory and Diophantine analysis, Walter de Gruyter & Co., (2000), 215–238.
Rainer Burkard, Location problems: from classical geometry to managerial decisions, Central European Journal of Operations Research, Springer, 8, (2000), 3–11.
Bilu, Yuri F. and Tichy, Robert F., The Diophantine equation f(cursive Greek chi) = g(y), Acta Arithmetica, Instytut Matematyczny, 95(3), (2000), 261–288. [doi]

2001

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.
Amnon Rosenmann, On rank, root and equations in free groups, International Journal of Algebra and Computation, World Scientific, 11(3), (2001), 375–390. [doi]
Franz Lehner, On the Computation of Spectra in Free Probability, Journal of Functional Analysis, Academic Press, 183(2), (2001), 451–471. [doi]
Hansjörg Albrecher, Ruin Models in Finance and Insurance: Exact Solutions and Simulation Methodology, PhD thesis, , (2001).
Clemens Heuberger, Graphen und Minimale Ziffernentwicklungen, PhD thesis, , (2001).
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, On a conjecture of E. Thomas concerning parametrized Thue equations, Acta Arithmetica, Instytut Matematyczny, 98, (2001), 375–394.
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.
Amnon Rosenmann, Subgroups of finite index and the fc-localization, Communications in Algebra, Taylor and Francis Ltd., 29(5), (2001), 1983–1991. [doi]
Burkard, Rainer Ernst and Helidon Dollani, Robust problems with pos/neg weights on a tree, Networks, Wiley-Liss Inc., 38, (2001), 102–113.
Bernhard Krön, End compactifications in non-locally-finite-graphs, Mathematical Proceedings of the Cambridge Philosophical Society, Cambridge University Press, 131, (2001), 427–443.
Rainer Burkard, Trees and paths: graph optimization problems with industrial applications, Chapter in , Springer, 1739, (2001), 1–38.
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.
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 and Jianzhong Zhang, Bottleneck capacity expansion problems with general budget constraints, RAIRO / Operations research, EDP Sciences, 35, (2001), 1–20.
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, 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.
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.
Clemens Heuberger and Helmut Prodinger, On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis, Computing, Springer Wien, 66, (2001), 377–393.
Eranda Dragoti-Cela, NP-hard location problems: efficiently solvable special cases and lower bounds, PhD thesis, , (2001).
Burkard, Rainer Ernst, Transportation problems, Chapter in , Physica-Verlag, (2001), 249–261.
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).

2002

Hansjörg Albrecher and Reinhold Kainhofer, Risk Theory with a Nonlinear Dividend Barrier, Computing, Springer Wien, 68, (2002), 289–311. [doi]
Combinatorial and global optimization, (P. Pardalos, A. Migdalas, Burkard, Rainer Ernst, eds.), World Scientific, 14, (2002).
Dagmar Tenfelde-Podehl and H.W. Hamacher, Gentechnologie - Fluch oder Segen?, Shaker-Verlag GmbH, (2002).
Burkard, Rainer Ernst, The travelling salesman problem, Chapter in , Oxford University Press, (2002), 616–624.
Tatiana Nagnibeda and Wolfgang Woess, Random walks on trees with finitely many cone types, Journal of Theoretical Probability, Springer Science+Business Media B.V, 15, (2002), 383–422.
Hansjörg Albrecher, Metric distribution results for sequences (q_n a), Mathematica Slovaca, deGruyter, 52(2), (2002), 195–206.
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.
Clemens Heuberger, On Hamiltonian Toeplitz Graphs, Discrete Mathematics, Elsevier B.V., 245, (2002), 107–125. [doi]
Eranda Çela, Assignment problems, Chapter in , Oxford University Press, (2002), 661–678.
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.
Clemens Heuberger, Attila Pethö and Robert Tichy, Thomas' family of Thue equations over imaginary quadratic fields, Journal of Symbolic Computation, Elsevier B.V., 34, (2002), 437–449. [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.
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]
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.
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.
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.
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.
Dagmar Tenfelde-Podehl and H.W. Hamacher, Entropie und Chaos in Stadt und Verkehr, Shaker-Verlag GmbH, (2002).
Franz Lehner, Free cumulants and enumeration of connected partitions, European Journal of Combinatorics, Elsevier B.V., 23(8), (2002), 1025–1031. [doi]
Hansjörg Albrecher, Reinhold Kainhofer and Robert Tichy, Efficient Simulation Techniques for a Generalized Ruin Model, Grazer mathematische Berichte, 245, (2002), 79–110.
Burkard, Rainer Ernst, Selected topics in assignment problems, Discrete Applied Mathematics, Elsevier B.V., 123, (2002), 257–302.
Elisabeth Gassner, Maximal spannende Baumprobleme mit einer Hierarchie von zwei Entscheidungsträgern, PhD thesis, , (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.

2003

Wolfgang Woess, Generating function techniques for random walks on graphs, Chapter in , American Mathematical Society, 338, (2003), 380–414.
Burkard, Rainer Ernst and Peter Butkovic, Finding all essential terms of characteristic maxpolynomial, Discrete Applied Mathematics, Elsevier B.V., 130, (2003), 367–380.
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.
Clemens Heuberger and Helmut Prodinger, Carry propagation in signed digit representations, European Journal of Combinatorics, Elsevier B.V., 24(3), (2003), 293–320. [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.
Franz Lehner, Cumulants in noncommutative probability theory II.Generalized Gaussian random variables, Probability Theory and Related Fields, Springer, 127(3), (2003), 407–422. [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]
Sara Brofferio, Speed of stochastic locally contractive systems, The Annals of Probability, Institute of Mathematical Statistics, 31(4), (2003), 2040–2067. [doi]
Hansjörg Albrecher, Jürgen Hartinger and Robert Tichy, Multivariate approximation methods for the pricing of catastrophe-linked bonds, International Series of Numerical Mathematics, Springer Nature Switzerland AG, 145, (2003), 21–39.
Fractals in Graz 2001: Analysis - Dynamics - Geometry - Stochastics, (Peter Grabner, Wolfgang Woess, eds.), Birkhäuser, (2003).
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.
Tullio Ceccherini-Silberstein and Wolfgang Woess, Growth sensitivity of context-free languages, Theoretical Computer Science, Elsevier B.V., 307, (2003), 103–116.
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]
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]
Franz Lehner, Cumulants, lattice paths, and orthogonal polynomials, Discrete Mathematics, Elsevier B.V., 270, (2003), 177–191. [doi]
Guangting Chen and Burkard, Rainer Ernst, Constrained Steiner trees in Halin graphs, RAIRO / Operations research, EDP Sciences, 37, (2003), 179–194.
Clemens Heuberger, On planarity and colorability of circulant graphs, Discrete Mathematics, Elsevier B.V., 268, (2003), 153–169. [doi]
Peter Grabner, Clemens Heuberger and Helmut Prodinger, Subblock occurrences in signed digit representations, Glasgow Mathematical Journal, Cambridge University Press, 45, (2003), 427–440. [doi]
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.
Burkard, Rainer Ernst and P. Butkovic, Max-algebra and the linear assignment problem, Mathematical Programming, Springer, 98, (2003), 415–429.
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.
Clemens Fuchs, Attila Petho and Tichy, Robert F., On the Diophantine equation Gn(x) = Gm(P(x)): Higher-order recurrences, Transactions of the American Mathematical Society, American Mathematical Society, 355(11), (2003), 4657–4681. [doi]

2004

Clemens Heuberger, Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 8, (2004), 329–361. [doi]
Ecaterina Sava-Huss, Nonparametrical statistical tests, PhD thesis, , (2004).
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.
Franz Lehner, Cumulants in Noncommutative Probability Theory I. Noncommutative Exchangeability Systems, Mathematische Zeitschrift, Springer New York, 248, (2004), 67–100. [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]
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]
Clemens Heuberger, Minimal Expansions in Redundant Number Systems: Fibonacci Bases and Greedy Algorithms, Periodica Mathematica Hungarica, Springer Science+Business Media B.V, 49, (2004), 65–89.
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.
Bernhard Krön, Growth of self-similar graphs, Journal of Graph Theory, Wiley-Blackwell, 45, (2004), 224–239.
Hansjörg Albrecher, Operational Time, Chapter in , Wiley, (2004), 1207–1208.
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.
Random Walks and Geometry, (Kaimanovich, Vadim A., Klaus Schmidt, Wolfgang Woess, eds.), de Gruyter, (2004).
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.
Burkard, Rainer Ernst, Carmen Pleschiutschnig and Jianzhong Zhang, Inverse p-median problems, Discrete Optimization, Elsevier B.V., no. 1, (2004), 23–39.
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.
Hansjörg Albrecher, Markov Models in Actuarial Science, Chapter in , Wiley, (2004), 1094–1096.
Barbara Angermeier, Inhomogeneous Markov chains, Monte Carlo simulation, and their application in Combinatorial Optimization, PhD thesis, , (2004).
Mihyun Kang, Random walks on finite graphs with congestion points, Applied Mathematics and Computation, Elsevier Inc., 153(2), (2004), 601–610. [doi]
Bettina Klinz and Wöginger, Gerhard Johannes, Minimum cost dynamic flow problems: The series-parallel case, Networks, Wiley-Liss Inc., 43, (2004), 153–162.
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.
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.
Clemens Heuberger, Alain Togbé and Volker Ziegler, Automatic solution of families of thue equations and an example of degree 8, Journal of Symbolic Computation, Elsevier B.V., 38, (2004), 1145–1163. [doi]
Elisabeth Gassner, Variants of the Assignment Problem and of the Transportation Problem, PhD thesis, , (2004).
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]
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.
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]
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.
Hansjörg Albrecher, Risk Measures in Finance and Insurance: Mathematical and Practical Aspects, PhD thesis, , (2004).
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, 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.
Sara Brofferio, Renewal theory on the affine group of an oriented tree, Journal of Theoretical Probability, Springer Science+Business Media B.V, 17(4), (2004), 819–859. [doi]
Th Stoll and Tichy, R. F., The Diophantine equation α( m x) + β( n y) = γ, Publicationes Mathematicae, Kossuth Lajos Tudomanyegyetem, 64(1-2), (2004), 155–165.

2005

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.
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.
Wolfgang Woess, A note on the norms of transition operators on lamplighter graphs and groups, International Journal of Algebra and Computation, World Scientific, 15(5-6), (2005), 1261–1272. [doi]
Johannes Hatzl, Reverse Median Problems on Graphs, In Oberwolfach Report No. 50/2005, ., (2005), 2854–2856.
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.
Burkard, Rainer Ernst, (Generalized) Convexity and Discrete Optimization, Chapter in (Andrew Eberhard, Nicolas Hadjisavvas, Luc, Dinh The, eds.), Springer, (2005), 23–37.
Markus Neuhauser, Relative property (T) and related properties of wreath products, Mathematische Zeitschrift, Springer New York, 251(1), (2005), 167–177. [doi]
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.
Hansjörg Albrecher, A note on the asymptotic behaviour of bottleneck problems, Operations Research Letters, Elsevier B.V., 33(2), (2005), 183–186.
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.
Mihyun Kang and O. Pikhurko, Maximum Kr+1-free graphs which are not r-partite, Matematychni studii, VNTL Publishers, 24(1), (2005), 12–20.
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.
Wolfgang Woess, Lamplighters, Diestel-Leader graphs, random walks, and harmonic functions, Combinatorics, Probability & Computing, Cambridge University Press, 14(3), (2005), 415–433. [doi]
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.
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.
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.
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.
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.
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]
Elisabeth Gassner, Deterministic Online Optical Call Admission Revisited, In Oberwolfach reports, Mathematisches Forschungsinstitut Oberwolfach, (2005), 2918–2920.
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.
Manuel Bodirsky, Clemens Gröpl and Mihyun Kang, Sampling unlabeled biconnected planar graphs, In Algorithms and computation, Springer, 3827, (2005), 593–603. [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]
Laurent Bartholdi and Wolfgang Woess, Spectral computations on lamplighter groups and Diestel-Leader graphs, The Journal of Fourier Analysis and Applications, Birkhäuser Boston, 11(2), (2005), 175–202. [doi]
Franz Lehner, Cumulants in Noncommutative Probability III: Creation and Annihilation Operators on Fock Spaces, Infinite Dimensional Analysis, Quantum Probability and Related Topics, World Scientific, 8(3), (2005), 407–437. [doi]
Hansjörg Albrecher, Some Extensions of the Classical Ruin Model in Risk Theory, Grazer mathematische Berichte, 348, (2005), 1–14.
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 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.
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]

2006

Bettina Klinz, Ulrich Pferschy and Joachim Schauer, ILP Models for a Nurse Scheduling Problem, In Operations Research Proceedings 2006, Springer, (2006), 319–324.
Clemens Heuberger, Parametrized Thue Equations — A survey, In Proceedings of the RIMS symposium “Analytic Number Theory and Surrounding Areas”, ., 1511, (2006), 82–91.
Peter Grabner and Clemens Heuberger, On the number of optimal base 2 representations of integers, Designs, Codes and Cryptography, Springer Science+Business Media B.V, 40, (2006), 25–39.
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.
Ecaterina Sava-Huss, Stochastic models in finance, Master's thesis, , (2006).
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]
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.
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.
Clemens Heuberger, All Solutions to Thomas' Family of Thue Equations over Imaginary Quadratic Number Fields, Journal of Symbolic Computation, Elsevier B.V., 41(9), (2006), 980–998. [doi]
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.
Hansjörg Albrecher and J. Hartinger, On the non-optimality of horizontal barrier strategies in the Sparre Andersen model, HERMIS - International Journal of Computer Mathematics and its Applications, LEA, 7, (2006), 109–122.
Elisabeth Gassner and Sven Krumke, Deterministic Online Optical Call Admission Revisited, In Approximation and Online Algorithms, Springer, 3879, (2006), 190–202. [doi]
Manuel Bodirsky and Mihyun Kang, Generating outerplanar graphs uniformly at random, Combinatorics, Probability & Computing, Cambridge University Press, 15(3), (2006), 333–343. [doi]
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.
Van de Woestijne, Christiaan, Deterministic Equation Solving over Finite Fields, PhD thesis, , (2006).
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]
Laurent Saloff-Coste and Wolfgang Woess, Transition operators on co-compact G-spaces, Revista Matemática Iberoamericana, Universidad Autonoma de Madrid, 22, (2006), 747–799.
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.
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]
Clemens Heuberger and Helmut Prodinger, Analysis of Alternative Digit Sets for Nonadjacent Representations, Monatshefte für Mathematik, Springer Wien, 147, (2006), 219–248. [doi]
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]
Sara Brofferio, The Poisson boundary of random rational affinities, Annales de l\textquoterightInstitut Fourier, Association des Annales de l'Institut Fourier, 56(2), (2006), 499–515.
Van de Woestijne, Christiaan, Surface Parametrisation without Diagonalisation, In International Symposium on Symbolic and Algebraic Computation, Association of Computing Machinery, (2006), 340–344. [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.
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]
Sebastien Blachère and Sara Brofferio, Internal diffusion limited aggregation on goups having exponential growth, Probability Theory and Related Fields, Springer, (2006), 1–20.
Burkard, Rainer Ernst and Johannes Hatzl, Modelling and optimizing batch processes in the chemical industry, Chapter in , Springer, (2006), 279–290.
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 Science+Business Media B.V, 12, (2006), 187–215. [doi]
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.
Guangting Chen, Gu Zhang and Burkard, Rainer Ernst, The web proxy location problem in general tree of rings networks, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 12, (2006), 327–336. [doi]
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]
Hansjörg Albrecher and J. Teugels, Exponential behavior in the presence of dependence in risk theory, Journal of Applied Probability, Cambridge University Press, 43(1), (2006), 257–273.
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.
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]
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]
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.
Roberto Avanzi, Clemens Heuberger and Helmut Prodinger, On Redundant $\tau$-adic Expansions and Non-Adjacent Digit Sets, (2006).

2007

Van de Woestijne, Christiaan, The Casas-Alvero Conjecture for Infinitely Many Degrees, Journal of Algebra, Elsevier B.V., 316, (2007), 224–230.
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.
Wilfried Huss, Internal diffusion-limited aggregation, (2007).
Gilch, Lorenz Alexander, Rate of Escape of Random Walks on Free Products, Journal of the Australian Mathematical Society, Cambridge University Press, 83(1), (2007), 31–54.
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, PhD thesis, , (2007).
Hansjörg Albrecher and Christian Hipp, Lundberg's risk process with tax, Blätter der DGVFM, Springer Verlag, 28(1), (2007), 13–28.
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]
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.
Cartwright, Donald I. and Wolfgang Woess, The spectrum of the averaging operator on a network (metric graph), Illinois Journal of Mathematics, Duke University Press, 71, (2007), 805–830.
Sebastian Müller, Types of branching Markov chains, (2007).
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]
Manuel Bodirsky, Omer Giménez, Mihyun Kang and Marc Noy, Enumeration and limit laws of series-parallel graphs, European Journal of Combinatorics, Elsevier B.V., 28(8), (2007), 2091–2105. [doi]
M. Bodirsky, M. Kang, Mike Löffler and C. McDiarmid, Random cubic planar graphs, Random Structures and Algorithms, John Wiley and Sons Ltd, 30(1-2), (2007), 78–94. [doi]
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, 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.
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.
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, The next step: collateralized debt obligations for catastrophe risks, Wilmott, Wiley-Blackwell, no. 6, (2007), 16–18.
Johannes Hatzl, Median problems on wheels and cactus graphs, Computing, Springer Wien, 80(4), (2007), 377–393.
Hansjörg Albrecher, Mayer, Philipp Arnold, Wim Schoutens and Jurgen Tistaert, The little Heston trap, Wilmott, Wiley-Blackwell, no. 1, (2007), 83–92.
Clemens Heuberger and Helmut Prodinger, The Hamming Weight of the Non-Adjacent-Form under Various Input Statistics, Periodica Mathematica Hungarica, Springer Science+Business Media B.V, 55, (2007), 81–96. [doi]
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.
Rainer Burkard, Admissible transformations and assignment problems, Vietnam Journal of Mathematics, 35(4), (2007), 373–386.
Manuel Bodirsky, Clemens Gröpl, Daniel Johannsen and Mihyun Kang, A direct decomposition of 3-connected planar graphs, Séminaire Lotharingien de Combinatoire, Faculty of Mathematics, University of Vienna, 54A, (2007), B54AK–B54AK.
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]
Clemens Heuberger and James Muir, Minimal Weight and Colexicographically Minimal Integer Representation, Journal of Mathematical Cryptology, de Gruyter, (2007), 297–328.
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 Helmut Prodinger, On α-greedy expansions of numbers, Advances in Applied Mathematics, Elsevier B.V., 38(4), (2007), 505–525. [doi]
Clemens Heuberger, Hwang's Quasi-Power-Theorem in Dimension Two, Quaestiones Mathematicae, Taylor and Francis Ltd., 30, (2007), 507–512.
Johannes Hatzl and Stephan Wagner, Combinatorial properties of a general domination problem with parity constraints, (2007).
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]
Burkard, Rainer Ernst, Monge properties, discrete convexity and applications, European Journal of Operational Research, Elsevier B.V., 176, (2007), 1–14.
Anders Karlsson and Wolfgang Woess, The Poisson boundary of lamplighter random walks on trees, Geometriae dedicata, Springer Netherlands, 124, (2007), 95–107. [doi]
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.
Johannes Hatzl, Mixed Integer Linear Programs for Batch Processes, (2007).
Burkard, Rainer Ernst, Discrete optimization:an Austrian view, Annals of Operations Research, Springer Netherlands, 149, (2007), 43–48.
Burkard, Rainer Ernst, Behrooz Alizadeh and Baroughi Bonab, Fahimeh, Semi-infinite optimization for solving linear fractional programming with fuzzy coefficients, (2007).
Dominik Kortschak, Asymptotic results for the sum of dependent non-identically distributed random variables, (2007).
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.
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.
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.
Ronald Ortner and Wolfgang Woess, Non-backtracking random walks and cogrowth of graphs, Canadian Journal of Mathematics, Cambridge University Press, 59, (2007), 828–844.
Burkard, Rainer Ernst, Behrooz Alizadeh and Baroughi Bonab, Fahimeh, Semi-Infinite Programming for solving Linear Fractional Programming with Fuzzy Parameters in Constraints, (2007).

2008

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]
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]
Gilch, Lorenz Alexander, Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups, (2008).
Wilfried Huss, Internal Diffusion-Limited Aggregation on non-amenable graphs, Electronic Communications in Probability, Institute of Mathematical Statistics, 13, (2008), 272–279.
Wilfried Huss, Internal diffusion-limited aggregation, (2008).
Margaret Archibald, Vasco Brattka and Clemens Heuberger, Randomness with respect to the Signed-Digit Representation, Fundamenta informaticae, IOS Press, 83, (2008), 1–19.
Hansjörg Albrecher, J. Renaud and X. Zhou, A Levy insurance risk process with tax, Journal of Applied Probability, Cambridge University Press, 45(2), (2008), 363–375. [doi]
Clemens Heuberger and Stephan Wagner, Maximizing the number of independent subsets over trees with bounded degree, Journal of Graph Theory, Wiley-Blackwell, 58, (2008), 49–68. [doi]
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]
Christoph Temmel, K-independent percolation on trees after the works of Bollobas & Balister, PhD thesis, , (2008).
Daniel Krenn, Polynomfunktionen und Polynompermutationen auf Z/p^nZ, PhD thesis, , (2008).
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]
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]
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]
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]
Elisabeth Gassner, The Inverse 1-Maxian Problem with edge length modification, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 16, (2008), 50–67.
Johannes Hatzl and Stephan Wagner, Combinatorial properties of a domination problem with parity constraints, Discrete Mathematics, Elsevier B.V., 308, (2008), 6355–6367. [doi]
Konrad Schrempf, Gekoppelte Finite Elemente- und Randelemente-Formulierungen für Akustik-Struktur Interaktionen, PhD thesis, , (2008).
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]
Rainer Burkard, Galavii, Mohammadreza, [No Value] and Elisabeth Gassner, Inverse 1-median problems, In Oberwolfach Reports, ., 51/2008, (2008), 2908–2909.
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.
van de Woestijne, Christiaan, Noncanonical number systems in the integers, Journal of Number Theory, Academic Press, 128, (2008), 2914–2938. [doi]
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.
Ecaterina Sava, The half-space method for the determination of the Poisson Boundary, (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 Poisson boundary of lamplighter random walks on general graphs, (2008).
Wolfgang Woess, Random Walks on Infinite Graphs and Groups, Cambridge University Press, 138, (2008).
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]
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]
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]
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, (2008), 409–424.
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.
Elisabeth Gassner, Up- and downgrading the 1-median in a network, TU Graz, Institut für Optimierung und Diskrete Mathematik (Math B), (2008).
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 and Johannes Hatzl, Clever or Smart: Strategies for the Online Target Date Assignment Problem, (2008).
Behrooz Alizadeh and Rainer Burkard, Inverse Network Center Location Problem with Edge Length Modification, (2008).
Elisabeth Gassner and Johannes Hatzl, How hard is it to find extreme Nash equilibria in network congestion games?, (2008).
Baroughi Bonab, Fahimeh, Rainer Burkard and Behrooz Alizadeh, Inverse Median Location Problems with Point Coordinates Modification on a d-dimensional Real Spaces, (2008).
Baroughi Bonab, Fahimeh, Behrooz Alizadeh and Rainer Burkard, Inverse median optimization problems with point coordinates variations, (2008).
Behrooz Alizadeh and Rainer Burkard, Exact Algorithms for Inverse Center Location Optimization on Trees, (2008).

2009

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]
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.
Clemens Heuberger and Stephan Wagner, On a Class of Extremal Trees for Various Indices, Match, University of Kragujevac, Faculty of Science, 62, (2009), 437–464.
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]
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]
Hansjörg Albrecher, Andreas Binder and Philipp Mayer, Einführung in die Finanzmathematik, Birkhäuser Verlag, (2009).
Behrooz Alizadeh, Rainer Burkard and Ulrich Pferschy, Inverse 1-center location problems with edge length augmentation on trees, ., (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]
Elisabetta Candellero, Asymptotics of Return Probabilities of Random Walks on Free Products of Lattices, (2009).
Wilfried Huss, Internal diffusion limited aggregation, (2009).
Ecaterina Sava, Languages associated with graphs - entropy sensitivity via Markov chains, (2009).
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, 11(3), (2009), 279–306. [doi]
Clemens Heuberger and James Muir, Unbalanced digit sets and the closest choice strategy for minimal weight integer representations, Designs, Codes and Cryptography, Springer Science+Business Media B.V, 52, (2009), 185–208. [doi]
Behrooz Alizadeh and Rainer Burkard, Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees, ., (2009).
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]
Elisabeth Gassner, Up- and downgrading the 1-center in a network, European Journal of Operational Research, Elsevier B.V., 198, (2009), 370–377.
Gilch, Lorenz Alexander, Asymptotics of Return Probabilities of Random Walks on Free Products of Lattices (joint work with Elisabetta Candellero), (2009).
Clemens Heuberger and Stephan Wagner, Chemical trees minimizing energy and Hosoya index, Journal of Mathematical Chemistry, Springer, 46, (2009), 214–230. [doi]
Gilch, Lorenz Alexander, Random Walks on Directed Covers of Graphs (joint work with Sebastian Müller), (2009).
Behrooz Alizadeh, Burkard, Rainer Ernest and Ulrich Pferschy, Inverse 1-center location problems with edge length augmentation on trees, ., (2009).
Daniel Krenn, Analytische Lösungen für das Vorwärtsproblem der Elektrischen Impedanztomographie auf einem Zylinder, PhD thesis, , (2009).
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]
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]
Gilch, Lorenz Alexander, Asymptotics of Return Probabilities of Random Walks on Free Products of Lattices (joint work with Elisabetta Candellero), (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.
Rainer Burkard, Mauro Dell'Amico and Silvano Martello, Assignment Problems, SIAM - Society of Industrial and Applied Mathematics, (2009).
Behrooz Alizadeh and Rainer Burkard, Uniform-cost inverse absolute and vertex center location problems on trees, ., (2009).
Österreichische Mathematik Olympiaden 2000-2008, (Gerd Baron, Schmidt, Birgit Vera, eds.), ., (2009).
Elisabetta Candellero, Phase Transitions for Random Walk Asymptotics on Free Products of Groups, (2009).
Wolfgang Woess, Denumerable Markov Chains, European Mathematical Society, (2009).
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, 20(3), (2009), 443–453. [doi]
Elisabeth Gassner and Bettina Klinz, The computational complexity of bilevel assignment problems, 4OR, Springer Verlag, 7, (2009), 379–394. [doi]
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]
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.
Fahimeh Baroughi, Rainer Burkard and Behrooz Alizadeh, Inverse Median Location Problems with Variable Coordinates, ., (2009).
Clemens Heuberger, Graphen, Ziffern und Kryptographie, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 212, (2009), 1–10.
Fahimeh Baroughi-Bonab, Burkard, Rainer Ernest and Behrooz Alizadeh, Inverse median location problems with variable coordinates, ., (2009).
Elisabeth Gassner, Location Problems with Variable Input Data, PhD thesis, , (2009).
Rainer Burkard, Communication network assignment problem (CAP), Chapter in , Springer, (2009), 394–396.
Elisabetta Candellero, Asymptotics of Return Probabilities of Random Walks on Free Products of Lattices, (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.
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).
Behrooz Alizadeh, Rainer Burkard and Ulrich Pferschy, Optimal algorithms for inverse center location problems with edge length augmentation on trees, (2009).

2010

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]
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]
Clemens Heuberger and Daniel Krenn, Analysis of Width-$w$ Non-adjacent Forms to Imaginary Quadratic Bases, Cornell University Library, (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]
Ecaterina Sava, Lamplighter Random Walks and Entropy-Sensitivity of Languages, PhD thesis, , (2010).
Daniel Krenn, Analysis of Digital Expansions to Imaginary Quadratic Bases, Master's thesis, , (2010).
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]
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.
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.
Peter Cameron, Mihyun Kang and Dudley Stark, Random preorders and alignments, Discrete Mathematics, Elsevier B.V., 310(6), (2010), 591–603. [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, SIAM Journal on Computing, Society for Industrial and Applied Mathematics Publications, 39, (2010), 2336–2362. [doi]
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.
Schmuck, Nina Sabine, The Wiener index of a graph, PhD thesis, , (2010).
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.
Rainer Burkard and Behrooz Alizadeh, Inverse center location problems, Electronic Notes in Discrete Mathematics, Elsevier B.V., 36, (2010), 105–110. [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 Johannes Hatzl, Median problems with positive and negative weights on cycles and cacti, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 20, (2010), 27–46. [doi]
Clemens Heuberger and Stephan Wagner, The number of maximum matchings in a tree, nicht erfasst, (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]
Daniel Krenn, Analysis of Digital Expansions in Conjunction with Koblitz Curves in Characteristic Three, (2010).
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]
Angelos Georgakopoulos, Uniqueness of electrical currents in a network of finite total resistance, Journal of the London Mathematical Society, Wiley, 82(14), (2010), 256–272. [doi]
Angelos Georgakopoulos, Every rayless graph has an unfriendly partition, Combinatorica, Springer, 5, (2010), 521–532.
Angelos Georgakopoulos, An eberhard-like theorem for pentagons and heptagons, Discrete & Computational Geometry, Springer, 44(4), (2010), 931–945.
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]
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]
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.
Elisabeth Gassner, The Steiner Forest Problem Revisited, Journal of Discrete Algorithms, Elsevier B.V., 8, (2010), 154–163. [doi]
Clemens Heuberger, Redundant τ-adic Expansions II: Non-Optimality and Chaotic Behaviour, Mathematics in computer science, Birkhauser Verlag Basel, 3, (2010), 141–157. [doi]
Elisabetta Candellero, Limit Behaviour of Random Walks and Branching Random Walks on Free Products, (2010).

2011

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]
Rainer Burkard and Roswitha Rissner, Polynomially solvable special cases of the quadratic bottleneck assignment problem, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 22, (2011), 845–856. [doi]
Angelos Georgakopoulos, Graph topologies induced by edge lengths, Discrete Mathematics, Elsevier B.V., 311, (2011), 1523–1542.
Franz Lehner, Cumulants as iterated integrals, Journal of statistical planning and inference, Elsevier B.V., 141(4), (2011), 1448–1454. [doi]
Clemens Heuberger and Daniel Krenn, Optimality of the Width-w Non-adjacent Form: General Characterisation and the Case of Imaginary Quadratic Bases, Cornell University Library, (2011).
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]
Random Walks, Boundaries and Spectra, (Daniel Lenz, Florian Sobieczky, Wolfgang Woess, eds.), Birkhäuser, 64, (2011). [doi]
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]
Angelos Georgakopoulos, Bases and closures under infinite sums, Linear Algebra and its Applications, Elsevier B.V., 435, (2011), 2007–2018.
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]
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.
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]
Schmuck, Nina Sabine, The Wiener maximum quadratic assignment problem, (2011).
Bettina Klinz and Wöginger, Gerhard Johannes, The Northwest corner rule revisited, Discrete Applied Mathematics, Elsevier B.V., 159(12), (2011), 1284–1289. [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]
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]
Christian Sattlecker, Free multiplicative central limit theorems and the free multiplicative normal distribution on the unit circle, (2011).
Gilch, Lorenz Alexander, Asymptotic Entropy of Random Walks on Free Products, Electronic Journal of Probability, Institute of Mathematical Statistics, 16, (2011), 76–105.
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]
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]
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]
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]
Franz Lehner, A noncrossing basis for noncommutative invariants of SL(2,C), Journal of Combinatorial Theory, Series A, Elsevier B.V., 118(1), (2011), 257–269. [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, 7, (2011), 57–69. [doi]
Clemens Heuberger and Stephan Wagner, The number of maximum matchings in a tree, Discrete Mathematics, Elsevier B.V., 311, (2011), 2512–2542. [doi]
Johannes Cuno, The Tits-alternative for non-spherical triangles of groups, (2011).
Belinschi, Serban T., 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]
Gilch, Lorenz Alexander, Random Walks on Directed Covers of Graphs, Journal of Theoretical Probability, Springer Science+Business Media B.V, 24(1), (2011), 118–149. [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]
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 Science+Business Media B.V, 58(2), (2011), 173–202. [doi]
Daniel Krenn and Sophie Frisch, Sylow $p$-groups of polynomial permutations on the integers mod $p^n$, Cornell University Library, (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]

2012

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]
Pierre Mathieu and Christoph Temmel, K-independent percolation on trees, Stochastic Processes and their Applications, Elsevier B.V., 122(3), (2012), 1129–1153. [doi]
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.
Daniel Krenn, Digital Expansions in Conjunction with Hyperelliptic Curve Cryptography, (2012).
Clemens Heuberger, Daniel Krenn and Sara Kropf, Finite state machines, automata, transducers, nicht erfasst, (2012).
Clemens Heuberger and Florian Heigl, Analysis of Digital Expansions of Minimal Weight, In AofA'12, ., AQ, (2012), 399–412.
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.
Daniel Krenn, Analysis of the width-w non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices, Cornell University Library, (2012).
Rainer Burkard and Behrooz Alizadeh, A linear time algorithm for inverse obnoxious center location problems on networks, Central European Journal of Operations Research, Springer, 21, (2012), 585–594. [doi]
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]
Wolfgang Woess, Context-free pairs of groups. II - Cuts, tree sets, and random walks, Discrete Mathematics, Elsevier B.V., 312, (2012), 157–173. [doi]
Daniel Krenn, Jörg Thuswaldner and Volker Ziegler, On linear Combinations of Units with bounded Coefficients and double-Base Digit Expansions, Cornell University Library, (2012).
Clemens Heuberger and Daniel Krenn, Existence and Optimality of w-Non-adjacent Forms with an Algebraic Integer Base, Cornell University Library, (2012).
Christoph Temmel, Properties and applications of Bernoulli random fields with strong dependency graph, PhD thesis, , (2012).
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.
Angelos Georgakopoulos and Matthias Hamann, On fixing boundary points of transitive hyperbolic graphs, Archiv der Mathematik, Springer International Publishing AG, 99, (2012), 91–99.
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]
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.
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]
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-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 and Zimmermann, Uwe T., Einführung in die Mathematische Optimierung, Springer Verlag, (2012). [doi]
Ecaterina Sava-Huss, DK Discrete Mathematics, (2012).

2013

Mihyun Kang and Konstantinos Panagiotou, On the connectivity of random graphs from addable classes, Journal of Combinatorial Theory, Series B, Elsevier B.V., 103, (2013), 306–312. [doi]
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]
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. [doi]
Gilch, Lorenz Alexander and Francois Ledrappier, Regularity of the Drift and Entropy of Random Walks on Groups, Publicaciones Matematicas del Uruguay, Centro de Matemática, 14, (2013), 147–158.
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]
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]
Bernhard Geiger and Christoph Temmel, Information-Preserving Markov Aggregation, In Proc. IEEE Information Theory Workshop, IEEE Institute of Electrical and Electronics Engineers, (2013), 258–262. [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.
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]
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. [doi]
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]
Wolfgang Woess, What is a horocyclic product, and how is it related to lamplighters ?, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 67(224), (2013), 1–27.
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.
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 and Stephan Wagner, Free Lamplighter Groups and a Question of Atiyah, American Journal of Mathematics, Johns Hopkins University Press, 135(3), (2013), 835–849. [doi]
Daniel Krenn, Digit Expansions with Applications in Cryptography, PhD thesis, , (2013).
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. [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]
Christian Elsholtz, Clemens Heuberger and Helmut Prodinger, The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions, IEEE Transactions on Information Theory, IEEE Institute of Electrical and Electronics Engineers, 59(2), (2013), 1065–1075. [doi]
Roswitha Rissner and Rainer Burkard, Bounds on the radius and status of graphs, Cornell University Library, (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]

2014

Daniele D'Angeli and Emanuele Rodaro, Groups and semigroups defined by colorings of synchronizing automata, International Journal of Algebra and Computation, World Scientific, 24(6), (2014), 773–793. [doi]
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, Schreier Graphs of an Extended Version of the Binary Adding Machine, The Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 21(4), (2014).
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, Academy of Sciences and Arts of Bosnia and Herzegovina, 10(1), (2014), 77–85. [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]
Roswitha Rissner and Rainer Burkard, Bounds on the radius and status of graphs, Networks, Wiley-Liss Inc., 64(2), (2014), 76–83. [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, 68(227), (2014), 1–24.
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]
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, Cornell University Library, (2014).
Johannes Cuno, Random walks and deterministic ways to explore discrete groups, (2014).
Johannes Cuno and Jörg Lehnert, The Tits alternative for non-spherical triangles of groups, Cornell University Library, (2014).
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).
Mihyun Kang and Konstantinos Panagiotou, On the connectivity threshold of Achlioptas processes, Journal of Combinatorics, International Press of Boston, Inc., 5(3), (2014), 291–304. [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).
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]
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. [doi]
Michael Behrisch,, Amin Coja-Oghlan and Mihyun Kang, Local limit theorems for the giant component of random hypergraphs, Combinatorics, Probability & Computing, Cambridge University Press, 23(3), (2014), 331–366. [doi]
Amnon Rosenmann, The Timestamp of Timed Automata, Cornell University Library, (2014).

2015

Peter Allen, Julia Böttcher, Cooley, Oliver Josef Nikolaus and Richard Mycroft, Regular slices for hypergraphs, (2015).
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, 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.
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.
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]
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.
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.
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]
Tetiana Boiko and Wolfgang Woess, Moments of Riesz measures on Poincaré disk and homogeneous tree—a comparative study, Expositiones Mathematicae, Elsevier B.V., 33(3), (2015), 353–374. [doi]
Eranda Dragoti-Cela and Rostislav Stanek, Heuristics for the data arrangement problem on regular trees, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 30(3), (2015), 768–802. [doi]
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).
Peter Allen, Julia Böttcher, Cooley, Oliver Josef Nikolaus and Richard Mycroft, Tight Cycles in Hypergraphs, (2015).
Alexander Bendikov, Laurent Saloff-Coste, Maura Salvatori and Wolfgang Woess, Brownian motion on treebolic space: escape to infinity, Revista Matemática Iberoamericana, Universidad Autonoma de Madrid, 31(3), (2015), 935–976. [doi]
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.
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, 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.
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]
Johannes Cuno and Jörg Lehnert, The Tits alternative for non-spherical triangles of groups, Transactions of the London Mathematical Society, John Wiley and Sons Inc., 2(1), (2015), 93–124.
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.
James Parkinson and Wolfgang Woess, Regular sequences and random walks in affine buildings, Annales de l\textquoterightInstitut Fourier, Association des Annales de l'Institut Fourier, 65(2), (2015), 675–707.
Franz Lehner, Relations between cumulants in noncommutative probability, Advances in Mathematics, Elsevier B.V., 282(1), (2015), 56–92. [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.
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, Tamas Makai, Koch, Christoph Jörg and Michal Karonski, Properties of stochastic Kronecker graphs, Journal of Combinatorics, International Press of Boston, Inc., 6, (2015), 395–432.
Çela , Eranda , Rostislav Stanek and Joachim Schauer, The data arrangement problem on binary trees, Technical report, , (2015).
Michael Behrisch, Amin Coja-Oghlan and Mihyun Kang, Corrigendum 'The asymptotic number of connected d-uniform hypergraphs', Combinatorics, Probability & Computing, Cambridge University Press, 24(1), (2015), 373–375. [doi]

2016

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-Blackwell, 83(2), (2016), 120. [doi]
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. [doi]
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).
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).
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]
Mihyun Kang, Andrea Jiménez and Martin Loebl, Cubic bridgeless graphs and braces, Graphs and Combinatorics, Springer Japan, 32(6), (2016), 2473–2495. [doi]
Alexander Bendikov, Laurent Saloff-Coste, Maura Salvatori and Wolfgang Woess, Brownian motion on treebolic space: positive harmonic functions, Annales de l\textquoterightInstitut Fourier, Association des Annales de l'Institut Fourier, 66(4), (2016), 1691–1731. [doi]
Eranda Dragoti-Cela, Vladimir Deineko and Woeginger, Gerhard J., Linearizable special cases of the QAP, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 31(3), (2016), 1269–1279. [doi]
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]
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. [doi]
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. [doi]
Ante Custic and Bettina Klinz, The constant objective value property for multidimensional assignment problems, Discrete Optimization, Elsevier B.V., (2016), 23–35. [doi]
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).
Gilch, Lorenz Alexander, Asymptotic Properties of Random Walks via Generating Functions, PhD thesis, , (2016).
Mihyun Kang, Giant components in random graphs, Chapter in , Springer, 159, (2016), 235–256. [doi]
Michael Martin, Arno Eichberger and Eranda Dragoti-Cela, Optimization Approach to Handle Global CO2 Fleet Emission Standards, (2016). [doi]
Daniele D'Angeli, Freeness and fragile words in automata, (2016).
Wilfried Huss, A functional limit law for p-rotor walk, (2016).
Daniele D'Angeli, Groups and Graphs froma Automata, (2016).
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). [doi]
Wilfried Huss, Rotor-router walks on Galton-Watson trees, (2016).
Wiktor Ejsmont and Franz Lehner, Sample Variance in Free Probability, Cornell University Library, (2016).
Daniele D'Angeli and Emanuele Rodaro, Freeness of automaton groups vs boundary dynamics, Journal of Algebra, Elsevier B.V., 462, (2016), 115–136. [doi]
Koch, Christoph Jörg, Phase transition phenomena in random graphs and hypergraphs, PhD thesis, Graz University of Technology (90000), (2016).

2017

M. Kang, M. Moßhammer and P. Sprüssel, Evolution of the giant component in graphs on orientable surfaces, Electronic Notes in Discrete Mathematics, Elsevier B.V., 61, (2017), 687–693. [doi]
Mihyun Kang, Tamas Makai and Oleg Pikhurko, Supersaturation Problem for the Bowtie, Electronic Notes in Discrete Mathematics, Elsevier B.V., 61, (2017), 679–685. [doi]
Ievgen Bondarenko, Daniele D'Angeli 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–424. [doi]
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.
Cooley, Oliver Josef Nikolaus, Penny Haxell, Mihyun Kang and Philipp Sprüssel, Homological connectedness of random hypergraphs, Electronic Notes in Discrete Mathematics, Elsevier B.V., 61, (2017), 279–285. [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, Series A, Elsevier B.V., 149, (2017), 30–100. [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]
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, Horofunctions on Sierpinski type triangles, Utilitas Mathematica, University of Kwazulu-Natal, 105, (2017), 267–277.
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang and Tobias Kapetanopoulos, Charting the replica symmetric phase, In Leibniz International Proceedings in Informatics, LIPIcs, Volume 81, (2017), 1–17. [doi]
Wojciech Cygan, Heat content for convolution semigroups, Journal of Mathematical Analysis and Applications, Elsevier B.V., 446(2), (2017), 1393–1414. [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]
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]
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]
Béla Bollobás, Cooley, Oliver Josef Nikolaus, Mihyun Kang and Koch, Christoph Jörg, Jigsaw percolation on random hypergraphs, Journal of Applied Probability, Cambridge University Press, 54(4), (2017), 1261. [doi]
Eranda 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. [doi]
Daniele D'Angeli and Alfredo Donno, Shuffling matrices, Kronecker product and Discrete Fourier Transform, Discrete Applied Mathematics, Elsevier B.V., 233, (2017), 1–18. [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., 340(6), (2017), 1172 – 1179. [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]
Daniele D'Angeli and Alfredo Donno, Wreath product of matrices, Linear Algebra and its Applications, Elsevier B.V., 513, (2017), 276–303. [doi]
Konrad Schrempf, Linearizing the Word Problem in (some) Free Fields, Cornell University Library, (2017), 1–24.
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]
Lorber, Florian Lukas, Amnon Rosenmann, Dejan Nickovic and Bernhard Aichernig, Bounded determinization of timed automata with silent transitions, Real-Time Systems, Springer Science+Business Media B.V, 53(3), (2017), 291–326. [doi]
Konrad Schrempf, On the Factorization of Non-Commutative Polynomials (in Free Associative Algebras), Cornell University Library, (2017), 1–22.
Michael Drmota, Mihyun Kang and Christian Krattenthaler, Preface, Electronic Notes in Discrete Mathematics, Elsevier B.V., 61, (2017), 1–3. [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]
Takahiro Hasebe and Franz Lehner, Cumulants, Spreadability and the Campbell-Baker-Hausdorff Series, Technical report, , (2017).

2018

Dijana Kreso and Robert Tichy, Diophantine equations in separated variables, Periodica Mathematica Hungarica, Springer Science+Business Media B.V, (2018), 47–67. [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]
Wilfried Huss, Lionel Levine and Ecaterina Sava-Huss, Interpolating between random walk and rotor walk, Random Structures & Algorithms, John Wiley and Sons Ltd, 52(2), (2018), 263–282. [doi]
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.
C. Dowden, M. Kang and M. Krivelevich, The genus of the Erdos-Rényi random graph and the fragile genus property, In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018), 17:1—-17:13. [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). [doi]
Leonardo Alese, Stefan Lendl and Paul Tabatabai, On sequences covering all rainbow k-progressions, Journal of Combinatorics, International Press of Boston, Inc., 9(4), (2018). [doi]
Cooley, Oliver Josef Nikolaus, Mihyun Kang and Yury Person, Largest components in random hypergraphs, Combinatorics, Probability & Computing, Cambridge University Press, 27(5), (2018), 741 – 762. [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]
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]
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]
Mihyun Kang and Philipp Sprüssel, Symmetries of unlabelled planar triangulations, The Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 25(1), (2018). [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, 17, (2018), 509. [doi]
Thomas Hirschler and Wolfgang Woess, Comparing entropy rates on finite and infinite rooted trees with length functions, IEEE Transactions on Information Theory, IEEE Institute of Electrical and Electronics Engineers, 64(8), (2018), 5570–5580. [doi]
A. Coja-Oghlan, C. Efthymiou, N. Jaafari, M. Kang and T. Kapetanopoulos, Charting the Replica Symmetric Phase, Communications in Mathematical Physics, Springer, 359(2), (2018), 603 – 698. [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]
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]
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]
Roman Aigner, Michael Stoschka, Martin Leitner, Wolfgang Schneller and Jörg Thuswaldner, Lifetime assessment of cast aluminium components based on CT-evaluated microstructural defects: 8th Conference on Industrial Computed Tomography, (2018).
Wenjie Fang, Fighting Fish and Two-Stack Sortable Permutations, In Séminaire Lotharingien de Combinatoire, European Mathematical Society, 80B, (2018). [url]
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]
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, 228, (2018), 627–663. [doi]

2019

Joshua Erde, Daniel Weißauer and Reinhard Diestel, Structural submodularity and tangles in abstract separation systems, Journal of Combinatorial Theory, Series A, Elsevier B.V., 167, (2019), 155–180. [doi]
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, Series B, Elsevier B.V., (2019). [doi]
Daniele D'Angeli, Alfredo Donno and Emanuele Rodaro, Catalan fragile words, International Journal of Group Theory, University of Isfahan, 9(2), (2019), 69–80. [doi]
Wojciech Cygan, Nikola Sandrić and Stjepan Sebek, Functional CLT for the range of stable random walks, Cornell University Library, (2019).
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.
Oswin Aichholzer, Ruy Fabila-Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber and Francisco Zaragoza, On the 2-Colored Crossing Number, In Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), Springer, Cham, (2019), 87–100. [doi]
Wojciech Cygan, Nikola Sandrić and Stjepan Sebek, CLT for the capacity of the range of stable random walks, Cornell University Library, (2019).
N. Fountoulakis, M. Kang and T. Makai, Resolution of a conjecture on majority dynamics: Rapid stabilisation in dense random graphs, Technical report, , (2019).
Joshua Erde, Florian Lehner, Max Pitz and Nathan Bowler, Bounding the cop number of a graph by its genus, In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2019), (2019), 507–510.
Joshua Erde and Daniel Weißauer, A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 33(3), (2019), 1654–1661. [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]
Abraham Gutierrez, Mickaël Buchet and Sylvain Clair, Persistent Homology To Quantify the Quality of Surface-Supported Covalent Networks, ChemPhysChem, Wiley-VCH, (2019). [doi]
Cooley, Oliver Josef Nikolaus, Wenjie Fang, Del Giudice, Nicola and Mihyun Kang, Subcritical random hypergraphs, high-order components, and hypertrees, In 2019 Proceedings of the Meeting on Analytic Algorithmics and Combinatorics (ANALCO), SIAM - Society of Industrial and Applied Mathematics, (2019), 111–118. [doi]
Dowden, Christopher Thomas, Mihyun Kang, Mirjana Mikalacki and Milos Stojakovic, The Toucher-Isolator game, The Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 26(4), (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), 101–117. [doi]
C. Dowden, M. Kang and M. Krivelevich, The genus of the Erd\H os-Rényi random graph and the fragile genus property, Random Structures & Algorithms, John Wiley and Sons Ltd, (2019). [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.
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]
Wenjie Fang, Cesar Ceballos and Henri Mühle, The steep-bounce zeta map in parabolic Cataland, In Proceedings of the 31st Conference on Formal Power Series and Algebraic Combinatorics, 82B, (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]
Wojciech Cygan, Nikola Sandrić and Stjepan Sebek, The growth of the range of stable random walks, Cornell University Library, (2019).
Ecaterina Sava-Huss and Wilfried Huss, Divisible sandpile on Sierpinski gasket graphs, Fractals, World Scientific Publ., 27(3), (2019). [doi]
Alexander Grigoriev, Hartmann, Tim A., Stefan Lendl and Woeginger, Gerhard J., Dispersing obnoxious facilities on a graph, In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019), 33:1–33:11. [url] [doi]
Bendikov, Alexander D., Wojciech Cygan and Wolfgang Woess, Oscillating heat kernels on ultrametric spaces, Journal of Spectral Theory, EMS Press, 9(1), (2019), 195–226. [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]
Johannes Carmesin, Florian Lehner and Möller, Rögnvaldur G., On tree-decompositions of one-ended graphs, Mathematische Nachrichten, Wiley-VCH, 292(3), (2019), 524–539. [doi]
Eranda Dragoti-Cela, Ulrich Pferschy, Roland Mestel and Stephan Hafner, Mean-Variance Portfolio Optimization Based on Ordinal Information, Technical report, , (2019), 1–34.
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.
Amnon Rosenmann, The Timestamp of Timed Automata, In FORMATS 2019 (É. André, Stoelinga, M., eds.), Springer, Cham, 11750, (2019), 181–198. [doi]
Eranda Cela and Elisabeth Gaar, Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid, Technical report, , (2019).
Amnon Rosenmann, On the Distance Between Timed Automata., In FORMATS 2019 (É André, M. Stoelinga, eds.), Springer, Cham, 11750, (2019), 199–215. [doi]
Gutierrez Sanchez, Abraham and Sebastian Müller, Quality analysis in acyclic production networks, Stochastics and Quality Control, deGruyter, 34(2), (2019), 59–66. [doi]
Florian Lehner, Firefighting on trees and cayley graphs, Australasian Journal of Combinatorics, The University of Queensland, 75(1), (2019), 66–72.
Amnon Rosenmann, Franz Lehner and Aljosa Peperko, Polynomial convolutions in max-plus algebra, Linear Algebra and its Applications, Elsevier B.V., 578, (2019), 370–401. [doi]
Florian Lehner, Monika Pil\'sniak and Marcin Stawiski, On asymmetric colourings of graphs with bounded degrees and infinite motion, Technical report, , (2019).

2020

Thomas Hirschler and Wolfgang Woess, Polyharmonic functions for finite graphs and Markov chains, In Frontiers in Analysis and Probability (Nalini Anantharaman, Nikeghbali, Ashkan, Rassias, Michael Th., eds.), Springer International Publishing AG, (2020), 77–90. [doi]
D.Y. Kang, M. Kang, J. Kim and S.-I. Oum, Fragile minor-monotone parameters under random edge perturbation, Technical report, , (2020).
Oliver Cooley and Abraham Gutiérrez, Multi-coloured jigsaw percolation on random graphs, Journal of Combinatorics, International Press of Boston, Inc., 11(4), (2020), 603–624. [doi]
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, 34(4), (2020), 2033–2062. [doi]
W. Fang, H.-K. Hwang and M. Kang, Phase transitions from exp(n1/2) to exp(n2/3) in the asymptotics of banded plane partitions1, Technical report, , (2020).
Oliver Cooley, Del Giudice, N., M. Kang and P. Sprüssel, Phase transition in cohomology groups of non-uniform random simplicial complexes, Technical report, , (2020).
O. Cooley, N.D. Giudice, M. Kang and P. Sprüssel, Vanishing of cohomology groups of random simplicial complexes, Random Structures & Algorithms, John Wiley and Sons Ltd, 56(2), (2020), 461–500. [doi]
Anna Muranova, On the notion of effective impedance, Operators and Matrices, Element d.o.o., 14(3), (2020), 723–741. [doi]
M. Kang, T. Makai and O. Pikhurko, Supersaturation problem for the bowtie, European Journal of Combinatorics, Elsevier B.V., 88, (2020). [doi]
Wilfried Imrich, Florian Lehner and Smith, Simon M., Distinguishing density and the Distinct Spheres Condition, European Journal of Combinatorics, Elsevier B.V., 89, (2020). [doi]
M. Kang and M. Missethan, The Giant Component and 2-Core in Sparse Random Outerplanar Graphs, In 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (Michael Drmota, Clemens Heuberger, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020). [doi]
Picardello, Angelo Massimo and Wolfgang Woess, Multiple boundary representations of λ-harmonic functions on trees, In Analysis and Geometry on Graphs and Manifolds (Matthias Keller, Daniel Lenz, Wojciechowski, Radoslaw K., eds.), Cambridge University Press, (2020), 95–125. [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, 56(4), (2020), 1117–1170. [doi]
Saeid Alikhani, Sandi Klav\v zar, Florian Lehner and Samaneh Soltani, Trees with distinguishing index equal distinguishing number plus one, Discussiones Mathematicae Graph Theory, The University of Zielona Gora Press, 40(3), (2020), 875–884. [doi]
Z. Gao and M. Kang, Counting Cubic Maps with Large Genus, In 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (Drmota, Michael, Clemens Heuberger, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020). [doi]
Florian Lehner and Smith, Simon M., On symmetries of edge and vertex colourings of graphs, Discrete Mathematics, Elsevier B.V., 343(9), (2020). [doi]
Florian Lehner and Gabriel Verret, Counterexamples to "A Conjecture on Induced Subgraphs of Cayley Graphs", Ars Mathematica Contemporanea, DMFA Slovenije, 19(1), (2020), 77–82. [doi]
Sebastian Müller and Wiegel, Gundelinde Maria, On transience of frogs on galton–watson trees, Electronic Journal of Probability, Institute of Mathematical Statistics, 25, (2020), 1–30. [doi]
Hartmann, Tim A., Stefan Lendl and Woeginger, Gerhard J., Continuous facility location on graphs, In Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings (Daniel Bienstock, Giacomo Zambelli, eds.), Springer, (2020), 171–181. [url] [doi]
Joshua Erde, Directed Path-Decompositions, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 34(1), (2020), 415–430. [doi]
Florian Lehner and Gabriel Verret, Distinguishing numbers of finite 4-valent vertex-transitive graphs, Ars Mathematica Contemporanea, DMFA Slovenije, 19(2), (2020), 173–187. [doi]
Eranda Dragoti-Cela and Elisabeth Gaar, Relationship of k-Bend and Monotonic ℓ-Bend Edge Intersection Graphs of Paths on a Grid, Technical report, , (2020), 1–30.
Wojciech Cygan and Stjepan Sebek, Transition probability estimates for subordinate random walks, Cornell University Library, (2020).
Del Giudice, Nicola, Random hypergraphs and random simplicial complexes, PhD thesis, , (2020).
Franz Lehner, Jean-Christophe Novelli and Jean-Yves Thibon, Combinatorial Hopf algebras in noncommutative probabilility, Technical report, , (2020).
Christian Lindorfer, Self-avoiding walks and their languages, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 74(244), (2020), 11–26.
Michael Drmota, Mihyun Kang and Christian Krattenthaler, Preface, European Journal of Combinatorics, Elsevier B.V., 88, (2020). [doi]
Wilfried Huss and Ecaterina Sava-Huss, Range and Speed of Rotor Walks on Trees, Journal of Theoretical Probability, Springer Science+Business Media B.V, 33(3), (2020), 1657–1690. [doi]
Eranda Dragoti-Cela, Vladimir Deineko and Gerhard Woeginger, Travelling salesman paths on Demidenko matrices, Technical report, , (2020).
Florian Lehner, Monika Pilsniak and Marcin Stawiski, A bound for the distinguishing index of regular graphs, European Journal of Combinatorics, Elsevier B.V., 89, (2020). [doi]
Wiktor Ejsmont and Franz Lehner, The free tangent law, Advances in Applied Mathematics, Elsevier B.V., 121, (2020). [doi]
Florian Lehner and Christian Lindorfer, Self-avoiding walks and multiple context-free languages, Technical report, , (2020).
Gutierrez Sanchez, Abraham and Sebastian Müller, Estimations of means and variances in a Markov linear model, Electronic Journal of Statistics, Cornell University Library, (2020).
Christian Lindorfer and Wolfgang Woess, The Language of Self-Avoiding Walks, Combinatorica, Springer, 40(5), (2020), 691–720. [doi]
Christian Lindorfer, A general bridge theorem for self-avoiding walks, Discrete Mathematics, Elsevier B.V., 343(12), (2020). [doi]
N. Fountoulakis, M. Kang and T. Makai, Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs, Random Structures & Algorithms, John Wiley and Sons Ltd, 57(4), (2020), 1134–1156. [doi]

2021

Joshua Erde, Max Pitz, Attila Joó, Gollin, J Pascal and Paul Knappe, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs, Journal of Combinatorial Theory, Series B, Elsevier B.V., 149, (2021), 16–22. [doi]
Oliver Cooley, Frederik Garbe, Hng, Eng Keat, Mihyun Kang, Nicolás Sanhueza-Matamala and Julian Zalla, Longest Paths in Random Hypergraphs, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 35(4), (2021), 2430–2458. [doi]
Florian Lehner, On the cop number of toroidal graphs, Journal of Combinatorial Theory, Series B, Elsevier B.V., 151, (2021), 250–262. [doi]
M. Isaev and M. Kang, On the chromatic number in the stochastic block model, Technical report, , (2021).
A. Coja-Oghlan, O. Cooley, M. Kang, J. Lee and J.B. Ravelomanana, The sparse parity matrix, Technical report, , (2021).
Franz Lehner and Kamil Szpojankowski, Boolean cumulants and subordination in free probability, Random Matrices: Theory and Applications, World Scientific, 10(4), (2021). [doi]
Anabanti, Chimere Stanley, Stefan Hammer and Okoli, Nneka Chigozie, An infinitude of counterexamples to Herzog\textquoterights conjecture on involutions in simple groups, Communications in Algebra, Taylor and Francis Ltd., 49(4), (2021), 1415–1421. [doi]
Stefan Lendl, Gerhard Woeginger and Lasse Wulf, Non-preemptive Tree Packing, In Combinatorial Algorithms. IWOCA 2021. Lecture Notes in Computer Science (P. Flocchini, L. Moura, eds.), Springer, 12757, (2021).
Chris Dowden, Mihyun Kang, Mirjana Mikala\v cki and Miloš Stojaković, The Game of Toucher and Isolator, Chapter in , Birkhäuser, (2021), 417–422. [doi]
W. Fang, H.-K. Hwang and M. Kang, Phase transitions from exp⁡(n1/2) to exp⁡(n2/3) in the asymptotics of banded plane partitions, Journal of Combinatorial Theory, Series B, Elsevier B.V., 178, (2021). [doi]
Oliver Cooley, Mihyun Kang and Oleg Pikhurko, On a Question of Vera T. Sós About Size Forcing of Graphons, Chapter in , Springer Science and Business Media Deutschland GmbH, (2021), 625–630. [doi]
Joshua Erde and Florian Lehner, Improved Bounds on the Cop Number of a Graph Drawn on a Surface, In Trends in Mathematics, Springer, 14, (2021), 111–116. [doi]
Dennis Fischer, Hartmann, Tim A., Stefan Lendl and Woeginger, Gerhard J., An Investigation of the Recoverable Robust Assignment Problem, In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021) (Golovach, Petr A., Meirav Zehavi, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 214, (2021), 19:1—-19:14. [doi]
Anna Muranova, On the Effective Impedance of Finite and Infinite Networks, Potential analysis, Springer Netherlands, (2021). [doi]
Do, Tuan Anh, Joshua Erde and Mihyun Kang, Component Behaviour of Random Bipartite Graphs, In Extended Abstracts EuroComb 2021, Springer, 14, (2021), 325–330. [doi]
Anna Muranova, Effective impedance over ordered fields, Journal of Mathematical Physics, American Institute of Physics Publising LLC, 62(3), (2021). [doi]
Amin Coja-Oghlan, O. Cooley, M. Kang, Joon Lee and Ravelomanana, Jean Bernoulli, The Sparse Parity Matrix, Technical report, , (2021). [doi]
Mihyun Kang and Michael Missethan, Cut Vertices in Random Planar Graphs, In Extended Abstracts EuroComb 2021, Springer Science and Business Media Deutschland GmbH, (2021), 18–24. [doi]
Oliver Cooley, Mihyun Kang and Julian Zalla, Loose Cores and Cycles in Random Hypergraphs, Chapter in , Springer Science and Business Media Deutschland GmbH, (2021), 280–285. [doi]
Marc Goerigk and Stefan Lendl, Robust Combinatorial Optimization with Locally Budgeted Uncertainty, Open Journal of Mathematical Optimization, Centre Mersenne for Open Scientific Publishing, 2, (2021). [doi]
Oliver Cooley, Nemanja Dragani, Mihyun Kang and Benny Sudakov, Large Induced Matchings in Random Graphs, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 35(1), (2021), 267–280. [doi]
Wolfgang Woess, Ratio limits and Martin boundary, Documenta Mathematica, Deutsche Mathematiker Vereinigung, 2021(26), (2021), 1501–1528. [doi]
M. Kang and M. Missethan, Local limit of sparse random planar graphs, Technical report, , (2021).
M. Isaev and M. Kang, On the chromatic number of graphons, Technical report, , (2021).
Arizmendi Echegaray, Octavio and Adrian Celestino, Polynomial with cyclic monotone elements with applications to Random Matrices with discrete spectrum, Random Matrices: Theory and Applications, World Scientific, 10(2), (2021). [doi]
Thomas Hirschler and Wolfgang Woess, Laplace and bi-Laplace equations for directed networks and Markov chains, Expositiones Mathematicae, Elsevier B.V., 39(2), (2021), 271–301. [doi]
Wiktor Ejsmont and Franz Lehner, The trace method for cotangent sums, Journal of Combinatorial Theory, Series A, Elsevier B.V., 177, (2021). [doi]
Wiktor Ejsmont and Franz Lehner, Sums of commutators in free probability, Journal of Functional Analysis, Academic Press, 280(2), (2021). [doi]
Eranda Cela, Stephan Hafner, Roland Mestel and Ulrich Pferschy, Mean-variance portfolio optimization based on ordinal information, Journal of Banking and Finance, Elsevier B.V., 122, (2021). [doi]
Agelos Georgakopoulos and Florian Lehner, Invariant spanning double rays in amenable groups, Discrete Mathematics, Elsevier B.V., 344(2), (2021). [doi]
Ecaterina Sava-Huss and Wolfgang Woess, Boundary behaviour of λ-polyharmonic functions on regular trees, Annali di Matematica Pura ed Applicata, Springer Verlag, 200(1), (2021), 35–50. [doi]
Joshua Erde, Gollin, J Pascal, Attila Joó, Paul Knappe and Max Pitz, Base Partition for Mixed Families of Finitary and Cofinitary Matroids, Combinatorica, Springer, 41(1), (2021), 31–52. [doi]
Christoph Aistleitner, Daniele D'Angeli, Abraham Gutierrez, Emanuele Rodaro and Amnon Rosenmann, Circular automata synchronize with high probability, Journal of Combinatorial Theory, Series A, Elsevier B.V., 178, (2021). [doi]
Hartmann, Tim A., Stefan Lendl and Woeginger, Gerhard J., Continuous facility location on graphs, Mathematical Programming, Springer, (2021). [doi]
Stefan Lendl, Britta Peis and Veerle Timmermans, Matroid Bases with Cardinality Constraints on the Intersection, Mathematical Programming, Springer, (2021). [doi]
Michael Missethan, Sparse random planar graphs, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 75(246), (2021), 29–41.
Amnon Rosenmann, Computing the sequence of $k$-cardinality assignments, Cornell University Library, (2021).
Florian Lehner and Christian Lindorfer, Comparing consecutive letter counts in multiple context-free languages, Theoretical Computer Science, Elsevier B.V., 868, (2021), 1–5. [doi]
Adrian Celestino, Kurusch Ebrahimi-Fard, Frédéric Patras and Daniel Perales, Cumulant-cumulant relations in free probability theory from Magnus' expansion, Foundations of Computational Mathematics, Springer New York, 22, (2021), 733–755. [doi]
J. Erde, M. Kang and M. Krivelevich, Large complete minors in random subgraphs, Combinatorics, Probability & Computing, Cambridge University Press, 30(4), (2021), 619–630. [doi]
Joshua Erde, Mihyun Kang and Michael Krivelevich, Expansion, long cycles, and compete minors in supercritical random subgraphs of the hypercube, Technical report, , (2021).
Christian Lindorfer, A language theoretic approach to self-avoiding walks, PhD thesis, Graz University of Technology (90000), (2021).
Amnon Rosenmann and Ventura Capell, Enric, Dependence and algebraicity over subgroups of free groups, Cornell University Library, (2021).
Eranda Dragoti-Cela, Bettina Klinz, Stefan Lendl, Orlin, James B., Gerhard Woeginger and Lasse Wulf, Linearizable Special Cases of the Quadratic Shortest Path Problem, In Graph-Theoretic Concepts in Computer Science (Kowalik, Łukasz, Pilipczuk, Michał, Rz\c a\.zewski, Pawel, eds.), Springer, (2021), 245–256. [doi]
Nikolaus Furian, Michael O'Sullivan, Cameron Walker and Eranda Cela, A Machine Learning Based Branch and Price Algorithm for a Sampled Vehicle Routing Problem, OR-Spectrum, Springer Verlag, 43(3), (2021), 693–732. [doi]
Hanna Oppelmayer, Boundary entropy spectra as finite subsums, Stochastics and Dynamics, World Scientific, 21(6), (2021). [doi]
Joshua Erde, Gollin, J. Pascal and Attila Joó, Enlarging vertex-flames in countable digraphs, Journal of Combinatorial Theory, Series B, Elsevier B.V., 151, (2021), 263–281. [doi]
Nathan Bowler, Joshua Erde, Florian Lehner and Max Pitz, Bounding the cop number of a graph by its genus, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 35(4), (2021), 2459–2489. [doi]
Thomas Lachmann, Stefan Lendl and Woeginger, Gerhard J., A linear time algorithm for the robust recoverable selection problem, Discrete Applied Mathematics, Elsevier B.V., 303, (2021), 94–107. [doi]
Marc Peigné and Wolfgang Woess, Recurrence of two-dimensional queueing processes, and random walk exit times from the quadrant, The Annals of Applied Probability, Institute of Mathematical Statistics, 31(6), (2021), 2519–2537. [doi]
Eranda Dragoti-Cela, Woeginger, Gerhard J. and Vladimir Deineko, Travelling salesman paths on Demidenko matrices, Discrete Applied Mathematics, Elsevier B.V., (2021). [doi]
Florian Lehner, Primo\v z Poto\v cnik and Pablo Spiga, On fixity of arc-transitive graphs, Science China / Mathematics, Science in China Press, 64(12), (2021), 2603–2610. [doi]

2022

Çela , Eranda and Elisabeth Gaar, Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid, Journal of Graph Algorithms and Applications, Brown University, 26(4), (2022), 519–552. [doi]
O. Cooley, M. Kang and O. Pikhurko, On a question of Vera T. Sós about size forcing of graphons, Acta Mathematica Hungarica, Springer Netherlands, 168(1), (2022), 1 – 26. [doi]
Joshua Erde, Mihyun Kang, Michael Krivelevich and Sahar Diskin, Percolation on High-dimensional Product Graphs, Technical report, , (2022).
Oliver Cooley, Del Giudice, Nicola, Mihyun Kang and Philipp Sprüssel, Phase transition in cohomology groups of non-uniform random simplicial complexes, Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 29(3), (2022). [doi]
Erich Kobler, Alexander Effland, Karl Kunisch and Thomas Pock, Total Deep Variation: A Stable Regularization Method for Inverse Problems, IEEE Transactions on Pattern Analysis and Machine Intelligence, IEEE Computer Society, 44(12), (2022), 9163 – 9180. [doi]
Armin Coja-Oghlan, O. Cooley, M. Kang, J. Lee and J.B. Ravelomanana, The Sparse Parity Matrix, In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Association of Computing Machinery, (2022), 822–833.
Anna Muranova and Wolfgang Woess, Networks with complex weights: Green function and power series, Mathematics, MDPI AG, 10(5), (2022). [doi]
M. Kang and M. Missethan, Concentration of maximum degree in random planar graphs, Journal of Combinatorial Theory, Series B, Elsevier B.V., 156, (2022), 310–342. [doi]
Oliver Cooley, Mihyun Kang and Julian Zalla, Loose cores and cycles in random hypergraphs, Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 29(4), (2022). [doi]
Joshua Erde, Mihyun Kang, Michael Krivelevich and Sahar Diskin, Percolation on Irregular High-dimensional Product Graphs, Technical report, , (2022).
M. Kang and M. Missethan, Longest and shortest cycles in random planar graphs, Random Structures and Algorithms, John Wiley and Sons Ltd, 60(3), (2022), 462–505. [doi]
Matteo Cavaleri, Daniele D\textquoterightAngeli, Alfredo Donno and Stefan Hammer, Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs, Discrete Applied Mathematics, Elsevier B.V., 307, (2022), 32–49. [doi]
Ante Custic and Stefan Lendl, The Steiner Cycle and Path Cover Problem on Interval Graphs, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 43(1), (2022), 226–234. [doi]
Octavio Arizmendi, Takahiro Hasebe and Franz Lehner, Cyclic independence: Boolean and monotone, Technical report, , (2022).
Adrian Celestino and Frédéric Patras, A forest formula for pre-Lie exponentials, Magnus' operator and cumulant-cumulant relations, Technical report, , (2022).
Florian Lehner, Universal planar graphs for the topological minor relation, Technical report, , (2022).
Florian Lehner, Monika Pil\'sniak and Marcin Stawiski, Corrigendum to “A bound for the distinguishing index of regular graphs”: “A bound for the distinguishing index of regular graphs” (European Journal of Combinatorics (2020) 89, (103145), (S0195669820300664), (10.1016/j.ejc.2020.103145)), European Journal of Combinatorics, Elsevier B.V., 101, (2022). [doi]
Panagiotis Spanos, Remarks on random walks on graphs and the Floyd boundary, Arkiv för Matematik, International Press of Boston, Inc., 60(1), (2022), 183–194. [doi]
Florian Lehner, A note on classes of subgraphs of locally finite graphs, Technical report, , (2022).
Do, Tuan Anh, Joshua Erde and Mihyun Kang, Planarity and genus of sparse random bipartite graphs, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 36(2), (2022), 1394–1415. [doi]
Julian Zalla and Oliver Cooley, High-order bootstrap percolation in hypergraphs, Technical report, , (2022).
Eranda Çela and Punnen, Abraham P., Complexity and Polynomially Solvable Special Cases of QUBO, Chapter in , Springer Nature Switzerland AG, (2022), 57–95. [doi]
Stefan Lendl, Gerhard Woeginger and Lasse Wulf, Non-Preemptive Tree Packing, Algorithmica, Springer New York, (2022). [doi]
Harris, Pamela E., Erik Insko and Florian Lehner, Tipsy cop and tipsy robber: collisions of biased random walks on graphs, Technical report, , (2022).
Florian Lehner, Asymmetric colouring of locally compact permutation groups, Technical report, , (2022).
Florian Lehner, Monika Pilsniak and Marcin Stawiski, Distinguishing infinite graphs with bounded degrees, Journal of Graph Theory, Wiley-Blackwell, 101(1), (2022), 52–65. [doi]
Amnon Rosenmann, Computing the sequence of k-cardinality assignments, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 44(2), (2022), 1265–1283. [doi]
Raúl Penaguiao and Yannic Vargas, Antipode formulas for pattern Hopf algebras, Technical report, , (2022).
Marc Goerigk, Stefan Lendl and Lasse Wulf, Two-Stage robust optimization problems with two-stage uncertainty, European Journal of Operational Research, Elsevier B.V., 302(1), (2022), 62–78. [doi]
O. Cooley, M. Kang and Oleg Pikhurko, On a question of Vera T. Sós about size forcing of graphons, Acta Mathematica Hungarica, Springer Netherlands, 168(1), (2022), 1–26. [doi]
Joshua Erde, Do, Tuan Anh, Michael Missethan and Oliver Cooley, The emergence of a giant rainbow component, Technical report, , (2022).
Nathan Bowler, Christian Elbracht, Joshua Erde, Gollin, J. Pascal, Karl Heuer, Max Pitz and Maximilian Teegen, Topological ubiquity of trees, Journal of Combinatorial Theory, Series B, Elsevier B.V., 157, (2022), 70–95. [doi]
Joshua Erde and Florian Lehner, Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups, Journal of Graph Theory, Wiley-Blackwell, 101(3), (2022), 559–571. [doi]
Marc Goerigk, Stefan Lendl and Lasse Wulf, Recoverable robust representatives selection problems with discrete budgeted uncertainty, European Journal of Operational Research, Elsevier B.V., 303(2), (2022), 567–580. [doi]

2023

Mikhail Isaev and Mihyun Kang, On the Chromatic Number in the Stochastic Block Model, Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 30(2), (2023). [doi]
Çela , Eranda , Bettina Klinz, Stefan Lendl, Woeginger, Gerhard J. and Lasse Wulf, A linear time algorithm for linearizing quadratic and higher-order shortest path problems, In Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Proceedings (Del Pia, Alberto, Volker Kaibel, eds.), Springer, (2023), 466–479. [doi]
Joshua Erde, Ben Barber, Peter Keevash and Alexander Roberts, Isoperimetric stability in lattices, In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB\textquoteright23, (2023), 107–113.
Florian Lehner and Christian Lindorfer, Self-avoiding walks and multiple context-free languages, Combinatorial Theory, eScholarship University of California, 3(1), (2023). [doi]
Joshua Erde, Mihyun Kang, Dominik Schmid, Bojan Mohar and Florian Lehner, Cop number of random k-uniform hypergraphs, In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications EUROCOMB\textquoteright23, (2023), 416–424.
Çela , Eranda , Vladimir Deineko and Gerhard Woeginger, Recognising permuted Demidenko matrices, arXiv, arXiv 2302.05191, (2023). [doi]
Vadim Kaimanovich and Wolfgang Woess, Limit distributions of branching Markov chains, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, Institut Henri Poincaré, 59(4), (2023), 1951–1983. [doi]
Joshua Erde, Mihyun Kang, Michael Krivelevich and Sahar Diskin, Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Product Graphs, Technical report, , (2023).
Vincent Pfenninger and Allan Lo, Towards Lehel's Conjecture for 4-Uniform Tight Cycles, The Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 30(1), (2023). [doi]
Joshua Erde, Mihyun Kang, Florian Lehner, Bojan Mohar and Dominik Schmid, Catching a robber on a random k-uniform hypergraph, Technical report, , (2023).
Sahar Diskin, Joshua Erde, Mihyun Kang and Michael Krivelevich, Percolation through Isoperimetry, Technical report, , (2023).
Eranda Çela, Stephan Hafner, Ulrich Pferschy and Roland Mestel, Integrating multiple sources of ordinal information in portfolio optimization, Technical report, , (2023).
Joshua Erde, Mihyun Kang and Michael Krivelevich, Expansion in supercritical random subgraphs of the hypercube and its consequences, The Annals of Probability, Institute of Mathematical Statistics, 51(1), (2023), 127–156. [doi]
Amin Coja-Oghlan, O. Cooley, M. Kang, Joon Lee and Ravelomanana, Jean Bernoulli, The Sparse Parity Matrix, Advances in Combinatorics, Alliance of Diamond OA Journals, 2023, (2023). [doi]
Amin Coja-Oghlan, Mihyun Kang, Lena Krieg and Maurice Rolvien, The k-XORSAT threshold revisited, Technical report, , (2023).
Stefan Hammer, Comparing Wiener, Szeged and revised Szeged index on cactus graphs, Ars Mathematica Contemporanea, DMFA Slovenije, 23(3), (2023). [doi]
Nantel Bergeron, González D'León, Rafael S., Li, Shu Xiao, Pang, C. Y.Amy and Yannic Vargas, Hopf algebras of parking functions and decorated planar trees, Advances in Applied Mathematics, Elsevier B.V., 143, (2023). [doi]
Eranda Çela, Bettina Klinz, Stefan Lendl, Woeginger, Gerhard J. and Lasse Wulf, A linear time algorithm for linearizing quadratic and higher-order shortest path problems, Technical report, , (2023).
Mihyun Kang and Michael Missethan, The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 37(1), (2023), 146–162. [doi]
David Gamarnik, Mihyun Kang and Pawel Pralat, Cliques, Chromatic Number, and Independent Sets in the Semi-random Process, Technical report, , (2023).
Stefan Lendl, Gerhard Woeginger and Lasse Wulf, Non-Preemptive Tree Packing, Algorithmica, Springer New York, 85(3), (2023), 783–804. [doi]
Celestino Rodriguez, Adrian de Jesus, Kurusch Ebrahimi-Fard, Alexandru Nica, Daniel Perales and Leon Witzman, Multiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants, Advances in Applied Mathematics, Elsevier B.V., 145, (2023). [doi]
Eranda Çela and Elisabeth Gaar, On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid, Discrete Applied Mathematics, Elsevier B.V., 331, (2023), 88–103. [doi]
Lucas Aragão, Maurício Collares, Gabriel Dahia and Marciano, João Pedro, The diameter of randomly twisted hypercubes, Technical report, , (2023).
Michael Anastos, Oliver Cooley, Mihyun Kang and Matthew Kwan, Partitioning problems via random processes, arXiv, (2023). [doi]
Do, Tuan Anh, Joshua Erde, Mihyun Kang and Michael Missethan, Component behaviour and excess of random bipartite graphs near the critical point, Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 30(3), (2023). [doi]
Joshua Erde, Nathan Bowler, Christian Elbracht, Gollin, J Pascal, Karl Heuer, Max Pitz and Maximilian Teegen, Ubiquity of graphs with nowhere-linear end structure, Journal of Graph Theory, Wiley-Blackwell, 103(3), (2023), 564–598. [doi]
Marija Alešković, Florian Küstner, Roman Messner, Florian Lackner, Ernst, Wolfgang E. and Marina Šekutor, Nanostructured supramolecular networks from self-assembled diamondoid molecules under ultracold conditions, Physical Chemistry, Chemical Physics, Royal Society of Chemistry, 25(27), (2023), 17869–17876. [doi]
Octavio Arizmendi, Franz Lehner and Amnon Rosenmann, On matrices in finite free position, Technical report, , (2023).
Çela , Eranda , Vladmir Deineko and Wöginger, Gerhard Johannes, Recognising permuted Demidenko matrices, Operations Research Letters, Elsevier B.V., 51(5), (2023), 494–500. [doi]
Gutierrez Sanchez, Abraham, Sebastian Müller and Šebek Stjepan, On asymptotic fairness in voting with greedy sampling, Advances in Applied Probability, Cambridge University Press, 55(3), (2023), 999–1032. [doi]
Takahiro Hasebe and Franz Lehner, Cumulants, spreadability and the Campbell–Baker–Hausdorff series, Documenta Mathematica, Deutsche Mathematiker Vereinigung, 28(3), (2023), 515–601. [doi]
Anita Dürr, Maalouly, Nicolas El} and Lasse Wulf, An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs, In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023 (Nicole Megow, Adam Smith, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023). [doi]
Samuele Giraudo and Yannic Vargas, Two associative operads of packed words, arXiv, (2023). [doi]
Dominique Manchon, Hedi Regeiba, Imen Rjaiba and Yannic Vargas, On the free commutative monoid over a positive operad, Technical report, , (2023).
Adrian Celestino and Yannic Vargas, Schröder trees, antipode formulas and non-commutative probability, arXiv, (2023). [doi]
Franz Lehner and Kamil Szpojankowski, Free Integral Calculus, Technical report, , (2023).
El Maalouly, Nicolas, Raphael Steiner and Lasse Wulf, Exact Matching: Correct Parity and FPT Parameterized by Independence Number, In 34th International Symposium on Algorithms and Computation, ISAAC 2023 (Satoru Iwata, Satoru Iwata, Naonori Kakimura, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023). [doi]
Hoang, Hung P., Stefan Lendl and Lasse Wulf, Assistance and interdiction problems on interval graphs, Discrete Applied Mathematics, Elsevier B.V., 340, (2023), 153–170. [doi]
Ben Barber, Joshua Erde, Peter Keevash and Alexander Roberts, Isoperimetric stability in lattices, Proceedings of the American Mathematical Society, American Mathematical Society, 151(12), (2023), 5021–5029. [doi]
Bettina Klinz and Eranda Çela, Gerhard J. Woeginger 1964-2022, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 77(254), (2023).
Adrian Celestino and Kurusch Ebrahimi-Fard, Conditionally monotone cumulants via shuffle algebra, Technical report, , (2023).

2024

Reinhard Diestel, Christian Elbracht, Joshua Erde and Maximilian Teegen, Duality and tangles of set separations, Journal of Combinatorics, International Press of Boston, Inc., 15(1), (2024), 1–39. [doi]
Nathan Bowler, Christian Elbracht, Joshua Erde, Pascal Gollin, J., Karl Heuer, Max Pitz and Maximilian Teegen, Ubiquity of locally finite graphs with extensive tree-decompositions, Combinatorial Theory, eScholarship University of California, 4(2), (2024). [doi]
Çela , Eranda , Bettina Klinz, Lasse Wulf and Stefan Lendl, A linear time algorithm for linearizing quadratic and higher-order shortest path problems, Mathematical Programming, North-Holland Publ Co, 2024, (2024). [doi]
Peter Allen, Olaf Parczyk and Vincent Pfenninger, Resilience for tight Hamiltonicity, Combinatorial Theory, eScholarship University of California, 4(1), (2024). [doi]
Joshua Erde, Matchings in the hypercube with specified edges, Technical report, , (2024).
Stijn Cambie, Bradley McCoy, Stephan Wagner and Corrine Yap, Bounding Mean Orders of Sub-k-Trees of k-Trees, Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 31(1), (2024). [doi]
Marc Goerigk, Stefan Lendl and Lasse Wulf, On the complexity of robust multi-stage problems with discrete recourse, Discrete Applied Mathematics, Elsevier B.V., 343, (2024), 355–370. [doi]
Maalouly, Nicolas El}, Sebastian Haslebacher and Lasse Wulf, On the Exact Matching Problem in Dense Graphs, In 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024 (Olaf Beyersdorff, Kante, Mamadou Moustapha, Orna Kupferman, Daniel Lokshtanov, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024). [doi]
Lucas Aragão, Maurício Collares, Marciano, João Pedro, Taísa Martins and Robert Morris, A lower bound for set-coloring Ramsey numbers, Random Structures and Algorithms, John Wiley and Sons Ltd, 64(2), (2024), 157–169. [doi]
Mathwieser, Corinna Marlene and Eranda Cela, Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty, Networks, Wiley-Liss Inc., 83(3), (2024), 587–604. [doi]
Clemens Heuberger, Selkirk, Sarah J. and Stephan Wagner, The distribution of the maximum protection number in simply generated trees, Combinatorics Probability and Computing, Cambridge University Press, 33(4), (2024). [doi]
Maurício Collares, Joseph Doolittle and Joshua Erde, The evolution of the permutahedron, Technical report, , (2024).
Anna Geisler and Sahar Diskin, Perfect Matching in Product Graphs and in their Random Subgraphs, Technical report, , (2024). [doi]
Picardello, Massimo A., Maura Salvatori and Wolfgang Woess, Polyharmonic potential theory on the Poincaré disk, Journal of Functional Analysis, Academic Press, 286(9), (2024). [doi]
Marcelo Campos, Maurício Collares and Mota, Guilherme Oliveira, Counting orientations of random graphs with no directed k-cycles, Random Structures and Algorithms, John Wiley and Sons Ltd, 64(3), (2024), 676–691. [doi]
Sahar Diskin, Joshua Erde, Mihyun Kang and Michael Krivelevich, Percolation on irregular high-dimensional product graphs, Combinatorics, Probability & Computing, Cambridge University Press, 33(3), (2024), 377–403. [doi]
Cardona Vasquez, David, Klatzer, Thomas Florian, Bettina Klinz and Sonja Wogrin, Enhancing time series aggregation for power system optimization models: Incorporating network and ramping constraints, Electric Power Systems Research, Elsevier B.V., 230, (2024). [doi]
Maurício Collares, Joshua Erde, Anna Geisler and Mihyun Kang, Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs, Technical report, , (2024).
Do, Tuan Anh, Joshua Erde and Mihyun Kang, A note on the width of sparse random graphs, Journal of Graph Theory, Wiley-Blackwell, 106(2), (2024), 273–295. [doi]
Dominik Schmid, Mihyun Kang and Michael Missethan, Bootstrap percolation on the high-dimensional Hamming graph, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, (2024).
Amnon Rosenmann and Enric Ventura, Dependence over subgroups of free groups, International Journal of Algebra and Computation, World Scientific, 34(4), (2024), 439–470. [doi]
Vladimir Deineko, Bettina Klinz and Woeginger, Gerhard J., The bipartite travelling salesman problem: A pyramidally solvable case, Operations Research Letters, Elsevier B.V., 55, (2024). [doi]
Cyril Banderier, Markus Kuba, Stephan Wagner and Michael Wallner, Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models, In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, A of A 2024 (Cecile Mailler, Sebastian Wild, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024). [doi]
Stephan Wagner, On the Number of Distinct Fringe Subtrees in Binary Search Trees, In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, A of A 2024 (Cecile Mailler, Sebastian Wild, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024). [doi]
Maurício Collares, Sahar Diskin, Joshua Erde and Michael Krivelevich, Long cycles in percolated expanders, Technical report, , (2024).
Fabian Burghart and Stephan Wagner, A Bijection for the Evolution of B-Trees, In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, A of A 2024 (Cecile Mailler, Sebastian Wild, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024). [doi]
Stephan Wagner and Mei Yin, Statistics of Parking Functions and Labeled Forests, In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, A of A 2024 (Cecile Mailler, Sebastian Wild, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024). [doi]
Benjamin Hackl and Stephan Wagner, Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study, In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, A of A 2024 (Cecile Mailler, Sebastian Wild, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024). [doi]
Sahar Diskin, Joshua Erde, Mihyun Kang and Michael Krivelevich, Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs, arXiv, (2024). [doi]
Sahar Diskin, Joshua Erde, Mihyun Kang and Michael Krivelevich, Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs, Combinatorica, Springer, 44(4), (2024), 741–784. [doi]
Cardona Vasquez, David, Bettina Klinz and Sonja Wogrin, Improving accuracy of energy system models for an efficient energy transition: basis-oriented aggregation and machine learning, In 45TH IAEE INTERNATIONAL CONFERENCE 25 -28 JUNE, 2024 ISTANBUL BOĞAZİÇİ UNIVERSITY, (2024), 481–484.
Anna Geisler and Sahar Diskin, Minimum degree k and k-connectedness usually arrive together, Technical report, , (2024). [doi]
Allan Lo and Vincent Pfenninger, Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles, Innovations in Graph Theory, Centre Mersenne for Open Scientific Publishing, 2024(1), (2024), 1–19. [doi]
Çela , Eranda , Vladimir Deineko and Woeginger, Gerhard J., Travelling salesman paths on Demidenko matrices, Discrete Applied Mathematics, Elsevier B.V., 2024(354), (2024), 3–14.
Kang, Dong Yeap, Tom Kelly, Daniela Kühn, Deryk Osthus and Vincent Pfenninger, Perfect Matchings in Random Sparsifications of Dirac Hypergraphs, Combinatorica, Springer, 44(6), (2024), 1233–1266. [doi]