The following pages link to (Q4773298):
Displaying 50 items.
- Recognizing Cartesian products in linear time (Q864136) (← links)
- A clustering algorithm based on maximal \(\varTheta\)-distant subtrees (Q869022) (← links)
- Cut scheduling in the apparel industry (Q883280) (← links)
- On arithmetical algorithms over finite fields (Q910432) (← links)
- Parallelism and fast solution of linear systems (Q911213) (← links)
- q-hook length formulas for forests (Q911620) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- Edge-disjoint paths in a grid bounded by two nested rectangles (Q913521) (← links)
- A faster algorithm for the maximum weighted tardiness problem (Q916393) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Computing the longest diagonal of a simple polygon (Q917298) (← links)
- Hidden surface removal for rectangles (Q918209) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- Time-varying Reeb graphs for continuous space-time data (Q945940) (← links)
- The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing (Q945942) (← links)
- Reconstruction of a graph from 2-vicinities of its vertices (Q947081) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- The problem of the moody chess players (Q975484) (← links)
- Recursive formulation of the matrix Padé approximation in packed storage (Q980202) (← links)
- Unary finite automata vs. arithmetic progressions (Q989556) (← links)
- On finding fundamental cut sets (Q990139) (← links)
- Finding all equilibria in games of strategic complements (Q996391) (← links)
- Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
- On-line computation of transitive closures of graphs (Q1051432) (← links)
- A low and a high hierarchy within NP (Q1052097) (← links)
- The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825) (← links)
- On the complexity of chess (Q1054641) (← links)
- Area-period tradeoffs for multiplication of rectangular matrices (Q1060844) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer (Q1065546) (← links)
- Factoring multivariate polynomials over finite fields (Q1065867) (← links)
- The optimality of balancing workloads in certain types of flexible manufacturing systems (Q1066800) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Universal retrieval trees (Q1068838) (← links)
- The performance of multilective VLSI algorithms (Q1069297) (← links)
- An assignment algorithm with applications to integrated circuit layout (Q1069442) (← links)
- Independence results about context-free languages and lower bounds (Q1071500) (← links)
- The one-dimensional weighted Voronoi diagram (Q1071508) (← links)
- Exact balancing is not always good (Q1072369) (← links)
- Verifying nonrigidity (Q1072373) (← links)
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths (Q1072571) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés (Q1073816) (← links)
- Exact computation of Steiner minimal trees in the plane (Q1076029) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture (Q1084875) (← links)
