The following pages link to (Q3651735):
Displaying 50 items.
- Spanning tree of a multiple graph (Q2136168) (← links)
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations (Q2136282) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- Regular numeral systems for data structures (Q2139186) (← links)
- Efficiently mining large gradual patterns using chunked storage layout (Q2140445) (← links)
- Tree-cotree decomposition of isogeometric mortared spaces in H(curl) on multi-patch domains (Q2142149) (← links)
- Extreme events in dynamical systems and random walkers: a review (Q2144474) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- Policies for risk-aware sensor data collection by mobile agents (Q2151909) (← links)
- Minimum spanning paths and Hausdorff distance in finite ultrametric spaces (Q2152004) (← links)
- A deterministic algorithm for the discrete logarithm problem in a semigroup (Q2154468) (← links)
- Inverting the discrete curl operator: a novel graph algorithm to find a vector potential of a given vector field (Q2157129) (← links)
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
- On random perfect matchings in metric spaces with not-too-large diameters (Q2158300) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- On lengths of edge-labeled graph expressions (Q2161278) (← links)
- The structure of the genetic code as an optimal graph clustering problem (Q2161382) (← links)
- The order estimation for hidden Markov models (Q2161809) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- Unified program generation and verification: a case study on number-theoretic transform (Q2163165) (← links)
- Fast and simple compact hashing via bucketing (Q2165038) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- Efficient optimization of the Held-Karp lower bound (Q2165584) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees (Q2168712) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- On the analysis of optimization problems in arc-dependent networks (Q2172089) (← links)
- Offline and online algorithms for single-minded selling problem (Q2173298) (← links)
- Configurational-force interface model for brittle fracture propagation (Q2173589) (← links)
- A nonlinear data-driven reduced order model for computational homogenization with physics/pattern-guided sampling (Q2175074) (← links)
- Grouping tasks to save energy in a cyclic scheduling problem: a complexity study (Q2178065) (← links)
- A bag-of-paths framework for network data analysis (Q2181053) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- Target control and expandable target control of complex networks (Q2181429) (← links)
- Low-rank updates and divide-and-conquer methods for quadratic matrix equations (Q2181678) (← links)
- On ultrametric 1-median selection (Q2182656) (← links)
- Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation (Q2182722) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Banzhaf random forests: cooperative game theory based random forests with consistency (Q2182870) (← links)
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
- Finding the largest triangle in a graph in expected quadratic time (Q2184135) (← links)
- Numerical steady state analysis of the Marchuk-Petrov model of antiviral immune response (Q2187859) (← links)
- Improved bounds on absolute positiveness of multivariate polynomials (Q2188981) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- An application of dynamic programming to assign pressing tanks at wineries (Q2189941) (← links)
- Using semidirect products of groups to build classes of interconnection networks (Q2192066) (← links)
- Learning a tree-structured Ising model in order to make predictions (Q2196190) (← links)
- Smith normal form of a distance matrix inspired by the four-point condition (Q2197141) (← links)
- Dynamic data structures for interval coloring (Q2197541) (← links)
