| 2024 | TAMC | On the Power of Counting the Total Number of Computation Paths of NPTMs. | Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos |
| 2017 | CIAC | Completeness Results for Counting Problems with Easy Decision. | Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos |
| 2013 | FedCSIS | Teaching Programming through Problem Solving: The Role of the Programming Language. | Nikolaos S. Papaspyrou, Stathis Zachos |
| 2013 | ICTAC | Random Walks on Some Basic Classes of Digraphs. | Wen-Ju Cheng, Jim Cox, Stathis Zachos |
| 2009 | SIROCCO | Ordered Coloring Grids and Related Graphs. | Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos |
| 2007 | MFCS | Randomized and Approximation Algorithms for Blue-Red Matching. | Christos Nomikos, Aris Pagourtzis, Stathis Zachos |
| 2006 | MFCS | The Complexity of Counting Functions with Easy Decision Version. | Aris Pagourtzis, Stathis Zachos |
| 2004 | Networking | Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. | Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos |
| 2003 | CIAC | Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. | Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis |
| 2003 | INFOCOM | Minimizing Request Blocking in All-Optical Rings. | Christos Nomikos, Aris Pagourtzis, Stathis Zachos |