The following pages link to Leonidas Palios (Q441870):
Displaying 49 items.
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- Computing the Newton polygon of the implicit equation (Q626973) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- Detecting holes and antiholes in graphs (Q870455) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (Q1025922) (← links)
- On the hamiltonicity of the Cartesian product (Q1044703) (← links)
- Encoding watermark numbers as reducible permutation graphs using self-inverting permutations (Q1801057) (← links)
- An optimal parallel co-connectivity algorithm (Q1882536) (← links)
- Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation (Q1882629) (← links)
- Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon (Q1924710) (← links)
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs (Q1933642) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- Shortest watchman tours in simple polygons under rotated monotone visibility (Q2019474) (← links)
- Optimizing generalized kernels of polygons (Q2046316) (← links)
- Corrigendum to ``Note on covering monotone orthogonal polygons'' (Q2252650) (← links)
- Join-reachability problems in directed graphs (Q2254502) (← links)
- On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- (Q2721995) (← links)
- Minimum r-Star Cover of Class-3 Orthogonal Polygons (Q2946065) (← links)
- Counting Spanning Trees in Graphs Using Modular Decomposition (Q3078398) (← links)
- Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments (Q3125219) (← links)
- On the Strongly Connected and Biconnected Components of the Complement of Graphs (Q3439158) (← links)
- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs (Q3522962) (← links)
- An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs (Q3612594) (← links)
- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (Q3651563) (← links)
- (Q4281925) (← links)
- (Q4295431) (← links)
- (Q4414511) (← links)
- (Q4471828) (← links)
- (Q4474099) (← links)
- An efficient shape-based approach to image retrieval (Q4538855) (← links)
- Parallel algorithms for P4-comparability graphs (Q4818673) (← links)
- Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments (Q5054766) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q5056155) (← links)
- (Q5387659) (← links)
- (Q5387667) (← links)
- Optimal Algorithms for Detecting Network Stability (Q5452165) (← links)
- (Q5501347) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710826) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897557) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897578) (← links)
- Algorithms and Computation (Q5897939) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902535) (← links)
- (Q6187792) (← links)
