C. Kaklamanis

发表

Tight bounds for oblivious routing in the hypercube

Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas, 1990, SPAA '90.

Socially desirable approximations for Dodgson's voting rule

Ariel D. Procaccia, Ioannis Caragiannis, Christos Kaklamanis, 2010, EC '10.

ARRIVAL: Next Stop in CLS

D. Sannella, D. Marx, C. Kaklamanis, 2018 .

Bounds on the leakage of the input ’ s distribution in information-hiding protocols

F. Nielson, C. Kaklamanis, 2019 .

Fractional path coloring on bounded degree trees

Hervé Rivano, Afonso Ferreira, Stéphane Pérennes, 2001 .

A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability

D. Sannella, C. Kaklamanis, I. Chatzigiannakis, 2018 .

Revenue Guarantees in Generalized Second Price Auctions

M. Kyropoulou, I. Caragiannis, C. Kaklamanis, 2013 .

VNCS: a Volunteer online social Network for immediate citizen awareness and action in Critical Situations

C. Kaklamanis, M. Dimopoulou, E. Papaioannou, 2019 .

Euro-Par 2016: Parallel Processing Workshops - Euro-Par 2016 International Workshops, Grenoble, France, August 24-26, 2016, Revised Selected Papers

Loris Marchal, Stephen L. Scott, Christos Kaklamanis, 2017, Euro-Par Workshops.

OCTOPUS Online Collaborative TOll card sharing PUblic System

Christos Kaklamanis, Stavros Athanassopoulos, Evi Papaioannou, 2015 .

Online Call Admission Control in Wireless Cellular Networks

Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou, 2007, Handbook of Parallel Computing.

Trustworthy Global Computing, 4th International Symposium, TGC 2008, Barcelona, Spain, November 3-4, 2008, Revised Selected Papers

Flemming Nielson, Christos Kaklamanis, F. Nielson, 2009, TGC.

On the minimum corridor connection and other generalized geometric problems

Thomas Erlebach, Alexander Grigoriev, René Sitters, 2006 .

VSI: Edu*-2016 - Keeping up with technology: Teaching parallel, distributed and high-performance computing

Christos Kaklamanis, Sheikh Ghafoor, Ramachandran Vaidyanathan, 2018, J. Parallel Distributed Comput..

Socially desirable approximations for Dodgson's voting rule

Ariel D. Procaccia, Ioannis Caragiannis, Christos Kaklamanis, 2010, EC.

Online Call Admission Control in Wireless Cellular Networks

Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou, 2007, Handbook of Parallel Computing.

Minimum Energy Communication in Ad Hoc Wireless Networks

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2007, Handbook of Parallel Computing.

Minimum Energy Communication in Ad Hoc Wireless Networks

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2007, Handbook of Parallel Computing.

Evaluating approval-based multiwinner voting in terms of robustness to noise

Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, 2020, Autonomous Agents and Multi-Agent Systems.

Proceedings of the 48th International Conference on Parallel Processing

Paul G. Spirakis, Christos Kaklamanis, Theodore S. Papatheodorou, 2012, ICPP.

The Efficiency of Fair Division

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2009, Theory of Computing Systems.

On the efficiency of equilibria in generalized second price auctions

Renato Paes Leme, Éva Tardos, Ioannis Caragiannis, 2011, EC '11.

Cellular Automata: Simulations Using Matlab

Christos Kaklamanis, Stavros Athanassopoulos, Gerasimos Kalfoutzos, 2012 .

Experimental comparison of algorithms for interference control in ad-hoc wireless networks

Christos Kaklamanis, Stavros Athanassopoulos, Evi Papaioannou, 2010, Melecon 2010 - 2010 15th IEEE Mediterranean Electrotechnical Conference.

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks

Alfredo Navarra, Ioannis Caragiannis, Christos Kaklamanis, 2010, Graphs and Algorithms in Communication Networks.

Energy-Efficient Wireless Network Design

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2003, Theory of Computing Systems.

Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2004, ADHOC-NOW.

