Aris Pagourtzis

Dora Souliou

Petros Potikas

Proceedings of the 6th IEEE International Conference on Big Data Computing Service and Applications, 2020

2019

Preface to Special Issue on Algorithms and Complexity.

[BibT_eX]

[DOI]

Dimitris Fotakis

Vangelis Th. Paschos

Theor. Comput. Sci., 2019

Security models for everlasting privacy.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Parameterized Fine-Grained Reductions.

[BibT_eX]

[DOI]

CoRR, 2019

Novel strategies for path stability estimation under topology change using Hello messaging in MANETs.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2019

Weight assignment on edges towards improved community detection.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Database Applications & Engineering Symposium, 2019

2018

Path multicoloring in spider graphs with even color multiplicity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Towards everlasting privacy and efficient coercion resistance in remote electronic voting.

[BibT_eX]

[DOI]

Bingsheng Zhang

IACR Cryptol. ePrint Arch., 2018

Minimum multiplicity edge coloring via orientation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks.

[BibT_eX]

[DOI]

Tomasz Radzik

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Faster FPTAS for the Subset-Sums Ratio Problem.

[BibT_eX]

[DOI]

Nikolaos Melissinos

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Community Detection via Neighborhood Overlap and Spanning Tree Computations.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018

2017

Energy-efficient broadcasting in ad hoc wireless networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2017

Conditional Blind Signatures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Reliable broadcast with respect to topology knowledge.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Joining Local Knowledge to Communicate Reliably (Extended Abstract).

[BibT_eX]

[DOI]

CoRR, 2017

On the connection between interval size functions and path counting.

[BibT_eX]

[DOI]

Evangelos Bampas

Andreas-Nikolas Göbel

Aris Tentes

Comput. Complex., 2017

Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Coercion Resistance in a Practical Secret Voting Scheme for Large Scale Elections.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Pervasive Systems, 2017

Reliable Communication via Semilattice Properties of Partial Knowledge.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Completeness Results for Counting Problems with Easy Decision.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Stathis Zachos at 70!

[BibT_eX]

[DOI]

Nikolaos S. Papaspyrou

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

k-shot Broadcasting in Ad Hoc Radio Networks.

[BibT_eX]

[DOI]

CoRR, 2016

Brief Announcement: Reliable Message Transmission under Partial Knowledge and General Adversaries.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

Improved periodic data retrieval in asynchronous rings with a faulty host.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Reliable Message Transmission under Partial Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Scheduling Connections via Path and Edge Multicoloring.

[BibT_eX]

[DOI]

Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

2014

Optimal Resilience Broadcast against Locally Bounded and General Adversaries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

The Lazy Matroid Problem.

[BibT_eX]

[DOI]

Laurent Gourvès

Jérôme Monnot

Proceedings of the Theoretical Computer Science, 2014

2013

On the Resilience and Uniqueness of CPA for Secure Broadcast.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.

[BibT_eX]

[DOI]

Laurent Gourvès

Jérôme Monnot

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Selfish Resource Allocation in Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm.

[BibT_eX]

[DOI]

Chris Litsas

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.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2012

2011

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

[BibT_eX]

[DOI]

Evangelos Bampas

Networks, 2011

Oblivious k-shot Broadcasting in Ad Hoc Radio Networks.

[BibT_eX]

[DOI]

Paraschos Koutris

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

Brief announcement: k-shot distributed broadcasting in radio networks.

[BibT_eX]

[DOI]

Paraschos Koutris

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Improved methods for extracting frequent itemsets from interim-support trees.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2009

Colored Resource Allocation Games.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

On the Complexity of Variations of Equal Sum Subsets.

[BibT_eX]

Nord. J. Comput., 2008

On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Maximum Profit Wavelength Assignment in WDM Rings.

[BibT_eX]

Evangelos Bampas

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

Path multicoloring with fewer colors in spiders and caterpillars.

[BibT_eX]

[DOI]

Computing, 2007

Deterministic Communication in Radio Networks with Large Labels.

[BibT_eX]

[DOI]

Algorithmica, 2007

Randomized and Approximation Algorithms for Blue-Red Matching.

[BibT_eX]

[DOI]

Christos Nomikos

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

A fast parallel algorithm for frequent itemsets mining.

[BibT_eX]

[DOI]

Dora Souliou

Panayotis Tsanakas

Proceedings of the Artificial Intelligence and Innovations 2007: from Theory to Applications, 2007

Selfish Routing and Path Coloring in All-Optical Networks.

[BibT_eX]

[DOI]

Ioannis Milis

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

Computing frequent itemsets in parallel using partial support trees.

[BibT_eX]

[DOI]

J. Syst. Softw., 2006

Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost.

[BibT_eX]

[DOI]

Comput. Networks, 2006

The Complexity of Counting Functions with Easy Decision Version.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Distributed Routing in Tree Networks with Few Landmarks.

[BibT_eX]

[DOI]

Ioannis Z. Emiris

Euripides Markou

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

Periodic Metro Scheduling.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2006, 2006

2005

Computing Frequent Itemsets in Parallel Using Partial Support Trees.

[BibT_eX]

[DOI]

Dora Souliou

Nikolaos Drosinos

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Informatics, 2005

2004

Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks.

[BibT_eX]

[DOI]

Proceedings of the NETWORKING 2004, 2004

2003

Satisfying a maximum number of pre-routed requests in all-optical rings.

[BibT_eX]

[DOI]

Christos Nomikos

Comput. Networks, 2003

Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique.

[BibT_eX]

[DOI]

Comput. J., 2003

Resource Allocation Problems in Multifiber WDM Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Flexible Train Rostering.

[BibT_eX]

[DOI]

Stephan J. Eidenbenz

Peter Widmayer

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Minimizing Request Blocking in All-Optical Rings.

[BibT_eX]

[DOI]

Christos Nomikos

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.

[BibT_eX]

[DOI]

Mark Cieliebak

Stephan J. Eidenbenz

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Observations on Parallel Computation of Transitive and Max-Closure Problems.

[BibT_eX]

[DOI]