Lily Chung

According to our database1, Lily Chung authored at least 13 papers between 2020 and 2024.

Collaborative distances:

Timeline

2020
2021
2022
2023
2024
0
1
2
3
4
5
3
2
1
1
1
1
3
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude.
CoRR, 2024

Folding One Polyhedral Metric Graph into Another.
CoRR, 2024

All Polyhedral Manifolds are Connected by a 2-Step Refolding.
CoRR, 2024

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023
Complexity of Solo Chess with Unlimited Moves.
CoRR, 2023

This Game Is Not Going To Analyze Itself.
CoRR, 2023

Improved Local Computation Algorithms for Constructing Spanners.
Proceedings of the Approximation, 2023

2022
Celeste is PSPACE-hard.
CoRR, 2022

Lower Bounds on Retroactive Data Structures.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.
J. Inf. Process., 2020


  Loading...