Andreas M. Hinz

Publication Activity (10 Years)

Years Active: 1989-2022
Publications (10 Years): 10

Top Topics

Maximum Common Subgraph

Computationally Tractable

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Discuss. Math. Graph Theory

Electron. J. Comb.

Publications

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