default search action
Andreas M. Hinz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j18]Andreas M. Hinz
, Borut Luzar
The Dudeney-Stockmeyer Conjecture. Discret. Appl. Math. 319: 19-26 (2022) - [j17]Kannan Balakrishnan, Manoj Changat, Andreas M. Hinz
The median of Sierpiński graphs. Discret. Appl. Math. 319: 159-170 (2022) - [j16]Andreas M. Hinz
Metric properties of Sierpiński triangle graphs. Discret. Appl. Math. 319: 439-453 (2022) - 2020
- [j15]Andreas M. Hinz, Nazanin Movarraei:
The Hanoi graph H34. Discuss. Math. Graph Theory 40(4): 1095-1109 (2020)
2010 – 2019
- 2019
- [j14]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): 1950049:1-1950049:4 (2019) - 2018
- [j13]Andreas M. Hinz, Seethu Varghese, Ambat Vijayakumar:
Power domination in Knödel graphs and Hanoi graphs. Discuss. Math. Graph Theory 38(1): 63-74 (2018) - 2017
- [j12]Andreas M. Hinz, Sandi Klavzar
A survey and classification of Sierpiński-type graphs. Discret. Appl. Math. 217: 565-600 (2017) - [j11]Andreas M. Hinz:
Open Problems for Hanoi and Sierpiński Graphs. Electron. Notes Discret. Math. 63: 23-31 (2017) - 2016
- [j10]Andreas M. Hinz, S. Arumugam
Preface. Electron. Notes Discret. Math. 53: 1-2 (2016) - [j9]Andreas M. Hinz, Ciril Petr:
Computational Solution of an Old Tower of Hanoi Problem. Electron. Notes Discret. Math. 53: 445-458 (2016) - 2014
- [j8]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): 4 (2014) - [j7]Andreas M. Hinz, Caroline Holz auf der Heide:
An efficient algorithm to determine all shortest paths in Sierpiński graphs. Discret. Appl. Math. 177: 111-120 (2014) - 2013
- [b1]Andreas M. Hinz, Sandi Klavzar, Uros Milutinovic, Ciril Petr:
The Tower of Hanoi - Myths and Maths. Birkhäuser 2013, ISBN 978-3-0348-0236-9, pp. I-XV, 1-335 - 2012
- [j6]Andreas M. Hinz, Daniele Parisse:
Coloring Hanoi and Sierpiński graphs. Discret. Math. 312(9): 1521-1535 (2012) - [j5]Andreas M. Hinz, Daniele Parisse:
The Average Eccentricity of Sierpiński Graphs. Graphs Comb. 28(5): 671-686 (2012)
2000 – 2009
- 2009
- [j4]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): 2934-2947 (2009) - 2005
- [j3]Andreas M. Hinz, Sandi Klavzar
Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence. Eur. J. Comb. 26(5): 693-708 (2005)
1990 – 1999
- 1992
- [j2]Andreas M. Hinz:
Shortest paths between regular states of the Tower of Hanoi. Inf. Sci. 63(1-2): 173-181 (1992)
1980 – 1989
- 1989
- [j1]Andreas M. Hinz:
An iterative algorithm for the Tower of Hanoi with four pegs. Computing 42(2-3): 133-140 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: