The following pages link to (Q4142699):
Displaying 50 items.
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- On universal learning algorithms (Q287154) (← links)
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- Improved performance of the greedy algorithm for partial cover (Q293139) (← links)
- A lower bound on the order of the largest induced forest in planar graphs with high girth (Q317411) (← links)
- Hub location under competition (Q322435) (← links)
- An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← links)
- Compressing two-dimensional routing tables with order (Q325484) (← links)
- A minimized-rule based approach for improving data currency (Q326482) (← links)
- On the distance and multidistance graph embeddability problem (Q334409) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- Dynamics and control at feedback vertex sets. I: Informative and determining nodes in regulatory networks (Q376311) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- The complexity of free-flood-it on \(2\times n\) boards (Q388453) (← links)
- Revisiting the complexity of and/or graph solution (Q394337) (← links)
- Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382) (← links)
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs (Q418035) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Approximation algorithms for a geometric set cover problem (Q423912) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- Most probable explanations in Bayesian networks: complexity and tractability (Q433524) (← links)
- On the bounds of feedback numbers of \((n,k)\)-star graphs (Q436576) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs (Q440780) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- The maximum degree and diameter-bounded subgraph in the mesh (Q444444) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- Graph clustering (Q458448) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information (Q473662) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- Reachability computation for polynomial dynamical systems (Q526433) (← links)
- A simple proof of an inequality connecting the alternating number of independent sets and the decycling number (Q539877) (← links)
- Two-constraint domain decomposition with space filling curves (Q551212) (← links)
- Computational complexity of the problem of tree generation under fine-grained access control policies (Q553325) (← links)
- Survey of polynomial transformations between NP-complete problems (Q555184) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- Ordered vertex removal and subgraph problems (Q582090) (← links)
