Aris Pagourtzis

126 papers A* 5A 4B 16C 16Misc 4Journal 57Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Finite Pinwheel Scheduling: the k-Visits Problem. SODA Sotiris Kanellopoulos, Christos Pergaminelis, Maria Kokkou, Euripides Markou, Aris Pagourtzis
2025	—	`conf`	AQQUA: Augmenting Quisquis with Auditability. ACNS (2) George Papadoulis, Danai Balla, Panagiotis Grontas, Aris Pagourtzis
2025	J	`jnl`	Approximation Schemes for k-Subset Sum Ratio and Multiway Number Partitioning Ratio. CoRR Sotiris Kanellopoulos, Giorgos Mitropoulos, Antonis Antonopoulos, Nikos Leonardos, Aris Pagourtzis, Christos Pergaminelis, Stavros Petsalakis, Kanellos Tsitouras
2025	B	`conf`	Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio. ISAAC Sotiris Kanellopoulos, Giorgos Mitropoulos, Antonis Antonopoulos, Nikos Leonardos, Aris Pagourtzis, Christos Pergaminelis, Stavros Petsalakis, Kanellos Tsitouras
2025	J	`jnl`	Beer Path Problems in Temporal Graphs. CoRR Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos, Anna Mpanti, Aris Pagourtzis, Christos Pergaminelis
2025	J	`jnl`	Byzantine fault-tolerant protocols for (n,f)-evacuation from a circle. Theor. Comput. Sci. Pourandokht Behrouz, Orestis Konstantinidis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou, Marianna Spyrakou
2025	J	`jnl`	Finite Pinwheel Scheduling: the k-Visits Problem. CoRR Sotiris Kanellopoulos, Christos Pergaminelis, Maria Kokkou, Euripides Markou, Aris Pagourtzis
2025	J	`jnl`	Overlapping community detection using graph attention networks. Future Gener. Comput. Syst. Konstantinos Sismanis, Petros Potikas, Dora Souliou, Aris Pagourtzis
2025	A	`conf`	Satisfactory Budget Division. AAMAS Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis
2025	J	`jnl`	Satisfactory Budget Division. CoRR Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis
2025	J	`jnl`	Voting with coercion resistance and everlasting privacy using linkable ring signatures. IACR Cryptol. ePrint Arch. Panagiotis Grontas, Aris Pagourtzis, Marianna Spyrakou
2024	J	`jnl`	AQQUA: Augmenting Quisquis with Auditability. IACR Cryptol. ePrint Arch. George Papadoulis, Danai Balla, Panagiotis Grontas, Aris Pagourtzis
2024	J	`jnl`	Approximating subset sum ratio via partition computations. Acta Informatica Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
2024	C	`conf`	On the Power of Counting the Total Number of Computation Paths of NPTMs. TAMC Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
2024	B	`conf`	Removable Online Knapsack with Bounded Size Items. SOFSEM Laurent Gourvès, Aris Pagourtzis
2024	A*	`conf`	The Computational Complexity of Finding Second-Order Stationary Points. ICML Andreas Kontogiannis, Vasilis Pollatos, Sotiris Kanellopoulos, Panayotis Mertikopoulos, Aris Pagourtzis, Ioannis Panageas
2023	J	`jnl`	Anonymity and everlasting privacy in electronic voting. Int. J. Inf. Sec. Panagiotis Grontas, Aris Pagourtzis
2023	—	`conf`	Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle. ALGOWIN Pourandokht Behrouz, Orestis Konstantinidis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou, Marianna Spyrakou
2023	J	`jnl`	Byzantine fault tolerant symmetric-persistent circle evacuation. Theor. Comput. Sci. Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
2023	J	`jnl`	Faster algorithms for k-subset sum and variations. J. Comb. Optim. Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
2023	J	`jnl`	On the Approximability of External-Influence-Driven Problems. CoRR Panagiotis Aivasiliotis, Aris Pagourtzis
2023	J	`jnl`	On the power of counting the total number of computation paths of NPTMs. CoRR Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
2023	J	`jnl`	Optimal circle search despite the presence of faulty robots. Inf. Process. Lett. Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
2022	—	`conf`	A parallel community detection algorithm based on spanning trees. BigDataService Petros Potikas, Dora Souliou, Aris Pagourtzis, Katerina Potika
2022	C	`conf`	Approximating Subset Sum Ratio via Subset Sum Computations. IWOCA Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
2022	J	`jnl`	Approximating Subset Sum Ratio via Subset Sum Computations. CoRR Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
2022	J	`jnl`	Approximation schemes for subset-sums ratio problems. Theor. Comput. Sci. Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
2022	J	`jnl`	Completeness, approximability and exponential time results for counting problems with easy decision version. Theor. Comput. Sci. Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
2022	—	`conf`	Designated-Verifier Linkable Ring Signatures with Unconditional Anonymity. CAI Danai Balla, Pourandokht Behrouz, Panagiotis Grontas, Aris Pagourtzis, Marianna Spyrakou, Giannis Vrettos
2022	J	`jnl`	Designated-Verifier Linkable Ring Signatures with unconditional anonymity. IACR Cryptol. ePrint Arch. Danai Balla, Pourandokht Behrouz, Panagiotis Grontas, Aris Pagourtzis, Marianna Spyrakou, Giannis Vrettos
2022	J	`jnl`	Designated-Verifier Linkable Ring Signatures. IACR Cryptol. ePrint Arch. Pourandokht Behrouz, Panagiotis Grontas, Vangelis Konstantakatos, Aris Pagourtzis, Marianna Spyrakou
2022	J	`jnl`	Extension and its price for the connected vertex cover problem. Theor. Comput. Sci. Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2022	J	`jnl`	Guest column: A panorama of counting problems the decision version of which is in P SIGACT News Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos
2021	C	`conf`	Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation. ALGOSENSORS Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
2021	Misc	`conf`	Designated-Verifier Linkable Ring Signatures. ICISC Pourandokht Behrouz, Panagiotis Grontas, Vangelis Konstantakatos, Aris Pagourtzis, Marianna Spyrakou
2021	—	`conf`	Faster Algorithms for k-Subset Sum and Variations. IJTCS-FAW Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
2021	J	`jnl`	Faster Algorithms for k-Subset Sum and Variations. CoRR Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
2021	B	`ed.`	Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings FCT Evripidis Bampis, Aris Pagourtzis
2021	J	`jnl`	Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree. Discret. Math. Algorithms Appl. Parikshit Saikia, Sushanta Karmakar, Aris Pagourtzis
2021	J	`jnl`	Publicly auditable conditional blind signatures. J. Comput. Secur. Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang
2020	C	`conf`	Approximate #Knapsack Computations to Count Semi-fair Allocations. TAMC Theofilos Triommatis, Aris Pagourtzis
2020	Misc	`conf`	Approximation Schemes for Subset Sum Ratio Problems. FAW Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
2020	J	`jnl`	Approximation Schemes for Subset Sum Ratio Problems. CoRR Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
2020	C	`conf`	Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\). TAMC Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
2020	J	`jnl`	Characterizations and approximability of hard counting classes below #P. CoRR Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
2020	A	`conf`	Object Allocation and Positive Graph Externalities. ECAI Dimitris Fotakis, Laurent Gourvès, Stelios Kasouridis, Aris Pagourtzis
2020	—	`conf`	On the Complexity of the Upper r-Tolerant Edge Cover Problem. TTCS Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2020	—	`conf`	Overlapping Community Detection via Minimum Spanning Tree Computations. BigDataService Aris Pagourtzis, Dora Souliou, Petros Potikas, Katerina Potika
2019	J	`jnl`	Approximate #Knapsack Computations to Count Semi-Fair Allocations. CoRR Theofilos Triommatis, Aris Pagourtzis
2019	C	`conf`	Extension and Its Price for the Connected Vertex Cover Problem. IWOCA Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2019	J	`jnl`	Novel strategies for path stability estimation under topology change using Hello messaging in MANETs. Ad Hoc Networks Alamgir Naushad, Ghulam Abbas, Ziaul Haq Abbas, Aris Pagourtzis
2019	C	`conf`	Optimal Circle Search Despite the Presence of Faulty Robots. ALGOSENSORS Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
2019	J	`jnl`	Parameterized Fine-Grained Reductions. CoRR Elli Anastasiadi, Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis
2019	J	`jnl`	Preface to Special Issue on Algorithms and Complexity. Theor. Comput. Sci. Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos
2019	J	`jnl`	Security models for everlasting privacy. IACR Cryptol. ePrint Arch. Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis
2019	C	`conf`	Weight assignment on edges towards improved community detection. IDEAS Dora Souliou, Petros Potikas, Katerina Potika, Aris Pagourtzis
2018	Misc	`conf`	A Faster FPTAS for the Subset-Sums Ratio Problem. COCOON Nikolaos Melissinos, Aris Pagourtzis
2018	J	`jnl`	A Faster FPTAS for the Subset-Sums Ratio Problem. CoRR Nikolaos Melissinos, Aris Pagourtzis
2018	—	`conf`	Community Detection via Neighborhood Overlap and Spanning Tree Computations. ALGOCLOUD Ketki Kulkarni, Aris Pagourtzis, Katerina Potika, Petros Potikas, Dora Souliou
2018	J	`jnl`	Minimum multiplicity edge coloring via orientation. Discret. Appl. Math. Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika
2018	J	`jnl`	Path multicoloring in spider graphs with even color multiplicity. Inf. Process. Lett. Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika
2018	B	`conf`	Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. MFCS Aris Pagourtzis, Tomasz Radzik
2018	—	`conf`	Towards Everlasting Privacy and Efficient Coercion Resistance in Remote Electronic Voting. Financial Cryptography Workshops Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang
2018	J	`jnl`	Towards everlasting privacy and efficient coercion resistance in remote electronic voting. IACR Cryptol. ePrint Arch. Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, Bingsheng Zhang
2017	C	`ed.`	Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings CIAC Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos
2017	—	`conf`	Coercion Resistance in a Practical Secret Voting Scheme for Large Scale Elections. ISPAN-FCST-ISCC Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis
2017	C	`conf`	Completeness Results for Counting Problems with Easy Decision. CIAC Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
2017	J	`jnl`	Conditional Blind Signatures. IACR Cryptol. ePrint Arch. Alexandros Zacharakis, Panagiotis Grontas, Aris Pagourtzis
2017	B	`conf`	Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. SOFSEM Evangelos Kranakis, Danny Krizanc, Euripides Markou, Aris Pagourtzis, Felipe Ramírez
2017	J	`jnl`	Energy-efficient broadcasting in ad hoc wireless networks. J. Discrete Algorithms Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis, Dimitris Sakavalas
2017	J	`jnl`	Joining Local Knowledge to Communicate Reliably (Extended Abstract). CoRR Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2017	J	`jnl`	On the connection between interval size functions and path counting. Comput. Complex. Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes
2017	B	`conf`	Reliable Communication via Semilattice Properties of Partial Knowledge. FCT Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2017	J	`jnl`	Reliable broadcast with respect to topology knowledge. Distributed Comput. Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2017	C	`conf`	Stathis Zachos at 70! CIAC 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
2016	A*	`conf`	Brief Announcement: Reliable Message Transmission under Partial Knowledge and General Adversaries. PODC Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2016	J	`jnl`	k-shot Broadcasting in Ad Hoc Radio Networks. CoRR Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis, Dimitris Sakavalas
2015	J	`jnl`	Improved periodic data retrieval in asynchronous rings with a faulty host. Theor. Comput. Sci. Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia
2015	J	`jnl`	Reliable Message Transmission under Partial Knowledge. IACR Cryptol. ePrint Arch. Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2015	—	`conf`	Scheduling Connections via Path and Edge Multicoloring. ADHOC-NOW Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika
2014	B	`conf`	Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host. SIROCCO Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia
2014	J	`jnl`	Optimal Resilience Broadcast against Locally Bounded and General Adversaries. IACR Cryptol. ePrint Arch. Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2014	A	`conf`	Reliable Broadcast with Respect to Topology Knowledge. DISC Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2014	—	`conf`	The Lazy Matroid Problem. IFIP TCS Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
2013	—	`conf`	A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm. ADHOC-NOW Chris Litsas, Aris Pagourtzis, Dimitris Sakavalas
2013	J	`jnl`	On the Resilience and Uniqueness of CPA for Secure Broadcast. IACR Cryptol. ePrint Arch. Chris Litsas, Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2013	C	`conf`	Selfish Resource Allocation in Optical Networks. CIAC Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis
2013	B	`conf`	The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. FCT Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
2012	J	`jnl`	On a Noncooperative Model for Wavelength Assignment in Multifiber Optical Networks. IEEE/ACM Trans. Netw. Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika
2011	J	`jnl`	An experimental study of maximum profit wavelength assignment in WDM rings. Networks Evangelos Bampas, Aris Pagourtzis, Katerina Potika
2011	—	`conf`	Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. CATS Paraschos Koutris, Aris Pagourtzis
2010	A*	`conf`	Brief announcement: k-shot distributed broadcasting in radio networks. PODC Paraschos Koutris, Aris Pagourtzis
2009	C	`conf`	Colored Resource Allocation Games. CTW Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasileios Syrgkanis
2009	J	`jnl`	Improved methods for extracting frequent itemsets from interim-support trees. Softw. Pract. Exp. Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou
2009	C	`conf`	On the Connection between Interval Size Functions and Path Counting. TAMC Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes
2008	C	`conf`	Maximum Profit Wavelength Assignment in WDM Rings. CTW Evangelos Bampas, Aris Pagourtzis, Katerina Potika
2008	B	`conf`	On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks. ISAAC Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika
2008	J	`jnl`	On the Complexity of Variations of Equal Sum Subsets. Nord. J. Comput. Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis, Konrad Schlude
2007	Misc	`conf`	A fast parallel algorithm for frequent itemsets mining. AIAI Dora Souliou, Aris Pagourtzis, Panayotis Tsanakas
2007	J	`jnl`	Deterministic Communication in Radio Networks with Large Labels. Algorithmica Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik
2007	J	`jnl`	Path multicoloring with fewer colors in spiders and caterpillars. Computing Aris Pagourtzis, Katerina Potika, Stathis Zachos
2007	B	`conf`	Randomized and Approximation Algorithms for Blue-Red Matching. MFCS Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2007	—	`conf`	Selfish Routing and Path Coloring in All-Optical Networks. CAAN Ioannis Milis, Aris Pagourtzis, Katerina Potika
2006	J	`jnl`	Computing frequent itemsets in parallel using partial support trees. J. Syst. Softw. Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos, Panayotis Tsanakas
2006	—	`conf`	Distributed Routing in Tree Networks with Few Landmarks. CAAN Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis
2006	C	`conf`	Periodic Metro Scheduling. ATMOS Evangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis
2006	J	`jnl`	Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Comput. Networks Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
2006	B	`conf`	The Complexity of Counting Functions with Easy Decision Version. MFCS Aris Pagourtzis, Stathis Zachos
2005	—	`conf`	Computing Frequent Itemsets in Parallel Using Partial Support Trees. PVM/MPI Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos
2005	—	`conf`	Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees. SGAI Conf. Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou
2005	—	`conf`	Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. Panhellenic Conference on Informatics Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2004	B	`conf`	Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
2003	J	`jnl`	Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter
2003	B	`conf`	Composing Equipotent Teams. FCT Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis
2003	B	`conf`	Flexible Train Rostering. ISAAC Stephan J. Eidenbenz, Aris Pagourtzis, Peter Widmayer
2003	A*	`conf`	Minimizing Request Blocking in All-Optical Rings. INFOCOM Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2003	B	`conf`	Resource Allocation Problems in Multifiber WDM Tree Networks. WG Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos
2003	J	`jnl`	Satisfying a maximum number of pre-routed requests in all-optical rings. Comput. Networks Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2002	A	`conf`	Deterministic Communication in Radio Networks with Large Labels. ESA Leszek Gasieniec, Aris Pagourtzis, Igor Potapov
2002	—	`conf`	Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI Aris Pagourtzis, Igor Potapov, Wojciech Rytter
2002	—	`conf`	Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
2001	—	`conf`	Acceptor-Definable Counting Classes. Panhellenic Conference on Informatics Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos
2001	—	`conf`	Oblivious gossiping in ad-hoc radio networks. DIAL-M Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis
2001	B	`conf`	On the Complexity of Train Assignment Problems. ISAAC Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
2001	—	`conf`	PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI Aris Pagourtzis, Igor Potapov, Wojciech Rytter
2001	J	`jnl`	Routing and path multicoloring. Inf. Process. Lett. Christos Nomikos, Aris Pagourtzis, Stathis Zachos