The following pages link to (Q3328583):
Displaying 50 items.
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- Certifying algorithms (Q465678) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- The coloring problem for classes with two small obstructions (Q479257) (← links)
- The Laplacian energy of threshold graphs and majorization (Q486231) (← links)
- On the non-unit count of interval graphs (Q496432) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
- Clique-perfectness of claw-free planar graphs (Q503649) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- Orientable edge colorings of graphs (Q531600) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- Fractional weak discrepancy and split semiorders (Q531608) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Common intervals of multiple permutations (Q534763) (← links)
- Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
- Inverse \(M\)-matrices. II (Q551242) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges (Q556849) (← links)
- Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964) (← links)
- Completion of partial matrices to contractions (Q580679) (← links)
- An efficient procedure for the N-city traveling salesman problem (Q583107) (← links)
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- The polytope of degree sequences (Q584289) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Space graphs and sphericity (Q595671) (← links)
- Reconstructibility and perfect graphs (Q595687) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- The off-line group seat reservation problem (Q613435) (← links)
- Some good characterization results relating to the Kőnig-Egerváry theorem (Q623797) (← links)
- On conditional covering problem (Q626967) (← links)
- On parallel recognition of cographs (Q627166) (← links)
- A characterization of graphs with rank 4 (Q630525) (← links)
- The elliptic matrix completion problem (Q630533) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Approximation of RNA multiple structural alignment (Q655441) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
