The following pages link to (Q5704408):
Displayed 50 items.
- A topological classification of convex bodies (Q292054) (← links)
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- GA topology optimization using random keys for tree encoding of structures (Q381347) (← links)
- Finite prime distance graphs and 2-odd graphs (Q390314) (← links)
- The design and implementation of an interactive course-timetabling system (Q475210) (← links)
- A genealogy of convex solids via local and global bifurcations of gradient vector fields (Q513882) (← links)
- On the metric dimension of barycentric subdivision of Cayley graphs (Q519256) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Graph theoretic foundations of multibody dynamics. I: Structural properties (Q655954) (← links)
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree (Q987822) (← links)
- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows (Q1005511) (← links)
- Lower bounds in minimum rank problems (Q1044621) (← links)
- CHY-graphs on a torus (Q1636357) (← links)
- Computation of contour integrals on \( \mathcal{M}_{0,n} \) (Q1638565) (← links)
- \(\Lambda\) scattering equations (Q1638805) (← links)
- Adaptive formation control of networked Lagrangian systems with a moving leader (Q1663728) (← links)
- CHY loop integrands from holomorphic forms (Q1692966) (← links)
- A tree-based model for setting optimal train fare zones (Q1718240) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Paired threshold graphs (Q1801073) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- Variable elimination in post-translational modification reaction networks with mass-action kinetics (Q1937882) (← links)
- Resolvability in subdivision of circulant networks \(C_n[1, k]\) (Q2004177) (← links)
- Hilbert function and facet ideals of products of simplicial complexes (Q2065343) (← links)
- Geodesic nets with three boundary vertices (Q2073256) (← links)
- \(k\)-Wiener index of a \(k\)-plex (Q2075457) (← links)
- On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
- Linear complexity of sequences on Koblitz curves of genus 2 (Q2103481) (← links)
- Reliability of maximum spanning tree identification in correlation-based market networks (Q2158099) (← links)
- Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833) (← links)
- Edge importance in a network via line graphs and the matrix exponential (Q2290932) (← links)
- Dynamics on binary relations over topological spaces (Q2333614) (← links)
- An iterative algorithm for the management of an electric car-rental service (Q2336458) (← links)
- Mutation on knots and Whitney's 2-isomorphism theorem (Q2376653) (← links)
- Modified linear programming and class 0 bounds for graph pebbling (Q2410032) (← links)
- Composite centrality: a natural scale for complex evolving networks (Q2448422) (← links)
- Generalized fractional total colorings of graphs (Q2516673) (← links)
- Facial unique-maximum edge and total coloring of plane graphs (Q2659070) (← links)
- Recognizing nullhomotopic maps into the classifying space of a Kac-Moody group (Q2672677) (← links)
- On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
- (Q2857421) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- An Introduction to Coding Sequences of Graphs (Q2958314) (← links)
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces (Q3176425) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- An Algorithm for Qualitative Simulation of Gene Regulatory Networks with Steep Sigmoidal Response Functions (Q3599197) (← links)
- Adinkras from ordered quartets of BC<sub>4</sub> Coxeter group elements and regarding another Gadget’s 1,358,954,496 matrix elements (Q4637958) (← links)
- (Q4957547) (← links)
- Generalised colouring sums of graphs (Q4966732) (← links)