The following pages link to (Q3619797):
Displaying 50 items.
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times (Q941547) (← links)
- Information processing in complex networks: Graph entropy and information functionals (Q945216) (← links)
- Finding a minimum medial axis of a discrete shape is NP-hard (Q952462) (← links)
- Diagnosis of behaviors of interest in partially-observed discrete-event systems (Q953472) (← links)
- Distance-based parametric bootstrap tests for clustering of species ranges (Q956894) (← links)
- An algorithm for computing exact least-trimmed squares estimate of simple linear regression with constraints (Q957150) (← links)
- Should one always use repeated squaring for modular exponentiation? (Q963373) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- An improved constraint satisfaction adaptive neural network for job-shop scheduling (Q969749) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Analyzing scheduling with transient failures (Q987815) (← links)
- Observability of continuous Petri nets with infinite server semantics (Q988778) (← links)
- A note on graph balancing problems with restrictions (Q990093) (← links)
- On the learnability of majority rule (Q996375) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
- Knowledge condition games (Q1006447) (← links)
- Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm (Q1006997) (← links)
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
- Minimum-link watchman tours (Q1007602) (← links)
- A hierarchical model for rate-dependent polycrystals (Q1013922) (← links)
- A sufficient condition for the liveness of weighted event graphs (Q1014950) (← links)
- Algorithms for maximum independent set in convex bipartite graphs (Q1017904) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage (Q1022451) (← links)
- Maximum entropy and least square error minimizing procedures for estimating missing conditional probabilities in Bayesian networks (Q1023695) (← links)
- Collision-free path coloring with application to minimum-delay gathering in sensor networks (Q1026148) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← links)
- A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
- Optimality conditions in preference-based spanning tree problems (Q1027614) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- Computing the update of the repeated median regression line in linear time (Q1028994) (← links)
- Finding optimal paths in MREP routing (Q1029048) (← links)
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052) (← links)
- Kinetic hanger (Q1029070) (← links)
- The worst-case chip problem (Q1029103) (← links)
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349) (← links)
- \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Adaptive synchronization of a network of interconnected nonlinear Lur'e systems (Q1040497) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- On Hamiltonian cycles and Hamiltonian paths (Q1041720) (← links)
