Mohammad Taghi Hajiaghayi

According to our database1, Mohammad Taghi Hajiaghayi authored at least 245 papers between 2000 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Approximate Maximum Matching in Random Streams.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Introduction to the Special Issue for SPAA'17.
TOPC, 2019

From Duels to Battlefields: Computing Equilibria of Blotto and Other Games.
Math. Oper. Res., 2019

Fair Allocation of Indivisible Goods to Asymmetric Agents.
J. Artif. Intell. Res., 2019

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

Massively Parallel Algorithms for String Matching with Wildcards.
CoRR, 2019

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

Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems.
CoRR, 2019

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

Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

1+ε approximation of tree edit distance in quadratic time.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Lower bounds for external memory integer sorting via network coding.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Approximating LCS in Linear Time: Beating the √n Barrier.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Stochastic Matching with Few Queries: New Algorithms and Tools.
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.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Computing Stackelberg Equilibria of Large General-Sum Games.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Stochastic Matching on Uniformly Sparse Graphs.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Massively Parallel Computation of Matching and MIS in Sparse Graphs.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

On the Efficiency and Equilibria of Rich Ads.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Exponentially Faster Massively Parallel Maximal Matching.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Streaming and Massively Parallel Algorithms for Edge Coloring.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Optimal Strategies of Blotto Games: Beyond Convexity.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Online Pandora's Boxes and Bandits.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.
ACM Trans. Algorithms, 2018

Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.
SIAM J. Comput., 2018

On maximum leaf trees and connections to connected maximum cut problems.
Inf. Process. Lett., 2018

Massively Parallel Dynamic Programming on Trees.
CoRR, 2018

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

Brief Announcement: Semi-MapReduce Meets Congested Clique.
CoRR, 2018

Fast algorithms for knapsack via convolution and prediction.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Prophet Secretary for Combinatorial Auctions and Matroids.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Envy-free Chore Division for An Arbitrary Number of Agents.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Frugal Auction Design for Set Systems: Vertex Cover and Knapsack.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Fair Allocation of Indivisible Goods: Improvements and Generalizations.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Spatio-Temporal Games Beyond One Dimension.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

On the Complexity of Chore Division.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Greedy Algorithms for Online Survivable Network Design.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: MapReduce Algorithms for Massive Trees.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Prophet Secretary.
SIAM J. Discrete Math., 2017

Bi-Covering: Covering Edges with Two Small Subsets of Vertices.
SIAM J. Discrete Math., 2017

Online Node-weighted Steiner Forest and Extensions via Disk Paintings.
SIAM J. Comput., 2017

A greedy approximation algorithm for minimum-gap scheduling.
J. Scheduling, 2017

Fair Allocation of Indivisible Goods: Improvement and Generalization.
CoRR, 2017

Online Degree-Bounded Steiner Network Design.
CoRR, 2017

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

Beating 1-1/e for ordered prophets.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

A Polynomial Time Algorithm for Spatio-Temporal Security Games.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Affinity Clustering: Hierarchical Clustering at Scale.
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?.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Market Pricing for Data Streams.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Bargaining Networks.
Encyclopedia of Algorithms, 2016

Prophet Inequality and Online Auctions.
Encyclopedia of Algorithms, 2016

Approximation Schemes for Planar Graph Problems.
Encyclopedia of Algorithms, 2016

Bidimensionality.
Encyclopedia of Algorithms, 2016

Network Creation Games.
Encyclopedia of Algorithms, 2016

Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs.
Encyclopedia of Algorithms, 2016

Approximation Algorithms for Movement Repairmen.
ACM Trans. Algorithms, 2016

A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median.
ACM Trans. Algorithms, 2016

Social network ad allocation and optimization: a geometric mapping-based approach.
Social Netw. Analys. Mining, 2016

Designing FPT Algorithms for Cut Problems Using Randomized Contractions.
SIAM J. Comput., 2016

On Fixed Cost k-Flow Problems.
Theory Comput. Syst., 2016

Bicovering: Covering edges with two small subsets of vertices.
Electronic Colloquium on Computational Complexity (ECCC), 2016

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

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

A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Online Degree-Bounded Steiner Network Design.
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.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Finding Large Matchings in Semi-Streaming.
Proceedings of the IEEE International Conference on Data Mining Workshops, 2016

Price of Competition and Dueling Games.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Beating Ratio 0.5 for Weighted Oblivious Matching Problems.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Automated Generation of Counterterrorism Policies Using Multiexpert Input.
ACM TIST, 2015

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable.
ACM Trans. Algorithms, 2015

Applications of Uniform Sampling: Densest Subgraph and Beyond.
CoRR, 2015

Kernelization via Sampling with Applications to Dynamic Graph Streams.
CoRR, 2015

Erratum to: Editorial.
Algorithmica, 2015

Editorial.
Algorithmica, 2015

