The following pages link to (Q2747613):
Displaying 50 items.
- Selecting and estimating regular vine copulae and application to financial returns (Q80568) (← links)
- A fast algorithm for computing distance correlation (Q113800) (← links)
- Half-trek criterion for generic identifiability of linear structural equation models (Q116505) (← links)
- Discovery of optimal factors in binary data via a novel method of matrix decomposition (Q131470) (← links)
- Dimension-reduced nonparametric maximum likelihood computation for interval-censored data (Q134612) (← links)
- The orienteering problem with time windows applied to robotic melon harvesting (Q255095) (← links)
- Scalable genomics with \texttt{R} and bioconductor (Q257684) (← links)
- 3SUM, 3XOR, triangles (Q261365) (← links)
- An algorithm for computing cutpoints in finite metric spaces (Q263276) (← links)
- Fast learning of restricted regular expressions and dtds (Q269337) (← links)
- Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← links)
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees (Q270010) (← links)
- Minimum cost input/output design for large-scale linear structural systems (Q274009) (← links)
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- Dimensionality reduction of collective motion by principal manifolds (Q282231) (← links)
- The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- Reducing multivalued discrete variables in solving separable task assignment problems (Q290332) (← links)
- Ranking chain sum orders (Q290525) (← links)
- Multi-agent planning under local LTL specifications and event-based synchronization (Q290878) (← links)
- Pricing Asian option by the FFT with higher-order error convergence rate under Lévy processes (Q298749) (← links)
- A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Algebraic dynamic programming for multiple context-free grammars (Q301600) (← links)
- Characterizing local optima for maximum parsimony (Q309903) (← links)
- Analysis of complex network performance and heuristic node removal strategies (Q312858) (← links)
- A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q319449) (← links)
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
- A note on algebraic expressions of rhomboidal labeled graphs (Q324971) (← links)
- A minimized-rule based approach for improving data currency (Q326482) (← links)
- Tri-connectivity augmentation in trees (Q327625) (← links)
- Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees (Q327683) (← links)
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- Fast pattern-based algorithms for cutting stock (Q337047) (← links)
- A scheduling problem with three competing agents (Q337134) (← links)
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575) (← links)
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- The multimode covering location problem (Q342251) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- Do branch lengths help to locate a tree in a phylogenetic network? (Q347040) (← links)
- A three-dimensional parametric mesher with surface boundary-layer capability (Q349159) (← links)
- Mining non-redundant diverse patterns: an information theoretic perspective (Q351988) (← links)
- Gaussian quantum computation with oracle-decision problems (Q352994) (← links)
- Proof systems and transformation games (Q354613) (← links)
- Embeddings of circulant networks (Q358657) (← links)
- Embedding of biological regulatory networks and property preservation (Q359895) (← links)
- Invariants for homology classes with application to optimal search and planning problem in robotics (Q360246) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
