The following pages link to (Q3651735):
Displaying 50 items.
- On Euclidean norm approximations (Q614080) (← links)
- \texttt{MEEP}: a flexible free-software package for electromagnetic simulations by the FDTD method (Q615116) (← links)
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (Q627177) (← links)
- Finding the shortest paths by node combination (Q632873) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes (Q638549) (← links)
- Estimating sample mean under interval uncertainty and constraint on sample variance (Q648375) (← links)
- Message-passing algorithms for inference and optimization (Q658470) (← links)
- Optimal topological simplification of discrete functions on surfaces (Q664359) (← links)
- Optimal portfolio allocation under the probabilistic VaR constraint and incentives for financial innovation (Q665824) (← links)
- A scalable lock-free stack algorithm (Q666004) (← links)
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Shape-aware matching of implicit surfaces based on thin shell energies (Q667645) (← links)
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Sparse and constrained stochastic predictive control for networked systems (Q680489) (← links)
- Genetic programming \(+\) proof search \(=\) automatic improvement (Q682376) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- Two skew-binary numeral systems and one application (Q692930) (← links)
- Route planning for agent-based information retrieval (Q707765) (← links)
- On approximating optimal weight ``no''-certificates in weighted difference constraint systems (Q721917) (← links)
- Associahedra via spines (Q722343) (← links)
- Efficient computation of multivariate empirical distribution functions at the observed values (Q722738) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- The subset assignment problem for data placement in caches (Q724230) (← links)
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- Counting and generating permutations in regular classes (Q727971) (← links)
- On the shortest path game (Q729795) (← links)
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges (Q729890) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability (Q730503) (← links)
- \textsc{Phat} -- persistent homology algorithms toolbox (Q739617) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- A string matching based algorithm for performance evaluation of mathematical expression recognition (Q746565) (← links)
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538) (← links)
- Dynamic budget management and budget reclamation for mixed-criticality systems (Q779455) (← links)
- Searching and inferring colorful topological motifs in vertex-colored graphs (Q782751) (← links)
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
- Hardness results of global Roman domination in graphs (Q831760) (← links)
- Synthesis with asymptotic resource bounds (Q832230) (← links)
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study (Q832797) (← links)
- Pattern matching in doubling spaces (Q832835) (← links)
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
