Christos Kaklamanis

According to our database1, Christos Kaklamanis
  • authored at least 123 papers between 1990 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Limitations of Deterministic Auction Design for Correlated Bidders.
TOCT, 2016

Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms.
Theory Comput. Syst., 2016

The Price of Stability of Simple Symmetric Fractional Hedonic Games.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

On Network Formation Games with Heterogeneous Players and Basic Network Creation Games.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
Bounding the inefficiency of outcomes in generalized second price auctions.
J. Economic Theory, 2015

2014
Revenue Guarantees in the Generalized Second Price Auction.
ACM Trans. Internet Techn., 2014

Socially desirable approximations for dodgson's voting rule.
ACM Trans. Algorithms, 2014

2013
Energy-Efficient Communication in Multi-interface Wireless Networks.
Theory Comput. Syst., 2013

Tight approximation bounds for combinatorial frugal coverage algorithms.
J. Comb. Optim., 2013

Limitations of Deterministic Auction Design for Correlated Bidders.
Proceedings of the Algorithms - ESA 2013, 2013

2012
The Efficiency of Fair Division.
Theory Comput. Syst., 2012

On the efficiency of equilibria in generalized second price auctions
CoRR, 2012

On the approximability of Dodgson and Young elections.
Artif. Intell., 2012

Revenue Guarantees in Sponsored Search Auctions.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Preface.
Theor. Comput. Sci., 2011

Tight Bounds for Selfish and Greedy Load Balancing.
Algorithmica, 2011

On the efficiency of equilibria in generalized second price auctions.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Taxes for linear atomic congestion games.
ACM Trans. Algorithms, 2010

Fractional Path Coloring in Bounded Degree Trees with Applications.
Algorithmica, 2010

The Impact of Altruism on the Efficiency of Atomic Congestion Games.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Socially desirable approximations for Dodgson's voting rule.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

An experimental study of greedy routing algorithms.
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

2009
Directed Tree Networks.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

WAOA 2006 Special Issue of TOCS.
Theory Comput. Syst., 2009

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.
Theory Comput. Syst., 2009

The Efficiency of Fair Division.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On the approximability of Dodgson and Young elections.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Energy-Efficient Communication in Multi-interface Wireless Networks.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

An Improved Approximation Bound for Spanning Star Forest and Color Saving.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On Low-Envy Truthful Allocations.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008
Preface.
Theor. Comput. Sci., 2008

Scheduling to maximize participation.
Theor. Comput. Sci., 2008

Competitive algorithms and lower bounds for online randomized call control in cellular networks.
Networks, 2008

Improving the Efficiency of Load Balancing Games through Taxes.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Communication in wireless networks with directional antennas.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007
Online Call Admission Control in Wireless Cellular Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Minimum Energy Communication in Ad Hoc Wireless Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Optimal hypercube simulation on the partitioned optical passive stars network.
The Journal of Supercomputing, 2007

A tight bound for online colouring of disk graphs.
Theor. Comput. Sci., 2007

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.
Discrete Applied Mathematics, 2007

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Topic 12 Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2007, 2007

2006
Approximation Algorithms for Path Coloring in Trees.
Proceedings of the Efficient Approximation and Online Algorithms, 2006

Energy-Efficient Wireless Network Design.
Theory Comput. Syst., 2006

Efficient automatic simulation of parallel computation on networks of workstations.
Discrete Applied Mathematics, 2006

Project AEOLUS: An Overview.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Scheduling to Maximize Participation.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Tight Bounds for Selfish and Greedy Load Balancing.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Taxes for Linear Atomic Congestion Games.
Proceedings of the Algorithms, 2006

2005
Station Placement in Networks.
Parallel Processing Letters, 2005

A Tight Bound for Online Coloring of Disk Graphs.
Proceedings of the Structural Information and Communication Complexity, 2005

Network Load Games.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Basic Computations in Wireless Networks.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Optimal Embedding of the Hypercube on Partitioned Optical Passive Stars Networks.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

Geometric Clustering to Minimize the Sum of Cluster Sizes.
Proceedings of the Algorithms, 2005

2004
Efficient binary and grey level morphological operations on a massively parallel processor.
Parallel Algorithms Appl., 2004

Approximate constrained bipartite edge coloring.
Discrete Applied Mathematics, 2004

Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.
Proceedings of the STACS 2004, 2004

