M
MohammadTaghi Hajiaghayi
Researcher at University of Maryland, College Park
Publications - 404
Citations - 12400
MohammadTaghi Hajiaghayi is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Approximation algorithm & 1-planar graph. The author has an hindex of 57, co-authored 377 publications receiving 11276 citations. Previous affiliations of MohammadTaghi Hajiaghayi include Massachusetts Institute of Technology & Indian Institutes of Technology.
Papers
More filters
Journal ArticleDOI
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
TL;DR: A new framework for designing fixed-parameter algorithms with subexponential running time---2O(&kradic;) nO(1) is introduced, which applies to a broad family of graph problems, called bidimensional problems, which includes many domination and problems such as vertex cover, feedback vertex set, minimum maximal matching, dominating set, edge dominate set, disk dimension, and many others restricted to bounded-genus graphs.
Proceedings ArticleDOI
Improved approximation algorithms for minimum-weight vertex separators
TL;DR: The algorithmic theory of vertex separators, and its relation to the embeddings of certain metric spaces is developed, and an O(√log n) pseudo-approximation for finding balanced vertices in general graphs is exhibited.
Journal ArticleDOI
The Bidimensionality Theory and Its Algorithmic Applications 1
TL;DR: The foundation of this work is the topological theory of drawings of graphs on surfaces and the results regarding the relation of the size of the largest grid minor in terms of treewidth in bounded-genus graphs and more generally in graphs excluding a fixed graph H as a minor.
Journal ArticleDOI
Improved Approximation Algorithms for Minimum Weight Vertex Separators
TL;DR: It is shown that embeddings into $L_1$ are insufficient but that the additional structure provided by many embedding theorems does suffice for the authors' purposes, and an optimal $O(\log k)$-approximate max-flow/min-vertex-cut theorem for arbitrary vertex-capacitated multicommodity flow instances on $k$ terminals is proved.
Proceedings ArticleDOI
Algorithmic graph minor theory: Decomposition, approximation, and coloring
TL;DR: A polynomial-time algorithm is developed using topological graph theory to decompose a graph into the structure guaranteed by the theorem: a clique-sum of pieces almost-embeddable into bounded-genus surfaces.