Mohammad Hajiaghayi

Thomas Kesselheim

Sahil Singla

SIAM J. Comput., 2024

Fairness and Efficiency in Online Class Matching.

[BibT_eX]

[DOI]

CoRR, 2024

Gains-from-Trade in Bilateral Trade with a Broker.

[BibT_eX]

[DOI]

Ilya Hajiaghayi

Gary Peng

CoRR, 2024

Dynamic Metric Embedding into ℓp Space.

[BibT_eX]

[DOI]

CoRR, 2024

Ad Auctions for LLMs via Retrieval Augmented Generation.

[BibT_eX]

[DOI]

Sébastien Lahaie

Keivan Rezaei

CoRR, 2024

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?

[BibT_eX]

[DOI]

Mohammad Hajiaghayi

CoRR, 2024

Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting.

[BibT_eX]

[DOI]

Simina Brânzei

Reed Phillips

Kun Wang

CoRR, 2024

Prize-Collecting Steiner Tree: A 1.79 Approximation.

[BibT_eX]

[DOI]

Ali Ahmadi

Iman Gholami

Mohammad Mahdavi

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC.

[BibT_eX]

[DOI]

Debarati Das

Tomasz Kociumaka

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Power of Posted-price Mechanisms for Prophet Inequalities.

[BibT_eX]

[DOI]

Piotr Krysta

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Dynamic Algorithms for Matroid Submodular Maximization.

[BibT_eX]

[DOI]

Leyla Biabani

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2-Approximation for Prize-Collecting Steiner Forest.

[BibT_eX]

[DOI]

Ali Ahmadi

Iman Gholami

Mohammad Mahdavi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?

[BibT_eX]

[DOI]

Mohammad Hajiaghayi

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Online Sampling and Decision Making with Low Entropy.

[BibT_eX]

[DOI]

Piotr Krysta

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Dynamic Metric Embedding into lp Space.

[BibT_eX]

[DOI]

Dariusz Rafal Kowalski

Proceedings of the Forty-first International Conference on Machine Learning, 2024

A Dynamic Algorithm for Weighted Submodular Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Regret Analysis of Repeated Delegated Choice.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Exponentially Faster Massively Parallel Maximal Matching.

[BibT_eX]

[DOI]

David G. Harris

J. ACM, October, 2023

Fast and Simple Solutions of Blotto Games.

[BibT_eX]

[DOI]

Oper. Res., March, 2023

Replication-proof Bandit Mechanism Design.

[BibT_eX]

[DOI]

Seyed A. Esmaeili

CoRR, 2023

Online Advertisements with LLMs: Opportunities and Challenges.

[BibT_eX]

[DOI]

Soheil Feizi

Keivan Rezaei

CoRR, 2023

Fault-Tolerant Consensus in Quantum Networks.

[BibT_eX]

[DOI]

CoRR, 2023

Bandit Social Learning: Exploration under Myopic Behavior.

[BibT_eX]

[DOI]

Aleksandrs Slivkins

CoRR, 2023

Weighted Edit Distance Computation: Strings, Trees, and Dyck.

[BibT_eX]

[DOI]

Debarati Das

Tomasz Kociumaka

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Location-Sensitive String Problems in MPC.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Brief Announcement: Regular and Dyck Languages in MPC.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Massively Parallel Tree Embeddings for High Dimensional Spaces.

[BibT_eX]

[DOI]

AmirMohsen Ahanchi

Alexandr Andoni

Peilin Zhong

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Delegating to Multiple Agents.

[BibT_eX]

[DOI]

Keivan Rezaei

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Trading Prophets.

[BibT_eX]

[DOI]

José Correa

Andrés Cristi

Paul Duetting

Kevin Schewior

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Brief Announcement: Improved Consensus in Quantum Networks.

[BibT_eX]

[DOI]

