1. Repository of OAI
Ελληνικά   English  

Browsing by Author Nikolopoulos, S. D.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Jump to: Α Β Γ Δ Ε Ζ Η Θ Ι Κ Λ Μ Ν Ξ Ο Π Ρ Σ Τ Υ Φ Χ Ψ Ω
or enter first few letters:  
View Option
Showing results 4 to 23 of 43 < previous   next >
TitleAuthor(s)Issue date???itemlist.???
Coloring permutation graphs in parallelNikolopoulos, S. D.24-Nov-2015-
Counting Spanning Trees in Cographs: An Algorithmic ApproachNikolopoulos, S. D.; Papadopoulos, C.24-Nov-2015-
Detecting holes and antiholes in graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Efficient parallel recognition of cographsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
A Fully Dynamic Algorithm for the Recognition of P4-sparse GraphsPapadopoulos, C.; Nikolopoulos, S. D.; Palios, L.24-Nov-2015-
The harmonious coloring problem is NP-complete for interval and permutation graphsAsdre, K.; Ioannidou, K.; Nikolopoulos, S. D.24-Nov-2015-
Heterogenous networks can be unstable at arbitrarily low injection ratesKoukopoulos, D.; Nikolopoulos, S. D.24-Nov-2015-
A limit characterization for the number of spanning trees of graphsNikolopoulos, S. D.; Nomikos, C.; Rondogiannis, P.24-Nov-2015-
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographsAsdre, K.; Nikolopoulos, S. D.24-Nov-2015-
The Longest Path Problem has a Polynomial Solution on Interval GraphsIoannidou, K.; Mertzios, G. B.; Nikolopoulos, S. D.24-Nov-2015-
Maximizing the number of spanning trees in K(n)-complements of asteroidal graphsNikolopoulos, S. D.; Palios, L.; Papadopoulos, C.24-Nov-2015-
Maximizing the number of spanning trees in K-n-complements of asteroidal graphsNikolopoulos, S. D.; Palios, L.; Papadopoulos, C.24-Nov-2015-
Maximum-size subgraphs of P4-sparse graphs admitting a perfect matchingNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Minimal separators in P-4-sparse graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Multi-source trees: Algorithms for minimizing eccentricity cost metricsFragopoulou, P.; Nikolopoulos, S. D.; Palios, L.24-Nov-2015-
NP-completeness results for some problems on subclasses of bipartite and chordal graphsAsdre, K.; Nikolopoulos, S. D.24-Nov-2015-
The number of spanning trees in K-n-Complements of quasi-threshold graphsNikolopoulos, S. D.; Papadopoulos, C.24-Nov-2015-
Odd-Even, Compare-Exchange Parallel SortingNikolopoulos, S. D.; Danielopoulos, S. D.24-Nov-2015-
On the number of spanning trees of K-n(m) +/- G graphsNikolopoulos, S. D.; Papadopoulos, C.24-Nov-2015-
On the number of spanning trees of multi-star related graphsNikolopoulos, S. D.; Rondogiannis, P.24-Nov-2015-
Showing results 4 to 23 of 43 < previous   next >