The following pages link to Stavros D. Nikolopoulos (Q294752):
Displaying 50 items.
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs (Q704836) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs (Q868040) (← links)
- Detecting holes and antiholes in graphs (Q870455) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (Q1025922) (← links)
- Constant-time parallel recognition of split graphs (Q1349719) (← links)
- Optimal gray-code labeling and recognition algorithms for hypercubes (Q1602516) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Encoding watermark numbers as reducible permutation graphs using self-inverting permutations (Q1801057) (← links)
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) (← links)
- Parallel algorithms for Hamiltonian problems on quasi-threshold graphs (Q1878696) (← links)
- An optimal parallel co-connectivity algorithm (Q1882536) (← links)
- Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation (Q1882629) (← links)
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs (Q1933642) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- Join-reachability problems in directed graphs (Q2254502) (← links)
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
- On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
- A limit characterization for the number of spanning trees of graphs (Q2390271) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- P-tree structures and event horizon: efficient event-set implementations (Q2508375) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- (Q2741358) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- (Q3073568) (← links)
- Counting Spanning Trees in Graphs Using Modular Decomposition (Q3078398) (← links)
- (Q3154670) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- Harmonious Coloring on Subclasses of Colinear Graphs (Q3404436) (← links)
- Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates (Q3434547) (← links)
- On the Strongly Connected and Biconnected Components of the Complement of Graphs (Q3439158) (← links)
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs (Q3522962) (← links)
- Colinear Coloring on Graphs (Q3605491) (← 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)
- On complete systems of invariants for small graphs (Q4347181) (← links)
- (Q4414511) (← links)
- (Q4474099) (← links)
- Parallel algorithms for P4-comparability graphs (Q4818673) (← links)
- FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS (Q4820006) (← links)