Online Algorithms for Disk Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Topic 13: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem.
Inf. Process. Lett., 2003

Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Simple On-Line Algorithms for Call Control in Cellular Networks.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Power Consumption Problems in Ad-Hoc Wireless Networks.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Energy-Efficient Wireless Network Design.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Topic Introduction.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002
Edge coloring of bipartite graphs with constraints.
Theor. Comput. Sci., 2002

Randomized path coloring on binary trees.
Theor. Comput. Sci., 2002

Efficient On-Line Frequency Allocation and Call Control in Cellular Networks.
Theory Comput. Syst., 2002

Station Layouts in the Presence of Location Constraints.
Journal of Interconnection Networks, 2002

New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
Inf. Process. Lett., 2002

Wavelength Routing in All-Optical Tree Networks: A Survey.
Bulletin of the EATCS, 2002

New Results for Energy-Efficient Broadcasting in Wireless Networks.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

A Parallel Solution in Texture Analysis Employing a Massively Parallel Processor (Research Note).
Proceedings of the Euro-Par 2002, 2002

2001
Sparse and limited wavelength conversion in all-optical tree networks.
Theor. Comput. Sci., 2001

Efficient primitive binary morphological algorithms on a massively parallel processor.
J. Electronic Imaging, 2001

Wavelength Routing in All-optical Tree Networks: A Survey.
Computers and Artificial Intelligence, 2001

Approximate Constrained Bipartite Edge Coloring.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals).
Proceedings of the STACS 2001, 2001

Recent Advances in Wavelength Routing.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies.
Proceedings of the SIROCCO 8, 2001

A hypercube parallel algorithm in texture analysis.
Proceedings of the Signal and Image Processing (SIP 2001), 2001

Bandwidth allocation in WDM tree networks.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Competitive Analysis of On-line Randomized Call Control in Cellular Networks.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Fractional Path Coloring with Applications to WDM Networks.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
A Hypercube Algorithm for Sliding Window Compression.
Parallel Processing Letters, 2000

Symmetric Communication in All-Optical Tree Networks.
Parallel Processing Letters, 2000

An efficient parallel algorithm for motion estimation in very low bit-rate video coding systems.
Concurrency - Practice and Experience, 2000

Efficient on-line communication in cellular networks.
SPAA, 2000

Greedy Dynamic Hot-Potato Routing on Arrays.
Proceedings of the 5th International Symposium on Parallel Architectures, 2000

fficient Binary Morphological Algorithms on a Massively Parallel Processor.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Efficient Automatic Simulation of Parallel Computation on Network of Workstations.
ICALP Satellite Workshops, 2000

Sliding-Window Compression on the Hypercube (Research Note).
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note).
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

Randomized path coloring on binary trees.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Optimal Wavelength Routing on Directed Fiber Trees.
Theor. Comput. Sci., 1999

Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks.
Proceedings of the Algorithm Engineering, 1999

Edge Coloring of Bipartite Graphs with Constraints.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Station Layouts in the Presence of Location Constraints.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Hierarchical Block Matching Motion Estimation on a Hypercube Multiprocessor.
Proceedings of the Parallel Computation, 1999

1998
Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees.
Proceedings of the SIROCCO'98, 1998

On the Complexity of Wavelength Converters.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Efficient wavelength routing in trees with low-degree converters.
Proceedings of the Multichannel Optical Networks: Theory and Practice, 1998

1997
New Graph Decompositions with Applications to Emulations.
Theory Comput. Syst., 1997

Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters.
Proceedings of the SIROCCO'97, 1997

Constrained Bipartite Edge Coloring with Applications to Wavelength Routing.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

An optimal greedy algorithm for wavelength allocation in directed tree networks.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996
Multipacket Hot-Potato Routing on Processor Arrays.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

Efficient Wavelength Routing on Directed Fiber Trees.
Proceedings of the Algorithms, 1996

1995
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors.
Mathematical Systems Theory, 1994

1993
New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies.
SPAA, 1993

Universal Emulations with Sublogarithmic Slowdown
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors.
SPAA, 1992

Simple Path Selection for Optimal Routing on Processor Arrays.
SPAA, 1992

Optimal Sorting on Mesh-Connected Processor Arrays.
SPAA, 1992

1991
Tight Bounds for Oblivious Routing in the Hypercube.
Mathematical Systems Theory, 1991

Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version).
SPAA, 1991

1990
Tight Bounds for Oblivious Routing in the Hypercube.
SPAA, 1990

Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990


  Loading...