Dariusz Rafal Kowalski

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Fair, Polylog-Approximate Low-Cost Hierarchical Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Bandit Social Learning under Myopic Behavior.

[BibT_eX]

[DOI]

Aleksandrs Slivkins

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Dynamic Non-monotone Submodular Maximization.

[BibT_eX]

[DOI]

Leyla Biabani

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time.

[BibT_eX]

[DOI]

Leyla Biabani

Proceedings of the International Conference on Machine Learning, 2023

Analysis of a Learning Based Algorithm for Budget Pacing.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Optimal Sparse Recovery with Decision Stumps.

[BibT_eX]

[DOI]

Mohammad Hajiaghayi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier.

[BibT_eX]

[DOI]

Saeedreza Seddighin

SIAM J. Comput., August, 2022

Optimal Algorithms for Free Order Multiple-Choice Secretary.

[BibT_eX]

[DOI]

Piotr Krysta

CoRR, 2022

Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost.

[BibT_eX]

[DOI]

CoRR, 2022

Fair allocation of indivisible goods: Beyond additive valuations.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Improved communication complexity of fault-tolerant consensus.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Adaptive Massively Parallel Algorithms for Cut Problems.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Online Algorithms for the Santa Claus Problem.

[BibT_eX]

[DOI]

Debmalya Panigrahi

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Adaptive Massively Parallel Constant-Round Tree Contraction.

[BibT_eX]

[DOI]

Hsin-Hao Su

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Two is Better Than One: Dual Embeddings for Complementary Product Recommendations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Knowledge Graph, 2022

Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance.

[BibT_eX]

[DOI]

Debarati Das

Tomasz Kociumaka

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Differentially Private Densest Subgraph.

[BibT_eX]

[DOI]

Elaine Shi

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Generalized Stochastic Matching.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Fair Allocation of Indivisible Goods: Improvement.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce.

[BibT_eX]

[DOI]

Mahdi Boroujeni

J. ACM, 2021

Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees.

[BibT_eX]

[DOI]

CoRR, 2021

String Matching with Wildcards in the Massively Parallel Computation Model.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.

[BibT_eX]

[DOI]

Kuan Cheng

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Scalable Equilibrium Computation in Multi-agent Influence Games on Networks.

[BibT_eX]

[DOI]

Fotini Christia

Michael J. Curry

Constantinos Daskalakis

Adam Hesterberg

Aidan Milliff

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings.

[BibT_eX]

[DOI]

Mohamad Latifian

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

PIE: A Data-Driven Payoff Inference Engine for Strategic Security Applications.

[BibT_eX]

[DOI]

Haipeng Chen

IEEE Trans. Comput. Soc. Syst., 2020

Approximation algorithms for connected maximum cut and related problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).

[BibT_eX]

[DOI]

Andreas Emil Feldmann

SIAM J. Comput., 2020

Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs.

[BibT_eX]

[DOI]

Mauricio G. C. Resende

Oper. Res., 2020

Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS.

[BibT_eX]

[DOI]

Aviad Rubinstein

CoRR, 2020

Lower bounds for external memory integer sorting via network coding.

[BibT_eX]

[DOI]

Kasper Green Larsen

Elaine Shi

Commun. ACM, 2020

Inverse Feature Learning: Feature Learning Based on Representation Learning of Error.

[BibT_eX]

[DOI]

Behzad Ghazanfari

Fatemeh Afghah

IEEE Access, 2020

Stochastic matching with few queries: (1-ε) approximation.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Approximate Maximum Matching in Random Streams.

[BibT_eX]

[DOI]

Tung Mai

Anup Rao

Ryan A. Rossi

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Prophets, Secretaries, and Maximizing the Probability of Choosing the Best.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Introduction to the Special Issue for SPAA'17.

[BibT_eX]

[DOI]

Mohammad Hossein Bateni

Silvio Lattanzi

ACM Trans. Parallel Comput., 2019

From Duels to Battlefields: Computing Equilibria of Blotto and Other Games.

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

