The following pages link to Mohammad Taghi Hajiaghayi (Q487271):
Displaying 50 items.
- (Q260244) (redirect page) (← links)
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- On a local protocol for concurrent file transfers (Q487273) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- (Q692629) (redirect page) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- Scheduling to minimize staleness and stretch in real-time data warehouses (Q693761) (← links)
- Characterization of networks supporting multi-dimensional linear interval routing schemes (Q703538) (← links)
- The checkpoint problem (Q714790) (← links)
- On the Max-flow min-cut ratio for directed multicommodity flows (Q818146) (← links)
- Low-dimensional embedding with extra information (Q854713) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Power optimization for connectivity problems (Q877193) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- A note on the subadditive network design problem (Q1038103) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- Palindrome recognition using a multidimensional tape. (Q1401342) (← links)
- A note on the bounded fragmentation property and its applications in network reliability (Q1413235) (← links)
- Diameter and treewidth in minor-closed graph families, revisited (Q1762990) (← links)
- Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors (Q1774147) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- A note on the consecutive ones submatrix problem. (Q1853060) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Computing Stackelberg equilibria of large general-sum games (Q2292620) (← links)
- Stochastic matching on uniformly sparse graphs (Q2292635) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Scheduling to minimize gaps and power consumption (Q2434309) (← links)
- Plane embeddings of planar graph metrics (Q2465416) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q2843251) (← links)
- Basic Network Creation Games (Q2848528) (← links)
- The Online Stochastic Generalized Assignment Problem (Q2851845) (← links)
- Approximation Algorithms for Movement Repairmen (Q2851859) (← links)
- Scheduling a Cascade with Opposing Influences (Q2856144) (← links)
- Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset (Q2862207) (← links)
- Fixed-Parameter and Approximation Algorithms: A New Look (Q2867077) (← links)
- Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (Q2875147) (← links)
- (Q2921671) (← links)
- (Q2921717) (← links)
- (Q2921724) (← links)
- (Q2921728) (← links)
- (Q2921741) (← links)
