Christos Kaklamanis

151 papers A* 10A 10B 36C 1Journal 53Unranked 32
YearRankTypeTitle / Venue / Authors
2023 — conf
"SHeMeD": An Application on Secure Computation of Medical Cloud Data Based on Homomorphic Encryption.
ICCSA (Workshops 6)
Hara Salaga, Nikos Karanikolas, Christos Kaklamanis
2022 J jnl
Evaluating approval-based multiwinner voting in terms of robustness to noise.
Auton. Agents Multi Agent Syst.
Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, George A. Krimpas
2021 B ed.
Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers
WAOA
Christos Kaklamanis, Asaf Levin
2021 J jnl
On the price of stability of some simple graph-based hedonic games.
Theor. Comput. Sci.
Christos Kaklamanis, Panagiotis Kanellopoulos, Konstantinos Papaioannou, Dimitris Patouchas
2020 J jnl
An efficient implementation of the Gale and Shapley "propose-and-reject" algorithm.
Electron. J. Graph Theory Appl.
Nasia Zacharia, Evi Papaioannou, Christos Kaklamanis
2020 A* conf
Evaluating Approval-Based Multiwinner Voting in Terms of Robustness to Noise.
IJCAI
Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, George A. Krimpas
2020 J jnl
Evaluating approval-based multiwinner voting in terms of robustness to noise.
CoRR
Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, George A. Krimpas
2019 — conf
A Voting Argumentation Framework: Considering the Reasoning behind Preferences.
ICAART (1)
Nikos Karanikolas, Pierre Bisquert, Christos Kaklamanis
2019 J jnl
A decision-making approach where argumentation added value tackles social choice deficiencies.
Prog. Artif. Intell.
Pierre Bisquert, Madalina Croitoru, Christos Kaklamanis, Nikos Karanikolas
2018 A* ed.
45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, July 9-13, 2018
ICALP
Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald Sannella
2018 J jnl
A Decision Support Tool for Agricultural Applications Based on Computational Social Choice and Argumentation.
Int. J. Agric. Environ. Inf. Syst.
Nikos Karanikolas, Pierre Bisquert, Patrice Buche, Christos Kaklamanis, Rallou Thomopoulos
2018 J jnl
ICALP 2019 - First Call for Papers.
Bull. EATCS
Efstratios Gallopoulos, John D. Garofalakis, Christos Kaklamanis, Sotiris E. Nikoletseas, Christos D. Zaroliagis
2018 — conf
Multi-criteria Decision Making with Existential Rules Using Repair Techniques.
SGAI Conf.
Nikos Karanikolas, Madalina Croitoru, Pierre Bisquert, Christos Kaklamanis, Rallou Thomopoulos, Bruno Yun
2018 J jnl
On network formation games with heterogeneous players and basic network creation games.
Theor. Comput. Sci.
Christos Kaklamanis, Panagiotis Kanellopoulos, Sophia Tsokana
2018 B conf
On the Price of Stability of Social Distance Games.
SAGT
Christos Kaklamanis, Panagiotis Kanellopoulos, Dimitris Patouchas
2018 J jnl
VSI: Edu*-2016 - Keeping up with technology: Teaching parallel, distributed and high-performance computing.
J. Parallel Distributed Comput.
Sushil K. Prasad, Sheikh K. Ghafoor, Christos Kaklamanis, Ramachandran Vaidyanathan
2017 — ed.
Euro-Par 2016: Parallel Processing Workshops - Euro-Par 2016 International Workshops, Grenoble, France, August 24-26, 2016, Revised Selected Papers
Euro-Par Workshops
Frédéric Desprez, Pierre-François Dutot, Christos Kaklamanis, Loris Marchal, Korbinian Molitorisz, Laura Ricci, Vittorio Scarano, Miguel A. Vega-Rodríguez, Ana Lucia Varbanescu, Sascha Hunold, Stephen L. Scott, Stefan Lankes, Josef Weidendorfer
2016 J jnl
Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms.
Theory Comput. Syst.
Christos Kaklamanis, Kirk Pruhs
2016 — conf
Integrating the Kaltura Video Platform with the Photodentro Video Repository: A Case Study.
CSE/EUC/DCABES
Vasileios Gkamas, A. Koutoumanos, K. Alexandris, Elina Megalou, Michael Paraskevas, Christos Kaklamanis
2016 J jnl
Limitations of Deterministic Auction Design for Correlated Bidders.
ACM Trans. Comput. Theory
Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
2016 C conf
On Network Formation Games with Heterogeneous Players and Basic Network Creation Games.
AAIM
Christos Kaklamanis, Panagiotis Kanellopoulos, Sophia Tsokana
2016 B conf
The Price of Stability of Simple Symmetric Fractional Hedonic Games.
SAGT
Christos Kaklamanis, Panagiotis Kanellopoulos, Konstantinos Papaioannou
2015 J jnl
Bounding the inefficiency of outcomes in generalized second price auctions.
J. Econ. Theory
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos
2014 B ed.
Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
WAOA
Christos Kaklamanis, Kirk Pruhs
2014 J jnl
Revenue Guarantees in the Generalized Second Price Auction.
ACM Trans. Internet Techn.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou
2014 J jnl
Socially desirable approximations for dodgson's voting rule.
ACM Trans. Algorithms
Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia
2013 J jnl
Energy-Efficient Communication in Multi-interface Wireless Networks.
Theory Comput. Syst.
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
2013 A conf
Limitations of Deterministic Auction Design for Correlated Bidders.
ESA
Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
2013 J jnl
Tight approximation bounds for combinatorial frugal coverage algorithms.
J. Comb. Optim.
Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
2012 — ed.
Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings
Euro-Par
Christos Kaklamanis, Theodore S. Papatheodorou, Paul G. Spirakis
2012 J jnl
On the approximability of Dodgson and Young elections.
Artif. Intell.
Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein
2012 J jnl
On the efficiency of equilibria in generalized second price auctions
CoRR
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos
2012 A conf
Revenue Guarantees in Sponsored Search Auctions.
ESA
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou
2012 J jnl
The Efficiency of Fair Division.
Theory Comput. Syst.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou
2011 A* conf
On the efficiency of equilibria in generalized second price auctions.
EC
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou
2011 J jnl
Preface.
Theor. Comput. Sci.
Christos Kaklamanis, Martin Skutella
2011 — conf
Tight Approximation Bounds for Greedy Frugal Coverage Algorithms.
FAW-AAIM
Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
2011 J jnl
Tight Bounds for Selfish and Greedy Load Balancing.
Algorithmica
Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
2010 — conf
An experimental study of greedy routing algorithms.
HPCS
Stavros Athanassopoulos, Christos Kaklamanis, Ilias Laftsidis, Evi Papaioannou
2010 — ch.
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks.
Graphs and Algorithms in Communication Networks
Alfredo Navarra, Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Ralf Klasing
2010 J jnl
Fractional Path Coloring in Bounded Degree Trees with Applications.
Algorithmica
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano
2010 — ch.
Game-Theoretic Approaches to Optimization Problems in Communication Networks.
Graphs and Algorithms in Communication Networks
Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, Luca Moscardelli
2010 A* conf
Socially desirable approximations for Dodgson's voting rule.
EC
Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia
2010 J jnl
Taxes for linear atomic congestion games.
ACM Trans. Algorithms
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2010 — conf
The Impact of Altruism on the Efficiency of Atomic Congestion Games.
TGC
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Evi Papaioannou
2009 B conf
An Improved Approximation Bound for Spanning Star Forest and Color Saving.
MFCS
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
2009 J jnl
Analysis of Approximation Algorithms for
Theory Comput. Syst.
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis
2009 — ch.
Directed Tree Networks.
Encyclopedia of Optimization
Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano
2009 B conf
Energy-Efficient Communication in Multi-interface Wireless Networks.
MFCS
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
2009 — conf
On Low-Envy Truthful Allocations.
ADT
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou
2009 A* conf
On the approximability of Dodgson and Young elections.
SODA
Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein
2009 — conf
The Efficiency of Fair Division.
WINE
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou
2009 — ed.
Trustworthy Global Computing, 4th International Symposium, TGC 2008, Barcelona, Spain, November 3-4, 2008, Revised Selected Papers
TGC
Christos Kaklamanis, Flemming Nielson
2009 J jnl
WAOA 2006 Special Issue of TOCS.
Theory Comput. Syst.
Thomas Erlebach, Christos Kaklamanis
2008 B ed.
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers
WAOA
Christos Kaklamanis, Martin Skutella
2008 B conf
Communication in wireless networks with directional antennas.
SPAA
Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese
2008 J jnl
Competitive algorithms and lower bounds for online randomized call control in cellular networks.
Networks
Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
2008 — conf
Improving the Efficiency of Load Balancing Games through Taxes.
WINE
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2008 J jnl
Preface.
Theor. Comput. Sci.
Christos Kaklamanis
2008 J jnl
Scheduling to maximize participation.
Theor. Comput. Sci.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou
2007 J jnl
A tight bound for online colouring of disk graphs.
Theor. Comput. Sci.
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
2007 B conf
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.
FCT
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis
2007 — ch.
Minimum Energy Communication in Ad Hoc Wireless Networks.
Handbook of Parallel Computing
Ioannis Caragiannis, Panagiotis Kanellopoulos, Christos Kaklamanis
2007 — ch.
Online Call Admission Control in Wireless Cellular Networks.
Handbook of Parallel Computing
Ioannis Caragiannis, Evi Papaioannou, Christos Kaklamanis
2007 J jnl
Optimal hypercube simulation on the partitioned optical passive stars network.
J. Supercomput.
Charalampos Konstantopoulos, Christos Kaklamanis
2007 J jnl
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.
Discret. Appl. Math.
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
2007 — conf
Topic 12 Theory and Algorithms for Parallel Computation.
Euro-Par
Nir Shavit, Nicolas Schabanel, Pascal Felber, Christos Kaklamanis
2006 — ch.
Approximation Algorithms for Path Coloring in Trees.
Efficient Approximation and Online Algorithms
Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
2006 B ed.
Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers
WAOA
Thomas Erlebach, Christos Kaklamanis
2006 J jnl
Efficient automatic simulation of parallel computation on networks of workstations.
Discret. Appl. Math.
Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Giuseppe Persiano
2006 J jnl
Energy-Efficient Wireless Network Design.
Theory Comput. Syst.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2006 — conf
Project AEOLUS: An Overview.
TGC
Christos Kaklamanis
2006 — conf
Scheduling to Maximize Participation.
TGC
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou
2006 A conf
Taxes for Linear Atomic Congestion Games.
ESA
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2006 — conf
Tight Bounds for Selfish and Greedy Load Balancing.
ICALP (1)
Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
2005 B conf
A Tight Bound for Online Coloring of Disk Graphs.
SIROCCO
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
2005 B conf
Basic Computations in Wireless Networks.
ISAAC
Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
2005 A conf
Geometric Clustering to Minimize the Sum of Cluster Sizes.
ESA
Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2005 B conf
Network Load Games.
ISAAC
Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
2005 — conf
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks.
Euro-Par
Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
2005 — conf
Optimal Embedding of the Hypercube on Partitioned Optical Passive Stars Networks.
Euro-Par
Christos Kaklamanis, Charalampos Konstantopoulos
2005 J jnl
Station Placement in Networks.
Parallel Process. Lett.
Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Giuseppe Persiano
2004 A conf
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.
STACS
Ioannis Caragiannis, Christos Kaklamanis
2004 J jnl
Approximate constrained bipartite edge coloring.
Discret. Appl. Math.
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
2004 J jnl
Efficient binary and grey level morphological operations on a massively parallel processor.
Parallel Algorithms Appl.
Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
2004 — conf
Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks.
ADHOC-NOW
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2004 B conf
Online Algorithms for Disk Graphs.
MFCS
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
2004 — conf
Topic 13: Theory and Algorithms for Parallel Computation.
Euro-Par
Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina
2003 J jnl
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem.
Inf. Process. Lett.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2003 B conf
Energy-Efficient Wireless Network Design.
ISAAC
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2003 B conf
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.
WAOA
Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos
2003 B conf
Power Consumption Problems in Ad-Hoc Wireless Networks.
WAOA
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2003 B conf
Simple On-Line Algorithms for Call Control in Cellular Networks.
WAOA
Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
2003 — conf
Topic Introduction.
Euro-Par
Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann
2002 — conf
A Parallel Solution in Texture Analysis Employing a Massively Parallel Processor (Research Note).
Euro-Par
Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
2002 J jnl
Edge coloring of bipartite graphs with constraints.
Theor. Comput. Sci.
Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
2002 J jnl
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks.
Theory Comput. Syst.
Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
2002 B conf
New Results for Energy-Efficient Broadcasting in Wireless Networks.
ISAAC
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2002 J jnl
New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
Inf. Process. Lett.
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2002 J jnl
Randomized path coloring on binary trees.
Theor. Comput. Sci.
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
2002 B ed.
SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002
SIROCCO
Christos Kaklamanis, Lefteris M. Kirousis
2002 J jnl
Station Layouts in the Presence of Location Constraints.
J. Interconnect. Networks
Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg
2002 J jnl
Wavelength Routing in All-Optical Tree Networks: A Survey.
Bull. EATCS
Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
2001 — conf
A hypercube parallel algorithm in texture analysis.
SIP
Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
2001 B conf
Approximate Constrained Bipartite Edge Coloring.
WG
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
2001 A conf
Bandwidth allocation in WDM tree networks.
IPDPS
Christos Kaklamanis
2001 A conf
Competitive Analysis of On-line Randomized Call Control in Cellular Networks.
IPDPS
Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
2001 J jnl
Efficient primitive binary morphological algorithms on a massively parallel processor.
J. Electronic Imaging
Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
2001 A* conf
Fractional Path Coloring with Applications to WDM Networks.
ICALP
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano
2001 B conf
New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies.
SIROCCO
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
2001 A conf
Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals).
STACS
Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano
2001 B conf
Recent Advances in Wavelength Routing.
SOFSEM
Christos Kaklamanis
2001 J jnl
Sparse and limited wavelength conversion in all-optical tree networks.
Theor. Comput. Sci.
Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano
2001 J jnl
Wavelength Routing in All-optical Tree Networks: A Survey.
Comput. Artif. Intell.
Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
2000 J jnl
A Hypercube Algorithm for Sliding Window Compression.
Parallel Process. Lett.
Christos Kaklamanis, Charalampos Konstantopoulos, Andreas Svolos
2000 J jnl
An efficient parallel algorithm for motion estimation in very low bit-rate video coding systems.
Concurr. Pract. Exp.
Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis
2000 — conf
Efficient Automatic Simulation of Parallel Computation on Network of Workstations.
ICALP Satellite Workshops
Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Pino Persiano
2000 B conf
Efficient on-line communication in cellular networks.
SPAA
Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
2000 — conf
Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note).
Euro-Par
Constantinos Bartzis, Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados
2000 — conf
Greedy Dynamic Hot-Potato Routing on Arrays.
ISPAN
Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados
2000 — conf
Randomized path coloring on binary trees.
APPROX
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
2000 — conf
Sliding-Window Compression on the Hypercube (Research Note).
Euro-Par
Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis
2000 J jnl
Symmetric Communication in All-Optical Tree Networks.
Parallel Process. Lett.
Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
2000 A conf
fficient Binary Morphological Algorithms on a Massively Parallel Processor.
IPDPS
Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
1999 B conf
Edge Coloring of Bipartite Graphs with Constraints.
MFCS
Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
1999 — conf
Efficient shape transformations on a massively parallel processor.
Electronic Imaging: Nonlinear Image Processing
Andreas I. Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
1999 — conf
Hierarchical Block Matching Motion Estimation on a Hypercube Multiprocessor.
ACPC
Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis
1999 — conf
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks.
WAE
Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis
1999 J jnl
Optimal Wavelength Routing on Directed Fiber Trees.
Theor. Comput. Sci.
Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
1999 B conf
Station Layouts in the Presence of Location Constraints.
ISAAC
Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg
1998 — conf
Efficient wavelength routing in trees with low-degree converters.
Multichannel Optical Networks: Theory and Practice
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
1998 B conf
On the Complexity of Wavelength Converters.
MFCS
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
1998 B conf
Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees.
SIROCCO
Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
1997 — conf
An optimal greedy algorithm for wavelength allocation in directed tree networks.
Network Design: Connectivity and Facilities Location
Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano
1997 B conf
Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters.
SIROCCO
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
1997 A* conf
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing.
ICALP
Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen
1997 J jnl
New Graph Decompositions with Applications to Emulations.
Theory Comput. Syst.
Christos Kaklamanis, Danny Krizanc, Satish Rao
1996 A conf
Efficient Wavelength Routing on Directed Fiber Trees.
ESA
Christos Kaklamanis, Giuseppe Persiano
1996 — conf
Multipacket Hot-Potato Routing on Processor Arrays.
Euro-Par, Vol. I
Christos Kaklamanis, Danny Krizanc
1996 B ed.
Structure, Information and Communication Complexity, SIROCCO '95, Proceedings of the 2nd Colloquium on Structural Information and Communication Complexity, Olympia Greece, June 12-14, 1995
SIROCCO
Lefteris M. Kirousis, Christos Kaklamanis
1995 A* conf
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.
FOCS
Milena Mihail, Christos Kaklamanis, Satish Rao
1994 J jnl
Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors.
Math. Syst. Theory
Christos Kaklamanis, Giuseppe Persiano
1993 B conf
New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies.
SPAA
Christos Kaklamanis, Danny Krizanc, Satish Rao
1993 A* conf
Universal Emulations with Sublogarithmic Slowdown
FOCS
Christos Kaklamanis, Danny Krizanc, Satish Rao
1992 B conf
Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors.
SPAA
Christos Kaklamanis, Giuseppe Persiano
1992 B conf
Optimal Sorting on Mesh-Connected Processor Arrays.
SPAA
Christos Kaklamanis, Danny Krizanc
1992 B conf
Simple Path Selection for Optimal Routing on Processor Arrays.
SPAA
Christos Kaklamanis, Danny Krizanc, Satish Rao
1991 B conf
Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version).
SPAA
Christos Kaklamanis, Danny Krizanc, Lata Narayanan, Thanasis Tsantilas
1991 J jnl
Tight Bounds for Oblivious Routing in the Hypercube.
Math. Syst. Theory
Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas
1990 A* conf
Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)
FOCS
Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas
1990 B conf
Tight Bounds for Oblivious Routing in the Hypercube.
SPAA
Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas