Arash Ahadi

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard	2022-03-21	Paper
On the proper arc labeling of directed graphs	2022-01-03	Paper
https://portal.mardi4nfdi.de/entity/Q5207845	2020-01-13	Paper
Connecting guards with minimum Steiner points inside simple polygons	2019-05-29	Paper
Sigma Partitioning: Complexity and Random Graphs	2019-01-21	Paper
Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications	2018-10-18	Paper
Touring convex polygons in polygonal domain fences	2018-03-26	Paper
On the algorithmic complexity of decomposing graphs into regular/irregular structures	2018-01-25	Paper
Is there any polynomial upper bound for the universal labeling of graphs?	2017-11-16	Paper
Algorithmic complexity of weakly semiregular partitioning and the representation number	2017-05-12	Paper
The inapproximability for the (0,1)-additive number	2016-08-23	Paper
Touring a sequence of disjoint polygons: complexity and extension	2016-06-27	Paper
On the complexity of deciding whether the regular number is at most two	2015-09-24	Paper
The complexity of the proper orientation number	2014-04-14	Paper
Algorithmic complexity of proper labeling problems	2014-01-10	Paper
Touring Disjoint Polygons Problem Is NP-Hard	2013-12-10	Paper
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number	2012-10-26	Paper
On the difference between chromatic number and dynamic chromatic number of graphs	2012-08-10	Paper
On the Lucky labeling of Graphs	2010-07-15	Paper
On Rainbow Connection of Strongly Regular Graphs	2010-01-19	Paper

Research outcomes over time

This page was built for person: Arash Ahadi