FluTCHA: Using Fluency to Distinguish Humans from Computers.
Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Parameterized Streaming: Maximal Matching and Vertex Cover.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Forming external behaviors by leveraging internal opinions.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Approximation Algorithms for Connected Maximum Cut and Related Problems.
Proceedings of the Algorithms - ESA 2015, 2015

Approximate Deadline-Scheduling with Precedence Constraints.
Proceedings of the Algorithms - ESA 2015, 2015

Revenue Maximization for Selling Multiple Correlated Items.
Proceedings of the Algorithms - ESA 2015, 2015

Selling Tomorrow's Bargains Today.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

HyperCubeMap: Optimal Social Network Ad Allocation Using Hyperbolic Embedding.
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.
Wireless Networks, 2014

Minimizing Movement: Fixed-Parameter Tractability.
ACM Trans. Algorithms, 2014

Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs.
ACM Trans. Algorithms, 2014

Correction: Basic Network Creation Games.
SIAM J. Discrete Math., 2014

On a Local Protocol for Concurrent File Transfers.
Theory Comput. Syst., 2014

Parameterized Streaming Algorithms for Vertex Cover.
CoRR, 2014

How to influence people with partial incentives.
Proceedings of the 23rd International World Wide Web Conference, 2014

How effectively can we form opinions?
Proceedings of the 23rd International World Wide Web Conference, 2014

Randomized Revenue Monotone Mechanisms for Online Advertising.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Network Cournot Competition.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Hierarchical graph partitioning.
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).
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The polarizing effect of network influences.
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).
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Online Stochastic Reordering Buffer Scheduling.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Submodular secretary problem and extensions.
ACM Trans. Algorithms, 2013

Basic Network Creation Games.
SIAM J. Discrete Math., 2013

Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset.
SIAM J. Comput., 2013

Scheduling to minimize gaps and power consumption.
J. Scheduling, 2013

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

The Foundations of Fixed Parameter Inapproximability.
CoRR, 2013

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

Brief announcement: a game-theoretic model motivated by the darpa network challenge.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Scheduling a Cascade with Opposing Influences.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Fixed-Parameter and Approximation Algorithms: A New Look.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

PACE: Policy-Aware Application Cloud Embedding.
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.
Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

The Online Stochastic Generalized Assignment Problem.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
The checkpoint problem.
Theor. Comput. Sci., 2012

Prize-collecting steiner network problems.
ACM Trans. Algorithms, 2012

The price of anarchy in network creation games.
ACM Trans. Algorithms, 2012

Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location.
ACM Trans. Algorithms, 2012

A Game-Theoretic Model Motivated by the DARPA Network Challenge
CoRR, 2012

Local Search Algorithms for the Red-Blue Median Problem.
Algorithmica, 2012

Euclidean Prize-Collecting Steiner Forest.
Algorithmica, 2012

A polynomial-time approximation scheme for planar multiway cut.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Online prophet-inequality matching with applications to ad allocation.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Threshold compression for 3G scalable monitoring.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

LP Rounding for k-Centers with Non-uniform Hard Capacities.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP.
SIAM J. Comput., 2011

Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses.
Theory Comput. Syst., 2011

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth.
J. ACM, 2011

To Cache or Not to Cache: The 3G Case.
IEEE Internet Computing, 2011

Combinatorial Algorithms for Capacitated Network Design
CoRR, 2011

Improved Approximation Algorithms for Label Cover Problems.
Algorithmica, 2011

Contraction decomposition in h-minor-free graphs and algorithmic applications.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Prize-collecting Steiner Problems on Planar Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Capacitated Metric Labeling.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Scalable monitoring via threshold compression in a large operational 3G network.
Proceedings of the SIGMETRICS 2011, 2011

Towards an efficient algorithmic framework for pricing cellular data service.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

AdCell: Ad Allocation in Cellular Networks.
Proceedings of the Algorithms - ESA 2011, 2011

Disjoint-Path Facility Location: Theory and Practice.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

Parameterized Complexity of Problems in Coalitional Resource Games.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Deploying sensor networks with guaranteed fault tolerance.
IEEE/ACM Trans. Netw., 2010

Multi-VPN Optimization for Scalable Routing via Relaying.
IEEE/ACM Trans. Netw., 2010

Foreword to special issue on SODA 2008.
ACM Trans. Algorithms, 2010

Dial a Ride from k-forest.
ACM Trans. Algorithms, 2010

Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design.
SIAM J. Comput., 2010

Prize-collecting Network Design on Planar Graphs
CoRR, 2010

Approximation algorithms via contraction decomposition.
Combinatorica, 2010

l22 Spreading Metrics for Vertex Ordering Problems.
Algorithmica, 2010

Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Prize-Collecting Steiner Networks via Iterative Rounding.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

The Cooperative Game Theory Foundations of Network Bargaining Games.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Budgeted Red-Blue Median and Its Generalizations.
Proceedings of the Algorithms, 2010

2009
Minimizing movement.
ACM Trans. Algorithms, 2009

The price of anarchy in cooperative network creation games.
SIGecom Exchanges, 2009

A note on the subadditive network design problem.
Oper. Res. Lett., 2009

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

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