Math. Oper. Res., 2019

Fair Allocation of Indivisible Goods to Asymmetric Agents.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Massively Parallel Algorithms for String Matching with Wildcards.

[BibT_eX]

[DOI]

CoRR, 2019

Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems.

[BibT_eX]

[DOI]

Mahdi Boroujeni

CoRR, 2019

MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond.

[BibT_eX]

[DOI]

Silvio Lattanzi

Cliff Stein

CoRR, 2019

Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

1+ε approximation of tree edit distance in quadratic time.

[BibT_eX]

[DOI]

Mahdi Boroujeni

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Approximating LCS in Linear Time: Beating the √n Barrier.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Stochastic Matching with Few Queries: New Algorithms and Tools.

[BibT_eX]

[DOI]

Nima Reyhani

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Computing Stackelberg Equilibria of Large General-Sum Games.

[BibT_eX]

[DOI]

Nika Haghtalab

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Stochastic Matching on Uniformly Sparse Graphs.

[BibT_eX]

[DOI]

Nima Reyhani

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Massively Parallel Computation of Matching and MIS in Sparse Graphs.

[BibT_eX]

[DOI]

Richard M. Karp

Jara Uitto

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

On the Efficiency and Equilibria of Rich Ads.

[BibT_eX]

[DOI]

MohammadAmin Ghiasi

Sébastien Lahaie

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time.

[BibT_eX]

[DOI]

Cliff Stein

Madhu Sudan

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Streaming and Massively Parallel Algorithms for Edge Coloring.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Optimal Strategies of Blotto Games: Beyond Convexity.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Online Pandora's Boxes and Bandits.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.

[BibT_eX]

[DOI]

Krzysztof Onak

ACM Trans. Algorithms, 2018

Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.

[BibT_eX]

[DOI]

Mohammad Hossein Bateni

SIAM J. Comput., 2018

On maximum leaf trees and connections to connected maximum cut problems.

[BibT_eX]

[DOI]

Rajiv Gandhi

Manish Purohit

Kanthi K. Sarpatwar

Inf. Process. Lett., 2018

Massively Parallel Dynamic Programming on Trees.

[BibT_eX]

[DOI]

CoRR, 2018

Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching.

[BibT_eX]

[DOI]

Richard M. Karp

CoRR, 2018

Brief Announcement: Semi-MapReduce Meets Congested Clique.

[BibT_eX]

[DOI]

CoRR, 2018

Fast algorithms for knapsack via convolution and prediction.

[BibT_eX]

[DOI]

Cliff Stein

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Envy-free Chore Division for An Arbitrary Number of Agents.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Ronald L. Rivest

Philip B. Stark

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Frugal Auction Design for Set Systems: Vertex Cover and Knapsack.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Fair Allocation of Indivisible Goods: Improvements and Generalizations.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Spatio-Temporal Games Beyond One Dimension.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

On the Complexity of Chore Division.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Greedy Algorithms for Online Survivable Network Design.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: MapReduce Algorithms for Massive Trees.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Prophet Secretary.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Bi-Covering: Covering Edges with Two Small Subsets of Vertices.

[BibT_eX]

[DOI]

Amey Bhangale

Rajiv Gandhi

SIAM J. Discret. Math., 2017

Online Node-weighted Steiner Forest and Extensions via Disk Paintings.

[BibT_eX]

[DOI]

Debmalya Panigrahi

SIAM J. Comput., 2017

A greedy approximation algorithm for minimum-gap scheduling.

[BibT_eX]

[DOI]

Marek Chrobak

Uriel Feige

Sanjeev Khanna

Fei Li

Seffi Naor

J. Sched., 2017

Fair Allocation of Indivisible Goods: Improvement and Generalization.

[BibT_eX]

[DOI]

CoRR, 2017

Online Degree-Bounded Steiner Network Design.

[BibT_eX]

