( en | de | ru )

 

Disambiguation of "Nikolopoulos, Stavros D."

Author of the publication

copydeleteadd this publication to your clipboard
Preventing Malware Pandemics in Mobile Devices by Establishing Response-time Bounds.

, and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anastasios D Nikolopoulos

Andreas Nikolopoulos

Panajotis Nikolopoulos

Vassiliki Nikolopoulos

Stavros Konstantinides

 

Other publications of authors with the same name

Watermarking Images in the Frequency Domain by Exploiting Self-inverting Permutations., , and . WEBIST, page 45-54. SciTePress, (2013)Watermarking Images using 2D Representations of Self-inverting Permutations., , and . WEBIST, page 380-385. SciTePress, (2012)Counting Spanning Trees in Cographs., and . Electron. Notes Discret. Math., (2003)On the performance of the first-fit coloring algorithm on permutation graphs., and . Inf. Process. Lett., 75 (6): 265-273 (2000)An optimal parallel solution for the path cover problem on P4-sparse graphs., , and . J. Parallel Distributed Comput., 67 (1): 63-76 (2007)NP-completeness results for some problems on subclasses of bipartite and chordal graphs., and . Theor. Comput. Sci., 381 (1-3): 248-259 (2007)Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 1080-1089. Springer, (2005)Join-Reachability Problems in Directed Graphs., , and . CSR, volume 6651 of Lecture Notes in Computer Science, page 195-208. Springer, (2011)Recognizing HHDS-Free Graphs., and . WG, volume 3787 of Lecture Notes in Computer Science, page 456-467. Springer, (2005)Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching., and . Panhellenic Conference on Informatics, volume 3746 of Lecture Notes in Computer Science, page 68-79. Springer, (2005)