Univ. of Waterloo, School of Computer Science

http://www.math.uwaterloo.ca/~mhajiaghay/

mhajiaghay@uwaterloo.ca

Author, editor, or reviewer of:

- 1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor
- A note on the bounded fragmentation property and its applications in network reliability
- Algorithms for Graphs of (Locally) Bounded Treewidth
- Approximation algorithms via contraction decomposition
- Balanced vertex-orderings of graphs
- Bidimensional parameters and local treewidth
- Bidimensionality: new connections between FPT algorithms and PTASs
- Equivalence of local treewidth and linear local treewidth and its algorithmic applications
- Exponential speedup of fixed parameter algorithms on graphs excluding a graph with one crossing as a minor
- Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
- Fast approximation schemes for $K_{3,3}$-minor-free or $K_5$-minor-free graphs
- Fixed parameter algorithms for $(k,r)$-center in planar graphs and map graphs
- Fixed-parameter algorithms for minor-closed graphs (of locally bounded treewidth)
- Fixed-parameter algorithms for the $(k,r)$-center in planar graphs and map graphs
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
- Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth