Imagen de Portada

Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Furcy, David, Summers, Scott M.
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
por: Greenhut, Daniel, et al.
Publicado: (2025)

Finding maximum matchings in RDV graphs efficiently
por: Biedl, Therese, et al.
Publicado: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
por: Eppstein, David
Publicado: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
por: Eppstein, David
Publicado: (2023)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
por: de Berg, Sarita, et al.
Publicado: (2026)

Maintaining Light Spanners via Minimal Updates
por: Khodabandeh, Hadi, et al.
Publicado: (2024)

Min-1-Planarity is NP-Hard
por: Okada, Yuto
Publicado: (2026)

Spanner for the $0/1/\infty$ weighted region problem
por: Gudmundsson, Joachim, et al.
Publicado: (2024)

Visualizing Treewidth
por: Chiu, Alvin, et al.
Publicado: (2025)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

A face cover perspective to $\ell_1$ embeddings of planar graphs
por: Filtser, Arnold
Publicado: (2019)

Range Counting Oracles for Geometric Problems
por: Driemel, Anne, et al.
Publicado: (2025)

On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications
por: Filtser, Arnold
Publicado: (2024)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
por: Bhore, Sujoy, et al.
Publicado: (2024)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
por: Chan, Timothy M., et al.
Publicado: (2025)

Enclosing Points with Geometric Objects
por: Chan, Timothy M., et al.
Publicado: (2024)

Delaunay Triangulations with Predictions
por: Cabello, Sergio, et al.
Publicado: (2026)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
por: Cabello, Sergio, et al.
Publicado: (2021)

Dynamic and Streaming Algorithms for Union Volume Estimation
por: Bhore, Sujoy, et al.
Publicado: (2026)

Touring a Sequence of Orthogonal Polygons
por: Casel, Katrin, et al.
Publicado: (2026)

Bifurcation: How to Explore a Tree
por: Har-Peled, Sariel
Publicado: (2025)

On computing the (exact) Fréchet distance with a frog
por: Conradi, Jacobus, et al.
Publicado: (2025)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
por: Di Battista, Giuseppe, et al.
Publicado: (2024)

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
por: Bartlmae, Simon, et al.
Publicado: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Balancing expression dags for more efficient lazy adaptive evaluation
por: Wilhelm, Martin
Publicado: (2017)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
por: Chan, Timothy M., et al.
Publicado: (2026)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
por: Chan, Timothy M., et al.
Publicado: (2025)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
por: de Berg, Sarita, et al.
Publicado: (2023)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
por: Banik, Aritra, et al.
Publicado: (2024)

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
por: Elkin, Yury, et al.
Publicado: (2021)

Approximation Algorithms for Smallest Intersecting Balls
por: Zheng, Jiaqi, et al.
Publicado: (2024)

On Approximating the Weighted Region Problem in Square Tessellations
por: Kakimura, Naonori, et al.
Publicado: (2024)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
por: Ebbens, Matthijs, et al.
Publicado: (2024)

Extraction Theorems With Small Extraction Numbers
por: Agarwal, Arjun, et al.
Publicado: (2024)

Fréchet Distance in Subquadratic Time
por: Cheng, Siu-Wing, et al.
Publicado: (2024)

Computing largest minimum color-spanning intervals of imprecise points
por: Acharyya, Ankush, et al.
Publicado: (2024)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2024)