The following pages link to (Q5461825):
Displaying 50 items.
- The unassigned distance geometry problem (Q266818) (← links)
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Constructing uniquely realizable graphs (Q393739) (← links)
- Hyperspherical embedding of graphs and networks in communicability spaces (Q403566) (← links)
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination (Q408445) (← links)
- Descriptive matrix factorization for sustainability. Adopting the principle of opposites (Q408702) (← links)
- Solving a generalized distance geometry problem for protein structure determination (Q417280) (← links)
- The configuration space of a model for ringed hydrocarbon molecules (Q424591) (← links)
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
- Discretization orders for protein side chains (Q486406) (← links)
- An alternative approach to distance geometry using \(L^\infty\) distances (Q499357) (← links)
- Discretization vertex orders in distance geometry (Q499358) (← links)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
- Formation control using range-only measurements (Q534298) (← links)
- On the computation of protein backbones by using artificial backbones of hydrogens (Q540709) (← links)
- Least-squares approximations in geometric buildup for solving distance geometry problems (Q637550) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Interrogating witnesses for geometric constraint solving (Q714618) (← links)
- On bar frameworks, stress matrices and semidefinite programming (Q717126) (← links)
- Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares (Q782688) (← links)
- Solving molecular distance geometry problems by global optimization algorithms (Q842778) (← links)
- Sensor network localization with imprecise distances (Q875138) (← links)
- Clifford algebra and the discretizable molecular distance geometry problem (Q888986) (← links)
- Compensated convexity and its applications (Q935274) (← links)
- Rigid versus unique determination of protein structures with geometric buildup (Q941022) (← links)
- On the nonnegative rank of Euclidean distance matrices (Q977487) (← links)
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem (Q1029680) (← links)
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation (Q1048270) (← links)
- Computational experience with an algorithm for tetrangle inequality bound smoothing (Q1111968) (← links)
- Some examples of the use of distances as coordinates for euclidean geometry (Q1176392) (← links)
- The embedding problem for predistance matrices (Q1176717) (← links)
- A genetic algorithm for circulant Euclidean distance matrices (Q1294348) (← links)
- Distance matrices and regular figures (Q1316171) (← links)
- An optimization problem on subsets of the symmetric positive-semidefinite matrices (Q1321430) (← links)
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space (Q1346132) (← links)
- Problems of distance geometry and convex properties of quadratic maps (Q1346137) (← links)
- Metric graphs elastically embeddable in the plane (Q1352120) (← links)
- Estimating polypeptide \(\alpha\)-carbon distances from multiple sequence alignments (Q1360623) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Solving the multiple instance problem with axis-parallel rectangles. (Q1399120) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- Distance geometry algorithms in molecular modelling of polymer and composite systems. (Q1416411) (← links)
- On the reconstruction of three-dimensional protein structures from contact maps (Q1662462) (← links)
- Recent advances on the interval distance geometry problem (Q1683318) (← links)
- Trajectory analysis via a geometric feature space approach (Q4970017) (← links)
- (Q5111761) (← links)
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD (Q5933499) (← links)
- Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane (Q6074574) (← links)
- A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems (Q6155061) (← links)
