| 2017 | COCOON | Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. | Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos |
| 2015 | WEBIST | Watermarking PDF Documents using Various Representations of Self-inverting Permutations. | Maria Chroni, Stavros D. Nikolopoulos |
| 2014 | WEBIST | From Image to Audio Watermarking Using Self-Inverting Permutations. | Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos |
| 2013 | DATA | Design and Evaluation of a Graph Codec System for Software Watermarking. | Maria Chroni, Stavros D. Nikolopoulos |
| 2013 | WEBIST | Watermarking Images in the Frequency Domain by Exploiting Self-inverting Permutations. | Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos |
| 2013 | WEBIST | Watermarking Digital Images in the Frequency Domain: Performance and Attack Issues. | Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos |
| 2013 | SECRYPT | A Dynamic Watermarking Model for Embedding Reducible Permutation Graphs into Software. | Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos |
| 2012 | COMPSAC | An Efficient Graph Codec System for Software Watermarking. | Maria Chroni, Stavros D. Nikolopoulos |
| 2012 | CSEDU | A Watermarking System for Teaching Students to Respect Intellectual Property Rights. | Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos |
| 2012 | WEBIST | Watermarking Images using 2D Representations of Self-inverting Permutations. | Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos |
| 2011 | CSR | Join-Reachability Problems in Directed Graphs. | Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios |
| 2011 | WALCOM | Counting Spanning Trees in Graphs Using Modular Decomposition. | Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos |
| 2010 | WALCOM | Harmonious Coloring on Subclasses of Colinear Graphs. | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
| 2010 | WG | The Longest Path Problem is Polynomial on Cocomparability Graphs. | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
| 2009 | IWOCA | An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. | Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios |
| 2009 | MFCS | The Longest Path Problem Is Polynomial on Interval Graphs. | Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos |
| 2009 | WALCOM | Colinear Coloring on Graphs. | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
| 2008 | FAW | The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. | Katerina Asdre, Stavros D. Nikolopoulos |
| 2008 | WALCOM | Optimal Algorithms for Detecting Network Stability. | Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis |
| 2007 | FAW | An | Stavros D. Nikolopoulos, Leonidas Palios |
| 2006 | CIAC | Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. | Dimitrios Koukopoulos, Stavros D. Nikolopoulos |
| 2006 | WG | A Fully Dynamic Algorithm for the Recognition of | Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos |
| 2005 | ISAAC | Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. | Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios |
| 2005 | WSC | P-tree structures and event horizon: efficient event-set implementations. | Katerina Asdre, Stavros D. Nikolopoulos |
| 2005 | WG | Adding an Edge in a Cograph. | Stavros D. Nikolopoulos, Leonidas Palios |
| 2005 | WG | Recognizing HHDS-Free Graphs. | Stavros D. Nikolopoulos, Leonidas Palios |
| 2004 | SODA | Hole and antihole detection in graphs. | Stavros D. Nikolopoulos, Leonidas Palios |
| 2004 | WG | Recognizing HHD-free and Welsh-Powell Opposition Graphs. | Stavros D. Nikolopoulos, Leonidas Palios |
| 2003 | WG | Recognizing Bipolarizable and P 4-Simplicial Graphs. | Stavros D. Nikolopoulos, Leonidas Palios |
| 2002 | WG | On the Recognition of P | Stavros D. Nikolopoulos, Leonidas Palios |
| 2001 | ISAAC | Recognition and Orientation Algorithms for P | Stavros D. Nikolopoulos, Leonidas Palios |
| 1997 | INFOCOM | Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph. | Stavros D. Nikolopoulos, Andreas Pitsillides, David Tipper |