search result

Cover von Structure theory and FPT algorithmics for graphs, digraphs and hypergraphs
Search for this author
Year: 2007
Publisher: Wadern-Dagstuhl, IBFI
Series: Dagstuhl Seminar Proceedings; 07281
Media group: DAGSTUHL-SEMINAR-PRO
Cover von Cache-oblivious and cache-aware algorithms
Search for this author
Year: 2004
Publisher: Wadern-Dagstuhl, IBFI
Series: Dagstuhl Seminar Proceedings; 04301
Media group: DAGSTUHL-SEMINAR-PRO
Cover von Rolling Polyhedra on Tessellations

Rolling Polyhedra on Tessellations

Author: O'Rourke, Joseph; Uehara, Ryuhei; Uno, Yushi
Year: 2022
Media group: LIPIcs
Cover von Algorithms for Designing Pop-Up Cards

Algorithms for Designing Pop-Up Cards

Author: Abel, Zachary; Demaine, Erik D.; Demaine, Martin L.
Year: 2013
Media group: ARTICLE
Cover von Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints

Author: Gregg, Christine; Hendrickson, Della H.; Kostitsyna, Irina
Year: 2024
Media group: LIPIcs
Cover von ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles

Author: Tockman, Andy
Year: 2024
Media group: LIPIcs
Cover von 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete

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

Author: Suhl, Adam; Zeff, Avi
Year: 2020
Media group: LIPIcs
Cover von Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly
article in DNA 2019: DNA Computing and Molecular Programming : pp. 140 - 158
Search for this author
Year: 2019
Publisher: Berlin, Springer
Series: Lecture notes in computer science; 11648 : article
Media group: ARTICLE
Cover von Simulation of Programmable Matter Systems
Using Active Tile-Based Self-Assembly
Search for this author
Year: 2019
Publisher: Cornell University, arXiv.org
Media group: ARTICLE
Cover von Fine-grained I/O Complexity via Reductions

Fine-grained I/O Complexity via Reductions

New Lower Bounds, Faster Algorithms, and a Time Hierarchy
Year: 2018
Media group: LIPIcs
OPEN V 11.1.0.0