The following pages link to Georg Grasegger (Q250457):
Displaying 43 items.
- Computation of all rational solutions of first-order algebraic ODEs (Q1647939) (← links)
- Rational general solutions of systems of first-order algebraic partial differential equations (Q1678116) (← links)
- Computing the number of realizations of a Laman graph (Q1689913) (← links)
- Deciding the existence of rational general solutions for first-order algebraic ODEs (Q1690785) (← links)
- Flexible placements of graphs with rotational symmetry (Q2094119) (← links)
- Zero-sum cycles in flexible non-triangular polyhedra (Q2094125) (← links)
- Graphs with flexible labelings allowing injective realizations (Q2174572) (← links)
- Counting realizations of Laman graphs on the sphere (Q2189421) (← links)
- Graphs with flexible labelings (Q2316799) (← links)
- Combinatorics of Bricard's octahedra (Q2656156) (← links)
- Symbolic Solutions of First-Order Algebraic ODEs (Q2808007) (← links)
- On Symbolic Solutions of Algebraic Partial Differential Equations (Q2879318) (← links)
- On the Classification of Motions of Paradoxically Movable Graphs (Q3387272) (← links)
- Radical solutions of first order autonomous algebraic ordinary differential equations (Q3452397) (← links)
- The Number of Realizations of a Laman Graph (Q4564015) (← links)
- FlexRiLoG—A SageMath Package for Motions of Graphs (Q5041080) (← links)
- Bracing frameworks consisting of parallelograms (Q5045257) (← links)
- Lower Bounds on the Number of Realizations of Rigid Graphs (Q5114449) (← links)
- An Algebraic-Geometric Method for Computing Zolotarev Polynomials (Q5119937) (← links)
- POLYNOMIAL EQUIVALENCE OF FINITE RINGS (Q5415974) (← links)
- On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere (Q5854464) (← links)
- A solution method for autonomous first-order algebraic partial differential equations (Q5964599) (← links)
- (Q6060034) (← links)
- Corrigendum to ‘flexible circuits in the d $d$‐dimensional rigidity matroid’ (Q6074581) (← links)
- Coupler curves of moving graphs and counting realizations of rigid graphs (Q6076254) (← links)
- Flexible circuits in the d‐dimensional rigidity matroid (Q6081564) (← links)
- Zero‐sum cycles in flexible polyhedra (Q6175394) (← links)
- Minimal counterexamples to Hendrickson's conjecture on globally rigid graphs (Q6421407) (← links)
- Flexibility and rigidity of frameworks consisting of triangles and parallelograms (Q6435071) (← links)
- Rigidity of nearly planar classes of graphs (Q6523653) (← links)
- Angular constraints on planar frameworks (Q6527435) (← links)
- The number of realisations of a rigid graph in Euclidean and spherical geometries (Q6662812) (← links)
- The number of realizations of all Laman graphs with at most 12 vertices (Q6696655) (← links)
- Ramanujan graphs with degree 3, 4, 5, 6, or 7 (Q6697131) (← links)
- Rigidity of 4-regular Ramanujan graphs (Q6697135) (← links)
- Dataset of globally rigid graphs (Q6697136) (← links)
- Dataset of redundantly rigid graphs (Q6697137) (← links)
- Marble graphs with various rigidity properties (Q6697158) (← links)
- Circuits in the 3-dimensional rigidity matroid (Q6697159) (← links)
- Non-planar apex graphs with different independence properties (Q6697162) (← links)
- Non-planar (3,6)-sparse graphs with various apex properties (Q6697164) (← links)
- Non-planar graphs with various apex properties (Q6697166) (← links)
- Dataset of (3,6)-tight graphs (Q6697177) (← links)
