Mohammad Hajiaghayi | Academic Influence

Mohammad Hajiaghayi's AcademicInfluence.com Rankings

Mohammad Hajiaghayi

Computer Science

#874

World Rank

#906

Historical Rank

Database

#3491

World Rank

#3637

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Mohammad Hajiaghayi's Degrees

PhD Computer Science University of Maryland, College Park
Masters Computer Science University of Maryland, College Park
Bachelors Computer Engineering Sharif University of Technology

Similar Degrees You Can Earn

Why Is Mohammad Hajiaghayi Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Mohammad Taghi Hajiaghayi is a computer scientist known for his work in algorithms, game theory, social networks, network design, graph theory, and big data. He has over 200 publications with over 185 collaborators and 10 issued patents.

(See a Problem?)

Mohammad Hajiaghayi'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

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs (2005) (309)
Improved approximation algorithms for minimum-weight vertex separators (2005) (271)
Deploying sensor networks with guaranteed capacity and fault tolerance (2005) (222)
The Bidimensionality Theory and Its Algorithmic Applications (2008) (222)
Algorithmic graph minor theory: Decomposition, approximation, and coloring (2005) (208)
Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks (2002) (202)
Adaptive limited-supply online auctions (2004) (196)
Automated Online Mechanism Design and Prophet Inequalities (2007) (185)
Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks (2003) (176)
Bidimensionality: new connections between FPT algorithms and PTASs (2005) (175)
Online auctions with re-usable goods (2005) (174)
Regret minimization and the price of total anarchy (2008) (169)
To Cache or Not to Cache: The 3G Case (2011) (160)
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs (2005) (157)
Submodular secretary problem and extensions (2010) (152)
Combination can be hard: approximability of the unique coverage problem (2006) (151)
Cell Breathing in Wireless LANs: Algorithms and Evaluation (2007) (146)
Minimizing movement (2007) (146)
Fair Allocation of Indivisible Goods: Improvements and Generalizations (2017) (144)
Linearity of grid minors in treewidth with applications through bidimensionality (2008) (136)
Network-aware forward caching (2009) (125)
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP (2009) (117)
The facility location problem with general cost functions (2003) (116)
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs (2004) (115)
Online prophet-inequality matching with applications to ad allocation (2012) (113)
Deploying Sensor Networks With Guaranteed Fault Tolerance (2010) (111)
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema (2006) (108)
The price of anarchy in network creation games (2007) (107)
Random MAX SAT, random MAX CUT, and their phase transitions (2003) (105)
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams (2016) (102)
Prophet Secretary for Combinatorial Auctions and Matroids (2017) (98)
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design (2006) (92)
Oblivious network design (2006) (92)
Approximation algorithms via contraction decomposition (2007) (91)
Bidimensional Parameters and Local Treewidth (2004) (90)
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth (2009) (90)
Equivalence of local treewidth and linear local treewidth and its algorithmic applications (2004) (84)
Designing FPT Algorithms for Cut Problems Using Randomized Contractions (2012) (82)
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond (2015) (80)
Affinity Clustering: Hierarchical Clustering at Scale (2017) (79)
Basic network creation games (2010) (79)
Prophet Secretary (2015) (77)
Hat Guessing Games (2008) (75)
Improved Approximation Algorithms for Minimum Weight Vertex Separators (2008) (73)
LP Rounding for k-Centers with Non-uniform Hard Capacities (2012) (72)
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (2009) (72)
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce (2018) (68)
Parameterized Streaming: Maximal Matching and Vertex Cover (2015) (67)
IBM Research Report The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 (2003) (66)
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset (2011) (66)
Beating 1-1/e for ordered prophets (2017) (66)
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality (2005) (61)
Fair Allocation of Indivisible Goods to Asymmetric Agents (2017) (61)
Diameter and Treewidth in Minor-Closed Graph Families, Revisited (2004) (60)
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games (2016) (60)
Contraction decomposition in h-minor-free graphs and algorithmic applications (2011) (57)
The Bidimensional Theory of Bounded-Genus Graphs (2004) (56)
Power optimization for connectivity problems (2005) (55)
Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses (2009) (55)
PACE: Policy-Aware Application Cloud Embedding (2013) (54)
Scheduling to minimize gaps and power consumption (2007) (54)
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (2004) (53)
Fixed-Parameter and Approximation Algorithms: A New Look (2013) (53)
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors (2005) (52)
L22 Spreading Metrics for Vertex Ordering Problems (2006) (51)
The Online Stochastic Generalized Assignment Problem (2013) (51)
Exponentially Faster Massively Parallel Maximal Matching (2019) (50)
Improved Approximation Algorithms for Label Cover Problems (2011) (49)
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location (2009) (48)
Network Cournot Competition (2014) (46)
Dial a Ride from k-forest (2007) (46)
How to influence people with partial incentives (2014) (46)
Low-Dimensional Embedding with Extra Information (2004) (46)
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time (2019) (45)
The Cooperative Game Theory Foundations of Network Bargaining Games (2010) (44)
Improved lower and upper bounds for universal TSP in planar metrics (2006) (43)
The price of anarchy in cooperative network creation games (2009) (43)
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game (2016) (43)
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth (2004) (41)
Balanced vertex-orderings of graphs (2005) (41)
Oblivious routing on node-capacitated and directed graphs (2005) (41)
A Fast Vision System for Middle Size Robots in RoboCup (2001) (40)
Massively Parallel Computation of Matching and MIS in Sparse Graphs (2019) (39)
Brief Announcement: Semi-MapReduce Meets Congested Clique (2018) (38)
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks (2007) (38)
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth (2002) (37)
Revenue Maximization for Selling Multiple Correlated Items (2014) (36)
A note on the Consecutive Ones Submatrix problem (2002) (35)
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction (2009) (35)
Prize-collecting Steiner problems on planar graphs (2011) (35)
Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond (2015) (31)
ℓ22 Spreading Metrics for Vertex Ordering Problems (2010) (31)
Local Search Algorithms for the Red-Blue Median Problem (2012) (31)
Envy-free Chore Division for An Arbitrary Number of Agents (2018) (31)
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics (2005) (31)
Approximation algorithms for node-weighted buy-at-bulk network design (2007) (30)
News Posting by Strategic Users in a Social Network (2009) (30)
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median (2013) (30)
RoboCup-2001: The Fifth Robotic Soccer World Championships (2002) (30)
Threshold compression for 3G scalable monitoring (2012) (29)
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees (2006) (29)
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems (2013) (28)
Oblivious routing in directed graphs with random demands (2005) (27)
Approximating LCS in Linear Time: Beating the √n Barrier (2019) (27)
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (2014) (27)
Minimizing Movement: Fixed-Parameter Tractability (2009) (27)
Online Node-Weighted Steiner Forest and Extensions via Disk Paintings (2013) (26)
Budgeted Red-Blue Median and Its Generalizations (2010) (26)
Decomposition, approximation, and coloring of odd-minor-free graphs (2010) (26)
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs (2003) (26)
Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping (2006) (26)
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence (2019) (25)
Prize-collecting steiner network problems (2010) (25)
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs (2002) (25)
The Minimum k-Colored Subgraph Problem in Haplotyping and DNA Primer Selection (2004) (24)
Approximate Maximum Matching in Random Streams (2019) (24)
A polynomial-time approximation scheme for planar multiway cut (2012) (24)
The price of anarchy in network creation games (2012) (23)
Finding Large Matchings in Semi-Streaming (2016) (22)
Efficient and practical resource block allocation for LTE-based D2D network via graph coloring (2014) (22)
Fast algorithms for knapsack via convolution and prediction (2018) (21)
Kernelization via Sampling with Applications to Dynamic Graph Streams (2015) (21)
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction (2008) (21)
Stochastic Matching with Few Queries: New Algorithms and Tools (2018) (21)
Stochastic k-Server: How Should Uber Work? (2017) (20)
Stochastic matching with few queries: (1-ε) approximation (2020) (20)
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction (2006) (20)
New lower bounds for oblivious routing in undirected graphs (2006) (19)
An O ( √ n )-Approximation Algorithm For Directed Sparsest Cut (2005) (19)
A Theory of Loss-Leaders: Making Money by Pricing Below Cost (2007) (19)
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems (2014) (18)
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (2009) (18)
Approximation Algorithms for Connected Maximum Cut and Related Problems (2015) (18)
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor (2002) (17)
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games (2018) (17)
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching (2018) (17)
New Streaming Algorithms for Parameterized Maximal Matching & Beyond (2015) (17)
Optimal Strategies of Blotto Games: Beyond Convexity (2019) (16)
Online Pandora's Boxes and Bandits (2019) (16)
Lower bounds for external memory integer sorting via network coding (2018) (16)
On the max-flow min-cut ratio for directed multicommodity flows (2006) (15)
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (2007) (15)
Quickly deciding minor-closed parameters in general graphs (2007) (15)
Prize-Collecting Steiner Networks via Iterative Rounding (2010) (15)
Stochastic Steiner Tree with Non-uniform Inflation (2007) (15)
On the simultaneous edge-coloring conjecture (2000) (14)
Bi-Covering: Covering Edges with Two Small Subsets of Vertices (2016) (14)
Disjoint-Path Facility Location: Theory and Practice (2011) (14)
Online client-server load balancing without global information (2005) (14)
Streaming and Massively Parallel Algorithms for Edge Coloring (2019) (14)
Beating Ratio 0.5 for Weighted Oblivious Matching Problems (2016) (13)
Palindrome recognition using a multidimensional tape (2003) (12)
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (2010) (12)
An O(sqrt(n))-approximation algorithm for directed sparsest cut (2006) (12)
Euclidean Prize-Collecting Steiner Forest (2009) (12)
AdCell: Ad Allocation in Cellular Networks (2011) (12)
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk (2005) (12)
Correction: Basic Network Creation Games (2014) (12)
Semi-oblivious routing: lower bounds (2007) (11)
How effectively can we form opinions? (2014) (11)
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting (2016) (11)
Algorithms for Graphs of (Locally) Bounded Treewidth (2001) (10)
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best (2019) (10)
Fair Allocation of Indivisible Goods: Improvement (2021) (10)
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (2014) (10)
1+ε approximation of tree edit distance in quadratic time (2019) (10)
Plane Embeddings of Planar Graph Metrics (2006) (10)
The Generalized Deadlock Resolution Problem (2005) (10)
Greedy Algorithms for Online Survivable Network Design (2018) (10)
Capacitated Metric Labeling (2011) (9)
The checkpoint problem (2010) (9)
Stochastic Matching on Uniformly Sparse Graphs (2019) (9)
09511 Open Problems - Parameterized complexity and approximation algorithms (2009) (9)
The Foundations of Fixed Parameter Inapproximability (2013) (9)
Online Degree-Bounded Steiner Network Design (2016) (8)
A Polynomial Time Algorithm for Spatio-Temporal Security Games (2017) (8)
Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT (2013) (8)
Computing Stackelberg Equilibria of Large General-Sum Games (2019) (8)
On the Complexity of Chore Division (2017) (8)
Online Stochastic Reordering Buffer Scheduling (2014) (8)
Combinatorial Algorithms for Capacitated Network Design (2011) (8)
Spatio-Temporal Games Beyond One Dimension (2018) (8)
Prize-collecting Network Design on Planar Graphs (2010) (8)
Semi-MapReduce Meets Congested Clique (2018) (7)
A note on the bounded fragmentation property and its applications in network reliability (2003) (7)
Bidimensionality, Map Graphs, and Grid Minors (2005) (7)
A Goal Keeper for Middle Size RoboCup (2000) (7)
A greedy approximation algorithm for minimum-gap scheduling (2013) (7)
Multi-VPN Optimization for Scalable Routing via Relaying (2009) (7)
Parameterized Complexity of Problems in Coalitional Resource Games (2011) (6)
Parameterized Streaming Algorithms for Vertex Cover (2014) (6)
Towards an efficient algorithmic framework for pricing cellular data service (2011) (6)
Dial a Ride from k -Forest (2007) (6)
Additive approximation algorithms for list-coloring minor-closed class of graphs (2009) (6)
On maximum leaf trees and connections to connected maximum cut problems (2018) (6)
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering (2017) (6)
Scheduling a Cascade with Opposing Influences (2013) (6)
RANDOM MAX 2-SAT AND MAX CUT (2003) (6)
Hierarchical graph partitioning (2014) (6)
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (2001) (6)
On Fixed Cost k-Flow Problems (2013) (5)
A game-theoretic model motivated by the darpa network challenge (2012) (5)
Automated Generation of Counterterrorism Policies Using Multiexpert Input (2015) (5)
The polarizing effect of network influences (2014) (5)
Brief Announcement: MapReduce Algorithms for Massive Trees (2018) (5)
Massively Parallel Dynamic Programming on Trees (2018) (5)
PREVE: A Policy Recommendation Engine based on Vector Equilibria applied to reducing LeT's attacks (2013) (5)
Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS (2020) (5)
Forming external behaviors by leveraging internal opinions (2015) (5)
Approximating Buy-at-Bulk k-Steiner trees (2005) (5)
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) (2013) (5)
MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond (2019) (5)
Fair allocation of indivisible goods: Beyond additive valuations (2021) (5)
Approximate Deadline-Scheduling with Precedence Constraints (2015) (5)
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond (2018) (4)
Approximation Schemes for Planar Graph Problems (2016) (4)
Deploying Sensor Nets with Guaranteed Capacity and Fault Tolerance (4)
Capacitated Network Design Problems : Hardness , Approximation Algorithms , and Connections to Group Steiner Tree ∗ (2012) (4)
Differentially Private Densest Subgraph (2021) (4)
Frugal Auction Design for Set Systems: Vertex Cover and Knapsack (2018) (4)
Price of Competition and Dueling Games (2016) (4)
On Distributed Hierarchical Clustering (2017) (4)
HyperCubeMap: Optimal social network ad allocation using hyperbolic embedding (2015) (3)
Bandwidth Sharing Network Design for Multi-Class Traffic (2006) (3)
Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs (2016) (3)
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings (2020) (3)
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence (2021) (3)
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs (2016) (3)
Bidimensional Structures: Algorithms, Combinatorics and Logic (2013) (3)
The Facility Location Problem with Concave Cost Functions (2002) (3)
Multi-VPN Optimization for Scalable Routing via Relaying (2009) (3)
On a Local Protocol for Concurrent File Transfers (2011) (3)
Length‐constrained path‐matchings in graphs (2002) (3)
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs (2018) (2)
Selling Tomorrow's Bargains Today (2015) (2)
String Matching with Wildcards in the Massively Parallel Computation Model (2019) (2)
Lower bounds for external memory integer sorting via network coding (2020) (2)
Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems (2019) (2)
Topics in Theoretical Computer Science (2015) (2)
Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees (2021) (2)
Prophet Inequality and Online Auctions (2016) (2)
Approximation Algorithms for Movement Repairmen (2013) (2)
Inverse Feature Learning: Feature Learning Based on Representation Learning of Error (2020) (2)
FluTCHA: Using Fluency to Distinguish Humans from Computers (2015) (2)
On the Efficiency and Equilibria of Rich Ads (2019) (2)
Randomized Revenue Monotone Mechanisms for Online Advertising (2014) (2)
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance (2022) (1)
Market Pricing for Data Streams (2017) (1)
A Technique for Improving Approximation Algorithms for Prize-Collecting Problems (2008) (1)
Online Job Scheduling Mechanisms : How Bad are Restarts ? (2010) (1)
Bandit Social Learning: Exploration under Myopic Behavior (2023) (1)
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (2016) (1)
On the Fixed Cost k-Flow Problem and related problems (2013) (1)
A note on the subadditive network design problem (2009) (1)
FPT hardness for Clique and Set Cover with super exponential time in k (2017) (1)
Adaptive Massively Parallel Algorithms for Cut Problems (2022) (1)
Characterization of networks supporting multi-dimensional linear interval routing schemes (2004) (1)
Scalable monitoring via threshold compression in a large operational 3G network (2011) (1)
Improved communication complexity of fault-tolerant consensus (2022) (1)
Semi-oblivious routing (2006) (1)
Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees (2020) (1)
Parameterized complexity and approximation algorithms Dagstuhl Seminar (2010) (1)
Analysis of a Learning Based Algorithm for Budget Pacing (2022) (1)
Adaptive Massively Parallel Constant-round Tree Contraction (2021) (1)
Massively Parallel Algorithms for String Matching with Wildcards (2019) (1)
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks (2021) (1)
Social network ad allocation and optimization: a geometric mapping-based approach (2016) (1)
Euclidean Prize-Collecting Steiner Forest (2011) (1)
Online Algorithms for the Santa Claus Problem (2022) (1)
Efficient and practical resource block allocation for LTE-based D2D network via graph coloring (2013) (1)
Comparing of SGML documents (2001) (1)
Optimal Algorithms for Free Order Multiple-Choice Secretary (2022) (1)
On Fixed Cost k-Flow Problems (2014) (1)
Fixed-parameter algorithms for minor-closed graphs ( of locally bounded treewidth ) ? (1)
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (2017) (1)
09511 Abstracts Collection - Parameterized complexity and approximation algorithms (2009) (1)
Title of Thesis Promised Streaming Algorithms and Finding Pseudo-repetitions Promised Streaming Algorithms and Finding Pseudo-repetitions (0)
On the Integrality Gap of the Directed-Component Relaxation for Steiner Tree (2011) (0)
CMSC 858 F : Algorithmic Lower Bounds : Fun with Hardness Proofs Fall 2014 (2014) (0)
Entropy-Optimal Algorithms for Multiple-Choice Secretary (2021) (0)
Approximation Algorithms via Contraction DecompositionA preliminary version of this paper appears in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2007 (2010) (0)
Clustering algorithms in PBS (0)
CMSC 858 M : Fun with Hardness Spring (2021) (0)
Foreword to special issue on SODA 2008 (2010) (0)
Using the PCP for proving Fixed parameter inapproximability (2016) (0)
CMSC 858 F : Algorithmic Lower Bounds Fall 2014 Parameterized reductions and assumptions Instructor (2014) (0)
Reducing the Optimum : Fixed Parameter Inapproximability for Clique and Set Cover in Time Super-exponential in Optimum (2014) (0)
Reducing the optimum : superexponential in opt time , Fixed parameter inapproximability for clique and setcover (2013) (0)
Beating Approximation Factor 2 for Minimum k-way Cut in Planar and Minor-free Graphs (2019) (0)
Session details: KEYNOTE LECTURE 2 (2017) (0)
CMSC 858F: Algorithmic Lower Bounds: Fun with Hardness Proofs Fall 2014 Quadratic Hardness and the 3-SUM Problem (2014) (0)
Probabilistic embedding into trees : definitions and applications (2011) (0)
M ay 2 01 8 On the Complexity of Chore Division (2018) (0)
Competitive Algorithms for Ad Allocation in Cellular Networks ( AdCell ) ? (2014) (0)
CMSC 858M: Algorithmic Lower Bounds Spring 2021 Chapter 3: NP-Hardness Via SAT and Planar SAT (2021) (0)
09511 Executive Summary - Parameterized complexity and approximation algorithms (2009) (0)
CMSC 858 F : Algorithmic Game Theory Fall 2010 Introduction to Algorithmic Game Theory Instructor : (2010) (0)
Approximating LCS in Linear Time: Beating the $\sqrt{n}$ Barrier (2020) (0)
Two is Better Than One: Dual Embeddings for Complementary Product Recommendations (2022) (0)
CMSC 858 F : Algorithmic Game Theory Spring 2014 Dueling Games (2014) (0)
Network Design and Game Theory Spring 2011 Lecture 6 Instructor : (2008) (0)
A greedy approximation algorithm for minimum-gap scheduling (2016) (0)
Introduction to the Special Issue for SPAA’17 (2019) (0)
Session details: KEYNOTE LECTURE 1 (2017) (0)
Algorithmic Lower Bounds - Assignment 1 (2021) (0)
A PTAS for Planar Group Steiner Tree via Bootstrapping Approximation (2016) (0)
Optimal Sparse Recovery with Decision Stumps (2023) (0)
CMSC 858 F : Algorithmic Game Theory Fall 2010 Frugality ( Cont . ) , Adwords Auctions (2010) (0)
Approximation Algorithms for Network Design Problems with Node Weights (2009) (0)
Network Creation Games (2016) (0)
CMSC 858F: Algorithmic Lower Bounds Fall 2014 Parameterized reductions and assumptions (2014) (0)
Framework for Efficient Algorithms in Planar Networks and Beyond (2012) (0)
Basic Network Creation Games Citation (2010) (0)
Network Design Foundation Homework 2 -solution (2015) (0)
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring (2019) (0)
The Submodular Secretary Problem MohammadHossein Bateni (2009) (0)
Research Statement : Network design , ( Wireless ) Networking , and Game Theory (2006) (0)
PIE: A Data-Driven Payoff Inference Engine for Strategic Security Applications (2020) (0)
Tight Bounds For Random MAX 2-SAT (2006) (0)
Subcubic Equivalences Between APSP , Co-Diameter , and Other Complementary Problems ∗ † (2016) (0)
On a Local Protocol for Concurrent File Transfers (2013) (0)
Asymmetric Streaming Algorithms for Edit Distance and LCS (2020) (0)
Bargaining Networks (2016) (0)
Online Auctions with Re-usable Goods The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters (2005) (0)
CMSC 858 F : Algorithmic Game Theory Fall 2010 Frugality & Profit Maximization in Mechanism Design Instructor : (2010) (0)
Erratum to: Editorial (2015) (0)
CMSC 858 F : Algorithmic Game Theory Fall 2010 Achieving Byzantine Agreement and Broadcast against Rational Adversaries Instructor : (2010) (0)
CMSC 858 F : Algorithmic Lower Bounds Fall 2014 Puzzles and Reductions from 3-Partition Instructor : (2014) (0)
CMSC 858 F : Algorithmic Lower Bounds Fall 2014 Introduction to Algorithmic Game Theory (2014) (0)
Vertex-Orderings of GraphsTherese Biedl (2007) (0)
Using the PCP to prove fixed parameter hardness (2017) (0)
Generalized Stochastic Matching (2022) (0)
Network Design and Game Theory Spring 2008 Lecture 6 (2008) (0)
Weighted Edit Distance Computation: Strings, Trees and Dyck (2023) (0)
Social network ad allocation and optimization: a geometric mapping-based approach (2016) (0)
Newsletter of the PC Community November 2011 Welcome (0)
Editorial (2015) (0)
Submodular secretary problems with extensions (2013) (0)
Localized Client-Server Load Balancing without Global Information (2007) (0)
Erratum to: Editorial (2015) (0)
CMSC 858F: Algorithmic Lower Bounds: Fun with Hardness Proofs Fall 2014 Fixed Parameter Algorithms and Lower Bounds for parameterized Problems (2014) (0)
CMSC 858M: Algorithmic Lower Bounds Spring 2021 Chapter 16: Beyond PSPACE (2022) (0)
Approximation algorithms for lasses of graphsex luding single-rossing graphs as minors ? (2007) (0)
Stochastic Matching with Few Queries: $(1-\varepsilon)$ Approximation (2020) (0)
CMSC 858M: Algorithmic Lower Bounds Spring 2021 Chapter 1: Computational Complexity Crash Course (2021) (0)
$\tilde{O}(n+\mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance (2022) (0)
CMSC 858F: Algorithmic Lower Bounds Fall 2014 Puzzles and Reductions from 3-Partition (2014) (0)
Local Search Algorithms for the Red-Blue Median Problem (2011) (0)
On Euclidean Prize-collecting Steiner Forest Problems (2009) (0)
Local Search for Red-Blue Median and its Generalizations (2011) (0)
Fixed parameter inapproximability for Clique and Set-Cover with super exponential time in k (2014) (0)
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (2022) (0)
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost (2022) (0)
Efficient Algorithmic Frameworks via Structural Graph Theory (2016) (0)
A rigorous paradigm for proving Fixed Parameter Inapproximability via gap reductions (2015) (0)
Scheduling to minimize gaps and power consumption (2013) (0)
Network Design and Game Theory Spring 2008 Lecture 4 (2008) (0)
CMSC 858 F : Algorithmic Lower Bounds Fall 2014 3SAT and NP-Hardness Instructor (2014) (0)
Budgeted Red-Blue Median ∗ (2009) (0)
CMSC 858 F : Algorithmic Game Theory Fall 2010 Complexity of finding Nash equilibrium : PPAD completeness results Instructor (2010) (0)

This paper list is powered by the following services:

Other Resources About Mohammad Hajiaghayi

en.wikipedia.org

What Schools Are Affiliated With Mohammad Hajiaghayi?

Mohammad Hajiaghayi is affiliated with the following schools:

Image Attributions

Image Source for Mohammad Hajiaghayi