The following pages link to Arash Ahadi (Q300223):
Displaying 21 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- (Q442371) (redirect page) (← links)
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309) (← links)
- Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487) (← links)
- Touring convex polygons in polygonal domain fences (Q1708597) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- On the proper arc labeling of directed graphs (Q2062885) (← links)
- On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard (Q2117514) (← links)
- Connecting guards with minimum Steiner points inside simple polygons (Q2419109) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- The inapproximability for the (0,1)-additive number (Q2816507) (← links)
- Touring Disjoint Polygons Problem Is NP-Hard (Q2867133) (← links)
- Sigma Partitioning: Complexity and Random Graphs (Q4611774) (← links)
- (Q5207845) (← links)
- On Rainbow Connection of Strongly Regular Graphs (Q6217238) (← links)
- On the Lucky labeling of Graphs (Q6219737) (← links)
- On the algorithmic complexity of decomposing graphs into regular/irregular structures (Q6296967) (← links)