The following pages link to (Q3328583):
Displayed 50 items.
- On some decision problems for trace codings (Q672324) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- The total interval number of a tree and the Hamiltonian completion number of its line graph (Q672831) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- On the equivalence covering number of splitgraphs (Q673014) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- \(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353) (← links)
- Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- An \(O(n^ 3)\) recognition algorithm for bithreshold graphs (Q676270) (← links)
- The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
- Visibility graphs of towers (Q676570) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- On recognizing and characterizing visibility graphs of simple polygons (Q677018) (← links)
- Trapezoid graphs and generalizations, geometry and algorithms (Q678864) (← links)
- Bipartite permutation graphs with application to the minimum buffer size problem (Q678867) (← links)
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- Möbius functions and confluent semi-commutations (Q685454) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
- Recognizing locally equivalent graphs (Q685658) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- Independence and domination in polygon graphs (Q686246) (← links)
- Irredundancy in circular arc graphs (Q686248) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- Bounded discrete representations of interval orders (Q686255) (← links)
- A linear algorithm for the group path problem on chordal graphs (Q686257) (← links)
- \(\phi\)-threshold and \(\phi\)-tolerance chain graphs (Q686259) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- On generalized perfect graphs: Bounded degree and bounded edge perfection (Q686267) (← links)
- Sources in posets and comparability graphs (Q687177) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- Two-step graphs of trees (Q688263) (← links)
- No-hole \((r+1)\)-distant colorings (Q688267) (← links)
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- Testing balancedness and perfection of linear matrices (Q689142) (← links)
- On a problem concerning tolerance graphs (Q689957) (← links)
- On the max coloring problem (Q690449) (← links)
- How is a chordal graph like a supersolvable binary matroid? (Q704292) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Girth and treewidth (Q707020) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Extended box clustering for classification problems (Q724605) (← links)