Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAris Pagourtzis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j29]Panagiotis Grontas
, Aris Pagourtzis:
Anonymity and everlasting privacy in electronic voting. Int. J. Inf. Sec. 22(4): 819-832 (2023)- [j28]Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou:
Optimal circle search despite the presence of faulty robots. Inf. Process. Lett. 182: 106391 (2023) - [j27]Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis:
Faster algorithms for k-subset sum and variations. J. Comb. Optim. 45(1): 24 (2023) - [j26]Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou:
Byzantine fault tolerant symmetric-persistent circle evacuation. Theor. Comput. Sci. 956: 113839 (2023) - [i19]Panagiotis Aivasiliotis, Aris Pagourtzis:
On the Approximability of External-Influence-Driven Problems. CoRR abs/2305.19251 (2023) - [i18]Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos:
On the power of counting the total number of computation paths of NPTMs. CoRR abs/2306.11614 (2023) - 2022
- [j25]Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos:
Guest column: A panorama of counting problems the decision version of which is in P3. SIGACT News 53(3): 46-68 (2022) - [j24]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: 66-80 (2022) - [j23]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: 55-73 (2022) - [j22]Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis:
Approximation schemes for subset-sums ratio problems. Theor. Comput. Sci. 931: 17-30 (2022) - [c59]Petros Potikas, Dora Souliou, Aris Pagourtzis, Katerina Potika:
A parallel community detection algorithm based on spanning trees. BigDataService 2022: 61-65 - [c58]Danai Balla, Pourandokht Behrouz, Panagiotis Grontas, Aris Pagourtzis, Marianna Spyrakou, Giannis Vrettos:
Designated-Verifier Linkable Ring Signatures with Unconditional Anonymity. CAI 2022: 55-68 - [c57]Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis:
Approximating Subset Sum Ratio via Subset Sum Computations. IWOCA 2022: 73-85 - [i17]Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis:
Approximating Subset Sum Ratio via Subset Sum Computations. CoRR abs/2201.04165 (2022) - [i16]Pourandokht Behrouz, Panagiotis Grontas, Vangelis Konstantakatos, Aris Pagourtzis, Marianna Spyrakou:
Designated-Verifier Linkable Ring Signatures. IACR Cryptol. ePrint Arch. 2022: 470 (2022) - [i15]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: 1138 (2022) - 2021
- [j21]Parikshit Saikia, Sushanta Karmakar, Aris Pagourtzis:
Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree. Discret. Math. Algorithms Appl. 13(2): 2150008:1-2150008:48 (2021) - [j20]Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang:
Publicly auditable conditional blind signatures. J. Comput. Secur. 29(2): 229-271 (2021) - [c56]Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou:
Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation. ALGOSENSORS 2021: 111-123 - [c55]Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis:
Faster Algorithms for k-Subset Sum and Variations. IJTCS-FAW 2021: 37-52 - [c54]Pourandokht Behrouz, Panagiotis Grontas, Vangelis Konstantakatos, Aris Pagourtzis, Marianna Spyrakou:
Designated-Verifier Linkable Ring Signatures. ICISC 2021: 51-70 - [e2]Evripidis Bampis, Aris Pagourtzis:
Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings. Lecture Notes in Computer Science 12867, Springer 2021, ISBN 978-3-030-86592-4 [contents] - [i14]Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis:
Faster Algorithms for k-Subset Sum and Variations. CoRR abs/2112.04244 (2021) - 2020
- [c53]Aris Pagourtzis, Dora Souliou, Petros Potikas, Katerina Potika:
Overlapping Community Detection via Minimum Spanning Tree Computations. BigDataService 2020: 62-65 - [c52]Dimitris Fotakis, Laurent Gourvès, Stelios Kasouridis, Aris Pagourtzis:
Object Allocation and Positive Graph Externalities. ECAI 2020: 107-114 - [c51]Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis:
Approximation Schemes for Subset Sum Ratio Problems. FAW 2020: 96-107 - [c50]Theofilos Triommatis, Aris Pagourtzis:
Approximate #Knapsack Computations to Count Semi-fair Allocations. TAMC 2020: 239-250 - [c49]Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis:
Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\). TAMC 2020: 251-262 - [c48]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: 32-47 - [i13]Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis:
Characterizations and approximability of hard counting classes below #P. CoRR abs/2003.02524 (2020) - [i12]Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis:
Approximation Schemes for Subset Sum Ratio Problems. CoRR abs/2003.06622 (2020)
2010 – 2019
- 2019
- [j19]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: 76-99 (2019) - [j18]Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos:
Preface to Special Issue on Algorithms and Complexity. Theor. Comput. Sci. 754: 1-2 (2019) - [c47]Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou:
Optimal Circle Search Despite the Presence of Faulty Robots. ALGOSENSORS 2019: 192-205 - [c46]Dora Souliou, Petros Potikas, Katerina Potika, Aris Pagourtzis:
Weight assignment on edges towards improved community detection. IDEAS 2019: 3:1-3:5 - [c45]Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis:
Extension and Its Price for the Connected Vertex Cover Problem. IWOCA 2019: 315-326 - [i11]Elli Anastasiadi, Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis:
Parameterized Fine-Grained Reductions. CoRR abs/1902.05529 (2019) - [i10]Theofilos Triommatis, Aris Pagourtzis:
Approximate #Knapsack Computations to Count Semi-Fair Allocations. CoRR abs/1912.12430 (2019) - [i9]Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis:
Security models for everlasting privacy. IACR Cryptol. ePrint Arch. 2019: 1193 (2019) - 2018
- [j17]Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Minimum multiplicity edge coloring via orientation. Discret. Appl. Math. 247: 380-388 (2018) - [j16]Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Path multicoloring in spider graphs with even color multiplicity. Inf. Process. Lett. 133: 1-4 (2018) - [c44]Ketki Kulkarni, Aris Pagourtzis, Katerina Potika, Petros Potikas, Dora Souliou:
Community Detection via Neighborhood Overlap and Spanning Tree Computations. ALGOCLOUD 2018: 13-24 - [c43]Nikolaos Melissinos, Aris Pagourtzis:
A Faster FPTAS for the Subset-Sums Ratio Problem. COCOON 2018: 602-614 - [c42]Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang:
Towards Everlasting Privacy and Efficient Coercion Resistance in Remote Electronic Voting. Financial Cryptography Workshops 2018: 210-231 - [c41]Aris Pagourtzis, Tomasz Radzik:
Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. MFCS 2018: 80:1-80:13 - [i8]Nikolaos Melissinos, Aris Pagourtzis:
A Faster FPTAS for the Subset-Sums Ratio Problem. CoRR abs/1803.09952 (2018) - [i7]Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang:
Towards everlasting privacy and efficient coercion resistance in remote electronic voting. IACR Cryptol. ePrint Arch. 2018: 215 (2018) - 2017
- [j15]Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes:
On the connection between interval size functions and path counting. Comput. Complex. 26(2): 421-467 (2017) - [j14]Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Reliable broadcast with respect to topology knowledge. Distributed Comput. 30(2): 87-102 (2017) - [j13]Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis, Dimitris Sakavalas:
Energy-efficient broadcasting in ad hoc wireless networks. J. Discrete Algorithms 42: 2-13 (2017) - [c40]Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos:
Completeness Results for Counting Problems with Easy Decision. CIAC 2017: 55-66 - [c39]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: 469-484 - [c38]Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Reliable Communication via Semilattice Properties of Partial Knowledge. FCT 2017: 367-380 - [c37]Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis:
Coercion Resistance in a Practical Secret Voting Scheme for Large Scale Elections. ISPAN-FCST-ISCC 2017: 514-519 - [c36]Evangelos Kranakis, Danny Krizanc, Euripides Markou, Aris Pagourtzis, Felipe Ramírez:
Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. SOFSEM 2017: 79-90 - [e1]Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos:
Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings. Lecture Notes in Computer Science 10236, 2017, ISBN 978-3-319-57585-8 [contents] - [i6]Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Joining Local Knowledge to Communicate Reliably (Extended Abstract). CoRR abs/1711.01725 (2017) - [i5]Alexandros Zacharakis, Panagiotis Grontas, Aris Pagourtzis:
Conditional Blind Signatures. IACR Cryptol. ePrint Arch. 2017: 682 (2017) - 2016
- [c35]Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Brief Announcement: Reliable Message Transmission under Partial Knowledge and General Adversaries. PODC 2016: 203-205 - [i4]Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis, Dimitris Sakavalas:
k-shot Broadcasting in Ad Hoc Radio Networks. CoRR abs/1603.08393 (2016) - 2015
- [j12]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: 231-254 (2015) - [c34]Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Scheduling Connections via Path and Edge Multicoloring. ADHOC-NOW 2015: 33-47 - [i3]Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Reliable Message Transmission under Partial Knowledge. IACR Cryptol. ePrint Arch. 2015: 243 (2015) - 2014
- [c33]Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis:
The Lazy Matroid Problem. IFIP TCS 2014: 66-77 - [c32]Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia:
Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host. SIROCCO 2014: 355-370 - [c31]Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Reliable Broadcast with Respect to Topology Knowledge. DISC 2014: 107-121 - [i2]Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Optimal Resilience Broadcast against Locally Bounded and General Adversaries. IACR Cryptol. ePrint Arch. 2014: 290 (2014) - 2013
- [c30]Chris Litsas, Aris Pagourtzis, Dimitris Sakavalas:
A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm. ADHOC-NOW 2013: 269-280 - [c29]Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis:
Selfish Resource Allocation in Optical Networks. CIAC 2013: 25-36 - [c28]Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis:
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. FCT 2013: 171-182 - [i1]Chris Litsas, Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
On the Resilience and Uniqueness of CPA for Secure Broadcast. IACR Cryptol. ePrint Arch. 2013: 738 (2013) - 2012
- [j11]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): 1125-1137 (2012) - 2011
- [j10]Evangelos Bampas, Aris Pagourtzis, Katerina Potika:
An experimental study of maximum profit wavelength assignment in WDM rings. Networks 57(3): 285-293 (2011) - [c27]Paraschos Koutris, Aris Pagourtzis:
Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. CATS 2011: 161-168 - 2010
- [c26]Paraschos Koutris, Aris Pagourtzis:
Brief announcement: k-shot distributed broadcasting in radio networks. PODC 2010: 77-78
2000 – 2009
- 2009
- [j9]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): 551-571 (2009) - [c25]Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasileios Syrgkanis:
Colored Resource Allocation Games. CTW 2009: 68-72 - [c24]Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes:
On the Connection between Interval Size Functions and Path Counting. TAMC 2009: 108-117 - 2008
- [j8]Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis, Konrad Schlude:
On the Complexity of Variations of Equal Sum Subsets. Nord. J. Comput. 14(3): 151-172 (2008) - [c23]Evangelos Bampas, Aris Pagourtzis, Katerina Potika:
Maximum Profit Wavelength Assignment in WDM Rings. CTW 2008: 35-38 - [c22]Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika:
On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks. ISAAC 2008: 159-170 - 2007
- [j7]Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik:
Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47(1): 97-117 (2007) - [j6]Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007) - [c21]Ioannis Milis, Aris Pagourtzis, Katerina Potika:
Selfish Routing and Path Coloring in All-Optical Networks. CAAN 2007: 71-84 - [c20]Dora Souliou, Aris Pagourtzis, Panayotis Tsanakas:
A fast parallel algorithm for frequent itemsets mining. AIAI 2007: 213-220 - [c19]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Randomized and Approximation Algorithms for Blue-Red Matching. MFCS 2007: 715-725 - 2006
- [j5]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): 1-14 (2006) - [j4]Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos, Panayotis Tsanakas:
Computing frequent itemsets in parallel using partial support trees. J. Syst. Softw. 79(12): 1735-1743 (2006) - [c18]Evangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis:
Periodic Metro Scheduling. ATMOS 2006 - [c17]Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis:
Distributed Routing in Tree Networks with Few Landmarks. CAAN 2006: 45-57 - [c16]Aris Pagourtzis, Stathis Zachos:
The Complexity of Counting Functions with Easy Decision Version. MFCS 2006: 741-752 - 2005
- [c15]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: 57-67 - [c14]Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos:
Computing Frequent Itemsets in Parallel Using Partial Support Trees. PVM/MPI 2005: 28-37 - [c13]Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou:
Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees. SGAI Conf. 2005: 263-276 - 2004
- [c12]Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING 2004: 150-161 - 2003
- [j3]Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter:
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. 46(4): 391-400 (2003) - [j2]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Satisfying a maximum number of pre-routed requests in all-optical rings. Comput. Networks 42(1): 55-63 (2003) - [c11]Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis:
Composing Equipotent Teams. FCT 2003: 98-108 - [c10]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Minimizing Request Blocking in All-Optical Rings. INFOCOM 2003: 1355-1361 - [c9]Stephan J. Eidenbenz, Aris Pagourtzis, Peter Widmayer:
Flexible Train Rostering. ISAAC 2003: 615-624 - [c8]Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos:
Resource Allocation Problems in Multifiber WDM Tree Networks. WG 2003: 218-229 - 2002
- [c7]Leszek Gasieniec, Aris Pagourtzis, Igor Potapov:
Deterministic Communication in Radio Networks with Large Labels. ESA 2002: 512-524 - [c6]Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer:
Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS 2002: 280-291 - [c5]Aris Pagourtzis, Igor Potapov, Wojciech Rytter:
Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI 2002: 217-225 - 2001
- [j1]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Routing and path multicoloring. Inf. Process. Lett. 80(5): 249-256 (2001) - [c4]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis:
Oblivious gossiping in ad-hoc radio networks. DIAL-M 2001: 44-51 - [c3]Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer:
On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402 - [c2]Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos:
Acceptor-Definable Counting Classes. Panhellenic Conference on Informatics 2001: 453-463 - [c1]Aris Pagourtzis, Igor Potapov, Wojciech Rytter:
PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI 2001: 249-256
Coauthor Index