[DOI]

CoRR, 2017

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands.

[BibT_eX]

[DOI]

Algorithmica, 2017

Beating 1-1/e for ordered prophets.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

A Polynomial Time Algorithm for Spatio-Temporal Security Games.

[BibT_eX]

[DOI]

Aleksandrs Slivkins

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Affinity Clustering: Hierarchical Clustering at Scale.

[BibT_eX]

[DOI]

Raimondas Kiveris

Silvio Lattanzi

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Stochastic k-Server: How Should Uber Work?.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Market Pricing for Data Streams.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Bargaining Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Prophet Inequality and Online Auctions.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Approximation Schemes for Planar Graph Problems.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Bidimensionality.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Network Creation Games.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Approximation Algorithms for Movement Repairmen.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Social network ad allocation and optimization: a geometric mapping-based approach.

[BibT_eX]

[DOI]

Peixin Gao

Hui Miao

John S. Baras

Soc. Netw. Anal. Min., 2016

Designing FPT Algorithms for Cut Problems Using Randomized Contractions.

[BibT_eX]

[DOI]

Marek Cygan

Marcin Pilipczuk

Michal Pilipczuk

SIAM J. Comput., 2016

On Fixed Cost k-Flow Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Bicovering: Covering edges with two small subsets of vertices.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

From Duels to Battefields: Computing Equilibria of Blotto and Other Games.

[BibT_eX]

[DOI]

Mahdi Ahmadinejad

CoRR, 2016

A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond.

[BibT_eX]

[DOI]

David P. Woodruff

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Online Degree-Bounded Steiner Network Design.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams.

[BibT_eX]

[DOI]

Andrew McGregor

Sofya Vorotnikova

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Finding Large Matchings in Semi-Streaming.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining Workshops, 2016

Price of Competition and Dueling Games.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Beating Ratio 0.5 for Weighted Oblivious Matching Problems.

[BibT_eX]

[DOI]

Xiaowei Wu

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Automated Generation of Counterterrorism Policies Using Multiexpert Input.

[BibT_eX]

[DOI]

V. S. Subrahmanian

ACM Trans. Intell. Syst. Technol., 2015

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Marek Cygan

ACM Trans. Algorithms, 2015

Applications of Uniform Sampling: Densest Subgraph and Beyond.

[BibT_eX]

[DOI]

David P. Woodruff

CoRR, 2015

Kernelization via Sampling with Applications to Dynamic Graph Streams.

[BibT_eX]

[DOI]

Andrew McGregor

Sofya Vorotnikova

CoRR, 2015

Erratum to: Editorial.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Giuseppe F. Italiano

Algorithmica, 2015

Editorial.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Giuseppe F. Italiano

Algorithmica, 2015

FluTCHA: Using Fluency to Distinguish Humans from Computers.

[BibT_eX]

[DOI]

Kotaro Hara

Benjamin B. Bederson

Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Parameterized Streaming: Maximal Matching and Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Forming external behaviors by leveraging internal opinions.

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

Sadra Yazdanbod

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Approximate Deadline-Scheduling with Precedence Constraints.

[BibT_eX]

[DOI]

Hossein Efsandiari

Proceedings of the Algorithms - ESA 2015, 2015

Revenue Maximization for Selling Multiple Correlated Items.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

Selling Tomorrow's Bargains Today.

[BibT_eX]

[DOI]

David L. Malec

Aravind Srinivasan

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

HyperCubeMap: Optimal Social Network Ad Allocation Using Hyperbolic Embedding.

[BibT_eX]

[DOI]

Hui Miao

Peixin Gao

John S. Baras

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014

Efficient and practical resource block allocation for LTE-based D2D network via graph coloring.

[BibT_eX]

[DOI]

Mahdi Hajiaghayi

Carl Wijting

Cássio B. Ribeiro

Wirel. Networks, 2014

Minimizing Movement: Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs.

