- On--line Call Control in Cellular Networks \Lambda Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou
- An improved approximation bound for spanning star forest and color saving
- The efficiency of fair division Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and
- Approximation Algorithms for Path Coloring Ioannis Caragiannis 1 , Christos Kaklamanis 1 , and Giuseppe Persiano 2
- Power Consumption Problems in Ad Hoc Wireless Networks ?
- Fractional Path Coloring with Applications to WDM Networks ?
- Efficient Coordination Mechanisms for Unrelated Machine Scheduling Ioannis Caragiannis
- Efficient On--line Frequency Allocation and Call Control in Cellular Networks \Lambda
- Wavelength Routing in All--Optical Tree Networks: A Survey \Lambda Ioannis Caragiannis y Christos Kaklamanis z Pino Persiano x
- On the Approximability of Dodgson and Young Elections Ioannis Caragiannis
- On the Efficiency of Equilibria in Generalized Second Price Auctions
- Improved lower bounds on the price of stability of undirected network design games
- Randomized Call Control in Sparse Wireless Cellular Networks \Lambda Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou
- Simple Online Algorithms for Call Control in Cellular Networks #
- EnergyE#cient Wireless Network Design # Ioannis Caragiannis Christos Kaklamanis Panagiotis Kanellopoulos
- The Impact of Altruism on the Efficiency of Atomic Congestion Games
- Communication in Wireless Networks with Directional Antennas
- Bandwidth Allocation Algorithms on Tree--Shaped All--Optical Networks with Wavelength Converters ?
- EnergyEfficient Wireless Network Design ? Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos
- Voting Almost Maximizes Social Welfare Despite Limited Communication
- Randomized Path Coloring on Binary Trees ? Vincenzo Auletta 1 , Ioannis Caragiannis 2 , Christos Kaklamanis 2 , and
- New Bounds on the Size of the Minimum Feedback Vertex Set
- Scheduling to maximize participation Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and
- Approximate Constrained Bipartite Edge Coloring \Lambda Ioannis Caragiannis y Afonso Ferreira z Christos Kaklamanis x St'ephane P'erennes --
- Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical
- Tight Bounds for Selfish and Greedy Load Ioannis Caragiannis1
- Approximation Algorithms and Mechanism Design for Minimax Approval Voting Ioannis Caragiannis
- On low-envy truthful allocations Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and
- Improving the Efficiency of Load Balancing Games through Taxes
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
- Wavelength management in WDM rings to maximize the number of connections
- Network Load Games Ioannis Caragiannis1
- Geometric Clustering to Minimize the Sum of Cluster Sizes
- New Bounds on the Competitiveness of Randomized Online Call Control
- Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies
- A tight bound for online coloring of disk graphs # Ioannis Caragiannis 1 , Aleksei V. Fishkin 2 , Christos Kaklamanis 1 , and
- An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting
- Analysis of Approximation Algorithms for k-Set Cover using Factor-Revealing Linear Programs
- Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees
- Fractional and Integral Coloring of LocallySymmetric Sets of Paths
- Basic Computations in Wireless Networks Ioannis Caragiannis1
- Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc
- Voting Almost Maximizes Social Welfare Despite Limited Communication Ioannis Caragiannis
- Online algorithms for disk graphs # Ioannis Caragiannis 1 , Aleksei Fishkin 2 , Christos Kaklamanis 1 , and
- Efficient On--line Communication in Cellular Networks Ioannis Caragiannis y
- Better Bounds for Online Load Balancing on Unrelated Machines Ioannis Caragiannis
- Taxes for Linear Atomic Congestion Games Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos
- Energy-efficient communication in multi-interface wireless networks
- [1] C. Bowman, P. Danzig, D. Hardy, U. Manber, M. Schwartz, and D. Wessels, Harvest: A Scalable, Customizable Discovery and Access System. Technical Report CUCS73294, Dept. of Computer
- Competitive Analysis of On--line Randomized Call Control in Cellular Networks Ioannis Caragiannis y Christos Kaklamanis z Evi Papaioannou x
- Greedy Dynamic Hot--Potato Routing on Arrays Ioannis Caragiannis y Christos Kaklamanis z Ioannis Vergados x
- Edge Coloring of Bipartite Graphs with Constraints ?
- Efficient Wavelength Routing in Trees with Low--Degree Converters
- New Results for Energy--E#cient Broadcasting in Wireless Networks #
- On the Complexity of Wavelength Converters ? Vincenzo Auletta 1 , Ioannis Caragiannis 2 , Christos Kaklamanis 2 ,
