The following pages link to Algorithms (Q82263):
Displaying 50 items.
- Finite element quadrature of regularized discontinuous and singular level set functions in 3D problems (Q1736529) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- Laplace-Fourier transform of the stretched exponential function: analytic error bounds, double exponential transform, and open-source implementation ``libkww'' (Q1736532) (← links)
- Testing goodness of fit of random graph models (Q1736535) (← links)
- Extracting co-occurrence relations from ZDDs (Q1736536) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- \(\ell\) major component detection and analysis (\(\ell^1\) MCDA): foundations in two dimensions (Q1736538) (← links)
- Energy efficient routing in wireless sensor networks through balanced clustering (Q1736541) (← links)
- Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Dubins traveling salesman problem with neighborhoods: a graph-based approach (Q1736545) (← links)
- Computing the eccentricity distribution of large graphs (Q1736547) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- Algorithms for non-negatively constrained maximum penalized likelihood reconstruction in tomographic imaging (Q1736549) (← links)
- Stable multicommodity flows (Q1736550) (← links)
- An open-source implementation of the critical-line algorithm for portfolio optimization (Q1736552) (← links)
- Solving university course timetabling problems using constriction particle swarm optimization with local search (Q1736554) (← links)
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (Q1736555) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Filtering degenerate patterns with application to protein sequence analysis (Q1736559) (← links)
- Improving man-optimal stable matchings by minimum change of preference lists (Q1736562) (← links)
- Maximum locally stable matchings (Q1736563) (← links)
- New heuristics for rooted triplet consistency (Q1736566) (← links)
- Noise reduction for nonlinear nonstationary time series data using averaging intrinsic mode function (Q1736570) (← links)
- Efficient \textit{in silico} chromosomal representation of populations via indexing ancestral genomes (Q1736575) (← links)
- Editorial: Special issue on graph algorithms (Q1736576) (← links)
- Ubiquitous integrity via network integration and parallelism-sustaining pedestrian/bike urbanism (Q1736577) (← links)
- Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
- A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint (Q1736579) (← links)
- Stable flows over time (Q1736580) (← links)
- Quantitative trait loci mapping problem: an extinction-based multi-objective evolutionary algorithm approach (Q1736585) (← links)
- Local search approaches in stable matching problems (Q1736586) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Sublinear time motif discovery from multiple sequences (Q1736589) (← links)
- Pattern-guided \(k\)-anonymity (Q1736590) (← links)
- New parallel sparse direct solvers for multicore architectures (Q1736591) (← links)
- An efficient local search for the feedback vertex set problem (Q1736593) (← links)
- Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists (Q1736596) (← links)
- Solving matrix equations on multi-core and many-core architectures (Q1736597) (← links)
- On stable matchings and flows (Q1736598) (← links)
- Bio-inspired meta-heuristics for emergency transportation problems (Q1736600) (← links)
- Choice function-based two-sided markets: stability, lattice property, path independence and algorithms (Q1736601) (← links)
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems (Q1736602) (← links)
- The minimum scheduling time for convergecast in wireless sensor networks (Q1736606) (← links)
- Pareto optimization or cascaded weighted sum: a comparison of concepts (Q1736609) (← links)
- Editorial: Special issue on algorithms for sequence analysis and storage (Q1736610) (← links)
- Correction to: ``Pareto optimization or cascaded weighted sum: a comparison of concepts'' (Q1736611) (← links)
- Faster and simpler approximation of stable matchings (Q1736612) (← links)
- Editorial: Special issue on matching under preferences (Q1736613) (← links)