[BibT_eX]

[DOI]

Philip N. Klein

ACM Trans. Algorithms, 2014

Correction: Basic Network Creation Games.

[BibT_eX]

[DOI]

Noga Alon

Panagiotis Kanellopoulos

SIAM J. Discret. Math., 2014

On a Local Protocol for Concurrent File Transfers.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Parameterized Streaming Algorithms for Vertex Cover.

[BibT_eX]

[DOI]

CoRR, 2014

How to influence people with partial incentives.

[BibT_eX]

[DOI]

Proceedings of the 23rd International World Wide Web Conference, 2014

How effectively can we form opinions?

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

Sadra Yazdanbod

Proceedings of the 23rd International World Wide Web Conference, 2014

Randomized Revenue Monotone Mechanisms for Online Advertising.

[BibT_eX]

[DOI]

Gagan Goel

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Network Cournot Competition.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Hierarchical graph partitioning.

[BibT_eX]

[DOI]

Theodore Johnson

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The polarizing effect of network influences.

[BibT_eX]

[DOI]

David L. Malec

Proceedings of the ACM Conference on Economics and Computation, 2014

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems.

[BibT_eX]

[DOI]

Debmalya Panigrahi

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Online Stochastic Reordering Buffer Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Submodular secretary problem and extensions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2013

Basic Network Creation Games.

[BibT_eX]

[DOI]

Noga Alon

SIAM J. Discret. Math., 2013

Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Scheduling to minimize gaps and power consumption.

[BibT_eX]

[DOI]

Amin S. Sayedi-Roshkhar

J. Sched., 2013

Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

The Foundations of Fixed Parameter Inapproximability.

[BibT_eX]

[DOI]

CoRR, 2013

A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median.

[BibT_eX]

[DOI]

CoRR, 2013

Brief announcement: a game-theoretic model motivated by the darpa network challenge.

[BibT_eX]

[DOI]

Jonathan Katz

Koyel Mukherjee

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Scheduling a Cascade with Opposing Influences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Fixed-Parameter and Approximation Algorithms: A New Look.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

PACE: Policy-Aware Application Cloud Embedding.

[BibT_eX]

[DOI]

Li Erran Li

Hongze Zhao

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

PREVE: a policy recommendation engine based on vector equilibria applied to reducing LeT's attacks.

[BibT_eX]

[DOI]

V. S. Subrahmanian

Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

The Online Stochastic Generalized Assignment Problem.

[BibT_eX]

[DOI]

Saeed Alaei

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

The checkpoint problem.

[BibT_eX]

[DOI]

Julián Mestre

Theor. Comput. Sci., 2012

Prize-collecting steiner network problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

The price of anarchy in network creation games.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

A Game-Theoretic Model Motivated by the DARPA Network Challenge

[BibT_eX]

[DOI]

Jonathan Katz

Koyel Mukherjee

CoRR, 2012

Local Search Algorithms for the Red-Blue Median Problem.

[BibT_eX]

[DOI]

Algorithmica, 2012

Euclidean Prize-Collecting Steiner Forest.

[BibT_eX]

[DOI]

Algorithmica, 2012

A polynomial-time approximation scheme for planar multiway cut.

[BibT_eX]

[DOI]

Philip N. Klein

Claire Mathieu

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Online prophet-inequality matching with applications to ad allocation.

[BibT_eX]

[DOI]

Saeed Alaei

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Threshold compression for 3G scalable monitoring.

[BibT_eX]

[DOI]

Suk-Bok Lee

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

LP Rounding for k-Centers with Non-uniform Hard Capacities.

[BibT_eX]

[DOI]

Marek Cygan

Samir Khuller

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP.

[BibT_eX]

[DOI]

Aaron Archer

SIAM J. Comput., 2011

Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses.

[BibT_eX]

[DOI]

Lukasz Golab

Theory Comput. Syst., 2011

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

J. ACM, 2011

