Andreas M. Hinz

According to our database, Andreas M. Hinz authored at least 19 papers between 1989 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

The Dudeney-Stockmeyer Conjecture.

Andreas M. Hinz, Borut Luzar, Ciril Petr

Discret. Appl. Math., 2022

Metric properties of Sierpiński triangle graphs.

Andreas M. Hinz, Caroline Holz auf der Heide, Sara Sabrina Zemljic

Discret. Appl. Math., 2022

The median of Sierpiński graphs.

Kannan Balakrishnan, Manoj Changat, Andreas M. Hinz, Divya Sindhu Lekha

Discret. Appl. Math., 2022

2020

The Hanoi graph <i>H³₄</i>.

Andreas M. Hinz, Nazanin Movarraei

Discuss. Math. Graph Theory, 2020

2019

A note on the Frame-Stewart conjecture.

Thierry Bousch, Andreas M. Hinz, Sandi Klavzar, Daniele Parisse, Ciril Petr, Paul K. Stockmeyer

Discret. Math. Algorithms Appl., 2019

2018

Power domination in Knödel graphs and Hanoi graphs.

Andreas M. Hinz, Seethu Varghese, Ambat Vijayakumar

Discuss. Math. Graph Theory, 2018

2017

Open Problems for Hanoi and Sierpiński Graphs.

Andreas M. Hinz

Electron. Notes Discret. Math., 2017

A survey and classification of Sierpiński-type graphs.

Andreas M. Hinz, Sandi Klavzar, Sara Sabrina Zemljic

Discret. Appl. Math., 2017

2016

Computational Solution of an Old Tower of Hanoi Problem.

Andreas M. Hinz, Ciril Petr

Electron. Notes Discret. Math., 2016

Preface.

Andreas M. Hinz, S. Arumugam, Rangaswami Balakrishnan, S. Francis Raj, T. Karthick, K. Somasundaram, Xuding Zhu

Electron. Notes Discret. Math., 2016

2014

An efficient algorithm to determine all shortest paths in Sierpiński graphs.

Andreas M. Hinz, Caroline Holz auf der Heide

Discret. Appl. Math., 2014

The Number of Moves of the Largest Disc in Shortest Paths on Hanoi Graphs.

Simon Aumann, Katharina A. M. Götz, Andreas M. Hinz, Ciril Petr

Electron. J. Comb., 2014

2013

The Tower of Hanoi - Myths and Maths.

Andreas M. Hinz, Sandi Klavzar, Uros Milutinovic, Ciril Petr

Birkhäuser, ISBN: 978-3-0348-0236-9, 2013

2012

The Average Eccentricity of Sierpiński Graphs.

Andreas M. Hinz, Daniele Parisse

Graphs Comb., 2012

Coloring Hanoi and Sierpiński graphs.

Andreas M. Hinz, Daniele Parisse

Discret. Math., 2012

2009

A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles.

Andreas M. Hinz, Anton Kostov, Fabian Kneißl, Fatma Sürer, Adrian Danek

Inf. Sci., 2009

2005

Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence.

Andreas M. Hinz, Sandi Klavzar, Uros Milutinovic, Daniele Parisse, Ciril Petr

Eur. J. Comb., 2005

1992

Shortest paths between regular states of the Tower of Hanoi.

Andreas M. Hinz

Inf. Sci., 1992

1989

An iterative algorithm for the Tower of Hanoi with four pegs.

Andreas M. Hinz

Computing, 1989