Ioannis Caragiannis

Assistant Professor

Department of Computer Engineering & Informatics
Building B, Room B053
University of Patras, 26500 Rio, Greece

Voice: +30 2610 997 512
Fax: +30 2610 969007
Email: caragian at ceid dot upatras dot gr

Research Interests

Design and analysis of algorithms
Approximation and online algorithms
Algorithmic aspects of communication networks (optical, wireless, p2p, etc.)
Algorithmic game theory
Computational social choice

Preprints

I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, M. Kyropoulou, B. Lucier, R. Paes Leme, and E. Tardos. On the efficiency of equilibria in generalized second price auctions. arXiv:1201.6429, 2012.

Journal publications

V. Bilo, I. Caragiannis, A. Fanelli, and G. Monaco. Improved lower bounds on the price of stability of undirected network design games. Theory of Computing Systemsi, to appear.
I. Caragiannis, J. A. Covey, M. Feldman, C. M. Homan, C. Kaklamanis, N. Karanikolas, A. D. Procaccia, and J. S. Rosenschein. On the approximability of Dodgson and Young elections. Artificial Intelligence, to appear.
I. Caragiannis. Efficient coordination mechanisms for unrelated machine scheduling. Algorithmica, to appear.
I. Caragiannis, C. Kaklamanis, and M. Kyropoulou. Tight approximation bounds for combinatorial frugal coverage algorithms. Journal of Combinatorial Optimization, to appear.
S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Energy-efficient communication in multi-interface wireless networks. Theory of Computing Systems, to appear.
I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson's voting rule. ACM Transactions on Algorithms, to appear.
I. Caragiannis and G. Monaco. A 6/5-approximation algorithm for the maximum 3-cover problem. Journal of Combinatorial Optimization, to appear.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. The efficiency of fair division. Theory of Computing Systems, 50(4), pp. 589-610, 2012.
I. Caragiannis and A. D. Procaccia. Voting almost maximizes social welfare despite limited communication. Artificial Intelligence , 175(9-10), pp. 1655-1671, 2011.
I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. Algorithmica, 61(3), pp. 606-637, 2011.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Taxes for linear atomic congestion games. ACM Transactions on Algorithms, 7(1), art. 13, 2010.
I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, and H. Rivano. Fractional path coloring in bounded degree trees with applications. Algorithmica, 58(2), pp. 516-540, 2010.
I. Caragiannis. Wavelength management in WDM rings to maximize the number of connection. SIAM Journal on Discrete Mathematics, 23 (2), pp. 959-978, 2009.
S. Athanassopoulos, I. Caragiannis, and C. Kaklamanis. Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. Theory of Computing Systems, 45(3), pp. 555-576, 2009.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and E. Papaioannou. Scheduling to maximize participation. Theoretical Computer Science, 402 (2-3), pp. 142-155, 2008. (TGC '06 special issue)
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Competitive Algorithms and Lower Bounds for Online Randomized Call Control in Cellular Networks. Networks, 52(4), pp. 235-251, 2008.
I. Caragiannis, A.V. Fishkin, C. Kaklamanis, and E. Papaioannou. A tight bound for on-line coloring of disk graphs. Theoretical Computer Science, 384 (2-3), pp. 152-160, 2007. (SIROCCO '05 special issue)
I. Caragiannis, A.V. Fishkin, C. Kaklamanis, and E. Papaioannou. Randomized Online Algorithms and Lower Bounds for Computing Large Independent Sets in Disk Graphs. Discrete Applied Mathematics, 155 (2), pp. 119-136, 2006. (MFCS '04 special issue)
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Energy-Efficient Wireless Network Design. Theory of Computing Systems, Vol. 39(5), pp. 593-617, 2006.
I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. Discrete Applied Mathematics, Vol. 143(1-3), pp. 54-61, 2004.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. A Logarithmic Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph Problem. Information Processing Letters, Vol. 86(3), pp. 149-154, 2003.
V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano. Randomized Path Coloring on Binary Trees. Theoretical Computer Science, Vol. 289 (1), pp. 355-399, 2002.
I. Caragiannis, C. Kaklamanis, E. Papaioannou. Efficient On-line Frequency Allocation and Call Control in Cellular Networks Theory of Computing Systems, Vol. 35 (5), pp. 521-543, 2002.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. New Bounds on the Size of the Feedback Vertex Set on Meshes and Butterflies. Information Processing Letters, Vol. 83 (5), pp. 275-280, 2002.
I. Caragiannis, C. Kaklamanis, P. Persiano. Edge Coloring of Bipartite Graphs with Constraints. Theoretical Computer Science, Vol. 270 (1-2), pp. 361-399, 2002.
V. Auletta, I. Caragiannis, L. Gargano, C. Kaklamanis, P. Persiano. Sparse and Limited Wavelength Conversion in All-Optical Tree Networks. Theoretical Computer Science, Vol. 266 (1-2), pp. 887-934, 2001.
I. Caragiannis, C. Kaklamanis, P. Persiano. Wavelength Routing in All-Optical Tree Networks: A Survey. Computing and Informatics (formerly Computers and Artificial Intelligence),Vol. 20 (2), pp. 95-120, 2001.
I. Caragiannis, C. Kaklamanis, P. Persiano. Symmetric Communication in All-Optical Tree Networks. Parallel Processing Letters, Vol. 10 (4), pp. 305-313, 2000.

Book chapters

V. Bilo, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, and L. Moscardelli. Game-theoretic approaches to optimization problems in communication netwotks. Chapter in Graphs and Algorithms in Communication Networks, Springer, pp. 241-263, 2009.
A. Navarra, I. Caragiannis, M. Flammini, C. Kaklamanis, and R. Klasing. Energy consumption minimization in ad hoc wireless, and multi-interface networks. Chapter in Graphs and Algorithms in Communication Networks, Springer, pp. 335-355, 2009.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Minimum energy Communication in ad hoc wireless networks: A survey. Chapter in Handbook of Parallel Computing: Models, Algorithms, and Applications, Chapman & Hall/CRC Computer & Information Science Series, pp. 39:1-20, 2007.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Online call admission control in wireless cellular networks. Chapter in Handbook of Parallel Computing: Models, Algorithms, and Applications, Chapman & Hall/CRC Computer & Information Science Series, pp. 38:1-20, 2007.
I. Caragiannis, C. Kaklamanis, and P. Persiano. Approximation Algorithms for Path Coloring in Trees Chapter in Efficient Approximation and Online Algorithms, LNCS 3484, Springer, pp. 74-96, 2006.

Conference publications

J. Augustine, I. Caragiannis, A. Fanelli, and C. Kalaitzis. Enforcing efficient equilibria in network design games via subsidies. In Proceedings of the 24th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 12), 2012, to appear. Full version: arXiv:1104.4423v1
I. Caragiannis and C. Kalaitzis. Space lower bounds for low-stretch greedy embeddings. In Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 12), LNCS, Springer, 2012, to appear.
I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik. Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC 12), 2012, to appear.
C. Boutilier, I. Caragiannis, S. Haber, T. Lu, A. D. Procaccia, and O. Sheffet. Optimal social choice functions: a utilitarian view. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC 12), 2012, to appear.
I. Caragiannis, E. Elkind, M. Szegedy, and L. Yu. Mechanism design: from partial to probabilistic verification. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC 12), 2012, to appear.
I. Caragiannis, A. Filos-Ratsikas, and A. D. Procaccia. An improved 2-agent kidney exchange mechanism. In Proceedings of the 7th Workshop on Internet and Network Economics (WINE 11), LNCS, Springer, 2011, to appear.
I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik. Efficient computation of approximate pure Nash equilibria in congestion games. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 11), 2011, to appear. Full version: arXiv:1104.2690.
I. Caragiannis, J. K. Lai, and A. D. Procaccia. Towards more expressive cake-cutting. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 11), pp. 127-132, 2011.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. On the efficiency of equilibria in generalized second price auctions. In Proceedings of the 12th ACM Conference on Electronic Commerce (EC 11), pp. 81-90, 2011.
I. Caragiannis, C. Kaklamanis, and M. Kyropoulou. Tight approximation bounds for greedy frugal coverage algorithms. In Proceedings of the 5th International Frontiers of Algorithmics Workshop (FAW 11) and the 7th International Conference on Algorithmic Aspects of Information and Management (AAIM 11), LNCS 6681, Springer, pp. 185-195, 2011.
V. Bilo, I. Caragiannis, A. Fanelli, and G. Monaco. Improved lower bounds on the price of stability of undirected network design games. In Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT 10), LNCS 6386, Springer, pp. 90-101, 2010.
I. Caragiannis, D. Kalaitzis, and E. Markakis. Approximation algorithms and mechanism design for minimax approval voting. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI 10), pp. 737-742, 2010.
I. Caragiannis and A. D. Procaccia. Voting almost maximizes social welfare despite limited communication. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI 10), pp. 743-748, 2010.
I. Caragiannis, C. Kaklamanis, N. Karanikolas, and A. D. Procaccia. Socially desirable approximations for Dodgson's voting rule. In Proceedings of the 11th ACM Conference on Electronic Commerce (EC 10), pp. 253-262, 2010.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, M. Kyropoulou, and E. Papaioannou. The impact of altruism on the efficiency of atomic congestion games. In Proceedings of the 5th Symposium on Trustworthy Global Computing (TGC 10), LNCS 6094, Springer, pp. 172-188, 2010.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. The efficiency of fair division. In Proceedings of the 5th Workshop on Internet and Network Economics (WINE 09), LNCS 5929, Springer, pp. 475-482, 2009.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou. On low-envy truthful allocations. In Proceedings of the 1st International Conference on Algorithmic Decision Theory (ADT 09), LNCS 5783, Springer, pp. 111-119, 2009.
S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and M. Kyropoulou. An improved approximation bound for spanning star forest and color saving. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 09), LNCS 5734, Springer, pp. 90-101, 2009.
S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Energy-efficient communication in multi-interface wireless networks. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 09), LNCS 5734, Springer, pp. 102-111, 2009.
I. Caragiannis. Efficient coordination mechanisms for unrelated machine scheduling. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), pp. 815-824, 2009.
I. Caragiannis, J. A. Covey, M. Feldman, C. M. Homan, C. Kaklamanis, N. Karanikolas, A. D. Procaccia, and J. S. Rosenschein. On the approximability of Dodgson and Young elections. In Procedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), pp. 1058-1067, 2009.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Improving the efficiency of load balancing games through taxes. In Proceedings of the 4th International Workshop on Internet and Network Economics (WINE 08), LNCS 5385, Springer, pp. 374-385, 2008.
I. Caragiannis and G. Monaco. A 6/5-approximation algorithm for the maximum 3-cover problem. In Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 08), LNCS 5162, Springer, pp. 205-216, 2008.
I. Caragiannis, C. Kaklamanis, E. Kranakis, D. Krizanc, and A. Wiese. Communication in wireless networks with directional antennas. In Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 08), pp. 344-351, 2008.
I. Caragiannis. Better bounds for online load balancing on unrelated machines. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 08), pp. 972-981, 2008.
S. Athanassopoulos, I. Caragiannis, and C. Kaklamanis. Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. In Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT 07), LNCS 4639, Springer, pp. 52-63, 2007.
I. Caragiannis, M. Flammini, and L. Moscardelli. An exponential improvement to the MST heuristic for minimum energy broadcasting in ad hoc wireless networks. In Proceedings of the 34th International Colloquium on Automata, Languages, and Programming (ICALP 07), LNCS 4596, Springer, pp. 447-458, 2007.
I. Caragiannis. Wavelength management in WDM rings to maximize the number of connections. In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS 07), LNCS 4393, Springer, pp. 61-72, 2007.
I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and E. Papaioannou. Scheduling to maximize participation. In Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC 06), LNCS 4661, Springer, pp. 218-232, 2006.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Taxes for linear atomic congestion games. In Proceedings of the 14th Annual European Symposium on Algorithms (ESA 06), LNCS 4168, Springer, pp. 184-195, 2006.
I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. In Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP 06), LNCS 4051, Springer, Part I, pp. 311-322, 2006.
I. Caragiannis, C. Galdi, and C. Kaklamanis Network Load Games. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 809-818, 2005.
I. Caragiannis, C. Galdi, and C. Kaklamanis. Basic Computations in Wireless Networks. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 05), LNCS 3827, Springer, pp. 533-542, 2005.
V. Bilo, I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Geometric Clustering to Minimize the Sum of Cluster Sizes. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA 05), LNCS 3669, Springer, pp. 460-471, 2005.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks. In Proceedings of EUROPAR 2005 Parallel Processing, LNCS 3648, Springer, pp. 1089-1099, 2005.
I. Caragiannis, A.V. Fishkin, C. Kaklamanis, and E. Papaioannou. A Tight Bound for Online Coloring of Disk Graphs. In Proceedings of the 12th International Colloquium on Structural Information and Communication Complexity (SIROCCO '05), LNCS 3499, Springer, pp. 78-88, 2005.
I. Caragiannis, A. Fishkin, C. Kaklamanis, and E. Papaioannou. On-line Algorithms for Disk Graphs. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS '04), LNCS 3153, Springer, pp. 215-226, 2004.
S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. In Proceedings of the 3rd International Conference for Ad Hoc Networks and Wireless (ADHOC-NOW '04), LNCS 3158, Springer, pp. 183-196, 2004.
I. Caragiannis and C. Kaklamanis. Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. In Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS '04), LNCS 2996, Springer, pp. 258-269, 2004.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Power Consumption Problems in Ad Hoc Wireless Networks. In Proceedings of the 1st Workshop on Approximation and On-line Algorithms (WAOA '03), LNCS 2909, Springer, pp. 252-255, 2003.
I. Caragiannis, C. Kaklamanis, P. Persiano, and A. Sidiropoulos. Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. In Proceedings of the 1st Workshop on Approximation and On-line Algorithms (WAOA '03), LNCS 2909, Springer, pp. 81-94, 2003.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Simple On-line Algorithms for Call Control in Cellular Networks. In Proceedings of the 1st Workshop on Approximation and On-line Algorithms (WAOA '03), LNCS 2909, Springer, pp. 67-80, 2003.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Energy-Efficient Wireless Network Design. In Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC '03), LNCS 2906, Springer, pp. 585-594, 2003.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. New Results for Energy-Efficient Broadcasting in Wireless Networks. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC '02), LNCS 2518, Springer, pp. 332-343, 2002.
I. Caragiannis, C. Kaklamanis, and E. Papaioannou. Randomized Call Control in Sparse Wireless Cellular Networks. In Proceedings of the 8th International Conference on Advances in Communications and Control (COMCON 01), pp. 73-82, 2001.
I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, and H. Rivano. Fractional Path Coloring with Applications to WDM Networks. In Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP 01), LNCS 2076, Springer, pp. 732-743, 2001.
I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. In Proceedings of the 27th International Workshop on Graph-Theoretic Concepts of Computer Science (WG 01), LNCS 2204, Springer, pp. 21-31, 2001.
I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. New Bounds on the Size of the Feedback Vertex Set on Meshes and Butterflies. In Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 01), pp. 77-88, 2001.
I. Caragiannis, C. Kaklamanis, E. Papaioannou. Competitive Analysis of On-line Randomized Call Control in Cellular Networks. In Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS 01), IEEE Computer Society Press, 2001.
I. Caragiannis, C. Kaklamanis, I. Vergados. Greedy Dynamic Hot-Potato Routing on Arrays. In Proceedings of 2000 International Symposium on Parallel Algorithms and Networks (I-SPAN 00), IEEE Computer Society Press, pp. 178-185, 2000.
V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano. Randomized Path Coloring on Binary Trees. In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 00), LNCS 1913, Springer, pp. 60-71, 2000.
C. Bartzis, I. Caragiannis, C. Kaklamanis, I. Vergados. Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays. In Proceedings of EUROPAR 2000 Parallel Processing, LNCS 1900, Springer, pp. 877-881, 2000.
I. Caragiannis, C. Kaklamanis, E. Papaioannou. Efficient On-line Communication in Cellular Networks. In Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 00), pp. 46-53, 2000.
I. Caragiannis, C. Kaklamanis, E. Papaioannou. On-line Call Control in Cellular Networks. Foundations of Mobile Computing (satellite workshop of FST&TCS 99), 1999.
A. Bouganis, I. Caragiannis, C. Kaklamanis. Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. In Proceedings of the 3rd Workshop on Algorithmic Engineering (WAE 99), LNCS 1668, Springer, pp. 259-271, 1999.
I. Caragiannis, C. Kaklamanis, P. Persiano. Edge Coloring of Bipartite Graphs with Constraints. In Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS 99), LNCS 1672, Springer, pp. 376-386, 1999.
V. Auletta, I. Caragiannis, C, Kaklamanis, P. Persiano. On the Complexity of Wavelength Converters. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS 98), LNCS 1450, Springer, pp. 771-779, 1998.
I. Caragiannis, C. Kaklamanis, P. Persiano. Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. In Proceedings of the 5th International Colloquium on Structural Information and Communication Complexity (SIROCCO 98), pp. 10-19, 1998.
V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano. Efficient Wavelength Routing in Trees with Low-Degree Converters. Multichannel Optical Networks: Theory and Practice, DIMACS Series in Discrete Mathematics and Computer Science, AMS, Vol. 46, pp. 1-14, 1998.
I. Caragiannis, A. Katsoulis, P. Spirakis, B. Tampakas. Indexing and Retrieval in Large Dynamic Document Collections. In Proceedings of the 6th Hellenic Conference on Informatics, pp. 653-666, 1997.
V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano. Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. In Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO 97), pp. 24-39, 1997.
V. Gerogiannis, I. Caragiannis, M. Tsoukarellas. A General Framework for Applying Safety Analysis to Safety Critical Real-Time Applications Using Fault Trees. In Proceedings of the 9th EUROMICRO Workshop on Real Time Systems, IEEE Computer Society Press, pp. 153-160, 1997.
I. Caragiannis, C. Kaklamanis, P. Persiano. Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies. 2nd Workshop on Optics and Computer Science, part of IPPS 97, 1997.