The following pages link to (Q5871911):
Displaying 50 items.
- Algorithmics for beginners. For students, teachers and pupils of the subjects of mathematics and informatics (Q380957) (← links)
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
- (Q5214167) (← links)
- Basic Concepts in Algorithms (Q5857685) (← links)
- The Minimum Moving Spanning Tree Problem (Q5886031) (← links)
- Some results on connected vertex separators (Q6040587) (← links)
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines (Q6065642) (← links)
- Combined invariant subspace \& frequency-domain subspace method for identification of discrete-time MIMO linear systems (Q6069658) (← links)
- Parity permutation pattern matching (Q6070786) (← links)
- A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs (Q6075716) (← links)
- Corrigendum to: ``Complexity and approximability of the happy set problem'' (Q6076349) (← links)
- Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs (Q6078291) (← links)
- Stable volumes for persistent homology (Q6082665) (← links)
- Feasibility assessments of a dynamical approach to compartmental modelling on graphs: scaling limits and performance analysis (Q6090490) (← links)
- Improved Milne-Hamming method for resolving high-order uncertain differential equations (Q6096300) (← links)
- Discrete bulk reconstruction (Q6105596) (← links)
- A GPU-parallelized interpolation-based fast multipole method for the relativistic space-charge field calculation (Q6112679) (← links)
- Minimizing the total weighted duration of courses in a single machine problem with precedence constraints (Q6148285) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
- Two-machine job-shop scheduling with one joint job (Q6153460) (← links)
- Identities and periodic oscillations of divide-and-conquer recurrences splitting at half (Q6153612) (← links)
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)
- Statistical embedding: beyond principal components (Q6181742) (← links)
- Some models are useful, but how do we know which ones? Towards a unified Bayesian model taxonomy (Q6185714) (← links)
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)
- Non-returning deterministic and nondeterministic finite automata with translucent letters (Q6186539) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Social disruption games in signed networks (Q6199710) (← links)
- Branching processes reveal influential nodes in social networks (Q6492041) (← links)
- Priority queues with decreasing keys (Q6495789) (← links)
- A cut-cell method for the numerical simulation of 3D multiphase flows with strong interfacial effects (Q6497215) (← links)
- Maximum satisfiability of mission-time linear temporal logic (Q6536429) (← links)
- How easy it is to know how: an upper bound for the satisfiability problem (Q6545554) (← links)
- Polynomial-time equivalences and refined algorithms for longest common subsequence variants (Q6546417) (← links)
- Generative models in the problem of evaluating the efficiency of computer algorithms (Q6547258) (← links)
- Quick-sort style approximation algorithms for generalizations of feedback vertex set in tournaments (Q6547935) (← links)
- Sparsifying count sketch (Q6551716) (← links)
- Revisiting RSA-polynomial problem and semiprime factorization (Q6558638) (← links)
- Approximate distance sensitivity oracles in subquadratic space (Q6566476) (← links)
- Solving the set covering problem with conflicts on sets: a new parallel GRASP (Q6568410) (← links)
- A new algorithm for inference in HMM's with lower span complexity (Q6573292) (← links)
- Limits on revocable proof systems, with implications for stateless blockchains (Q6573990) (← links)
- Almost surely convergence of the quantum entropy of random graph states and the area law (Q6584114) (← links)
- Parity permutation pattern matching (Q6586663) (← links)
- An algorithm for the secure total domination problem in proper interval graphs (Q6590080) (← links)
- Sharp threshold for embedding balanced spanning trees in random geometric graphs (Q6595519) (← links)
- Generalizing Lloyd's algorithm for graph clustering (Q6598501) (← links)
- Worldsheet formalism for decoupling limits in string theory (Q6609339) (← links)
- Book review of: T. Nipkow (ed.), Functional data structures and algorithms. A proof assistant approach (Q6610384) (← links)
- Defending hash tables from algorithmic complexity attacks with resource burning (Q6614003) (← links)
