default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristos Kaklamanis
Person information
- affiliation: University of Patras, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c82]Hara Salaga
, Nikos Karanikolas, Christos Kaklamanis:
"SHeMeD": An Application on Secure Computation of Medical Cloud Data Based on Homomorphic Encryption. ICCSA (Workshops 6) 2023: 116-133- 2022
- [j51]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, George A. Krimpas:
Evaluating approval-based multiwinner voting in terms of robustness to noise. Auton. Agents Multi Agent Syst. 36(1): 1 (2022) - 2021
- [j50]Christos Kaklamanis, Panagiotis Kanellopoulos, Konstantinos Papaioannou, Dimitris Patouchas:
On the price of stability of some simple graph-based hedonic games. Theor. Comput. Sci. 855: 1-15 (2021) - [e10]Christos Kaklamanis, Asaf Levin:
Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12806, Springer 2021, ISBN 978-3-030-80878-5 [contents] - 2020
- [j49]Nasia Zacharia, Evi Papaioannou, Christos Kaklamanis:
An efficient implementation of the Gale and Shapley "propose-and-reject" algorithm. Electron. J. Graph Theory Appl. 8(1): 29-57 (2020) - [c81]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, George A. Krimpas:
Evaluating Approval-Based Multiwinner Voting in Terms of Robustness to Noise. IJCAI 2020: 74-80 - [i2]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, George A. Krimpas:
Evaluating approval-based multiwinner voting in terms of robustness to noise. CoRR abs/2002.01776 (2020)
2010 – 2019
- 2019
- [j48]Pierre Bisquert, Madalina Croitoru, Christos Kaklamanis, Nikos Karanikolas:
A decision-making approach where argumentation added value tackles social choice deficiencies. Prog. Artif. Intell. 8(2): 229-239 (2019) - [c80]Nikos Karanikolas, Pierre Bisquert, Christos Kaklamanis:
A Voting Argumentation Framework: Considering the Reasoning behind Preferences. ICAART (1) 2019: 42-53 - 2018
- [j47]Efstratios Gallopoulos, John D. Garofalakis, Christos Kaklamanis, Sotiris E. Nikoletseas, Christos D. Zaroliagis:
ICALP 2019 - First Call for Papers. Bull. EATCS 126 (2018) - [j46]Nikos Karanikolas, Pierre Bisquert, Patrice Buche, Christos Kaklamanis, Rallou Thomopoulos:
A Decision Support Tool for Agricultural Applications Based on Computational Social Choice and Argumentation. Int. J. Agric. Environ. Inf. Syst. 9(3): 54-73 (2018) - [j45]Sushil K. Prasad, Sheikh K. Ghafoor, Christos Kaklamanis, Ramachandran Vaidyanathan:
VSI: Edu*-2016 - Keeping up with technology: Teaching parallel, distributed and high-performance computing. J. Parallel Distributed Comput. 118(Part): 118-119 (2018) - [j44]Christos Kaklamanis, Panagiotis Kanellopoulos, Sophia Tsokana:
On network formation games with heterogeneous players and basic network creation games. Theor. Comput. Sci. 717: 62-72 (2018) - [c79]Christos Kaklamanis, Panagiotis Kanellopoulos, Dimitris Patouchas:
On the Price of Stability of Social Distance Games. SAGT 2018: 125-136 - [c78]Nikos Karanikolas, Madalina Croitoru, Pierre Bisquert, Christos Kaklamanis, Rallou Thomopoulos, Bruno Yun:
Multi-criteria Decision Making with Existential Rules Using Repair Techniques. SGAI Conf. 2018: 177-183 - [e9]Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald Sannella:
45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. LIPIcs 107, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-076-7 [contents] - 2017
- [e8]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:
Euro-Par 2016: Parallel Processing Workshops - Euro-Par 2016 International Workshops, Grenoble, France, August 24-26, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10104, Springer 2017, ISBN 978-3-319-58942-8 [contents] - 2016
- [j43]Christos Kaklamanis, Kirk Pruhs:
Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms. Theory Comput. Syst. 58(1): 1-3 (2016) - [j42]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Limitations of Deterministic Auction Design for Correlated Bidders. ACM Trans. Comput. Theory 8(4): 13:1-13:18 (2016) - [c77]Christos Kaklamanis, Panagiotis Kanellopoulos, Sophia Tsokana:
On Network Formation Games with Heterogeneous Players and Basic Network Creation Games. AAIM 2016: 125-136 - [c76]Vasileios Gkamas, A. Koutoumanos, K. Alexandris, Elina Megalou, Michael Paraskevas, Christos Kaklamanis:
Integrating the Kaltura Video Platform with the Photodentro Video Repository: A Case Study. CSE/EUC/DCABES 2016: 173-176 - [c75]Christos Kaklamanis, Panagiotis Kanellopoulos, Konstantinos Papaioannou:
The Price of Stability of Simple Symmetric Fractional Hedonic Games. SAGT 2016: 220-232 - 2015
- [j41]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos:
Bounding the inefficiency of outcomes in generalized second price auctions. J. Econ. Theory 156: 343-388 (2015) - 2014
- [j40]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia:
Socially desirable approximations for dodgson's voting rule. ACM Trans. Algorithms 10(2): 6:1-6:28 (2014) - [j39]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
Revenue Guarantees in the Generalized Second Price Auction. ACM Trans. Internet Techn. 14(2-3): 17:1-17:19 (2014) - [e7]Christos Kaklamanis, Kirk Pruhs:
Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8447, Springer 2014, ISBN 978-3-319-08000-0 [contents] - 2013
- [j38]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Tight approximation bounds for combinatorial frugal coverage algorithms. J. Comb. Optim. 26(2): 292-309 (2013) - [j37]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Energy-Efficient Communication in Multi-interface Wireless Networks. Theory Comput. Syst. 52(2): 285-296 (2013) - [c74]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Limitations of Deterministic Auction Design for Correlated Bidders. ESA 2013: 277-288 - 2012
- [j36]Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein:
On the approximability of Dodgson and Young elections. Artif. Intell. 187: 31-51 (2012) - [j35]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
The Efficiency of Fair Division. Theory Comput. Syst. 50(4): 589-610 (2012) - [c73]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
Revenue Guarantees in Sponsored Search Auctions. ESA 2012: 253-264 - [e6]Christos Kaklamanis, Theodore S. Papatheodorou, Paul G. Spirakis:
Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings. Lecture Notes in Computer Science 7484, Springer 2012, ISBN 978-3-642-32819-0 [contents] - [i1]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos:
On the efficiency of equilibria in generalized second price auctions. CoRR abs/1201.6429 (2012) - 2011
- [j34]Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli:
Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica 61(3): 606-637 (2011) - [j33]Christos Kaklamanis, Martin Skutella:
Preface. Theor. Comput. Sci. 412(7): 561-562 (2011) - [c72]Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Tight Approximation Bounds for Greedy Frugal Coverage Algorithms. FAW-AAIM 2011: 185-195 - [c71]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
On the efficiency of equilibria in generalized second price auctions. EC 2011: 81-90 - 2010
- [j32]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano:
Fractional Path Coloring in Bounded Degree Trees with Applications. Algorithmica 58(2): 516-540 (2010) - [j31]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Taxes for linear atomic congestion games. ACM Trans. Algorithms 7(1): 13:1-13:31 (2010) - [c70]Stavros Athanassopoulos, Christos Kaklamanis, Ilias Laftsidis, Evi Papaioannou:
An experimental study of greedy routing algorithms. HPCS 2010: 150-156 - [c69]Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia:
Socially desirable approximations for Dodgson's voting rule. EC 2010: 253-262 - [c68]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Evi Papaioannou:
The Impact of Altruism on the Efficiency of Atomic Congestion Games. TGC 2010: 172-188 - [p3]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, Luca Moscardelli:
Game-Theoretic Approaches to Optimization Problems in Communication Networks. Graphs and Algorithms in Communication Networks 2010: 241-263 - [p2]Alfredo Navarra, Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Ralf Klasing:
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks. Graphs and Algorithms in Communication Networks 2010: 335-355
2000 – 2009
- 2009
- [j30]Thomas Erlebach, Christos Kaklamanis:
WAOA 2006 Special Issue of TOCS. Theory Comput. Syst. 45(3): 427-428 (2009) - [j29]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis:
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. Theory Comput. Syst. 45(3): 555-576 (2009) - [c67]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
On Low-Envy Truthful Allocations. ADT 2009: 111-119 - [c66]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
An Improved Approximation Bound for Spanning Star Forest and Color Saving. MFCS 2009: 90-101 - [c65]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Energy-Efficient Communication in Multi-interface Wireless Networks. MFCS 2009: 102-111 - [c64]Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein:
On the approximability of Dodgson and Young elections. SODA 2009: 1058-1067 - [c63]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
The Efficiency of Fair Division. WINE 2009: 475-482 - [e5]Christos Kaklamanis, Flemming Nielson:
Trustworthy Global Computing, 4th International Symposium, TGC 2008, Barcelona, Spain, November 3-4, 2008, Revised Selected Papers. Lecture Notes in Computer Science 5474, Springer 2009, ISBN 978-3-642-00944-0 [contents] - [r3]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
Directed Tree Networks. Encyclopedia of Optimization 2009: 716-725 - 2008
- [j28]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Competitive algorithms and lower bounds for online randomized call control in cellular networks. Networks 52(4): 235-251 (2008) - [j27]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou:
Scheduling to maximize participation. Theor. Comput. Sci. 402(2-3): 142-155 (2008) - [j26]Christos Kaklamanis:
Preface. Theor. Comput. Sci. 406(3): 171-172 (2008) - [c62]Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese:
Communication in wireless networks with directional antennas. SPAA 2008: 344-351 - [c61]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Improving the Efficiency of Load Balancing Games through Taxes. WINE 2008: 374-385 - [e4]Christos Kaklamanis, Martin Skutella:
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers. Lecture Notes in Computer Science 4927, Springer 2008, ISBN 978-3-540-77917-9 [contents] - 2007
- [j25]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs. Discret. Appl. Math. 155(2): 119-136 (2007) - [j24]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
A tight bound for online colouring of disk graphs. Theor. Comput. Sci. 384(2-3): 152-160 (2007) - [j23]Charalampos Konstantopoulos, Christos Kaklamanis:
Optimal hypercube simulation on the partitioned optical passive stars network. J. Supercomput. 42(2): 165-180 (2007) - [c60]Nir Shavit, Nicolas Schabanel, Pascal Felber, Christos Kaklamanis:
Topic 12 Theory and Algorithms for Parallel Computation. Euro-Par 2007: 793 - [c59]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis:
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. FCT 2007: 52-63 - [r2]Ioannis Caragiannis, Panagiotis Kanellopoulos, Christos Kaklamanis:
Minimum Energy Communication in Ad Hoc Wireless Networks. Handbook of Parallel Computing 2007 - [r1]Ioannis Caragiannis, Evi Papaioannou, Christos Kaklamanis:
Online Call Admission Control in Wireless Cellular Networks. Handbook of Parallel Computing 2007 - 2006
- [j22]Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Giuseppe Persiano:
Efficient automatic simulation of parallel computation on networks of workstations. Discret. Appl. Math. 154(10): 1500-1509 (2006) - [j21]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Energy-Efficient Wireless Network Design. Theory Comput. Syst. 39(5): 593-617 (2006) - [c58]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Taxes for Linear Atomic Congestion Games. ESA 2006: 184-195 - [c57]Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli:
Tight Bounds for Selfish and Greedy Load Balancing. ICALP (1) 2006: 311-322 - [c56]Christos Kaklamanis:
Project AEOLUS: An Overview. TGC 2006: 1-9 - [c55]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou:
Scheduling to Maximize Participation. TGC 2006: 218-232 - [p1]Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Approximation Algorithms for Path Coloring in Trees. Efficient Approximation and Online Algorithms 2006: 74-96 - [e3]Thomas Erlebach, Christos Kaklamanis:
Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers. Lecture Notes in Computer Science 4368, Springer 2006, ISBN 3-540-69513-3 [contents] - 2005
- [j20]Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Giuseppe Persiano:
Station Placement in Networks. Parallel Process. Lett. 15(1-2): 117-130 (2005) - [c54]Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Geometric Clustering to Minimize the Sum of Cluster Sizes. ESA 2005: 460-471 - [c53]Christos Kaklamanis, Charalampos Konstantopoulos:
Optimal Embedding of the Hypercube on Partitioned Optical Passive Stars Networks. Euro-Par 2005: 952-961 - [c52]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks. Euro-Par 2005: 1089-1099 - [c51]Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis:
Basic Computations in Wireless Networks. ISAAC 2005: 533-542 - [c50]Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis:
Network Load Games. ISAAC 2005: 809-818 - [c49]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
A Tight Bound for Online Coloring of Disk Graphs. SIROCCO 2005: 78-88 - 2004
- [j19]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano:
Approximate constrained bipartite edge coloring. Discret. Appl. Math. 143(1-3): 54-61 (2004) - [j18]Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis:
Efficient binary and grey level morphological operations on a massively parallel processor. Parallel Algorithms Appl. 19(1): 33-50 (2004) - [c48]Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. ADHOC-NOW 2004: 183-196 - [c47]Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina:
Topic 13: Theory and Algorithms for Parallel Computation. Euro-Par 2004: 803 - [c46]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
Online Algorithms for Disk Graphs. MFCS 2004: 215-226 - [c45]Ioannis Caragiannis, Christos Kaklamanis:
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. STACS 2004: 258-269 - 2003
- [j17]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem. Inf. Process. Lett. 86(3): 149-154 (2003) - [c44]Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann:
Topic Introduction. Euro-Par 2003: 884 - [c43]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Energy-Efficient Wireless Network Design. ISAAC 2003: 585-594 - [c42]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Simple On-Line Algorithms for Call Control in Cellular Networks. WAOA 2003: 67-80 - [c41]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos:
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. WAOA 2003: 81-94 - [c40]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Power Consumption Problems in Ad-Hoc Wireless Networks. WAOA 2003: 252-255 - 2002
- [j16]Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Wavelength Routing in All-Optical Tree Networks: A Survey. Bull. EATCS 76: 104-124 (2002) - [j15]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
New bounds on the size of the minimum feedback vertex set in meshes and butterflies. Inf. Process. Lett. 83(5): 275-280 (2002) - [j14]Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg:
Station Layouts in the Presence of Location Constraints. J. Interconnect. Networks 3(1-2): 1-17 (2002) - [j13]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks. Theory Comput. Syst. 35(5): 521-543 (2002) - [j12]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Edge coloring of bipartite graphs with constraints. Theor. Comput. Sci. 270(1-2): 361-399 (2002) - [j11]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Randomized path coloring on binary trees. Theor. Comput. Sci. 289(1): 355-399 (2002) - [c39]Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis:
A Parallel Solution in Texture Analysis Employing a Massively Parallel Processor (Research Note). Euro-Par 2002: 431-435 - [c38]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
New Results for Energy-Efficient Broadcasting in Wireless Networks. ISAAC 2002: 332-343 - [e2]Christos Kaklamanis, Lefteris M. Kirousis:
SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002. Proceedings in Informatics 13, Carleton Scientific 2002 [contents] - 2001
- [j10]Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Wavelength Routing in All-optical Tree Networks: A Survey. Comput. Artif. Intell. 20(2): 95-120 (2001) - [j9]Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis:
Efficient primitive binary morphological algorithms on a massively parallel processor. J. Electronic Imaging 10(2): 567-575 (2001) - [j8]Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano:
Sparse and limited wavelength conversion in all-optical tree networks. Theor. Comput. Sci. 266(1-2): 887-934 (2001) - [c37]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano:
Fractional Path Coloring with Applications to WDM Networks. ICALP 2001: 732-743 - [c36]Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Competitive Analysis of On-line Randomized Call Control in Cellular Networks. IPDPS 2001: 14 - [c35]Christos Kaklamanis:
Bandwidth allocation in WDM tree networks. IPDPS 2001: 198 - [c34]Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis:
A hypercube parallel algorithm in texture analysis. SIP 2001: 47-50 - [c33]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies. SIROCCO 2001: 77-88 - [c32]Christos Kaklamanis:
Recent Advances in Wavelength Routing. SOFSEM 2001: 58-72 - [c31]Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano:
Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals). STACS 2001: 271-282 - [c30]