Adam Hesterberg - Citegraph

Author Info

Name	Affiliation	Papers
ADAM HESTERBERG	Department of Mathematics, Massachusetts Institute of Technology, USA	20
Collaborators	Citations	PageRank
82	4	7.07
Referers	Referees	References
14	104	51

Search Limit

100104

Publications (20 rows)

Collaborators (82 rows)

Referers (14 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Characterizing Universal Reconfigurability of Modular Pivoting Robots	0	0.34	2021
1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete	0	0.34	2021
Snipperclips: Cutting tools into desired polygons using themselves	0	0.34	2021
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible	0	0.34	2020
New Results in Sona Drawing: Hardness and TSP Separation	0	0.34	2020
Arithmetic Expression Construction	0	0.34	2020
Reconfiguring Undirected Paths.	0	0.34	2019
Pachinko.	0	0.34	2018
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.	0	0.34	2018
Folding Polyominoes into (Poly)Cubes.	1	0.38	2017
Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ...	0	0.34	2017
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.	0	0.34	2017
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.	0	0.34	2017
The Parameterized Complexity of Ricochet Robots.	0	0.34	2017
Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard.	1	0.40	2017
Upward Partitioned Book Embeddings.	1	0.34	2017
The Shortest Separating Cycle Problem.	0	0.34	2016
Single-Player and Two-Player Buttons & Scissors Games.	0	0.34	2016
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).	0	0.34	2015
Folding a Paper Strip to Minimize Thickness.	1	0.54	2014