| Publication | Date of Publication | Type |
|---|
Reconfiguration of non-crossing spanning trees
Journal of Computational Geometry | 2024-12-19 | Paper |
| Lower bounds on retroactive data structures | 2024-09-11 | Paper |
| Compacting squares: input-sensitive in-place reconfiguration of sliding squares | 2024-05-27 | Paper |
| Pushing blocks via checkable gadgets: PSPACE-completeness of push-1f and block/box dude | 2024-05-16 | Paper |
| Rolling polyhedra on tessellations | 2024-05-16 | Paper |
| Flat folding an unassigned single-vertex complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without flat angles | 2024-05-14 | Paper |
Celeste is PSPACE-hard
(available as arXiv preprint) | 2024-04-09 | Paper |
| Celeste is PSPACE-hard | 2024-04-09 | Paper |
The Legend of Zelda: the complexity of mechanics
(available as arXiv preprint) | 2024-04-09 | Paper |
| The Legend of Zelda: the complexity of mechanics | 2024-04-09 | Paper |
| Multifold tiles of polyominoes and convex lattice polygons | 2024-04-09 | Paper |
Unfolding orthotubes with a dual Hamiltonian path
(available as arXiv preprint) | 2024-04-09 | Paper |
| Unfolding orthotubes with a dual Hamiltonian path | 2024-04-09 | Paper |
Complexity of simple folding of mixed orthogonal crease patterns
(available as arXiv preprint) | 2024-04-09 | Paper |
| Complexity of simple folding of mixed orthogonal crease patterns | 2024-04-09 | Paper |
Orthogonal fold \& cut
(available as arXiv preprint) | 2024-04-09 | Paper |
| Orthogonal fold \& cut | 2024-04-09 | Paper |
Particle computation: complexity, algorithms, and logic
Natural Computing | 2024-02-09 | Paper |
Particle computation: complexity, algorithms, and logic
Natural Computing | 2024-02-09 | Paper |
Chess Equilibrium Puzzles
Mathematics Magazine | 2023-11-17 | Paper |
Traversability, reconfiguration, and reachability in the gadget framework
Algorithmica | 2023-11-17 | Paper |
Arithmetic Expression Construction.
(available as arXiv preprint) | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7765375 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-14 | Paper |
Recursed Is Not Recursive: A Jarring Result
(available as arXiv preprint) | 2023-11-14 | Paper |
Finding closed quasigeodesics on convex polyhedra
(available as arXiv preprint) | 2023-11-02 | Paper |
| When Can You Tile an Integer Rectangle with Integer Squares? | 2023-08-29 | Paper |
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets
Theoretical Computer Science | 2023-08-01 | Paper |
Any Platonic solid can transform to another by \(O(1)\) refoldings
Computational Geometry | 2023-07-12 | Paper |
Negative instance for the edge patrolling beacon problem
(available as arXiv preprint) | 2023-03-31 | Paper |
| Toward unfolding doubly covered \(n\)-stars | 2023-03-31 | Paper |
| Packing cube nets into rectangles with \(O(1)\) holes | 2023-03-31 | Paper |
| Tatamibari is NP-complete | 2023-02-07 | Paper |
| \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete | 2023-02-07 | Paper |
| Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650410 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| This Game Is Not Going To Analyze Itself | 2023-02-02 | Paper |
Rectangular spiral galaxies are still hard
Computational Geometry | 2023-01-09 | Paper |
PSPACE-completeness of reversible deterministic systems
(available as arXiv preprint) | 2022-12-09 | Paper |
Strings-and-coins and nimstring are PSPACE-complete
Combinatorial Game Theory | 2022-10-14 | Paper |
Developing a tetramonohedron with minimum cut length
Computational Geometry | 2022-10-06 | Paper |
Some polycubes have no edge zipper unfolding
(available as arXiv preprint) | 2022-09-09 | Paper |
Area-optimal simple polygonalizations: the CG challenge 2019
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets
(available as arXiv preprint) | 2022-07-13 | Paper |
Traversability, reconfiguration, and reachability in the gadget framework
(available as arXiv preprint) | 2022-07-13 | Paper |
Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations
(available as arXiv preprint) | 2022-05-24 | Paper |
Filling a hole in a crease pattern: Isometric mapping from prescribed boundary folding
Origami⁶ | 2022-05-24 | Paper |
Filling a hole in a crease pattern: Isometric mapping from prescribed boundary folding
Origami⁶ | 2022-05-24 | Paper |
Rigid flattening of polyhedra with slits
Origami⁶ | 2022-05-24 | Paper |
Scaling any surface down to any fraction
Origami⁶ | 2022-05-24 | Paper |
Weaving a uniformly thick sheet from rectangles
Origami⁶ | 2022-05-24 | Paper |
scientific article; zbMATH DE number 7525474 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
(available as arXiv preprint) | 2022-05-11 | Paper |
Ununfoldable polyhedra with \(6\) vertices or \(6\) faces
Computational Geometry | 2022-04-08 | Paper |
| Strings-and-coins and Nimstring are PSPACE-complete | 2022-03-25 | Paper |
Strings-and-coins and Nimstring are PSPACE-complete
(available as arXiv preprint) | 2022-03-25 | Paper |
On the effects of hierarchical self-assembly for reducing program-size complexity
Theoretical Computer Science | 2021-11-11 | Paper |
Continuous flattening of all polyhedral manifolds using countably infinite creases
Computational Geometry | 2021-09-17 | Paper |
Snipperclips: cutting tools into desired polygons using themselves
Computational Geometry | 2021-09-17 | Paper |
Belga B-trees
Theory of Computing Systems | 2021-08-03 | Paper |
Belga B-trees
Theory of Computing Systems | 2021-08-03 | Paper |
Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
(available as arXiv preprint) | 2021-06-15 | Paper |
Approximating the Canadian traveller problem with online randomization
Algorithmica | 2021-04-19 | Paper |
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
Algorithmica | 2021-04-19 | Paper |
Folding polyominoes with holes into a cube
Computational Geometry | 2021-01-07 | Paper |
| Coin-flipping magic | 2020-11-10 | Paper |
| scientific article; zbMATH DE number 7272496 (Why is no real title available?) | 2020-11-10 | Paper |
Existence and hardness of conveyor belts
The Electronic Journal of Combinatorics | 2020-11-05 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Computational Geometry | 2020-10-23 | Paper |
Universal hinge patterns for folding strips efficiently into any grid polyhedron
Computational Geometry | 2020-10-23 | Paper |
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
Theoretical Computer Science | 2020-09-03 | Paper |
scientific article; zbMATH DE number 7238987 (Why is no real title available?)
(available as arXiv preprint) | 2020-08-25 | Paper |
Nearly optimal separation between partially and fully retroactive data structures
(available as arXiv preprint) | 2020-08-25 | Paper |
| Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch | 2020-08-18 | Paper |
Computational complexity of motion planning of a robot through simple gadgets
(available as arXiv preprint) | 2020-08-11 | Paper |
The computational complexity of Portal and other 3D video games
(available as arXiv preprint) | 2020-08-11 | Paper |
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
(available as arXiv preprint) | 2020-08-11 | Paper |
Computational complexity of generalized Push Fight
(available as arXiv preprint) | 2020-08-11 | Paper |
Solving the Rubik's Cube Optimally is NP-complete
(available as arXiv preprint) | 2020-08-05 | Paper |
| Escaping a Polygon | 2020-07-17 | Paper |
Conic crease patterns with reflecting rule lines
(available as arXiv preprint) | 2020-07-10 | Paper |
| scientific article; zbMATH DE number 7219440 (Why is no real title available?) | 2020-07-10 | Paper |
| Folding triangular and hexagonal mazes | 2020-07-10 | Paper |
Cookie clicker
Graphs and Combinatorics | 2020-04-03 | Paper |
Cookie clicker
Graphs and Combinatorics | 2020-04-03 | Paper |
Polyhedral characterization of reversible hinged dissections
Graphs and Combinatorics | 2020-04-03 | Paper |
Infinite all-layers simple foldability
Graphs and Combinatorics | 2020-04-03 | Paper |
Path puzzles: discrete tomography with a path constraint is hard
Graphs and Combinatorics | 2020-04-03 | Paper |
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Theoretical Computer Science | 2020-01-16 | Paper |
Reconfiguring undirected paths
(available as arXiv preprint) | 2020-01-16 | Paper |
| Reconfiguring undirected paths | 2020-01-16 | Paper |
Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
SIAM Journal on Computing | 2019-12-09 | Paper |
Simulation of programmable matter systems using active tile-based self-assembly
(available as arXiv preprint) | 2019-12-05 | Paper |
| Simulation of programmable matter systems using active tile-based self-assembly | 2019-12-05 | Paper |
Belga B-trees
Computer Science – Theory and Applications | 2019-10-22 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
| A review on curved creases in art, design and mathematics | 2019-06-12 | Paper |
Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows”
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| scientific article; zbMATH DE number 7051287 (Why is no real title available?) | 2019-05-06 | Paper |
| The geometry of binary search trees | 2019-05-06 | Paper |
Any monotone function is realized by interlocked polygons
Algorithms | 2019-03-26 | Paper |
Flat foldings of plane graphs with prescribed angles and edge lengths
(available as arXiv preprint) | 2019-02-27 | Paper |
Upward partitioned book embeddings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Upward partitioned book embeddings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Sequentially swapping colored tokens on graphs
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Algorithmica | 2019-01-11 | Paper |
Conflict-free coloring of graphs
SIAM Journal on Discrete Mathematics | 2018-11-28 | Paper |
Folding Polyominoes into (Poly)Cubes
International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
The fewest clues problem
Theoretical Computer Science | 2018-11-23 | Paper |
Interlocked open linkages with few joints
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Vertex-unfoldings of simplicial manifolds
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Know when to fold 'em: self-assembly of shapes by folding in oritatami
(available as arXiv preprint) | 2018-11-08 | Paper |
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Bumpy pyramid folding
Computational Geometry | 2018-10-31 | Paper |
Minimizing movement: fixed-parameter tractability
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Node-weighted Steiner tree and group Steiner tree in planar graphs
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Reconfiguring massive particle swarms with limited, global control | 2018-10-17 | Paper |
Juggling and card shuffling meet mathematical fonts
Connections in Discrete Mathematics | 2018-10-09 | Paper |
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Lecture Notes in Computer Science | 2018-10-04 | Paper |
| Origamizer: a practical algorithm for folding any polyhedron | 2018-08-13 | Paper |
Universal shape replicators via self-assembly with attractive and repulsive forces
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Three colors suffice: conflict-free coloring of planar graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A simple proof that the \((n^{2} - 1)\)-puzzle is hard
Theoretical Computer Science | 2018-06-07 | Paper |
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
(available as arXiv preprint) | 2018-06-07 | Paper |
Continuously flattening polyhedra using straight skeletons
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Pachinko
Computational Geometry | 2018-02-19 | Paper |
Pachinko
Computational Geometry | 2018-02-19 | Paper |
| Who needs crossings? Hardness of plane graph rigidity | 2018-01-30 | Paper |
| The complexity of Hex and the Jordan curve theorem | 2017-12-19 | Paper |
Unfolding genus-2 orthogonal polyhedra with linear refinement
Graphs and Combinatorics | 2017-12-12 | Paper |
| Tilt: the video -- designing worlds to control robot swarms with only global signals | 2017-10-10 | Paper |
Separating point sets in polygonal environments
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
An energy-driven approach to linkage unfolding
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Embedding stacked polytopes on a polynomial-size grid | 2017-09-29 | Paper |
Geodesic ham-sandwich cuts
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Low-dimensional embedding with extra information
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Inapproximability of the standard pebble game and hard to pebble graphs
(available as arXiv preprint) | 2017-09-22 | Paper |
| Inapproximability of the standard pebble game and hard to pebble graphs | 2017-09-22 | Paper |
Universal hinge patterns for folding strips efficiently into any grid polyhedron
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Arboral satisfaction: recognition and LP approximation
Information Processing Letters | 2017-08-16 | Paper |
Push-pull block puzzles are hard
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Push-pull block puzzles are hard
Lecture Notes in Computer Science | 2017-07-21 | Paper |
| The fewest clues problem | 2017-07-17 | Paper |
| Super Mario Bros. is harder/easier than we thought | 2017-07-17 | Paper |
Embedding stacked polytopes on a polynomial-size grid
Discrete & Computational Geometry | 2017-06-16 | Paper |
New geometric algorithms for fully connected staged self-assembly
Theoretical Computer Science | 2017-05-18 | Paper |
On Cartesian trees and range minimum queries
Algorithmica | 2017-05-17 | Paper |
Sequentially swapping colored tokens on graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Rigid Origami Vertices: Conditions and Forcing Sets
(available as arXiv preprint) | 2017-03-30 | Paper |
Necklaces, convolutions, and \(X+Y\)
Algorithmica | 2017-03-27 | Paper |
| Minimal forcing sets for 1D origami | 2017-03-18 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Mario Kart is hard
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Continuous flattening of orthogonal polyhedra
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Box pleating is hard
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Dissection with the fewest pieces is hard, even to approximate
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Bust-a-Move/Puzzle Bobble is NP-complete
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Bust-a-Move/Puzzle Bobble is NP-complete
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
(available as arXiv preprint) | 2017-01-30 | Paper |
| Algorithms for designing pop-up cards | 2017-01-30 | Paper |
Toward an energy efficient language and compiler for (partially) reversible algorithms
Reversible Computation | 2016-08-10 | Paper |
Energy-efficient algorithms
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
The two-handed tile assembly model is not intrinsically universal
Algorithmica | 2016-03-29 | Paper |
The two-handed tile assembly model is not intrinsically universal
Algorithmica | 2016-03-29 | Paper |
One-dimensional staged self-assembly
Natural Computing | 2016-03-10 | Paper |
Folding a paper strip to minimize thickness
Journal of Discrete Algorithms | 2016-02-18 | Paper |
Folding equilateral plane graphs
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
Constructing points through folding and intersection
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
Journal of the ACM | 2015-12-04 | Paper |
Cache-oblivious iterated predecessor queries via range coalescing
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Polylogarithmic fully retroactive priority queues via hierarchical checkpointing
Lecture Notes in Computer Science | 2015-10-30 | Paper |
| Narrow misère dots-and-boxes | 2015-10-07 | Paper |
New geometric algorithms for fully connected staged self-assembly
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Linear-time algorithm for sliding tokens on trees
Theoretical Computer Science | 2015-09-16 | Paper |
On Wrapping Spheres and Cubes with Rectangular Paper
Lecture Notes in Computer Science | 2015-09-14 | Paper |
Polynomial-time algorithm for sliding tokens on trees
Algorithms and Computation | 2015-09-11 | Paper |
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Retroactive data structures
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6469186 (Why is no real title available?) | 2015-08-03 | Paper |
| Equivalence of local treewidth and linear local treewidth and its algorithmic applications | 2015-08-03 | Paper |
| scientific article; zbMATH DE number 6469156 (Why is no real title available?) | 2015-08-03 | Paper |
| Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs | 2015-08-03 | Paper |
| Tight bounds for the partial-sums problem | 2015-08-03 | Paper |
Worst-case optimal tree layout in external memory
Algorithmica | 2015-07-10 | Paper |
Reconfigurable asynchronous logic automata (RALA)
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-06-11 | Paper |
Fun with fonts: algorithmic typography
Theoretical Computer Science | 2015-05-26 | Paper |
Swapping labeled tokens on graphs
Theoretical Computer Science | 2015-05-26 | Paper |
Classic Nintendo games are (computationally) hard
Theoretical Computer Science | 2015-05-26 | Paper |
Folding a paper strip to minimize thickness
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Approximability of the subset sum reconfiguration problem
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
Picture-hanging puzzles
Theory of Computing Systems | 2015-01-21 | Paper |
Picture-hanging puzzles
Theory of Computing Systems | 2015-01-21 | Paper |
Flat foldings of plane graphs with prescribed angles and edge lengths
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Correction: ``Basic network creation games
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
| scientific article; zbMATH DE number 6381654 (Why is no real title available?) | 2014-12-18 | Paper |
| Minimizing movement | 2014-12-18 | Paper |
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
Algorithmica | 2014-12-02 | Paper |
Minimizing movement
ACM Transactions on Algorithms | 2014-11-18 | Paper |
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Bidimensionality: new connections between FPT algorithms and PTASs | 2014-10-13 | Paper |
| Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality | 2014-10-13 | Paper |
| Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics | 2014-10-13 | Paper |
The price of anarchy in network creation games
ACM Transactions on Algorithms | 2014-09-09 | Paper |
One tile to rule them all: simulating any tile assembly system with a single universal tile
Automata, Languages, and Programming | 2014-07-01 | Paper |
Canadians should travel randomly
Automata, Languages, and Programming | 2014-07-01 | Paper |
Contraction decomposition in \(h\)-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Shape replication through self-assembly and RNase enzymes | 2014-05-22 | Paper |
| scientific article; zbMATH DE number 6297711 (Why is no real title available?) | 2014-05-22 | Paper |
| scientific article; zbMATH DE number 6297800 (Why is no real title available?) | 2014-05-22 | Paper |
Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
Graphs and Combinatorics | 2014-03-24 | Paper |
The price of anarchy in network creation games
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Scheduling to minimize gaps and power consumption
Journal of Scheduling | 2014-02-05 | Paper |
UNO is hard, even for a single player
Theoretical Computer Science | 2014-01-22 | Paper |
Reprint of: Refold rigidity of convex polyhedra
Computational Geometry | 2014-01-22 | Paper |
The Voronoi game on graphs and its complexity
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Basic network creation games
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Variations on instant insanity
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Blame trees
Lecture Notes in Computer Science | 2013-08-12 | Paper |
The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
Automata, Languages, and Programming | 2013-08-06 | Paper |
Combining binary search trees
Automata, Languages, and Programming | 2013-08-06 | Paper |
Efficient reconfiguration of lattice-based modular robots
Computational Geometry | 2013-07-31 | Paper |
Refold rigidity of convex polyhedra
Computational Geometry | 2013-07-31 | Paper |
Ghost chimneys
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Journal of Combinatorial Optimization | 2013-04-08 | Paper |
Approximation algorithms via contraction decomposition
Combinatorica | 2013-04-05 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
Meshes preserving minimum feature size
Lecture Notes in Computer Science | 2013-01-07 | Paper |
A generalization of the source unfolding of convex polyhedra
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Bounded-degree polyhedronization of point sets
Computational Geometry | 2012-12-04 | Paper |
Reconfiguration of list edge-colorings in a graph
Discrete Applied Mathematics | 2012-10-26 | Paper |
Non-crossing matchings of points with geometric objects
Computational Geometry | 2012-10-12 | Paper |
Constant price of anarchy in network-creation games via public-service advertising
Internet Mathematics | 2012-08-29 | Paper |
On \(k\)-convex polygons
Computational Geometry | 2012-06-13 | Paper |
| The price of anarchy in cooperative network creation games | 2012-04-24 | Paper |
| Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs | 2012-04-24 | Paper |
Hinged dissections exist
Discrete & Computational Geometry | 2012-03-02 | Paper |
Algorithmic folding complexity
Graphs and Combinatorics | 2012-01-24 | Paper |
(Non)Existence of pleated folds: How paper folds between creases
Graphs and Combinatorics | 2012-01-24 | Paper |
Continuous blooming of convex polyhedra
Graphs and Combinatorics | 2012-01-24 | Paper |
| Self-assembly of arbitrary shapes using RNAse enzymes: meeting the Kolmogorov bound with small scale factor (extended abstract) | 2012-01-23 | Paper |
Folding equilateral plane graphs
Algorithms and Computation | 2011-12-16 | Paper |
Making polygons by simple folds and one straight cut
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Common unfoldings of polyominoes and polycubes
Lecture Notes in Computer Science | 2011-11-11 | Paper |
One-dimensional staged self-assembly
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Algorithms for solving Rubik's cubes
Algorithms – ESA 2011 | 2011-09-16 | Paper |
\(O(1)\)-approximations for maximum movement problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Flattening fixed-angle chains is strongly NP-hard
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Lossless fault-tolerant data structures with additive overhead
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Remarks on separating words
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
Approximability of the Subset Sum Reconfiguration Problem
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Computing signed permutations of polygons
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
Finding hidden independent sets in interval graphs
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Tetris is Hard, Even to Approximate
Lecture Notes in Computer Science | 2011-03-18 | Paper |
On the complexity of reconfiguration problems
Theoretical Computer Science | 2011-03-14 | Paper |
The Stackelberg minimum spanning tree game
Algorithmica | 2011-03-02 | Paper |
Realistic reconfiguration of crystalline (and telecube) robots
Springer Tracts in Advanced Robotics | 2011-03-02 | Paper |
Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
Computational Geometry | 2011-01-31 | Paper |
Constant price of anarchy in network creation games via public service advertising
Algorithms and Models for the Web-Graph | 2011-01-21 | Paper |
Covering points by disjoint boxes with outliers
Computational Geometry | 2011-01-21 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Locked and unlocked chains of planar shapes
Discrete & Computational Geometry | 2010-09-22 | Paper |
Lower bounds for asymmetric communication channels and distributed source coding
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Combination can be hard
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Lower bounds for dynamic connectivity
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Cache-oblivious priority queue and graph algorithm applications
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Grid vertex-unfolding orthostacks
International Journal of Computational Geometry & Applications | 2010-07-27 | Paper |
Playing games with algorithms: algorithmic combinatorial game theory
(available as arXiv preprint) | 2010-07-09 | Paper |
| scientific article; zbMATH DE number 5734572 (Why is no real title available?) | 2010-07-09 | Paper |
Minimizing the diameter of a network using shortcut edges
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Correlation clustering with partial information
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Confluently persistent tries for efficient version control
Algorithmica | 2010-05-19 | Paper |
Matching points with things
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Optimal dynamic video-on-demand using adaptive broadcasting
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Generalized D-forms have no spurious creases
Discrete & Computational Geometry | 2010-02-23 | Paper |
Playing with triangulations
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Algorithmic folding complexity
Algorithms and Computation | 2009-12-17 | Paper |
Folding a better checkerboard
Algorithms and Computation | 2009-12-17 | Paper |
Minimizing Movement: Fixed-Parameter Tractability
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Minimizing Movement: Fixed-Parameter Tractability
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Reconfiguration of List Edge-Colorings in a Graph
Lecture Notes in Computer Science | 2009-10-20 | Paper |
A Pseudopolynomial Algorithm for Alexandrov’s Theorem
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Minimal Locked Trees
Lecture Notes in Computer Science | 2009-10-20 | Paper |
| Games, puzzles, and computation | 2009-09-04 | Paper |
Combination Can Be Hard: Approximability of the Unique Coverage Problem
SIAM Journal on Computing | 2009-08-20 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Linear reconfiguration of cube-style modular robots
Computational Geometry | 2009-07-27 | Paper |
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
Automata, Languages and Programming | 2009-07-14 | Paper |
On Cartesian Trees and Range Minimum Queries
Automata, Languages and Programming | 2009-07-14 | Paper |
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
Automata, Languages and Programming | 2009-07-14 | Paper |
Wrapping spheres with flat paper
Computational Geometry | 2009-06-30 | Paper |
Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
Algorithmica | 2009-06-22 | Paper |
Dynamic ham-sandwich cuts in the plane
Computational Geometry | 2009-06-18 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Refolding planar polygons
Discrete & Computational Geometry | 2009-04-27 | Paper |
Approximability of partitioning graphs with supply and demand
Journal of Discrete Algorithms | 2009-02-23 | Paper |
The Stackelberg Minimum Spanning Tree Game
Lecture Notes in Computer Science | 2009-02-17 | Paper |
A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Tight bounds for dynamic convex hull queries (again)
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Hinged dissections exist
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| Plane embeddings of planar graph metrics | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506193 (Why is no real title available?) | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506194 (Why is no real title available?) | 2009-02-10 | Paper |
On the Complexity of Reconfiguration Problems
Algorithms and Computation | 2009-01-29 | Paper |
Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
Algorithms and Computation | 2009-01-29 | Paper |
Planar Embeddings of Graphs with Specified Edge Lengths
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Deflating the Pentagon
Computational Geometry and Graph Theory | 2009-01-13 | Paper |
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Realizing partitions respecting full and partial order information
Journal of Discrete Algorithms | 2008-11-18 | Paper |
Linearity of grid minors in treewidth with applications through bidimensionality
Combinatorica | 2008-10-21 | Paper |
Optimally Adaptive Integration of Univariate Lipschitz Functions
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Lecture Notes in Computer Science | 2008-09-18 | Paper |
De Dictionariis Dynamicis Pauco Spatio Utentibus
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
Natural Computing | 2008-09-02 | Paper |
| scientific article; zbMATH DE number 5318635 (Why is no real title available?) | 2008-09-01 | Paper |
| All polygon flip finitely\dots right? | 2008-07-21 | Paper |
Confluently Persistent Tries for Efficient Version Control
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Algorithmic Graph Minors and Bidimensionality
Parameterized and Exact Computation | 2008-06-05 | Paper |
Linear Reconfiguration of Cube-Style Modular Robots
Algorithms and Computation | 2008-05-27 | Paper |
Approximability of Partitioning Graphs with Supply and Demand
Algorithms and Computation | 2008-04-24 | Paper |
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction
Algorithms and Computation | 2008-04-24 | Paper |
Subquadratic algorithms for 3SUM
Algorithmica | 2008-04-23 | Paper |
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
DNA Computing | 2008-04-04 | Paper |
Optimally adaptive integration of univariate Lipschitz functions
Algorithmica | 2008-04-03 | Paper |
Communication-aware processor allocation for supercomputers: Finding point sets of small average distance
Algorithmica | 2008-04-03 | Paper |
Dynamic Optimality—Almost
SIAM Journal on Computing | 2008-03-28 | Paper |
Grid Vertex-Unfolding Orthostacks
Discrete and Computational Geometry | 2008-03-18 | Paper |
Origami, Linkages, and Polyhedra: Folding with Algorithms
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Necklaces, Convolutions, and X + Y
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Plane embeddings of planar graph metrics
Discrete & Computational Geometry | 2008-01-04 | Paper |
An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
SIAM Journal on Computing | 2008-01-03 | Paper |
An Optimal Decomposition Algorithm for Tree Edit Distance
Automata, Languages and Programming | 2007-11-28 | Paper |
| Geometric folding algorithms. Linkages, origami, polyhedra | 2007-11-20 | Paper |
Edge-unfolding nested polyhedral bands
Computational Geometry | 2007-10-19 | Paper |
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science | 2007-09-18 | Paper |
Sand drawings and Gaussian graphs§
Journal of Mathematics and the Arts | 2007-09-12 | Paper |
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
Graphs and Combinatorics | 2007-07-19 | Paper |
| scientific article; zbMATH DE number 5163271 (Why is no real title available?) | 2007-06-08 | Paper |
The Bidimensional Theory of Bounded-Genus Graphs
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
Geodesic ham-sandwich cuts
Discrete & Computational Geometry | 2007-04-26 | Paper |
Morpion solitaire
Theory of Computing Systems | 2007-02-13 | Paper |
Puzzles, art, and magic with algorithms
Theory of Computing Systems | 2007-02-13 | Paper |
Quickly deciding minor-closed parameters in general graphs
European Journal of Combinatorics | 2006-12-07 | Paper |
Low-dimensional embedding with extra information
Discrete & Computational Geometry | 2006-12-06 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Correlation clustering in general weighted graphs
Theoretical Computer Science | 2006-09-14 | Paper |
Online searching with turn cost
Theoretical Computer Science | 2006-09-14 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Geometric restrictions on producible polygonal protein chains
Algorithmica | 2006-06-14 | Paper |
Optimal Covering Tours with Turn Costs
SIAM Journal on Computing | 2006-06-01 | Paper |
Cache-Oblivious B-Trees
SIAM Journal on Computing | 2006-06-01 | Paper |
Logarithmic Lower Bounds in the Cell-Probe Model
SIAM Journal on Computing | 2006-06-01 | Paper |
| A survey of folding and unfolding in computational geometry | 2006-04-28 | Paper |
Representing trees of higher degree
Algorithmica | 2006-03-21 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
Theoretical Computer Science | 2005-10-26 | Paper |
Games on triangulations
Theoretical Computer Science | 2005-10-26 | Paper |
OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE
International Journal of Computational Geometry & Applications | 2005-09-29 | Paper |
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
International Journal of Computational Geometry & Applications | 2005-09-29 | Paper |
Bidimensional Parameters and Local Treewidth
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Hinged dissection of polyominoes and polyforms
Computational Geometry | 2005-08-05 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
Discrete & Computational Geometry | 2005-08-02 | Paper |
| scientific article; zbMATH DE number 2185599 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2185611 (Why is no real title available?) | 2005-07-04 | Paper |
Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
Algorithmica | 2005-04-29 | Paper |
Fast allocation and deallocation with an improved buddy system
Acta Informatica | 2005-04-15 | Paper |
Fun-Sort -- or the chaos of unordered binary search
Discrete Applied Mathematics | 2005-02-23 | Paper |
Diameter and treewidth in minor-closed graph families, revisited
Algorithmica | 2005-02-11 | Paper |
Finding hidden independent sets in interval graphs
Theoretical Computer Science | 2004-10-27 | Paper |
Solitaire clobber
Theoretical Computer Science | 2004-10-27 | Paper |
When can you fold a map?
Computational Geometry | 2004-10-13 | Paper |
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences | 2004-10-01 | Paper |
ONLINE ROUTING IN CONVEX SUBDIVISIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
TETRIS IS HARD, EVEN TO APPROXIMATE
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Tight bounds on maximal and maximum matchings
Discrete Mathematics | 2004-08-19 | Paper |
Robot Localization without Depth Perception
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086639 (Why is no real title available?) | 2004-08-11 | Paper |
Proximate point searching
Computational Geometry | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080234 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081000 (Why is no real title available?) | 2004-08-04 | Paper |
What is the optimal shape of a city?
Journal of Physics A: Mathematical and General | 2004-06-15 | Paper |
| scientific article; zbMATH DE number 2068107 (Why is no real title available?) | 2004-05-27 | Paper |
A linear lower bound on index size for text retrieval
Journal of Algorithms | 2004-03-14 | Paper |
Straightening polygonal arcs and convexifying polygonal cycles
Discrete & Computational Geometry | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2038758 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1944413 (Why is no real title available?) | 2003-11-10 | Paper |
| scientific article; zbMATH DE number 1979505 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1979514 (Why is no real title available?) | 2003-09-14 | Paper |
Palindrome recognition using a multidimensional tape.
Theoretical Computer Science | 2003-08-17 | Paper |
On universally easy classes for NP-complete problems.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1947405 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947390 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947389 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947388 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947048 (Why is no real title available?) | 2003-07-07 | Paper |
| scientific article; zbMATH DE number 1945188 (Why is no real title available?) | 2003-07-02 | Paper |
Interlocked open and closed linkages with few joints.
Computational Geometry | 2003-07-01 | Paper |
Long proteins with unique optimal foldings in the H-P model
Computational Geometry | 2003-05-19 | Paper |
| scientific article; zbMATH DE number 1877249 (Why is no real title available?) | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1893562 (Why is no real title available?) | 2003-04-07 | Paper |
Flipturning Polygons
Discrete & Computational Geometry | 2003-03-17 | Paper |
| scientific article; zbMATH DE number 1834637 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1830752 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1759407 (Why is no real title available?) | 2002-10-13 | Paper |
| scientific article; zbMATH DE number 1786504 (Why is no real title available?) | 2002-08-21 | Paper |
Locked and unlocked polygonal chains in three dimensions
Discrete & Computational Geometry | 2002-07-22 | Paper |
A note on reconfiguring tree linkages: Trees can lock
Discrete Applied Mathematics | 2002-05-15 | Paper |
Enumerating foldings and unfoldings between polygons and polytopes
Graphs and Combinatorics | 2002-05-14 | Paper |
| Optimal covering tours with turn costs | 2002-03-24 | Paper |
| On universally easy classes for NP-complete problems | 2002-01-30 | Paper |
| A linear lower bound on index size for text retrieval | 2002-01-30 | Paper |
Reconfiguring convex polygons
Computational Geometry | 2002-01-14 | Paper |
Polygons cuttable by a circular saw
Computational Geometry | 2002-01-14 | Paper |
| scientific article; zbMATH DE number 1944408 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1944412 (Why is no real title available?) | 2002-01-01 | Paper |
Efficient algorithms for Petersen's matching theorem
Journal of Algorithms | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1522946 (Why is no real title available?) | 2000-10-30 | Paper |
| scientific article; zbMATH DE number 1507294 (Why is no real title available?) | 2000-09-14 | Paper |
Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
Computational Geometry | 2000-06-05 | Paper |
| scientific article; zbMATH DE number 1445373 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1305504 (Why is no real title available?) | 2000-01-25 | Paper |
| scientific article; zbMATH DE number 1305400 (Why is no real title available?) | 1999-06-17 | Paper |
Super Guarding and Dark Rays in Art Galleries
(available as arXiv preprint) | N/A | Paper |
