The following pages link to Stephan Olariu (Q185063):
Displaying 50 items.
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Fault-tolerant recursive least-squares computations on a mesh-connected parallel processor (Q701167) (← links)
- All minimal prime extensions of hereditary classes of graphs (Q868943) (← links)
- On the closure of triangle-free graphs under substitution (Q915449) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- Efficient corona training protocols for sensor networks (Q936525) (← links)
- No antitwins in minimal imperfect graphs (Q1107542) (← links)
- Paw-free graphs (Q1108293) (← links)
- The strong perfect graph conjecture for pan-free graphs (Q1112848) (← links)
- Wings and perfect graphs (Q1112849) (← links)
- On the unimodality of convex polygons (Q1113454) (← links)
- All variations on perfectly orderable graphs (Q1114703) (← links)
- Weak bipolarizable graphs (Q1116961) (← links)
- A simple linear-time algorithm for computing the ring and MST of unimodal polygons (Q1120279) (← links)
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs) (Q1175981) (← links)
- A faster optimal algorithm for the measure problem (Q1179216) (← links)
- An efficient parallel algorithm for multiselection (Q1179217) (← links)
- A charming class of perfectly orderable graphs (Q1193431) (← links)
- A constant-time channel-assignment algorithm on reconfigurable meshes (Q1195930) (← links)
- The morphology of convex polygons (Q1205915) (← links)
- Applications of reconfigurable meshes to constant-time computations (Q1208520) (← links)
- Time-optimal proximity graph computations on enhanced meshes (Q1268803) (← links)
- On the \(p\)-connectedness of graphs---a survey (Q1302141) (← links)
- (Q1364467) (redirect page) (← links)
- Time-optimal tree computations on sparse meshes (Q1364469) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
- Some observations on using meta-heuristics for efficient location management in mobile computing networks. (Q1398770) (← links)
- A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
- Enhanced simulated annealing technique for the single-row routing problem (Q1610590) (← links)
- Single-row transformation of complete graphs (Q1777610) (← links)
- A generalization of Chvátal's star-cutset lemma (Q1813708) (← links)
- The hierarchical cliques interconnection network (Q1878689) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- Constant-time convexity problems on reconfigurable meshes (Q1898215) (← links)
- Reconstructing a binary tree from its traversals in doubly logarithmic CREW time (Q1898217) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- On the dynamic initialization of parallel computers (Q1976383) (← links)
- Optimal greedy algorithms for indifference graphs (Q2365550) (← links)
- Quasi-brittle graphs, a new class of perfectly orderable graphs (Q2366016) (← links)
- Selection on rectangular meshes with multiple broadcasting (Q2366647) (← links)
- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks (Q2729095) (← links)
- The LBFS Structure and Recognition of Interval Graphs (Q3058537) (← links)
- (Q3153068) (← links)
- The set of prime extensions of a graph: the finite and the infinite case (Q3439148) (← links)
- A simple linear-time algorithm for computing the center of an interval graph (Q3477967) (← links)
- Constructing bimodal convex hexagons (Q3478004) (← links)
- On the L(h,k)-Labeling of Co-comparability Graphs (Q3611902) (← links)
- (Q3809824) (← links)