To Cache or Not to Cache: The 3G Case.

[BibT_eX]

[DOI]

Jeffrey Erman

Alexandre Gerber

Oliver Spatscheck

IEEE Internet Comput., 2011

Combinatorial Algorithms for Capacitated Network Design

[BibT_eX]

[DOI]

CoRR, 2011

Improved Approximation Algorithms for Label Cover Problems.

[BibT_eX]

[DOI]

Moses Charikar

Algorithmica, 2011

Contraction decomposition in h-minor-free graphs and algorithmic applications.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Prize-collecting Steiner Problems on Planar Graphs.

[BibT_eX]

[DOI]

Alina Ene

Nitish Korula

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Capacitated Metric Labeling.

[BibT_eX]

[DOI]

Matthew Andrews

Ankur Moitra

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Scalable monitoring via threshold compression in a large operational 3G network.

[BibT_eX]

[DOI]

Suk-Bok Lee

Proceedings of the SIGMETRICS 2011, 2011

Towards an efficient algorithmic framework for pricing cellular data service.

[BibT_eX]

[DOI]

Sina Jafarpour

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

AdCell: Ad Allocation in Cellular Networks.

[BibT_eX]

[DOI]

Saeed Alaei

Proceedings of the Algorithms - ESA 2011, 2011

Disjoint-Path Facility Location: Theory and Practice.

[BibT_eX]

[DOI]

David S. Johnson

Mauricio G. C. Resende

Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

Parameterized Complexity of Problems in Coalitional Resource Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Deploying sensor networks with guaranteed fault tolerance.

[BibT_eX]

[DOI]

Jonathan Bredin

Daniela Rus

IEEE/ACM Trans. Netw., 2010

Multi-VPN Optimization for Scalable Routing via Relaying.

[BibT_eX]

[DOI]

Alexandre Gerber

IEEE/ACM Trans. Netw., 2010

Foreword to special issue on SODA 2008.

[BibT_eX]

[DOI]

Shang-Hua Teng

ACM Trans. Algorithms, 2010

Dial a Ride from k-forest.

[BibT_eX]

[DOI]

Viswanath Nagarajan

R. Ravi

ACM Trans. Algorithms, 2010

Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Prize-collecting Network Design on Planar Graphs

[BibT_eX]

[DOI]

CoRR, 2010

Approximation algorithms via contraction decomposition.

[BibT_eX]

[DOI]

Bojan Mohar

Comb., 2010

l22 Spreading Metrics for Vertex Ordering Problems.

[BibT_eX]

[DOI]

Moses Charikar

Satish Rao

Algorithmica, 2010

Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Prize-Collecting Steiner Networks via Iterative Rounding.

[BibT_eX]

[DOI]

Arefeh A. Nasri

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

The Cooperative Game Theory Foundations of Network Bargaining Games.

[BibT_eX]

[DOI]

Nicole Immorlica

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Budgeted Red-Blue Median and Its Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Minimizing movement.

[BibT_eX]

[DOI]

Amin S. Sayedi-Roshkhar

Shayan Oveis Gharan

ACM Trans. Algorithms, 2009

The price of anarchy in cooperative network creation games.

[BibT_eX]

[DOI]

SIGecom Exch., 2009

Hat Guessing Games.

[BibT_eX]

[DOI]

Steve Butler

SIAM Rev., 2009

A note on the subadditive network design problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.

[BibT_eX]

[DOI]

Algorithmica, 2009

Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.

[BibT_eX]

[DOI]

Algorithmica, 2009

Network-aware forward caching.

[BibT_eX]

[DOI]

Jeffrey Erman

Alexandre Gerber

Oliver Spatscheck

Proceedings of the 18th International Conference on World Wide Web, 2009

News Posting by Strategic Users in a Social Network.

[BibT_eX]

[DOI]

Mangesh Gupte

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Additive approximation algorithms for list-coloring minor-closed class of graphs.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

