The following pages link to Jeremy P. Spinrad (Q344852):
Displaying 46 items.
- (Q187142) (redirect page) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- Visibility graphs of towers (Q676570) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
- Algorithms for the homogeneous set sandwich problem (Q850795) (← links)
- A new characterization of HH-free graphs (Q942119) (← links)
- Worst-case analysis of a scheduling algorithm (Q1060946) (← links)
- Worst case analysis of a graph coloring algorithm (Q1066156) (← links)
- Circular-arc graphs with clique cover number two (Q1078197) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Edge subdivision and dimension (Q1108295) (← links)
- Note on recognition of matroid systems (Q1180837) (← links)
- Cycle-free partial orders and chordal comparability graphs (Q1182042) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- Finding large holes (Q1182105) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Efficient graph representations (Q1396949) (← links)
- Scalar aggregation in inconsistent databases. (Q1401279) (← links)
- A note on computing graph closures (Q1422436) (← links)
- Recognizing quasi-triangulated graphs. (Q1428566) (← links)
- Forbidden subgraph decomposition (Q1598796) (← links)
- Recognition algorithms for orders of small width and graphs of small Dilworth number (Q1771253) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Algorithms for weakly triangulated graphs (Q1891926) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)
- Doubly lexical ordering of dense 0--1 matrices (Q2366069) (← links)
- (Q2768334) (← links)
- (Q2768336) (← links)
- (Q2816133) (← links)
- Improved algorithms for weakly chordal graphs (Q2944551) (← links)
- Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)
- (Q3128916) (← links)
- (Q3138902) (← links)
- (Q3138973) (← links)
- (Q3140413) (← links)
- Between<i>O</i>(<i>nm</i>) and<i>O</i>(<i>n<sup>alpha</sup></i>) (Q3434988) (← links)
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs (Q3434989) (← links)
- Finding Triangles in Restricted Classes of Graphs (Q3439511) (← links)
- (Q5005173) (← links)
- Polynomial time recognition of unit circular-arc graphs (Q5468870) (← links)