A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2003, Inf. Process. Lett..

New Results for Energy-Efficient Broadcasting in Wireless Networks

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2002, ISAAC.

Approximate constrained bipartite edge coloring

Hervé Rivano, Afonso Ferreira, Stéphane Pérennes, 2001, Discret. Appl. Math..

A decision-making approach where argumentation added value tackles social choice deficiencies

Madalina Croitoru, Christos Kaklamanis, Nikos Karanikolas, 2019, Progress in Artificial Intelligence.

An efficient implementation of the Gale and Shapley "propose-and-reject" algorithm

Christos Kaklamanis, Evi Papaioannou, Nasia Zacharia, 2020, Electron. J. Graph Theory Appl..

Revenue Guarantees in the Generalized Second Price Auction

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2014, TOIT.

Revenue Guarantees in Sponsored Search Auctions

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2012, ESA.

On Low-Envy Truthful Allocations

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2009, ADT.

Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals)

Christos Kaklamanis, Giuseppe Persiano, Manuela Montangero, 2001, STACS.

Sparse and limited wavelength conversion in all-optical tree networks

Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano, 2001, Theor. Comput. Sci..

Optimal Wavelength Routing on Directed Fiber Trees

Klaus Jansen, Thomas Erlebach, Christos Kaklamanis, 1999, Theor. Comput. Sci..

A hypercube parallel algorithm in texture analysis

Charalampos Konstantopoulos, Christos Kaklamanis, Andreas Svolos, 2001, Signal and Image Processing.

Efficient automatic simulation of parallel computation on networks of workstations

Christos Kaklamanis, Giuseppe Persiano, Danny Krizanc, 2006, Discret. Appl. Math..

Polyvalent Parallelizations for Hierarchical Block Matching Motion Estimation

Charalampos Konstantopoulos, Christos Kaklamanis, Andreas Svolos, 2000 .

Simple path selection for optimal routing on processor arrays

Satish Rao, Christos Kaklamanis, Danny Krizanc, 1992, SPAA '92.

Game-Theoretic Approaches to Optimization Problems in Communication Networks

Vittorio Bilò, Angelo Fanelli, Gianpiero Monaco, 2010, Graphs and Algorithms in Communication Networks.

The Price of Stability of Simple Symmetric Fractional Hedonic Games

Christos Kaklamanis, Panagiotis Kanellopoulos, Konstantinos Papaioannou, 2016, SAGT.

On the approximability of Dodgson and Young elections

Ariel D. Procaccia, Ioannis Caragiannis, Christos Kaklamanis, 2009, Artif. Intell..

Limitations of Deterministic Auction Design for Correlated Bidders

Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou, 2013, ESA.

Tight Bounds for Selfish and Greedy Load Balancing

Ioannis Caragiannis, Christos Kaklamanis, Michele Flammini, 2006, Algorithmica.

New graph decompositions with applications to emulations

Satish Rao, Christos Kaklamanis, Danny Krizanc, 2007, Theory of Computing Systems.

Taxes for linear atomic congestion games

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2006, TALG.

Basic Computations in Wireless Networks

Ioannis Caragiannis, Christos Kaklamanis, Clemente Galdi, 2005, ISAAC.

Geometric Clustering to Minimize the Sum of Cluster Sizes

Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, 2005, ESA.

Asymptotically tight bounds for computing with faulty arrays of processors

Anna R. Karlin, Frank Thomson Leighton, Satish Rao, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

On the Price of Stability of Social Distance Games

Christos Kaklamanis, Panagiotis Kanellopoulos, Dimitris Patouchas, 2018, SAGT.

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs

Ioannis Caragiannis, Christos Kaklamanis, Aleksei V. Fishkin, 2007, Discret. Appl. Math..

Online Algorithms for Disk Graphs

Ioannis Caragiannis, Christos Kaklamanis, Aleksei V. Fishkin, 2004, MFCS.

Evaluating approval-based multiwinner voting in terms of robustness to noise

Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, 2020, Autonomous Agents and Multi-Agent Systems.

Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks

Ioannis Caragiannis, Christos Kaklamanis, I. Caragiannis, 2004, STACS.

Randomized path coloring on binary trees

Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano, 2000, Theor. Comput. Sci..

Constrained Bipartite Edge Coloring with Applications to Wavelength Routing

Klaus Jansen, Thomas Erlebach, Christos Kaklamanis, 1997, ICALP.

Efficient Wavelength Routing on Directed Fiber Trees

Christos Kaklamanis, Giuseppe Persiano, G. Persiano, 1996, ESA.

Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings

Satish Rao, Christos Kaklamanis, Milena Mihail, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Approximation Algorithms for Path Coloring in Trees

Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano, 2006, Efficient Approximation and Online Algorithms.

Wavelength Routing in All-Optical Tree Networks: A Survey

Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano, 2001, Bull. EATCS.

Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies

Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, 1997 .

A Decision Support Tool for Agricultural Applications Based on Computational Social Choice and Argumentation

Christos Kaklamanis, Nikos Karanikolas, Rallou Thomopoulos, 2018, Int. J. Agric. Environ. Inf. Syst..

Euro-Par 2012 Parallel Processing

Paul G. Spirakis, Christos Kaklamanis, Theodore S. Papatheodorou, 2012, Lecture Notes in Computer Science.

Optimal hypercube simulation on the partitioned optical passive stars network

Charalampos Konstantopoulos, Christos Kaklamanis, C. Kaklamanis, 2007, The Journal of Supercomputing.

A tight bound for online colouring of disk graphs

Ioannis Caragiannis, Christos Kaklamanis, Aleksei V. Fishkin, 2007, Theor. Comput. Sci..

Station Layouts in the Presence of Location Constraints (extended Abstract) Research Supported in Part by Mitacs Project Canccom (complex Adaptive Networks for Computing and Communication)

Prosenjit Bose, David Peleg, Christos Kaklamanis, 1999 .

Branch-and-bound and backtrack search on mesh-connected arrays of processors

Christos Kaklamanis, Giuseppe Persiano, G. Persiano, 1992, SPAA '92.

The Impact of Altruism on the Efficiency of Atomic Congestion Games

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2010, TGC.

Bounding the inefficiency of outcomes in generalized second price auctions

Renato Paes Leme, Éva Tardos, Ioannis Caragiannis, 2012, J. Econ. Theory.

Communication in wireless networks with directional antennas

Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, 2008, SPAA '08.

New bounds on the size of the minimum feedback vertex set in meshes and butterflies

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, 2002, Inf. Process. Lett..

Universal emulations with sublogarithmic slowdown

Satish Rao, Christos Kaklamanis, Danny Krizanc, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

New graph decompositions and fast emulations in hypercubes and butterflies

Satish Rao, Christos Kaklamanis, Danny Krizanc, 1993, SPAA '93.

Universal Emulations with Sublogarithmic Slowdown (Extended Abstract)

Satish Rao, Christos Kaklamanis, Danny Krizanct, 1993 .

Hot-potato routing on processor arrays

Satish Rao, Christos Kaklamanis, Danny Krizanc, 1993, ACM Symposium on Parallelism in Algorithms and Architectures.

Greedy dynamic hot-potato routing on arrays

Ioannis Caragiannis, Christos Kaklamanis, Yannis Vergados, 2000, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000.

Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note)

I. Caragiannis, C. Kaklamanis, Yannis Vergados, 2000, Euro-Par.

Multipacket Hot-Potato Routing on Processor Arrays

Christos Kaklamanis, Danny Krizanc, D. Krizanc, 1996, Euro-Par, Vol. I.

On the price of stability of some simple graph-based hedonic games

Christos Kaklamanis, Panagiotis Kanellopoulos, Konstantinos Papaioannou, 2020, Theor. Comput. Sci..

A Tight Bound for Online Coloring of Disk Graphs

Ioannis Caragiannis, Christos Kaklamanis, Aleksei V. Fishkin, 2005, SIROCCO.