Andreas M. Hinz

20 papers Journal 19
YearRankTypeTitle / Venue / Authors
2026 J jnl
The median of Sierpiński triangle graphs.
Discret. Appl. Math.
Kannan Balakrishnan, Manoj Changat, M. V. Dhanyamol, Andreas M. Hinz, Hrishik Koley, Divya Sindhu Lekha
2022 J jnl
Metric properties of Sierpiński triangle graphs.
Discret. Appl. Math.
Andreas M. Hinz, Caroline Holz auf der Heide, Sara Sabrina Zemljic
2022 J jnl
The Dudeney-Stockmeyer Conjecture.
Discret. Appl. Math.
Andreas M. Hinz, Borut Luzar, Ciril Petr
2022 J jnl
The median of Sierpiński graphs.
Discret. Appl. Math.
Kannan Balakrishnan, Manoj Changat, Andreas M. Hinz, Divya Sindhu Lekha
2020 J jnl
The Hanoi graph
Discuss. Math. Graph Theory
Andreas M. Hinz, Nazanin Movarraei
2019 J jnl
A note on the Frame-Stewart conjecture.
Discret. Math. Algorithms Appl.
Thierry Bousch, Andreas M. Hinz, Sandi Klavzar, Daniele Parisse, Ciril Petr, Paul K. Stockmeyer
2018 J jnl
Power domination in Knödel graphs and Hanoi graphs.
Discuss. Math. Graph Theory
Andreas M. Hinz, Seethu Varghese, Ambat Vijayakumar
2017 J jnl
A survey and classification of Sierpiński-type graphs.
Discret. Appl. Math.
Andreas M. Hinz, Sandi Klavzar, Sara Sabrina Zemljic
2017 J jnl
Open Problems for Hanoi and Sierpiński Graphs.
Electron. Notes Discret. Math.
Andreas M. Hinz
2016 J jnl
Computational Solution of an Old Tower of Hanoi Problem.
Electron. Notes Discret. Math.
Andreas M. Hinz, Ciril Petr
2016 J jnl
Preface.
Electron. Notes Discret. Math.
Andreas M. Hinz, S. Arumugam, Rangaswami Balakrishnan, S. Francis Raj, T. Karthick, K. Somasundaram, Xuding Zhu
2014 J jnl
An efficient algorithm to determine all shortest paths in Sierpiński graphs.
Discret. Appl. Math.
Andreas M. Hinz, Caroline Holz auf der Heide
2014 J jnl
The Number of Moves of the Largest Disc in Shortest Paths on Hanoi Graphs.
Electron. J. Comb.
Simon Aumann, Katharina A. M. Götz, Andreas M. Hinz, Ciril Petr
2013 — book
The Tower of Hanoi - Myths and Maths.
Andreas M. Hinz, Sandi Klavzar, Uros Milutinovic, Ciril Petr
2012 J jnl
Coloring Hanoi and Sierpiński graphs.
Discret. Math.
Andreas M. Hinz, Daniele Parisse
2012 J jnl
The Average Eccentricity of Sierpiński Graphs.
Graphs Comb.
Andreas M. Hinz, Daniele Parisse
2009 J jnl
A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles.
Inf. Sci.
Andreas M. Hinz, Anton Kostov, Fabian Kneißl, Fatma Sürer, Adrian Danek
2005 J jnl
Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence.
Eur. J. Comb.
Andreas M. Hinz, Sandi Klavzar, Uros Milutinovic, Daniele Parisse, Ciril Petr
1992 J jnl
Shortest paths between regular states of the Tower of Hanoi.
Inf. Sci.
Andreas M. Hinz
1989 J jnl
An iterative algorithm for the Tower of Hanoi with four pegs.
Computing
Andreas M. Hinz