Dimitris Fotakis

According to our database1, Dimitris Fotakis authored at least 101 papers between 1996 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Preface to Special Issue on Algorithms and Complexity.
Theor. Comput. Sci., 2019

2018
The Power of Verification for Greedy Mechanism Design.
J. Artif. Intell. Res., 2018

Opinion Dynamics with Limited Information.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Covering Clients with Types and Budgets.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Combinatorial Auctions Without Money.
Algorithmica, 2017

Resolving Braess's Paradox in Random Networks.
Algorithmica, 2017

Selfish Transportation Games.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Opinion Formation Games with Aggregation and Negative Influence.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Stathis Zachos at 70!
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Minimum Congestion Redundant Assignments.
Encyclopedia of Algorithms, 2016

Efficient Money Burning in General Domains.
Theory Comput. Syst., 2016

Strategyproof Facility Location for Concave Cost Functions.
Algorithmica, 2016

Conference Program Design with Single-Peaked and Single-Crossing Preferences.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Mechanism Design with Selective Verification.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Opinion Dynamics with Local Interactions.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

On the Size and the Approximability of Minimum Temporally Connected Subgraphs.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Scheduling MapReduce Jobs Under Multi-round Precedences.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
Truthfulness Flooded Domains and the Power of Verification for Mechanism Design.
ACM Trans. Economics and Comput., 2015

Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking.
Theory Comput. Syst., 2015

Efficient lineage for SUM aggregate queries.
AI Commun., 2015

Improving Selfish Routing for Risk-Averse Players.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Efficient Money Burning in General Domains.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

A Selective Tour Through Congestion Games.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

A Glimpse at Paul G. Spirakis.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

The Power of Verification for Greedy Mechanism Design.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
On the Power of Deterministic Mechanisms for Facility Location Games.
ACM Trans. Economics and Comput., 2014

On the efficiency of Influence-and-Exploit strategies for revenue maximization under positive externalities.
Theor. Comput. Sci., 2014

On the hardness of network design for bottleneck routing games.
Theor. Comput. Sci., 2014

Online Sum-Radii Clustering.
Theor. Comput. Sci., 2014

Influence Maximization in Switching-Selection Threshold Models.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Scheduling MapReduce Jobs on Unrelated Processors.
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

Combinatorial auctions without money.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Winner-imposing strategyproof mechanisms for multiple Facility Location games.
Theor. Comput. Sci., 2013

Strategyproof facility location with concave costs.
SIGecom Exchanges, 2013

Truthfulness Flooded Domains and the Power of Verification for Mechanism Design.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Resolving Braess's Paradox in Random Networks.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Strategyproof facility location for concave cost functions.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Stochastic Congestion Games with Risk-Averse Players.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Enumerating subgraph instances using map-reduce.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

On the Power of Deterministic Mechanisms for Facility Location Games.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Efficient methods for selfish network design.
Theor. Comput. Sci., 2012

The Impact of Social Ignorance on Weighted Congestion Games.
Theory Comput. Syst., 2012

On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

On the Hardness of Network Design for Bottleneck Routing Games.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Online Sum-Radii Clustering.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Memoryless facility location in one pass.
ACM Trans. Algorithms, 2011

Online and incremental algorithms for facility location.
SIGACT News, 2011

Externalities among Advertisers in Sponsored Search.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010
Atomic Congestion Games: Fast, Myopic and Concurrent.
Theory Comput. Syst., 2010

Stackelberg Strategies for Atomic Congestion Games.
Theory Comput. Syst., 2010

Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy.
Theory Comput. Syst., 2010

Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009
Dealing with Large Datasets Using an Artificial Intelligence Clustering Tool.
Proceedings of the Tools and Applications with Artificial Intelligence, 2009

The structure and complexity of Nash equilibria for a selfish routing game.
Theor. Comput. Sci., 2009

The Impact of Social Ignorance on Weighted Congestion Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Efficient Methods for Selfish Network Design.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Minimum Congestion Redundant Assignments.
Proceedings of the Encyclopedia of Algorithms, 2008

Atomic congestion games among coalitions.
ACM Trans. Algorithms, 2008

Cost-Balancing Tolls for Atomic Network Congestion Games.
Internet Mathematics, 2008

On the Competitive Ratio for Online Facility Location.
Algorithmica, 2008

Atomic Congestion Games: Fast, Myopic and Concurrent.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
A primal-dual algorithm for online non-uniform facility location.
J. Discrete Algorithms, 2007

Cost-Balancing Tolls for Atomic Network Congestion Games.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Stackelberg Strategies for Atomic Congestion Games.
Proceedings of the Algorithms, 2007

2006
Incremental algorithms for Facility Location and k-Median.
Theor. Comput. Sci., 2006

Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies.
J. Discrete Algorithms, 2006

Efficient heuristic algorithms for correcting the Cascade Vulnerability Problem for interconnected networks.
Computer Communications, 2006

Memoryless Facility Location in One Pass.
Proceedings of the STACS 2006, 2006

Atomic Congestion Games Among Coalitions.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Radiocoloring in planar graphs: Complexity and approximations.
Theor. Comput. Sci., 2005

Selfish unsplittable flows.
Theor. Comput. Sci., 2005

Space Efficient Hash Tables with Worst Case Constant Access Time.
Theory Comput. Syst., 2005

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

A Primal-Dual Algorithm for Online Non-uniform Facility Location.
Proceedings of the Advances in Informatics, 2005

2004
Selfish Unsplittable Flows.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Incremental Algorithms for Facility Location and k-Median.
Proceedings of the Algorithms, 2004

2003
An Evolutionary Computation Technique for User Profile Optimization.
I. J. Comput. Appl., 2003

Space Efficient Hash Tables with Worst Case Constant Access Time.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

On the Competitive Ratio for Online Facility Location.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Minimum Congestion Redundant Assignments to Tolerate Random Faults.
Algorithmica, 2002

Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Genetically determined variable structure multiple model estimation.
IEEE Trans. Signal Processing, 2001

Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem.
Bulletin of the EATCS, 2001

Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring.
Computers and Artificial Intelligence, 2001

An Evolutionary Computation Technique for User Profile Optimization.
Proceedings of the ISCA 3rd International Conference on Information Reuse and Integration, 2001

An Evolutionary Annealing Approach to Graph Coloring.
Proceedings of the Applications of Evolutionary Computing, 2001

2000
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999
Efficient Redundant Assignments under Fault-Tolerance Constraints.
Proceedings of the Randomization, 1999

Virtual European School - VES.
Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

1998
Random Walks, Conditional Hitting Sets and Partial Derandomization
Electronic Colloquium on Computational Complexity (ECCC), 1998

Graph Properties that Facilitate Travelling
Electronic Colloquium on Computational Complexity (ECCC), 1998

A Hamiltonian Approach to the Assignment of Non-reusable Frequencies.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997
Frequency assignment in mobile and radio networks.
Proceedings of the Networks in Distributed Computing, 1997

1996
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996


  Loading...