Dimitris Fotakis | Academic Influence

Dimitris Fotakis's AcademicInfluence.com Rankings

Dimitris Fotakis

Computer Science

#1945

World Rank

#2021

Historical Rank

Database

#8974

World Rank

#9436

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Dimitris Fotakis's Degrees

PhD Computer Science National Technical University of Athens
Masters Computer Science National Technical University of Athens
Bachelors Computer Science National Technical University of Athens

Similar Degrees You Can Earn

Why Is Dimitris Fotakis Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Dimitris Fotakis is associate professor of Theoretical Computer Science at the National Technical University of Athens. He is a prominent researcher in the field of algorithmic game theory. Born and raised in Patras, he received a Computer Engineering Diploma and a PhD in Computer Science from the Department of Computer Engineering and Informatics, University of Patras, Greece. From September 2001 until September 2003, he was a Postdoctoral Researcher at the Max-Planck-Institut für Informatik, Algorithms and Complexity Group, Saarbrücken, Germany. Since February 2009, he has been a faculty member with the Division of Computer Science, School of Electrical and Computer Engineering, National Technical University of Athens, Greece.

(See a Problem?)

Dimitris Fotakis's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The structure and complexity of Nash equilibria for a selfish routing game (2002) (277)
Selfish unsplittable flows (2005) (236)
Space Efficient Hash Tables with Worst Case Constant Access Time (2003) (204)
Enumerating subgraph instances using map-reduce (2012) (134)
On the Competitive Ratio for Online Facility Location (2003) (113)
On the Power of Deterministic Mechanisms for Facility Location Games (2012) (93)
Atomic congestion games among coalitions (2006) (68)
Winner-imposing strategyproof mechanisms for multiple Facility Location games (2010) (63)
A primal-dual algorithm for online non-uniform facility location (2005) (60)
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost (2005) (60)
Stackelberg Strategies for Atomic Congestion Games (2007) (53)
Incremental algorithms for Facility Location and k-Median (2004) (50)
Online and incremental algorithms for facility location (2011) (50)
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy (2010) (41)
Cost-Balancing Tolls for Atomic Network Congestion Games (2007) (40)
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs (2000) (40)
Strategyproof Facility Location for Concave Cost Functions (2013) (37)
Frequency assignment in mobile and radio networks (1997) (36)
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users (2010) (31)
Stochastic Congestion Games with Risk-Averse Players (2013) (27)
Atomic Congestion Games: Fast, Myopic and Concurrent (2009) (25)
On the Size and the Approximability of Minimum Temporally Connected Subgraphs (2016) (23)
Memoryless facility location in one pass (2006) (23)
Combinatorial Auctions Without Money (2013) (22)
Efficient methods for selfish network design (2009) (20)
Virtual European School-VES (1999) (20)
Externalities among Advertisers in Sponsored Search (2011) (19)
A Hamiltonian Approach to the Assignment of Non-reusable Frequencies (1998) (19)
Opinion Dynamics with Local Interactions (2016) (18)
Radiocoloring in planar graphs: Complexity and approximations (2005) (17)
Truthfulness Flooded Domains and the Power of Verification for Mechanism Design (2013) (17)
The Impact of Social Ignorance on Weighted Congestion Games (2009) (15)
Improving Selfish Routing for Risk-Averse Players (2015) (14)
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse (2015) (13)
Optimal Learning of Mallows Block Model (2019) (12)
Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem (2001) (11)
On the efficiency of Influence-and-Exploit strategies for revenue maximization under positive externalities (2011) (10)
Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring (2001) (10)
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors (2013) (9)
Opinion Formation Games with Aggregation and Negative Influence (2018) (9)
Graph Properties that Facilitate Travelling (1998) (9)
A heuristic scheme for the recognition of progressive digital straight lines with unevenness (1988) (9)
Learning Augmented Online Facility Location (2021) (9)
Atomic Congestion Games: Fast, Myopic and Concurrent (2008) (8)
Assignment of Reusable and Non-Reusable Frequencies (2002) (8)
A microcoded RISC (1986) (8)
Resolving Braess’s Paradox in Random Networks (2017) (8)
Scheduling MapReduce Jobs Under Multi-round Precedences (2016) (7)
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent (2020) (7)
Reallocating Multiple Facilities on the Line (2019) (7)
A Selective Tour Through Congestion Games (2015) (7)
Malleable scheduling beyond identical machines (2019) (7)
Influence Maximization in Switching-Selection Threshold Models (2014) (6)
Who to Trust for Truthfully Maximizing Welfare? (2015) (6)
Strategyproof facility location with concave costs (2014) (6)
A Risc-Type Structural Design of the Hermes Multiprocessor Kernel (1987) (6)
Selfish Transportation Games (2017) (6)
Cost-Balancing Tolls for Atomic Network Congestion Games (2008) (6)
Metric-Distortion Bounds under Limited Information (2021) (5)
A RISC-bit-sliced design of the HERMES multilevel vision system (1988) (5)
The Power of Verification for Greedy Mechanism Design (2015) (5)
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP (1996) (5)
Mechanism Design with Selective Verification (2016) (5)
Private and Non-private Uniformity Testing for Ranking Data (2021) (5)
The Online Min-Sum Set Cover Problem (2020) (5)
On the hardness of network design for bottleneck routing games (2012) (5)
An interactive cooperative teleworking environment - telemethea (1996) (5)
Differentially Private Regression with Unbounded Covariates (2022) (5)
Opinion Dynamics with Limited Information (2018) (5)
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations (2002) (4)
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (2002) (4)
Efficient Online Scheduling of Electric Vehicle Charging Using a Service-Price Menu (2021) (4)
Conference Program Design with Single-Peaked and Single-Crossing Preferences (2016) (4)
Efficient Parameter Estimation of Truncated Boolean Product Distributions (2020) (4)
Efficient Algorithms for Learning from Coarse Labels (2021) (4)
A Bridge between Liquid and Social Welfare in Combinatorial Auctions with Submodular Bidders (2018) (4)
Aggregating Incomplete and Noisy Rankings (2020) (4)
Online Facility Location in Evolving Metrics (2021) (4)
Minimum Congestion Redundant Assignments to Tolerate Random Faults (2002) (4)
An Interactive Cooperative Teleworking Environment-Tηλε μ αθεια ∗ (1996) (3)
Efficient Money Burning in General Domains (2015) (3)
Scheduling MapReduce Jobs on Identical and Unrelated Processors (2019) (3)
Solving the (n 2 1)-Puzzle with 8 n 3 Expected Moves (2015) (3)
Major Principles on the Design of an Educational Network (1977) (3)
Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds (2021) (2)
Sampling Multiple Nodes in Large Networks: Beyond Random Walks (2021) (2)
Efficient Money Burning in General Domains (2016) (2)
Scheduling MapReduce Jobs on Unrelated Processors (2013) (2)
Resolving Braess’s Paradox in Random Networks (2013) (2)
Mechanism Design for Perturbation Stable Combinatorial Auctions (2020) (2)
Efficient Online Learning for Dynamic k-Clustering (2021) (2)
Efficient heuristic algorithms for correcting the Cascade Vulnerability Problem for interconnected networks (2006) (2)
Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds (2021) (1)
On Radiocoloring Hierarchically Specified Planar Graphs: \( \mathcal{P}\mathcal{S}\mathcal{P}\mathcal{A}\mathcal{C}\mathcal{E} \) -Completeness and Approximations (2002) (1)
Combinatorial and Global Optimization, Pp. ??{?? Assignment of Reusable and Non-reusable Frequencies (1998) (1)
Label Ranking through Nonparametric Regression (2021) (1)
Stochastic Opinion Dynamics for Interest Prediction in Social Networks (2021) (1)
Efficient Truthful Scheduling and Resource Allocation through Monitoring (2021) (1)
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games (2020) (1)
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics (2020) (1)
Asymptotically Optimal Communication in Simple Mechanisms (2020) (1)
An Interactive Cooperative Teleworking Environment (1996) (1)
Improving Selfish Routing for Risk-Averse Players (2019) (1)
Strategyproof Facility Location in Perturbation Stable Instances (2021) (1)
Combinatorial Auctions Without Money (2015) (1)
Identity testing for Mallows model (2021) (1)
The Maximum Latency of Unsplittable Flows in Capacitated Networks (2004) (1)
Graph Connectivity with Noisy Queries (2022) (1)
Formation Games with Aggregation and Negative Influence ? (2017) (0)
The Impact of Social Ignorance on Weighted Congestion Games (2011) (0)
HIPPOCRATES : A Tool for Distance Education (2000) (0)
Algorithmic Game Theory: 12th International Symposium, SAGT 2019, Athens, Greece, September 30 – October 3, 2019, Proceedings (2019) (0)
Local Aggregation in Preference Games (2020) (0)
On Radiocoloring Hierarchically Specified Planar Graphs: % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xf (2002) (0)
Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows (2019) (0)
Linear Label Ranking with Bounded Noise (2022) (0)
Learning Powers of Poisson Binomial Distributions (2017) (0)
Opinion Formation Games with Aggregation and Negative Influence (2018) (0)
A Constant-Factor Approximation for Generalized Malleable Scheduling under M♮-Concave Processing Speeds (2021) (0)
A Glimpse at Paul G. Spirakis (2015) (0)
Scheduling MapReduce Jobs on Identical and Unrelated Processors (2019) (0)
Linear Programming and Fast ParallelApproximability ? (2007) (0)
17 : 2 Malleable Scheduling Beyond Identical Machines 1 (2019) (0)
Object Allocation and Positive Graph Externalities (2020) (0)
Working Paper on Revenue Maximization in Generalized Deferred-Acceptance Auctions (2020) (0)
The Stru ture and Complexity of NashEquilibria for a Sel sh Routing Game ? (2002) (0)
Sampling and Optimal Preference Elicitation in Simple Mechanisms (2022) (0)
On the Approximability of Multistage Min-Sum Set Cover (2021) (0)
Special issue on algorithmic game theory (SAGT 2019) (2022) (0)
Covering Clients with Types and Budgets (2018) (0)
Efficient lineage for SUM aggregate queries (2013) (0)
A Mechanism Design and Learning Approach for Revenue Maximization on Cloud Dynamic Spot Markets (2021) (0)
Estimating the Number of Induced Subgraphs from Incomplete Data and Neighborhood Queries (2021) (0)
An Online Truthful Algorithm for Menu-Based Scheduling in Electric Vehicle Charging Networks (2022) (0)
Perfect Sampling from Pairwise Comparisons (2022) (0)
Obvious Strategyproofness, Bounded Rationality and Approximation (cid:63) The Case of Machine Scheduling (2019) (0)
Preface to Special Issue on Algorithmic Game Theory (2015) (0)
Petri-net modeling of the hermes multiprocessor vision system (1989) (0)
A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds (2021) (0)
Detecting and analysing the topology of the cosmic web with spatial clustering algorithms I: Methods (2022) (0)
Algorithmic Issues in Coalitional and Dynamic Network Games (2005) (0)
Who to Trust for Truthful Facility Location (2017) (0)
On the distortion of single winner elections with aligned candidates (2022) (0)
Random Bit Recycling , PCPs andthe Complexity of NP ? (2007) (0)
Graph Labelling and Assignment of Non-ReusableFrequencies ? (2007) (0)
Dimensionality and Coordination in Voting: The Distortion of STV (2022) (0)
Efficient Redundant Assignments under Fault-Tolerance Constraints (1999) (0)
M ay 2 01 9 Reallocating Multiple Facilities on the Line ∗ (2019) (0)
Solving Inverse Problems for Spectral Energy Distributions with Deep Generative Networks (2020) (0)
Escaping Braess's paradox through approximate Caratheodory's theorem (2022) (0)
Machine Partitioning and Scheduling under Fault-Tolerance Constraints (2000) (0)
Minimum Congestion Redundant Assignments (2016) (0)
An Upper Bound on Redundant AssignmentReliability ? (2007) (0)
Random Walks, Conditional Hitting Sets and Partial Derandomization (1998) (0)
Preface to Special Issue on Algorithms and Complexity (2019) (0)
Preface to Special Issue on Algorithmic Game Theory (2015) (0)
Stathis Zachos at 70! (2017) (0)
Strategyproof Facility Location for Concave Cost Functions (2015) (0)
Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games (2019) (0)
Dimensionality, Coordination, and Robustness in Voting (2021) (0)
Multilingual implementations of OSI applications (2000) (0)
Correction to: Algorithmic Game Theory (2019) (0)
Algorithms and Complexity (2015) (0)

This paper list is powered by the following services:

Other Resources About Dimitris Fotakis

What Schools Are Affiliated With Dimitris Fotakis?

Dimitris Fotakis is affiliated with the following schools:

Image Attributions

Image Source for Dimitris Fotakis