Mohammadreza Razzazi

Available identifiers

zbMath Open razzazi.mohammadrezaMaRDI QIDQ284359

List of research outcomes

Publication	Date of Publication	Type
The most points connected-covering problem with two disks	2019-09-05	Paper
Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs	2019-06-24	Paper
Minimum Cardinality Point-to-point Connectivity Augmentation Problem	2018-10-26	Paper
Analysis of a first-fit algorithm for the capacitated unit covering problem	2017-07-28	Paper
Augmenting weighted graphs to establish directed point-to-point connectivity	2017-06-22	Paper
Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability	2016-12-28	Paper
An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification	2016-05-18	Paper
Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions	2016-01-14	Paper
On capacitated covering with unit balls	2015-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q5249243	2015-04-30	Paper
An algorithmic framework for solving geometric covering problems -- with applications	2014-11-14	Paper
A PTAS for the cardinality constrained covering with unit balls	2014-03-13	Paper
An improved approximation algorithm for the most points covering problem	2012-12-06	Paper
Planar straight-line point-set embedding of trees with partial embeddings	2012-03-12	Paper
Minimum cost open chain reconfiguration	2011-10-27	Paper
Minimum height path partitioning of trees	2011-07-25	Paper
Drawing complete binary trees inside rectilinear polygons	2011-01-20	Paper
An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core	2009-05-20	Paper
The Reachability Problem in a Concave Region: A New Context	2008-09-30	Paper
https://portal.mardi4nfdi.de/entity/Q5474000	2006-06-23	Paper
How to draw free trees inside bounded rectilinear polygons	2005-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q2779388	2002-04-15	Paper
On optimal guillotine partitions approximating optimal \(d\)-box partitions	1994-06-15	Paper
AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES	1994-05-26	Paper

Research outcomes over time

This page was built for person: Mohammadreza Razzazi