Adam Hesterberg

Orcid: 0000-0002-6053-1167

According to our database¹, Adam Hesterberg authored at least 37 papers between 2012 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Super Guarding and Dark Rays in Art Galleries.

[BibT_eX]

[DOI]

CoRR, 2024

2023

When Can You Tile an Integer Rectangle with Integer Squares?

[BibT_eX]

[DOI]

CoRR, 2023

Super Guarding and Dark Rays in Art Galleries.

[BibT_eX]

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2021

Snipperclips: Cutting tools into desired polygons using themselves.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Multidimensional Scaling: Approximation and Complexity.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Characterizing Universal Reconfigurability of Modular Pivoting Robots.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Scalable Equilibrium Computation in Multi-agent Influence Games on Networks.

[BibT_eX]

[DOI]

Fotini Christia

Michael J. Curry

Constantinos Daskalakis

Erik D. Demaine

John P. Dickerson

MohammadTaghi Hajiaghayi

Adam Hesterberg

Marina Knittel

Aidan Milliff

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.

[BibT_eX]

[DOI]

Ivan Tadeu Ferreira Antunes Filho

J. Inf. Process., 2020

Tetris is NP-hard even with <i>O</i>(1) Rows or Columns.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Path Puzzles: Discrete Tomography with a Path Constraint is Hard.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Tetris is NP-hard even with $O(1)$ rows or columns.

[BibT_eX]

[DOI]

CoRR, 2020

Escaping a Polygon.

[BibT_eX]

[DOI]

CoRR, 2020

Arithmetic Expression Construction.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Finding Closed Quasigeodesics on Convex Polyhedra.

[BibT_eX]

[DOI]

Erik D. Demaine

Adam Hesterberg

Jason S. Ku

Proceedings of the 36th International Symposium on Computational Geometry, 2020

New Results in Sona Drawing: Hardness and TSP Separation.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Reconfiguring Undirected Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018

Conflict-Free Coloring of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Folding Polyominoes into (Poly)Cubes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2018

Pachinko.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Negative Instance for the Edge Patrolling Beacon Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

The Parameterized Complexity of Ricochet Robots.

[BibT_eX]

[DOI]

Adam Hesterberg

Justin Kopinsky

J. Inf. Process., 2017

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ...

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Even 1 × <i>n</i> Edge-Matching and Jigsaw Puzzles are Really Hard.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard.

[BibT_eX]

[DOI]

CoRR, 2017

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Upward Partitioned Book Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Folding a paper strip to minimize thickness.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Single-Player and Two-Player Buttons & Scissors Games.

[BibT_eX]

[DOI]

CoRR, 2016

The Shortest Separating Cycle Problem.

[BibT_eX]

[DOI]

Esther M. Arkin

Jie Gao

Adam Hesterberg

Joseph S. B. Mitchell

Jiemin Zeng

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015

Improved Connectivity Condition for Byzantine Fault Tolerance.

[BibT_eX]

[DOI]

Adam Hesterberg

Andrea Lincoln

Jayson Lynch

CoRR, 2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Mario Kart Is Hard.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2012

Extremal functions of excluded tensor products of permutation matrices.

[BibT_eX]

[DOI]

Adam Hesterberg

Discret. Math., 2012

Adam Hesterberg

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...