|
Search the dblp DataBase
Ioannis Caragiannis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
Taxes for Linear Atomic Congestion Games. [Citation Graph (0, 0)][DBLP] ESA, 2006, pp:184-195 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
Basic Computations in Wireless Networks. [Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:533-542 [Conf]
- Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
Network Load Games. [Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:809-818 [Conf]
- 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]
- Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
Energy-Efficient Wireless Network Design. [Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:585-594 [Conf]
- Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados
Greedy Dynamic Hot-Potato Routing on Arrays. [Citation Graph (0, 0)][DBLP] ISPAN, 2000, pp:178-185 [Conf]
- 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]
- 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]
- Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
Edge Coloring of Bipartite Graphs with Constraints. [Citation Graph (0, 0)][DBLP] MFCS, 1999, pp:376-386 [Conf]
- 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]
- 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]
- 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]
- 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]
- Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
Efficient on-line communication in cellular networks. [Citation Graph (0, 0)][DBLP] SPAA, 2000, pp:46-53 [Conf]
- 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]
- Ioannis Caragiannis
Wavelength Management in WDM Rings to Maximize the Number of Connections. [Citation Graph (0, 0)][DBLP] STACS, 2007, pp:61-72 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
Approximation Algorithms and Mechanism Design for Minimax Approval Voting. [Citation Graph (, )][DBLP]
Voting Almost Maximizes Social Welfare Despite Limited Communication. [Citation Graph (, )][DBLP]
Topic 12: Theory and Algorithms for Parallel Computation. [Citation Graph (, )][DBLP]
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. [Citation Graph (, )][DBLP]
An Improved Approximation Bound for Spanning Star Forest and Color Saving. [Citation Graph (, )][DBLP]
Energy-Efficient Communication in Multi-interface Wireless Networks. [Citation Graph (, )][DBLP]
Socially desirable approximations for Dodgson's voting rule. [Citation Graph (, )][DBLP]
Better bounds for online load balancing on unrelated machines. [Citation Graph (, )][DBLP]
Efficient coordination mechanisms for unrelated machine scheduling. [Citation Graph (, )][DBLP]
On the approximability of Dodgson and Young elections. [Citation Graph (, )][DBLP]
Communication in wireless networks with directional antennas. [Citation Graph (, )][DBLP]
Scheduling to Maximize Participation. [Citation Graph (, )][DBLP]
Improving the Efficiency of Load Balancing Games through Taxes. [Citation Graph (, )][DBLP]
The Efficiency of Fair Division. [Citation Graph (, )][DBLP]
On Low-Envy Truthful Allocations. [Citation Graph (, )][DBLP]
Search in 0.173secs, Finished in 0.178secs
|