| 2009 |
|---|
| 54 | EE | 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 |
| 53 | EE | Ioannis Caragiannis:
Efficient coordination mechanisms for unrelated machine scheduling.
SODA 2009: 815-824 |
| 2008 |
|---|
| 52 | EE | Geppino Pucci,
Coromoto León,
Ioannis Caragiannis,
Kieran T. Herley:
Topic 12: Theory and Algorithms for Parallel Computation.
Euro-Par 2008: 876 |
| 51 | EE | Ioannis Caragiannis,
Gianpiero Monaco:
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem.
MFCS 2008: 205-216 |
| 50 | EE | Ioannis Caragiannis:
Better bounds for online load balancing on unrelated machines.
SODA 2008: 972-981 |
| 49 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Evangelos Kranakis,
Danny Krizanc,
Andreas Wiese:
Communication in wireless networks with directional antennas.
SPAA 2008: 344-351 |
| 48 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Panagiotis Kanellopoulos:
Improving the Efficiency of Load Balancing Games through Taxes.
WINE 2008: 374-385 |
| 47 | EE | 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) |
| 46 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Panagiotis Kanellopoulos,
Evi Papaioannou:
Scheduling to maximize participation.
Theor. Comput. Sci. 402(2-3): 142-155 (2008) |
| 2007 |
|---|
| 45 | EE | Stavros Athanassopoulos,
Ioannis Caragiannis,
Christos Kaklamanis:
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.
FCT 2007: 52-63 |
| 44 | EE | Ioannis Caragiannis,
Michele Flammini,
Luca Moscardelli:
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks.
ICALP 2007: 447-458 |
| 43 | EE | Ioannis Caragiannis:
Wavelength Management in WDM Rings to Maximize the Number of Connections.
STACS 2007: 61-72 |
| 42 | EE | Ioannis Caragiannis,
Aleksei V. Fishkin,
Christos Kaklamanis,
Evi Papaioannou:
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.
Discrete Applied Mathematics 155(2): 119-136 (2007) |
| 41 | EE | 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) |
| 2006 |
|---|
| 40 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Panagiotis Kanellopoulos:
Taxes for Linear Atomic Congestion Games.
ESA 2006: 184-195 |
| 39 | EE | Ioannis Caragiannis,
Michele Flammini,
Christos Kaklamanis,
Panagiotis Kanellopoulos,
Luca Moscardelli:
Tight Bounds for Selfish and Greedy Load Balancing.
ICALP (1) 2006: 311-322 |
| 38 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Panagiotis Kanellopoulos,
Evi Papaioannou:
Scheduling to Maximize Participation.
TGC 2006: 218-232 |
| 37 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Panagiotis Kanellopoulos:
Energy-Efficient Wireless Network Design.
Theory Comput. Syst. 39(5): 593-617 (2006) |
| 2005 |
|---|
| 36 | EE | Vittorio Bilò,
Ioannis Caragiannis,
Christos Kaklamanis,
Panagiotis Kanellopoulos:
Geometric Clustering to Minimize the Sum of Cluster Sizes.
ESA 2005: 460-471 |
| 35 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Evi Papaioannou:
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks.
Euro-Par 2005: 1089-1099 |
| 34 | EE | Ioannis Caragiannis,
Clemente Galdi,
Christos Kaklamanis:
Basic Computations in Wireless Networks.
ISAAC 2005: 533-542 |
| 33 | EE | Ioannis Caragiannis,
Clemente Galdi,
Christos Kaklamanis:
Network Load Games.
ISAAC 2005: 809-818 |
| 32 | EE | Ioannis Caragiannis,
Aleksei V. Fishkin,
Christos Kaklamanis,
Evi Papaioannou:
A Tight Bound for Online Coloring of Disk Graphs.
SIROCCO 2005: 78-88 |
| 2004 |
|---|
| 31 | EE | 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 |
| 30 | EE | Ioannis Caragiannis,
Aleksei V. Fishkin,
Christos Kaklamanis,
Evi Papaioannou:
Online Algorithms for Disk Graphs.
MFCS 2004: 215-226 |
| 29 | EE | Ioannis Caragiannis,
Christos Kaklamanis:
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.
STACS 2004: 258-269 |
| 28 | EE | Ioannis Caragiannis,
Afonso Ferreira,
Christos Kaklamanis,
Stephane Perennes,
Pino Persiano,
Hervé Rivano:
Approximate constrained bipartite edge coloring.
Discrete Applied Mathematics 143(1-3): 54-61 (2004) |
| 2003 |
|---|
| 27 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Panagiotis Kanellopoulos:
Energy-Efficient Wireless Network Design.
ISAAC 2003: 585-594 |
| 26 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Panagiotis Kanellopoulos:
Power Consumption Problems in Ad-Hoc Wireless Networks.
WAOA 2003: 252-255 |
| 25 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Evi Papaioannou:
Simple On-Line Algorithms for Call Control in Cellular Networks.
WAOA 2003: 67-80 |
| 24 | EE | 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 |
| 23 | EE | 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) |
| 2002 |
|---|
| 22 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Panagiotis Kanellopoulos:
New Results for Energy-Efficient Broadcasting in Wireless Networks.
ISAAC 2002: 332-343 |
| 21 | | Ioannis Caragiannis,
Christos Kaklamanis,
Giuseppe Persiano:
Wavelength Routing in All-Optical Tree Networks: A Survey.
Bulletin of the EATCS 76: 104-124 (2002) |
| 20 | EE | 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) |
| 19 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Pino Persiano:
Edge coloring of bipartite graphs with constraints.
Theor. Comput. Sci. 270(1-2): 361-399 (2002) |
| 18 | | Vincenzo Auletta,
Ioannis Caragiannis,
Christos Kaklamanis,
Pino Persiano:
Randomized path coloring on binary trees.
Theor. Comput. Sci. 289(1): 355-399 (2002) |
| 17 | EE | 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) |
| 2001 |
|---|
| 16 | EE | Ioannis Caragiannis,
Afonso Ferreira,
Christos Kaklamanis,
Stephane Perennes,
Hervé Rivano:
Fractional Path Coloring with Applications to WDM Networks.
ICALP 2001: 732-743 |
| 15 | | Ioannis Caragiannis,
Christos Kaklamanis,
Evi Papaioannou:
Competitive Analysis of On-line Randomized Call Control in Cellular Networks.
IPDPS 2001: 14 |
| 14 | | 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 |
| 13 | EE | Ioannis Caragiannis,
Afonso Ferreira,
Christos Kaklamanis,
Stephane Perennes,
Pino Persiano,
Hervé Rivano:
Approximate Constrained Bipartite Edge Coloring.
WG 2001: 21-31 |
| 12 | | Ioannis Caragiannis,
Christos Kaklamanis,
Giuseppe Persiano:
Wavelength Routing in All-optical Tree Networks: A Survey.
Computers and Artificial Intelligence 20(2): (2001) |
| 11 | EE | 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) |
| 2000 |
|---|
| 10 | EE | Vincenzo Auletta,
Ioannis Caragiannis,
Christos Kaklamanis,
Pino Persiano:
Randomized path coloring on binary trees.
APPROX 2000: 60-71 |
| 9 | EE | Constantinos Bartzis,
Ioannis Caragiannis,
Christos Kaklamanis,
Ioannis Vergados:
Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note).
Euro-Par 2000: 877-881 |
| 8 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Ioannis Vergados:
Greedy Dynamic Hot-Potato Routing on Arrays.
ISPAN 2000: 178-185 |
| 7 | EE | Ioannis Caragiannis,
Christos Kaklamanis,
Evi Papaioannou:
Efficient on-line communication in cellular networks.
SPAA 2000: 46-53 |
| 6 | | Ioannis Caragiannis,
Christos Kaklamanis,
Pino Persiano:
Symmetric Communication in All-Optical Tree Networks.
Parallel Processing Letters 10(4): 305-314 (2000) |
| 1999 |
|---|
| 5 | EE | Athanasios Bouganis,
Ioannis Caragiannis,
Christos Kaklamanis:
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks.
Algorithm Engineering 1999: 259-271 |
| 4 | | Ioannis Caragiannis,
Christos Kaklamanis,
Pino Persiano:
Edge Coloring of Bipartite Graphs with Constraints.
MFCS 1999: 376-386 |
| 1998 |
|---|
| 3 | EE | Vincenzo Auletta,
Ioannis Caragiannis,
Christos Kaklamanis,
Pino Persiano:
On the Complexity of Wavelength Converters.
MFCS 1998: 771-779 |
| 2 | | Ioannis Caragiannis,
Christos Kaklamanis,
Pino Persiano:
Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees.
SIROCCO 1998: 10-19 |
| 1997 |
|---|
| 1 | | Vincenzo Auletta,
Ioannis Caragiannis,
Christos Kaklamanis,
Pino Persiano:
Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters.
SIROCCO 1997: 24-39 |
