Saved in:
| Main Authors: | Laštovička, Petr, Legerský, Jan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.13721 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Eight-Partitioning Points in 3D, and Efficiently Too
by: Aronov, Boris, et al.
Published: (2024)
by: Aronov, Boris, et al.
Published: (2024)
Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
by: Ilmavirta, Joonas, et al.
Published: (2023)
by: Ilmavirta, Joonas, et al.
Published: (2023)
Approximating mixed volumes to arbitrary accuracy
by: Narayanan, Hariharan, et al.
Published: (2025)
by: Narayanan, Hariharan, et al.
Published: (2025)
Learning Minimally Rigid Graphs with High Realization Counts
by: Slyvka, Oleksandr, et al.
Published: (2026)
by: Slyvka, Oleksandr, et al.
Published: (2026)
The algorithmic Fried Potato Problem in two dimensions
by: Criado, Francisco, et al.
Published: (2025)
by: Criado, Francisco, et al.
Published: (2025)
Flexibility and rigidity of frameworks consisting of triangles and parallelograms
by: Grasegger, Georg, et al.
Published: (2023)
by: Grasegger, Georg, et al.
Published: (2023)
Stable cuts, NAC-colourings and flexible realisations of graphs
by: Clinch, Katie, et al.
Published: (2024)
by: Clinch, Katie, et al.
Published: (2024)
Attempting the impossible: enumerating extremal submodular functions for n=6
by: Csirmaz, Elod P., et al.
Published: (2024)
by: Csirmaz, Elod P., et al.
Published: (2024)
Constructing reflection-symmetric flexible realisations of graphs
by: Dewar, Sean, et al.
Published: (2024)
by: Dewar, Sean, et al.
Published: (2024)
Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
by: Wulf, Lasse
Published: (2025)
by: Wulf, Lasse
Published: (2025)
Flexible placements of periodic graphs in the plane
by: Dewar, Sean
Published: (2019)
by: Dewar, Sean
Published: (2019)
Coupler curves of moving graphs and counting realizations of rigid graphs
by: Grasegger, Georg, et al.
Published: (2022)
by: Grasegger, Georg, et al.
Published: (2022)
$k$-fold circuits and coning in rigidity matroids
by: Hewetson, John, et al.
Published: (2025)
by: Hewetson, John, et al.
Published: (2025)
Counting Frameworks of Bipyramids
by: Southgate, Jack
Published: (2023)
by: Southgate, Jack
Published: (2023)
Counting for rigidity under projective transformations in the plane
by: Berman, Leah Wrenn, et al.
Published: (2025)
by: Berman, Leah Wrenn, et al.
Published: (2025)
Rigidity of Circle Packings with Flexible Radii
by: Connelly, Robert, et al.
Published: (2022)
by: Connelly, Robert, et al.
Published: (2022)
The $d$-dimensional realisation number of a rigid graph
by: Dewar, Sean, et al.
Published: (2026)
by: Dewar, Sean, et al.
Published: (2026)
Minimal dispersion on the cube and the torus
by: Arman, Andrii, et al.
Published: (2024)
by: Arman, Andrii, et al.
Published: (2024)
The number of realisations of a random graph
by: Dewar, Sean, et al.
Published: (2026)
by: Dewar, Sean, et al.
Published: (2026)
The number of realisations of a rigid graph in Euclidean and spherical geometries
by: Dewar, Sean, et al.
Published: (2023)
by: Dewar, Sean, et al.
Published: (2023)
Simplices with fixed volumes of codimension 2 faces in a continuous deformation
by: Zhang, Lizhao
Published: (2023)
by: Zhang, Lizhao
Published: (2023)
Uniquely realisable graphs in polyhedral normed spaces
by: Dewar, Sean
Published: (2025)
by: Dewar, Sean
Published: (2025)
On the uniqueness of collections of pennies and marbles
by: Dewar, Sean, et al.
Published: (2023)
by: Dewar, Sean, et al.
Published: (2023)
Identifying contact graphs of sphere packings with generic radii
by: Dewar, Sean
Published: (2023)
by: Dewar, Sean
Published: (2023)
Edge-length preserving embeddings of graphs between normed spaces
by: Dewar, Sean, et al.
Published: (2024)
by: Dewar, Sean, et al.
Published: (2024)
Classifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane
by: Dewar, Sean
Published: (2022)
by: Dewar, Sean
Published: (2022)
Generalised rigid body motions in non-Euclidean planes with applications to global rigidity
by: Dewar, Sean, et al.
Published: (2021)
by: Dewar, Sean, et al.
Published: (2021)
Circle packings and hyperbolic surfaces of finite type
by: Ba, Te, et al.
Published: (2023)
by: Ba, Te, et al.
Published: (2023)
Characterizing globally linked pairs in graphs
by: Jordán, Tibor, et al.
Published: (2026)
by: Jordán, Tibor, et al.
Published: (2026)
Equilibrium stressability of multidimensional frameworks
by: Karpenkov, Oleg, et al.
Published: (2020)
by: Karpenkov, Oleg, et al.
Published: (2020)
Highly regular vertex-transitive graphs are globally rigid
by: Saliby, Angelo El
Published: (2026)
by: Saliby, Angelo El
Published: (2026)
On the existence of two affine-equivalent frameworks with prescribed edge lengths in Euclidean $d$-space
by: Alexandrov, Victor
Published: (2023)
by: Alexandrov, Victor
Published: (2023)
Computing the number of realisations of a rigid graph
by: Dewar, Sean, et al.
Published: (2025)
by: Dewar, Sean, et al.
Published: (2025)
Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints
by: Keil, J. Mark, et al.
Published: (2025)
by: Keil, J. Mark, et al.
Published: (2025)
Liftings of surfaces in the plane
by: Karpenkov, Oleg, et al.
Published: (2025)
by: Karpenkov, Oleg, et al.
Published: (2025)
Closed-Form Decomposition for Simplicial Cones and PDBarv Algorithm for Lattice Point Counting
by: Tao, Sihao, et al.
Published: (2025)
by: Tao, Sihao, et al.
Published: (2025)
The tropical galaxy of a Laman graph
by: Bielby, Amelia, et al.
Published: (2025)
by: Bielby, Amelia, et al.
Published: (2025)
Angular constraints on planar frameworks
by: Dewar, Sean, et al.
Published: (2024)
by: Dewar, Sean, et al.
Published: (2024)
Fast Isotopy Computation for T-Curves
by: Geiselmann, Zoe, et al.
Published: (2026)
by: Geiselmann, Zoe, et al.
Published: (2026)
Maximal origami flip graphs of flat-foldable vertices: properties and algorithms
by: Hull, Thomas C., et al.
Published: (2022)
by: Hull, Thomas C., et al.
Published: (2022)
Similar Items
-
Eight-Partitioning Points in 3D, and Efficiently Too
by: Aronov, Boris, et al.
Published: (2024) -
Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
by: Ilmavirta, Joonas, et al.
Published: (2023) -
Approximating mixed volumes to arbitrary accuracy
by: Narayanan, Hariharan, et al.
Published: (2025) -
Learning Minimally Rigid Graphs with High Realization Counts
by: Slyvka, Oleksandr, et al.
Published: (2026) -
The algorithmic Fried Potato Problem in two dimensions
by: Criado, Francisco, et al.
Published: (2025)