Network-aware forward caching.
Proceedings of the 18th International Conference on World Wide Web, 2009

News Posting by Strategic Users in a Social Network.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Additive approximation algorithms for list-coloring minor-closed class of graphs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

09511 Open Problems - Parameterized complexity and approximation algorithms.
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

09511 Executive Summary - Parameterized complexity and approximation algorithms.
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

09511 Abstracts Collection - Parameterized complexity and approximation algorithms.
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

2008
Bidimensionality.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximation Schemes for Planar Graph Problems.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.
ACM Trans. Algorithms, 2008

Hat Guessing Games.
SIAM J. Discrete Math., 2008

Improved Approximation Algorithms for Minimum Weight Vertex Separators.
SIAM J. Comput., 2008

Combination Can Be Hard: Approximability of the Unique Coverage Problem.
SIAM J. Comput., 2008

Linearity of grid minors in treewidth with applications through bidimensionality.
Combinatorica, 2008

The Bidimensionality Theory and Its Algorithmic Applications.
Comput. J., 2008

Regret minimization and the price of total anarchy.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction.
Proceedings of the Approximation, 2008

2007
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks.
IEEE/ACM Trans. Netw., 2007

Cell Breathing in Wireless LANs: Algorithms and Evaluation.
IEEE Trans. Mob. Comput., 2007

Oblivious routing on node-capacitated and directed graphs.
ACM Trans. Algorithms, 2007

Localized Client-Server Load Balancing without Global Information.
SIAM J. Comput., 2007

Power optimization for connectivity problems.
Math. Program., 2007

Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth.
J. Comput. Syst. Sci., 2007

Quickly deciding minor-closed parameters in general graphs.
Eur. J. Comb., 2007

Plane Embeddings of Planar Graph Metrics.
Discrete & Computational Geometry, 2007

Dial a Ride from k-forest
CoRR, 2007

A Theory of Loss-Leaders: Making Money by Pricing Below Cost.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Semi-oblivious routing: lower bounds.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Approximation algorithms for node-weighted buy-at-bulk network design.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Stochastic Steiner Tree with Non-uniform Inflation.
Proceedings of the Approximation, 2007

Automated Online Mechanism Design and Prophet Inequalities.
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.
Wireless Networks, 2006

On the max-flow min-cut ratio for directed multicommodity flows.
Theor. Comput. Sci., 2006

The Bidimensional Theory of Bounded-Genus Graphs.
SIAM J. Discrete Math., 2006

An O(sqrt(n))-approximation algorithm for directed sparsest cut.
Inf. Process. Lett., 2006

Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk
Electronic Colloquium on Computational Complexity (ECCC), 2006

Approximating Buy-at-Bulk k-Steiner trees
Electronic Colloquium on Computational Complexity (ECCC), 2006

Low-Dimensional Embedding with Extra Information.
Discrete & Computational Geometry, 2006

Semi-oblivious routing.
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.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Improved lower and upper bounds for universal TSP in planar metrics.
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.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Oblivious network design.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

l22 spreading metrics for vertex ordering problems.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Bandwidth Sharing Network Design for Multi-Class Traffic.
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.
Proceedings of the Computational Science, 2006

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design.
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.
ACM Trans. Algorithms, 2005

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.
J. ACM, 2005

Balanced vertex-orderings of graphs.
Discrete Applied Mathematics, 2005

Bidimensionality, Map Graphs, and Grid Minors
CoRR, 2005

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

Oblivious routing in directed graphs with random demands.
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.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Bidimensionality: new connections between FPT algorithms and PTASs.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Online client-server load balancing without global information.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Online auctions with re-usable goods.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

Deploying sensor networks with guaranteed capacity and fault tolerance.
Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005

The Generalized Deadlock Resolution Problem.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring.
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.
Theor. Comput. Sci., 2004

Bidimensional Parameters and Local Treewidth.
SIAM J. Discrete Math., 2004

Random MAX SAT, random MAX CUT, and their phase transitions.
Random Struct. Algorithms, 2004

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.
J. Comput. Syst. Sci., 2004

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

Equivalence of local treewidth and linear local treewidth and its algorithmic applications.
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.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Adaptive limited-supply online auctions.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
Palindrome recognition using a multidimensional tape.
Theor. Comput. Sci., 2003

The facility location problem with general cost functions.
Networks, 2003

A note on the bounded fragmentation property and its applications in network reliability.
Eur. J. Comb., 2003

Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Length-constrained path-matchings in graphs.
Networks, 2002

A note on the Consecutive Ones Submatrix problem.
Inf. Process. Lett., 2002

RoboCup-2001: The Fifth Robotic Soccer World Championships.
AI Magazine, 2002

Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.
Electronic Notes in Discrete Mathematics, 2001

A Fast Vision System for Middle Size Robots in RoboCup.
Proceedings of the RoboCup 2001: Robot Soccer World Cup V, 2001

2000
On the simultaneous edge-coloring conjecture.
Discrete Mathematics, 2000



  Loading...