The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christos Kaklamanis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis
    Hierarchical Block Matching Motion Estimation on a Hypercube Multiprocessor. [Citation Graph (0, 0)][DBLP]
    ACPC, 1999, pp:265-275 [Conf]
  2. Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2004, pp:183-196 [Conf]
  3. Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    Randomized path coloring on binary trees. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:60-71 [Conf]
  4. Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Geometric Clustering to Minimize the Sum of Cluster Sizes. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:460-471 [Conf]
  5. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Taxes for Linear Atomic Congestion Games. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:184-195 [Conf]
  6. Christos Kaklamanis, Giuseppe Persiano
    Efficient Wavelength Routing on Directed Fiber Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:460-470 [Conf]
  7. Constantinos Bartzis, Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados
    Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note). [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:877-881 [Conf]
  8. Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina
    Topic 13: Theory and Algorithms for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:803- [Conf]
  9. Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
    New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:1089-1099 [Conf]
  10. Christos Kaklamanis, Charalampos Konstantopoulos
    Optimal Embedding of the Hypercube on Partitioned Optical Passive Stars Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:952-961 [Conf]
  11. Christos Kaklamanis, Danny Krizanc
    Multipacket Hot-Potato Routing on Processor Arrays. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:270-277 [Conf]
  12. Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann
    Topic Introduction. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2003, pp:884- [Conf]
  13. Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis
    Sliding-Window Compression on the Hypercube (Research Note). [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:835-838 [Conf]
  14. Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
    A Parallel Solution in Texture Analysis Employing a Massively Parallel Processor (Research Note). [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:431-435 [Conf]
  15. Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas
    Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:285-296 [Conf]
  16. Christos Kaklamanis, Danny Krizanc, Satish Rao
    Universal Emulations with Sublogarithmic Slowdown [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:341-350 [Conf]
  17. Milena Mihail, Christos Kaklamanis, Satish Rao
    Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:548-557 [Conf]
  18. Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
    Tight Bounds for Selfish and Greedy Load Balancing. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:311-322 [Conf]
  19. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano
    Fractional Path Coloring with Applications to WDM Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:732-743 [Conf]
  20. Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Pino Persiano
    Efficient Automatic Simulation of Parallel Computation on Network of Workstations. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:191-202 [Conf]
  21. Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen
    Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:493-504 [Conf]
  22. Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
    Competitive Analysis of On-line Randomized Call Control in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:14- [Conf]
  23. Christos Kaklamanis
    Bandwidth allocation in WDM tree networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:198- [Conf]
  24. Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
    fficient Binary Morphological Algorithms on a Massively Parallel Processor. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:281-0 [Conf]
  25. Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg
    Station Layouts in the Presence of Location Constraints. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:269-278 [Conf]
  26. Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
    Basic Computations in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:533-542 [Conf]
  27. Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
    Network Load Games. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:809-818 [Conf]
  28. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    New Results for Energy-Efficient Broadcasting in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:332-343 [Conf]
  29. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Energy-Efficient Wireless Network Design. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:585-594 [Conf]
  30. Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados
    Greedy Dynamic Hot-Potato Routing on Arrays. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2000, pp:178-185 [Conf]
  31. Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    On the Complexity of Wavelength Converters. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:771-779 [Conf]
  32. Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
    Online Algorithms for Disk Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:215-226 [Conf]
  33. Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    Edge Coloring of Bipartite Graphs with Constraints. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:376-386 [Conf]
  34. Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
    A hypercube parallel algorithm in texture analysis. [Citation Graph (0, 0)][DBLP]
    SIP, 2001, pp:47-50 [Conf]
  35. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:77-88 [Conf]
  36. Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:24-39 [Conf]
  37. Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
    A Tight Bound for Online Coloring of Disk Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:78-88 [Conf]
  38. Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:10-19 [Conf]
  39. Christos Kaklamanis
    Recent Advances in Wavelength Routing. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2001, pp:58-72 [Conf]
  40. Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
    Efficient on-line communication in cellular networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:46-53 [Conf]
  41. Christos Kaklamanis, Danny Krizanc
    Optimal Sorting on Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:50-59 [Conf]
  42. Christos Kaklamanis, Danny Krizanc, Lata Narayanan, Thanasis Tsantilas
    Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:17-28 [Conf]
  43. Christos Kaklamanis, Danny Krizanc, Satish Rao
    Simple Path Selection for Optimal Routing on Processor Arrays. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:23-30 [Conf]
  44. Christos Kaklamanis, Danny Krizanc, Satish Rao
    New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:325-334 [Conf]
  45. Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas
    Tight Bounds for Oblivious Routing in the Hypercube. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:31-36 [Conf]
  46. Christos Kaklamanis, Giuseppe Persiano
    Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:118-126 [Conf]
  47. Ioannis Caragiannis, Christos Kaklamanis
    Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:258-269 [Conf]
  48. Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano
    Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals). [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:271-282 [Conf]
  49. Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis
    Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:259-271 [Conf]
  50. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Power Consumption Problems in Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:252-255 [Conf]
  51. Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
    Simple On-Line Algorithms for Call Control in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:67-80 [Conf]
  52. Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos
    Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:81-94 [Conf]
  53. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
    Approximate Constrained Bipartite Edge Coloring. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:21-31 [Conf]
  54. Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
    Wavelength Routing in All-optical Tree Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2001, v:20, n:2, pp:- [Journal]
  55. Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis
    An efficient parallel algorithm for motion estimation in very low bit-rate video coding systems. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 2000, v:12, n:5, pp:289-309 [Journal]
  56. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
    Approximate constrained bipartite edge coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:54-61 [Journal]
  57. Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Giuseppe Persiano
    Efficient automatic simulation of parallel computation on networks of workstations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:10, pp:1500-1509 [Journal]
  58. Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
    Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:119-136 [Journal]
  59. Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
    Wavelength Routing in All-Optical Tree Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:76, n:, pp:104-124 [Journal]
  60. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    New bounds on the size of the minimum feedback vertex set in meshes and butterflies. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:5, pp:275-280 [Journal]
  61. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:3, pp:149-154 [Journal]
  62. Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg
    Station Layouts in the Presence of Location Constraints. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:1-2, pp:1-17 [Journal]
  63. Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
    Efficient On-Line Frequency Allocation and Call Control in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:5, pp:521-543 [Journal]
  64. Christos Kaklamanis, Danny Krizanc, Satish Rao
    New Graph Decompositions with Applications to Emulations. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:1, pp:39-49 [Journal]
  65. Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas
    Tight Bounds for Oblivious Routing in the Hypercube. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:4, pp:223-232 [Journal]
  66. Christos Kaklamanis, Giuseppe Persiano
    Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:5, pp:471-489 [Journal]
  67. Andreas Svolos, Charalampos Konstantopoulos, Christos Kaklamanis
    Efficient binary and grey level morphological operations on a massively parallel processor. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms Appl., 2004, v:19, n:1, pp:33-50 [Journal]
  68. Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    Symmetric Communication in All-Optical Tree Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2000, v:10, n:4, pp:305-314 [Journal]
  69. Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Giuseppe Persiano
    Station Placement in Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2005, v:15, n:1-2, pp:117-130 [Journal]
  70. Christos Kaklamanis, Charalampos Konstantopoulos, Andreas Svolos
    A Hypercube Algorithm for Sliding Window Compression. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2000, v:10, n:4, pp:315-326 [Journal]
  71. Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano
    Sparse and limited wavelength conversion in all-optical tree networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:887-934 [Journal]
  72. Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    Randomized path coloring on binary trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:355-399 [Journal]
  73. Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    Edge coloring of bipartite graphs with constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:361-399 [Journal]
  74. Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
    Optimal Wavelength Routing on Directed Fiber Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:119-137 [Journal]
  75. Nir Shavit, Nicolas Schabanel, Pascal Felber, Christos Kaklamanis
    Topic 12 Theory and Algorithms for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2007, pp:793- [Conf]
  76. Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis
    Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:52-63 [Conf]
  77. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Energy-Efficient Wireless Network Design. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:5, pp:593-617 [Journal]
  78. Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
    A tight bound for online colouring of disk graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:152-160 [Journal]

  79. An Improved Approximation Bound for Spanning Star Forest and Color Saving. [Citation Graph (, )][DBLP]


  80. Energy-Efficient Communication in Multi-interface Wireless Networks. [Citation Graph (, )][DBLP]


  81. Socially desirable approximations for Dodgson's voting rule. [Citation Graph (, )][DBLP]


  82. On the approximability of Dodgson and Young elections. [Citation Graph (, )][DBLP]


  83. Communication in wireless networks with directional antennas. [Citation Graph (, )][DBLP]


  84. Scheduling to Maximize Participation. [Citation Graph (, )][DBLP]


  85. Project AEOLUS: An Overview. [Citation Graph (, )][DBLP]


  86. Improving the Efficiency of Load Balancing Games through Taxes. [Citation Graph (, )][DBLP]


  87. The Efficiency of Fair Division. [Citation Graph (, )][DBLP]


  88. On Low-Envy Truthful Allocations. [Citation Graph (, )][DBLP]


  89. An experimental study of greedy routing algorithms. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002