Aris Pagourtzis

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 63

Top Venues

CoRR

IACR Cryptol. ePrint Arch.

Theor. Comput. Sci.

TAMC

Publications

Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
Approximating subset sum ratio via partition computations. Acta Informatica 61 (2) (2024)
Laurent Gourvès, Aris Pagourtzis
Removable Online Knapsack with Bounded Size Items. SOFSEM (2024)
George Papadoulis, Danai Balla, Panagiotis Grontas, Aris Pagourtzis
AQQUA: Augmenting Quisquis with Auditability. IACR Cryptol. ePrint Arch. 2024 (2024)
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
On the Power of Counting the Total Number of Computation Paths of NPTMs. TAMC (2024)
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
On the power of counting the total number of computation paths of NPTMs. CoRR (2023)
Panagiotis Grontas, Aris Pagourtzis
Anonymity and everlasting privacy in electronic voting. Int. J. Inf. Sec. 22 (4) (2023)
Pourandokht Behrouz, Orestis Konstantinidis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou, Marianna Spyrakou
Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle. ALGOWIN (2023)
Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
Faster algorithms for k-subset sum and variations. J. Comb. Optim. 45 (1) (2023)
Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
Byzantine fault tolerant symmetric-persistent circle evacuation. Theor. Comput. Sci. 956 (2023)
Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
Optimal circle search despite the presence of faulty robots. Inf. Process. Lett. 182 (2023)
Panagiotis Aivasiliotis, Aris Pagourtzis
On the Approximability of External-Influence-Driven Problems. CoRR (2023)
Danai Balla, Pourandokht Behrouz, Panagiotis Grontas, Aris Pagourtzis, Marianna Spyrakou, Giannis Vrettos
Designated-Verifier Linkable Ring Signatures with Unconditional Anonymity. CAI (2022)
Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
Approximating Subset Sum Ratio via Subset Sum Computations. CoRR (2022)
Danai Balla, Pourandokht Behrouz, Panagiotis Grontas, Aris Pagourtzis, Marianna Spyrakou, Giannis Vrettos
Designated-Verifier Linkable Ring Signatures with unconditional anonymity. IACR Cryptol. ePrint Arch. 2022 (2022)
Petros Potikas, Dora Souliou, Aris Pagourtzis, Katerina Potika
A parallel community detection algorithm based on spanning trees. BigDataService (2022)
Pourandokht Behrouz, Panagiotis Grontas, Vangelis Konstantakatos, Aris Pagourtzis, Marianna Spyrakou
Designated-Verifier Linkable Ring Signatures. IACR Cryptol. ePrint Arch. 2022 (2022)
Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
Completeness, approximability and exponential time results for counting problems with easy decision version. Theor. Comput. Sci. 915 (2022)
Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos
. SIGACT News 53 (3) (2022)
Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
Extension and its price for the connected vertex cover problem. Theor. Comput. Sci. 904 (2022)
Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
Approximation schemes for subset-sums ratio problems. Theor. Comput. Sci. 931 (2022)
Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
Approximating Subset Sum Ratio via Subset Sum Computations. IWOCA (2022)
Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
Faster Algorithms for k-Subset Sum and Variations. IJTCS-FAW (2021)
Parikshit Saikia, Sushanta Karmakar, Aris Pagourtzis
Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree. Discret. Math. Algorithms Appl. 13 (2) (2021)
Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation. ALGOSENSORS (2021)
Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
Faster Algorithms for k-Subset Sum and Variations. CoRR (2021)
Pourandokht Behrouz, Panagiotis Grontas, Vangelis Konstantakatos, Aris Pagourtzis, Marianna Spyrakou
Designated-Verifier Linkable Ring Signatures. ICISC (2021)
Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang
Publicly auditable conditional blind signatures. J. Comput. Secur. 29 (2) (2021)
Theofilos Triommatis, Aris Pagourtzis
Approximate #Knapsack Computations to Count Semi-fair Allocations. TAMC (2020)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
Characterizations and approximability of hard counting classes below #P. CoRR (2020)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\). TAMC (2020)
Dimitris Fotakis, Laurent Gourvès, Stelios Kasouridis, Aris Pagourtzis
Object Allocation and Positive Graph Externalities. ECAI (2020)
Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
On the Complexity of the Upper r-Tolerant Edge Cover Problem. TTCS (2020)
Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
Approximation Schemes for Subset Sum Ratio Problems. FAW (2020)
Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
Approximation Schemes for Subset Sum Ratio Problems. CoRR (2020)
Aris Pagourtzis, Dora Souliou, Petros Potikas, Katerina Potika
Overlapping Community Detection via Minimum Spanning Tree Computations. BigDataService (2020)
Dora Souliou, Petros Potikas, Katerina Potika, Aris Pagourtzis
Weight assignment on edges towards improved community detection. IDEAS (2019)
Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
Optimal Circle Search Despite the Presence of Faulty Robots. ALGOSENSORS (2019)
Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis
Security models for everlasting privacy. IACR Cryptol. ePrint Arch. 2019 (2019)
Elli Anastasiadi, Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis
Parameterized Fine-Grained Reductions. CoRR (2019)
Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
Extension and Its Price for the Connected Vertex Cover Problem. IWOCA (2019)
Theofilos Triommatis, Aris Pagourtzis
Approximate #Knapsack Computations to Count Semi-Fair Allocations. CoRR (2019)
Alamgir Naushad, Ghulam Abbas, Ziaul Haq Abbas, Aris Pagourtzis
Novel strategies for path stability estimation under topology change using Hello messaging in MANETs. Ad Hoc Networks 87 (2019)
Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos
Preface to Special Issue on Algorithms and Complexity. Theor. Comput. Sci. 754 (2019)
Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang
Towards Everlasting Privacy and Efficient Coercion Resistance in Remote Electronic Voting. Financial Cryptography Workshops (2018)
Nikolaos Melissinos, Aris Pagourtzis
A Faster FPTAS for the Subset-Sums Ratio Problem. CoRR (2018)
Aris Pagourtzis, Tomasz Radzik
Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. MFCS (2018)
Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika
Path multicoloring in spider graphs with even color multiplicity. Inf. Process. Lett. 133 (2018)
Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika
Minimum multiplicity edge coloring via orientation. Discret. Appl. Math. 247 (2018)
Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang
Towards everlasting privacy and efficient coercion resistance in remote electronic voting. IACR Cryptol. ePrint Arch. 2018 (2018)
Ketki Kulkarni, Aris Pagourtzis, Katerina Potika, Petros Potikas, Dora Souliou
Community Detection via Neighborhood Overlap and Spanning Tree Computations. ALGOCLOUD (2018)
Nikolaos Melissinos, Aris Pagourtzis
A Faster FPTAS for the Subset-Sums Ratio Problem. COCOON (2018)
Alexandros Zacharakis, Panagiotis Grontas, Aris Pagourtzis
Conditional Blind Signatures. IACR Cryptol. ePrint Arch. 2017 (2017)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
Completeness Results for Counting Problems with Easy Decision. CIAC (2017)
Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika
Stathis Zachos at 70! CIAC (2017)
Evangelos Kranakis, Danny Krizanc, Euripides Markou, Aris Pagourtzis, Felipe Ramírez
Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. SOFSEM (2017)
Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
Joining Local Knowledge to Communicate Reliably (Extended Abstract). CoRR (2017)
Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis
Coercion Resistance in a Practical Secret Voting Scheme for Large Scale Elections. ISPAN-FCST-ISCC (2017)
Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
Reliable broadcast with respect to topology knowledge. Distributed Comput. 30 (2) (2017)
Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis, Dimitris Sakavalas
Energy-efficient broadcasting in ad hoc wireless networks. J. Discrete Algorithms 42 (2017)
Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes
On the connection between interval size functions and path counting. Comput. Complex. 26 (2) (2017)
Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
Reliable Communication via Semilattice Properties of Partial Knowledge. FCT (2017)
Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis, Dimitris Sakavalas
k-shot Broadcasting in Ad Hoc Radio Networks. CoRR (2016)
Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
Brief Announcement: Reliable Message Transmission under Partial Knowledge and General Adversaries. PODC (2016)
Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika
Scheduling Connections via Path and Edge Multicoloring. ADHOC-NOW (2015)
Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
Reliable Message Transmission under Partial Knowledge. IACR Cryptol. ePrint Arch. 2015 (2015)
Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia
Improved periodic data retrieval in asynchronous rings with a faulty host. Theor. Comput. Sci. 608 (2015)
Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
Reliable Broadcast with Respect to Topology Knowledge. DISC (2014)
Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
The Lazy Matroid Problem. IFIP TCS (2014)
Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia
Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host. SIROCCO (2014)
Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
Optimal Resilience Broadcast against Locally Bounded and General Adversaries. IACR Cryptol. ePrint Arch. 2014 (2014)
Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis
Selfish Resource Allocation in Optical Networks. CIAC (2013)
Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. FCT (2013)
Chris Litsas, Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
On the Resilience and Uniqueness of CPA for Secure Broadcast. IACR Cryptol. ePrint Arch. 2013 (2013)
Chris Litsas, Aris Pagourtzis, Dimitris Sakavalas
A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm. ADHOC-NOW (2013)
Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika
On a Noncooperative Model for Wavelength Assignment in Multifiber Optical Networks. IEEE/ACM Trans. Netw. 20 (4) (2012)
Paraschos Koutris, Aris Pagourtzis
Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. CATS (2011)
Evangelos Bampas, Aris Pagourtzis, Katerina Potika
An experimental study of maximum profit wavelength assignment in WDM rings. Networks 57 (3) (2011)
Paraschos Koutris, Aris Pagourtzis
Brief announcement: k-shot distributed broadcasting in radio networks. PODC (2010)
Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasileios Syrgkanis
Colored Resource Allocation Games. CTW (2009)
Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes
On the Connection between Interval Size Functions and Path Counting. TAMC (2009)
Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou
Improved methods for extracting frequent itemsets from interim-support trees. Softw. Pract. Exp. 39 (6) (2009)
Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis, Konrad Schlude
On the Complexity of Variations of Equal Sum Subsets. Nord. J. Comput. 14 (3) (2008)
Evangelos Bampas, Aris Pagourtzis, Katerina Potika
Maximum Profit Wavelength Assignment in WDM Rings. CTW (2008)
Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika
On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks. ISAAC (2008)
Aris Pagourtzis, Katerina Potika, Stathis Zachos
Path multicoloring with fewer colors in spiders and caterpillars. Computing 80 (3) (2007)
Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik
Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47 (1) (2007)
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Randomized and Approximation Algorithms for Blue-Red Matching. MFCS (2007)
Ioannis Milis, Aris Pagourtzis, Katerina Potika
Selfish Routing and Path Coloring in All-Optical Networks. CAAN (2007)
Dora Souliou, Aris Pagourtzis, Panayotis Tsanakas
A fast parallel algorithm for frequent itemsets mining. AIAI (2007)
Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Comput. Networks 50 (1) (2006)
Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis
Distributed Routing in Tree Networks with Few Landmarks. CAAN (2006)
Aris Pagourtzis, Stathis Zachos
The Complexity of Counting Functions with Easy Decision Version. MFCS (2006)
Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos, Panayotis Tsanakas
Computing frequent itemsets in parallel using partial support trees. J. Syst. Softw. 79 (12) (2006)
Evangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis
Periodic Metro Scheduling. ATMOS (2006)
Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. Panhellenic Conference on Informatics (2005)
Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou
Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees. SGAI Conf. (2005)
Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos
Computing Frequent Itemsets in Parallel Using Partial Support Trees. PVM/MPI (2005)
Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING (2004)
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Satisfying a maximum number of pre-routed requests in all-optical rings. Comput. Networks 42 (1) (2003)
Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos
Resource Allocation Problems in Multifiber WDM Tree Networks. WG (2003)

Aris Pagourtzis.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Aris Pagourtzis