The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ioannis Caragiannis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Taxes for Linear Atomic Congestion Games. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:184-195 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
    Basic Computations in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:533-542 [Conf]
  11. Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
    Network Load Games. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:809-818 [Conf]
  12. 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]
  13. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Energy-Efficient Wireless Network Design. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:585-594 [Conf]
  14. Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados
    Greedy Dynamic Hot-Potato Routing on Arrays. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2000, pp:178-185 [Conf]
  15. 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]
  16. 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]
  17. Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    Edge Coloring of Bipartite Graphs with Constraints. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:376-386 [Conf]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
    Efficient on-line communication in cellular networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:46-53 [Conf]
  23. 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]
  24. Ioannis Caragiannis
    Wavelength Management in WDM Rings to Maximize the Number of Connections. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:61-72 [Conf]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. Ioannis Caragiannis, Michele Flammini, Luca Moscardelli
    An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:447-458 [Conf]
  43. 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]
  44. 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]

  45. Approximation Algorithms and Mechanism Design for Minimax Approval Voting. [Citation Graph (, )][DBLP]


  46. Voting Almost Maximizes Social Welfare Despite Limited Communication. [Citation Graph (, )][DBLP]


  47. Topic 12: Theory and Algorithms for Parallel Computation. [Citation Graph (, )][DBLP]


  48. A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. [Citation Graph (, )][DBLP]


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


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


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


  52. Better bounds for online load balancing on unrelated machines. [Citation Graph (, )][DBLP]


  53. Efficient coordination mechanisms for unrelated machine scheduling. [Citation Graph (, )][DBLP]


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


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


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


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


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


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


Search in 0.000secs, Finished in 0.002secs
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