The following pages link to (Q4198056):
Displayed 50 items.
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities (Q139206) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- On the complexity of deduction modulo leaf permutative equations (Q556681) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- The parameter-less genetic algorithm in practice (Q558041) (← links)
- Heuristic solutions and confidence intervals for the multicovering problem (Q579132) (← links)
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis (Q579140) (← links)
- Two-dimensional cellular automata (Q579933) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- Partition semantics for relations (Q579957) (← links)
- Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964) (← links)
- Querying logical databases (Q579967) (← links)
- Deadlock-freedom (and safety) of transactions in a distributed database (Q579973) (← links)
- More about NP-completeness in the frustration model of spin-glasses (Q580185) (← links)
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem (Q580978) (← links)
- Some experiments with simulated annealing for coloring graphs (Q581241) (← links)
- NP-completeness properties about linear extensions (Q581427) (← links)
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- The set coincidence game: Complexity, attainability, and symmetric strategies (Q582100) (← links)
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints (Q582203) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- The Banker's problem with precedences (Q582904) (← links)
- Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
- The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (Q583101) (← links)
- The strong exponential hierarchy collapses (Q584250) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- Simple multi-visit attribute grammars (Q584934) (← links)
- The role of complexity in comparing classifications (Q585631) (← links)
- A natural encoding scheme proved probabilistic polynomial complete (Q593778) (← links)
- The jogger's problem (Q593786) (← links)
- The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
- The NP-completeness of a tomographical problem on bicolored domino tilings (Q596077) (← links)
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
- Combined super-/substring and super-/subsequence problems (Q596093) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- ATM VP-based network design (Q596263) (← links)
- The computational complexity of the relative robust shortest path problem with interval data (Q596264) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Symmetry-based matrix factorization (Q597055) (← links)
- A network flow model of group technology (Q597530) (← links)
- A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
- An information-theoretic model for steganography (Q598242) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Computational complexity of the semantics of some natural language constructions (Q598312) (← links)
- From monomials to words to graphs. (Q598451) (← links)