The following pages link to (Q3328583):
Displayed 50 items.
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Online scheduling with interval conflicts (Q372978) (← links)
- Transitive oriented 3 hypergraphs of cyclic orders (Q382898) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (Q389670) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs (Q410643) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Trimming weighted graphs of bounded treewidth (Q415289) (← links)
- 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)
- 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)
- 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)
- Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)