The following pages link to (Q3651735):
Displaying 50 items.
- Weak heaps engineered (Q396692) (← links)
- Algorithms to test open set condition for self-similar set related to P.V. numbers (Q401376) (← links)
- Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization (Q403016) (← links)
- Mining spatial colocation patterns: a different framework (Q408691) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- Approximation algorithms for free-label maximization (Q419365) (← links)
- The MST of symmetric disk graphs is light (Q425622) (← links)
- Statistical measures of two dimensional point set uniformity (Q435027) (← links)
- Efficient algorithms for local ranking (Q436589) (← links)
- Approximating the buffer allocation problem using epochs (Q436884) (← links)
- One-dimensional partitioning for heterogeneous systems: theory and practice (Q436908) (← links)
- Fast brief practical DFA minimization (Q437674) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Finding strong bridges and strong articulation points in linear time (Q443716) (← links)
- Mass distributions of linear chain polymers (Q454295) (← links)
- On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules (Q456005) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Adaptive stochastic Galerkin FEM (Q460851) (← links)
- An image denoising approach based on a meshfree method and the domain decomposition technique (Q463709) (← links)
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- Greedy algorithms and poset matroids (Q473210) (← links)
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312) (← links)
- The complexity of the empire colouring problem (Q476435) (← links)
- The predecessor-existence problem for \(k\)-reversible processes (Q476889) (← links)
- On the event distance of Poisson processes with applications to sensors (Q477345) (← links)
- A fast algorithm for order-preserving pattern matching (Q477704) (← links)
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
- The number of moves of the largest disc in shortest paths on Hanoi graphs (Q490248) (← links)
- A faster algorithm for the resource allocation problem with convex cost functions (Q491166) (← links)
- Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem (Q496641) (← links)
- A robust multiquadric method for digital elevation model construction (Q500719) (← links)
- QuickHeapsort: modifications and improved analysis (Q504991) (← links)
- A generic framework for symbolic execution: a coinductive approach (Q507361) (← links)
- A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm (Q507395) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles (Q513626) (← links)
- From imperative to rule-based graph programs (Q516038) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Interval scheduling maximizing minimum coverage (Q528573) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Generalized density clustering (Q605923) (← links)
- A hybrid search method for the vehicle routing problem with time windows (Q613770) (← links)
