Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Udi Rotics
Daniel P. Kennedy
Dan Graur
Barbara Aquilani
Yu Peng
Chengtao Li
Roland Zumkeller
Maximilian Dürr
Liangliang Shang
Chen Ma
Home
/
Paper
/
Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together).
Paper Info
Open Visualization
Title
Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together).
Year
Venue
DocType
2021
CCCG
Conference
Citations
PageRank
References
0
0.34
0
Authors
3
Authors (3 rows)
Cited by (0 rows)
References (0 rows)
Name
Order
Citations
PageRank
Austin Barr
1
0
0.34
Calvin Chung
2
0
0.34
Aaron Williams
3
139
20.42
1
