Aris Pagourtzis
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
45
Venues
25
Active years
2001–2026
Best venue rank
A*
Where they publish
- CIWOCA4 papers
- BISAAC4 papers
- CTAMC4 papers
- CAlgosensors3 papers
- BMFCS3 papers
- CCIAC3 papers
- BFCT3 papers
- BSOFSEM2 papers
- NationalFAW2 papers
- A*PODC2 papers
- A*SODA1 paper
- BACNS1 paper
- A*ICML1 paper
- NationalICISC1 paper
- AECAI1 paper
- CIDEAS1 paper
- NationalCOCOON1 paper
- AFC1 paper
- BSIROCCO1 paper
- CATMOS1 paper
- NationalSGAI1 paper
- BNetworking1 paper
- A*INFOCOM1 paper
- BWG1 paper
- AESA1 paper
Papers
45 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | IWOCA | Beer Path Problems in Temporal Graphs. | Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos, Anna Mpanti, Aris Pagourtzis, Christos Pergaminelis |
| 2026 | IWOCA | Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes. | Dimitris Fotakis, Laurent Gourvs, Aris Pagourtzis, Panagiotis Patsilinakos |
| 2026 | SODA | Finite Pinwheel Scheduling: the k-Visits Problem. | Sotiris Kanellopoulos, Christos Pergaminelis, Maria Kokkou, Euripides Markou, Aris Pagourtzis |
| 2025 | ACNS | AQQUA: Augmenting Quisquis with Auditability. | George Papadoulis, Danai Balla, Panagiotis Grontas, Aris Pagourtzis |
| 2025 | ISAAC | Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio. | Sotiris Kanellopoulos, Giorgos Mitropoulos, Antonis Antonopoulos, Nikos Leonardos, Aris Pagourtzis, Christos Pergaminelis, Stavros Petsalakis, Kanellos Tsitouras |
| 2024 | ICML | The Computational Complexity of Finding Second-Order Stationary Points. | Andreas Kontogiannis, Vasilis Pollatos, Sotiris Kanellopoulos, Panayotis Mertikopoulos, Aris Pagourtzis, Ioannis Panageas |
| 2024 | SOFSEM | Removable Online Knapsack with Bounded Size Items. | Laurent Gourvs, Aris Pagourtzis |
| 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 |
| 2023 | Algosensors | Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle. | Pourandokht Behrouz, Orestis Konstantinidis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou, Marianna Spyrakou |
| 2022 | IWOCA | Approximating Subset Sum Ratio via Subset Sum Computations. | Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis |
| 2021 | Algosensors | Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation. | Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou |
| 2021 | FAW | Faster Algorithms for k-Subset Sum and Variations. | Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis |
| 2021 | ICISC | Designated-Verifier Linkable Ring Signatures. | Pourandokht Behrouz, Panagiotis Grontas, Vangelis Konstantakatos, Aris Pagourtzis, Marianna Spyrakou |
| 2020 | ECAI | Object Allocation and Positive Graph Externalities. | Dimitris Fotakis, Laurent Gourvs, Stelios Kasouridis, Aris Pagourtzis |
| 2020 | FAW | Approximation Schemes for Subset Sum Ratio Problems. | Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis |
| 2020 | TAMC | Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\). | Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis |
| 2020 | TAMC | Approximate #Knapsack Computations to Count Semi-fair Allocations. | Theofilos Triommatis, Aris Pagourtzis |
| 2019 | Algosensors | Optimal Circle Search Despite the Presence of Faulty Robots. | Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou |
| 2019 | IDEAS | Weight assignment on edges towards improved community detection. | Dora Souliou, Petros Potikas, Katerina Potika, Aris Pagourtzis |
| 2019 | IWOCA | Extension and Its Price for the Connected Vertex Cover Problem. | Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jrme Monnot, Aris Pagourtzis |
| 2018 | COCOON | A Faster FPTAS for the Subset-Sums Ratio Problem. | Nikolaos Melissinos, Aris Pagourtzis |
| 2018 | FC | Towards Everlasting Privacy and Efficient Coercion Resistance in Remote Electronic Voting. | Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang |
| 2018 | MFCS | Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. | Aris Pagourtzis, Tomasz Radzik |
| 2017 | CIAC | Stathis Zachos at 70! | Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Frer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika |
| 2017 | CIAC | Completeness Results for Counting Problems with Easy Decision. | Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos |
| 2017 | FCT | Reliable Communication via Semilattice Properties of Partial Knowledge. | Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas |
| 2017 | SOFSEM | Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. | Evangelos Kranakis, Danny Krizanc, Euripides Markou, Aris Pagourtzis, Felipe Ramrez |
| 2016 | PODC | Brief Announcement: Reliable Message Transmission under Partial Knowledge and General Adversaries. | Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas |
| 2014 | SIROCCO | Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host. | Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia |
| 2013 | CIAC | Selfish Resource Allocation in Optical Networks. | Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis |
| 2013 | FCT | The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. | Laurent Gourvs, Jrme Monnot, Aris Pagourtzis |
| 2010 | PODC | Brief announcement: k-shot distributed broadcasting in radio networks. | Paraschos Koutris, Aris Pagourtzis |
| 2009 | TAMC | On the Connection between Interval Size Functions and Path Counting. | Evangelos Bampas, Andreas-Nikolas Gbel, Aris Pagourtzis, Aris Tentes |
| 2008 | ISAAC | On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks. | Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika |
| 2007 | MFCS | Randomized and Approximation Algorithms for Blue-Red Matching. | Christos Nomikos, Aris Pagourtzis, Stathis Zachos |
| 2006 | ATMOS | Periodic Metro Scheduling. | Evangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis |
| 2006 | MFCS | The Complexity of Counting Functions with Easy Decision Version. | Aris Pagourtzis, Stathis Zachos |
| 2005 | SGAI | Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees. | Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou |
| 2004 | Networking | Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. | Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos |
| 2003 | FCT | Composing Equipotent Teams. | Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis |
| 2003 | INFOCOM | Minimizing Request Blocking in All-Optical Rings. | Christos Nomikos, Aris Pagourtzis, Stathis Zachos |
| 2003 | ISAAC | Flexible Train Rostering. | Stephan J. Eidenbenz, Aris Pagourtzis, Peter Widmayer |
| 2003 | WG | Resource Allocation Problems in Multifiber WDM Tree Networks. | Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos |
| 2002 | ESA | Deterministic Communication in Radio Networks with Large Labels. | Leszek Gasieniec, Aris Pagourtzis, Igor Potapov |
| 2001 | ISAAC | On the Complexity of Train Assignment Problems. | Thomas Erlebach, Martin Gantenbein, Daniel Hrlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhfel, David Scot Taylor, Peter Widmayer |