Aris Pagourtzis

According to our database1, Aris Pagourtzis authored at least 63 papers between 2001 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Preface to Special Issue on Algorithms and Complexity.
Theor. Comput. Sci., 2019

Novel strategies for path stability estimation under topology change using Hello messaging in MANETs.
Ad Hoc Networks, 2019

2018
Path multicoloring in spider graphs with even color multiplicity.
Inf. Process. Lett., 2018

Minimum multiplicity edge coloring via orientation.
Discrete Applied Mathematics, 2018

Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Towards Everlasting Privacy and Efficient Coercion Resistance in Remote Electronic Voting.
Proceedings of the Financial Cryptography and Data Security, 2018

A Faster FPTAS for the Subset-Sums Ratio Problem.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Community Detection via Neighborhood Overlap and Spanning Tree Computations.
Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018

2017
Energy-efficient broadcasting in ad hoc wireless networks.
J. Discrete Algorithms, 2017

Conditional Blind Signatures.
IACR Cryptology ePrint Archive, 2017

Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Coercion Resistance in a Practical Secret Voting Scheme for Large Scale Elections.
Proceedings of the 14th International Symposium on Pervasive Systems, 2017

Reliable Communication via Semilattice Properties of Partial Knowledge.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Completeness Results for Counting Problems with Easy Decision.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Stathis Zachos at 70!
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Brief Announcement: Reliable Message Transmission under Partial Knowledge and General Adversaries.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
Reliable Message Transmission under Partial Knowledge.
IACR Cryptology ePrint Archive, 2015

Scheduling Connections via Path and Edge Multicoloring.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

2014
Optimal Resilience Broadcast against Locally Bounded and General Adversaries.
IACR Cryptology ePrint Archive, 2014

Reliable Broadcast with Respect to Topology Knowledge.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host.
Proceedings of the Structural Information and Communication Complexity, 2014

The Lazy Matroid Problem.
Proceedings of the Theoretical Computer Science, 2014

2013
On the Resilience and Uniqueness of CPA for Secure Broadcast.
IACR Cryptology ePrint Archive, 2013

The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Selfish Resource Allocation in Optical Networks.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm.
Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012
On a Noncooperative Model for Wavelength Assignment in Multifiber Optical Networks.
IEEE/ACM Trans. Netw., 2012

2011
An experimental study of maximum profit wavelength assignment in WDM rings.
Networks, 2011

Oblivious k-shot Broadcasting in Ad Hoc Radio Networks.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010
Brief announcement: k-shot distributed broadcasting in radio networks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
On the Connection between Interval Size Functions and Path Counting.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Colored Resource Allocation Games.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
On the Complexity of Variations of Equal Sum Subsets.
Nord. J. Comput., 2008

On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Maximum Profit Wavelength Assignment in WDM Rings.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
Path multicoloring with fewer colors in spiders and caterpillars.
Computing, 2007

Deterministic Communication in Radio Networks with Large Labels.
Algorithmica, 2007

Randomized and Approximation Algorithms for Blue-Red Matching.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

A fast parallel algorithm for frequent itemsets mining.
Proceedings of the Artificial Intelligence and Innovations 2007: from Theory to Applications, 2007

Selfish Routing and Path Coloring in All-Optical Networks.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006
Computing frequent itemsets in parallel using partial support trees.
Journal of Systems and Software, 2006

Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost.
Computer Networks, 2006

The Complexity of Counting Functions with Easy Decision Version.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Distributed Routing in Tree Networks with Few Landmarks.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

Periodic Metro Scheduling.
Proceedings of the ATMOS 2006, 2006

2005
Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees.
Proceedings of the Research and Development in Intelligent Systems XXII, 2005

Computing Frequent Itemsets in Parallel Using Partial Support Trees.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2005

Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree.
Proceedings of the Advances in Informatics, 2005

2004
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks.
Proceedings of the NETWORKING 2004, 2004

2003
Satisfying a maximum number of pre-routed requests in all-optical rings.
Computer Networks, 2003

Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique.
Comput. J., 2003

Resource Allocation Problems in Multifiber WDM Tree Networks.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Flexible Train Rostering.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Minimizing Request Blocking in All-Optical Rings.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Composing Equipotent Teams.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
Observations on Parallel Computation of Transitive and Max-Closure Problems.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 9th European PVM/MPI Users' Group Meeting, Linz, Austria, September 29, 2002

Server Placements, Roman Domination and other Dominating Set Variants.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Deterministic Communication in Radio Networks with Large Labels.
Proceedings of the Algorithms, 2002

2001
Routing and path multicoloring.
Inf. Process. Lett., 2001

PVM Computation of the Transitive Closure: The Dependency Graph Approach.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2001

Acceptor-Definable Counting Classes.
Proceedings of the Advances in Informatics, 8th Panhellenic Conference on Informatics, 2001

On the Complexity of Train Assignment Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Oblivious gossiping in ad-hoc radio networks.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001


  Loading...