Dimitris Fotakis

According to our database1, Dimitris Fotakis authored at least 91 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Scheduling MapReduce Jobs on Identical and Unrelated Processors.
Theory Comput. Syst., 2020

Improving Selfish Routing for Risk-Averse Players.
Theory Comput. Syst., 2020

Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics.
CoRR, 2020

Mechanism Design for Perturbation Stable Combinatorial Auctions.
CoRR, 2020

Local Aggregation in Preference Games.
CoRR, 2020

Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

The Online Min-Sum Set Cover Problem.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Efficient Parameter Estimation of Truncated Boolean Product Distributions.
Proceedings of the Conference on Learning Theory, 2020

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

Opinion Formation Games with Aggregation and Negative Influence.
Theory Comput. Syst., 2019

Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games.
CoRR, 2019

Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Reallocating Multiple Facilities on the Line.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Optimal Learning of Mallows Block Model.
Proceedings of the Conference on Learning Theory, 2019

Malleable Scheduling Beyond Identical Machines.
Proceedings of the Approximation, 2019

A Bridge between Liquid and Social Welfare in Combinatorial Auctions with Submodular Bidders.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 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
Learning Powers of Poisson Binomial Distributions.
CoRR, 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


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

Who to Trust for Truthfully Maximizing Welfare?
CoRR, 2015

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

Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors.
Proceedings of the Experimental Algorithms - 14th 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: <i>PSPACE</i> -completeness and Approximations.
Proceedings of the Algorithms, Probability, Networks, and Games, 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

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

Strategyproof facility location with concave costs.
SIGecom Exch., 2013

Strategy-Proof Facility Location for Concave Cost Functions
CoRR, 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

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

The Impact of Social Ignorance on Weighted Congestion Games.
Theory Comput. Syst., 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

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

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

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

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

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

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

2006
Incremental algorithms for Facility Location and <i>k</i>-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.
Comput. Commun., 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

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

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

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

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

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

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

Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring.
Comput. Artif. Intell., 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...