The following pages link to Mohammadreza Razzazi (Q284359):
Displaying 25 items.
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- (Q555534) (redirect page) (← links)
- Minimum height path partitioning of trees (Q555536) (← links)
- Minimum cost open chain reconfiguration (Q642965) (← links)
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability (Q730503) (← links)
- Planar straight-line point-set embedding of trees with partial embeddings (Q763547) (← links)
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions (Q903629) (← links)
- On optimal guillotine partitions approximating optimal \(d\)-box partitions (Q1327171) (← links)
- The most points connected-covering problem with two disks (Q2322704) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- (Q2779388) (← links)
- AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (Q2929639) (← links)
- Drawing complete binary trees inside rectilinear polygons (Q3066961) (← links)
- The Reachability Problem in a Concave Region: A New Context (Q3527863) (← links)
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)
- AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES (Q4289635) (← links)
- How to draw free trees inside bounded rectilinear polygons (Q4652864) (← links)
- Minimum Cardinality Point-to-point Connectivity Augmentation Problem (Q4692118) (← links)
- Analysis of a first-fit algorithm for the capacitated unit covering problem (Q4976332) (← links)
- (Q5249243) (← links)
- On capacitated covering with unit balls (Q5266149) (← links)
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs (Q5384532) (← links)
- (Q5474000) (← links)