09511 Open Problems - Parameterized complexity and approximation algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

09511 Executive Summary - Parameterized complexity and approximation algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

09511 Abstracts Collection - Parameterized complexity and approximation algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

2008

Bidimensionality.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximation Schemes for Planar Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

ACM Trans. Algorithms, 2008

Improved Approximation Algorithms for Minimum Weight Vertex Separators.

[BibT_eX]

[DOI]

Uriel Feige

James R. Lee

SIAM J. Comput., 2008

Combination Can Be Hard: Approximability of the Unique Coverage Problem.

[BibT_eX]

[DOI]

Uriel Feige

SIAM J. Comput., 2008

Linearity of grid minors in treewidth with applications through bidimensionality.

[BibT_eX]

[DOI]

Comb., 2008

The Bidimensionality Theory and Its Algorithmic Applications.

[BibT_eX]

[DOI]

Comput. J., 2008

Regret minimization and the price of total anarchy.

[BibT_eX]

[DOI]

Katrina Ligett

Aaron Roth

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction.

[BibT_eX]

[DOI]

Mihai Badoiu

Anastasios Sidiropoulos

Proceedings of the Approximation, 2008

2007

Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks.

[BibT_eX]

[DOI]

Nicole Immorlica

IEEE/ACM Trans. Netw., 2007

Cell Breathing in Wireless LANs: Algorithms and Evaluation.

[BibT_eX]

[DOI]

Paramvir Bahl

IEEE Trans. Mob. Comput., 2007

Oblivious routing on node-capacitated and directed graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Localized Client-Server Load Balancing without Global Information.

[BibT_eX]

[DOI]

Baruch Awerbuch

Robert Kleinberg

SIAM J. Comput., 2007

Power optimization for connectivity problems.

[BibT_eX]

[DOI]

Math. Program., 2007

Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth.

[BibT_eX]

[DOI]

Naomi Nishimura

J. Comput. Syst. Sci., 2007

Quickly deciding minor-closed parameters in general graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Plane Embeddings of Planar Graph Metrics.

[BibT_eX]

[DOI]

Mohammad Moharrami

Discret. Comput. Geom., 2007

Dial a Ride from k-forest

[BibT_eX]

[DOI]

Viswanath Nagarajan

R. Ravi

CoRR, 2007

A Theory of Loss-Leaders: Making Money by Pricing Below Cost.

[BibT_eX]

[DOI]

Maria-Florina Balcan

T.-H. Hubert Chan

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Semi-oblivious routing: lower bounds.

[BibT_eX]

[DOI]

Robert Kleinberg

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Approximation algorithms for node-weighted buy-at-bulk network design.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Stochastic Steiner Tree with Non-uniform Inflation.

[BibT_eX]

[DOI]

Amit Kumar

Proceedings of the Approximation, 2007

Automated Online Mechanism Design and Prophet Inequalities.

[BibT_eX]

[DOI]

Tuomas Sandholm

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks.

[BibT_eX]

[DOI]

Mohsen Bahramgiri

Wirel. Networks, 2006

On the max-flow min-cut ratio for directed multicommodity flows.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

The Bidimensional Theory of Bounded-Genus Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

An O(sqrt(n))-approximation algorithm for directed sparsest cut.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Approximating Buy-at-Bulk k-Steiner trees

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Low-Dimensional Embedding with Extra Information.

[BibT_eX]

[DOI]

Mihai Badoiu

Piotr Indyk

Discret. Comput. Geom., 2006

Semi-oblivious routing.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

New lower bounds for oblivious routing in undirected graphs.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Improved lower and upper bounds for universal TSP in planar metrics.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema.

[BibT_eX]

[DOI]

Kamal Jain

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Oblivious network design.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

l22 spreading metrics for vertex ordering problems.

[BibT_eX]

[DOI]

Moses Charikar

Satish Rao

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Bandwidth Sharing Network Design for Multi-Class Traffic.

[BibT_eX]

[DOI]

Li (Erran) Li

Marina Thottan

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping.

[BibT_eX]

[DOI]

Proceedings of the Computational Science, 2006

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2005

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.

[BibT_eX]

[DOI]

J. ACM, 2005

Balanced vertex-orderings of graphs.

[BibT_eX]

[DOI]

Therese Biedl

Timothy M. Chan

Yashar Ganjali

David R. Wood

Discret. Appl. Math., 2005

Bidimensionality, Map Graphs, and Grid Minors

[BibT_eX]

[DOI]

CoRR, 2005

Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.

[BibT_eX]

[DOI]

Algorithmica, 2005

Oblivious routing in directed graphs with random demands.

[BibT_eX]

[DOI]

Jeong Han Kim

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Bidimensionality: new connections between FPT algorithms and PTASs.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Online client-server load balancing without global information.

[BibT_eX]

[DOI]

Baruch Awerbuch

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Online auctions with re-usable goods.

[BibT_eX]

[DOI]

David C. Parkes

Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

Deploying sensor networks with guaranteed capacity and fault tolerance.

[BibT_eX]

[DOI]

Jonathan Bredin

Daniela Rus

Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005

The Generalized Deadlock Resolution Problem.

[BibT_eX]

[DOI]

Kamal Jain

Kunal Talwar

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Characterization of networks supporting multi-dimensional linear interval routing schemes.

[BibT_eX]

[DOI]

Yashar Ganjali

Theor. Comput. Sci., 2004

Bidimensional Parameters and Local Treewidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Random MAX SAT, random MAX CUT, and their phase transitions.

[BibT_eX]

[DOI]

Don Coppersmith

David Gamarnik

Gregory B. Sorkin

Random Struct. Algorithms, 2004

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.

[BibT_eX]

[DOI]

Naomi Nishimura

Prabhakar Ragde

J. Comput. Syst. Sci., 2004

Diameter and Treewidth in Minor-Closed Graph Families, Revisited.

[BibT_eX]

[DOI]

Algorithmica, 2004

Equivalence of local treewidth and linear local treewidth and its algorithmic applications.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Adaptive limited-supply online auctions.

[BibT_eX]

[DOI]

David C. Parkes

Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

Palindrome recognition using a multidimensional tape.

[BibT_eX]

[DOI]

Tomás Vinar

Theor. Comput. Sci., 2003

The facility location problem with general cost functions.

[BibT_eX]

[DOI]

Networks, 2003

A note on the bounded fragmentation property and its applications in network reliability.

[BibT_eX]

[DOI]

Mahdi Hajiaghayi

Eur. J. Comb., 2003

Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Length-constrained path-matchings in graphs.

[BibT_eX]

[DOI]

Networks, 2002

A note on the Consecutive Ones Submatrix problem.

[BibT_eX]

[DOI]

Yashar Ganjali

Inf. Process. Lett., 2002

RoboCup-2001: The Fifth Robotic Soccer World Championships.

[BibT_eX]

[DOI]

Ehsan Chiniforooshan

AI Mag., 2002

Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.

[BibT_eX]

[DOI]

Naomi Nishimura

Prabhakar Ragde

Electron. Notes Discret. Math., 2001

A Fast Vision System for Middle Size Robots in RoboCup.

[BibT_eX]

[DOI]

Ehsan Chiniforooshan

Proceedings of the RoboCup 2001: Robot Soccer World Cup V, 2001

2000

On the simultaneous edge-coloring conjecture.

[BibT_eX]

[DOI]

Ebadollah S. Mahmoodian

Seyed Vahab Mirrokni

Amin Saberi

Ruzbeh Tusserkani

Discret. Math., 2000

A Goal Keeper for Middle Size RoboCup.

[BibT_eX]

[DOI]

Mansour Jamzad

Amirali Foroughnassiraei