3 citations · 7 across the 11 of their papers we have counts for
13 papers
Grid Theory and Polynomiality in Dynamic Lot-Sizing
El-Mehdi Mehiri, Nabil Absi, Elodie Suzanne
Why are some dynamic lot-sizing problems polynomial? We address this question by introducing Grid Theory, a structural framework based on cumulative production and the additive str…
Rotating-Memory Fibonacci Numbers and Periodic Tilings
Walid Abdelaidoum, El-Mehdi Mehiri, Hacène Belbachir
We introduce and study the rotating-memory Fibonacci numbers, a periodic variable-order analogue of the Fibonacci sequence in which the number of preceding terms used in the recurr…
The Weighted Tower of Hanoi: Algebraic Structure, Phase Transitions, and Integer Sequences
Andreas M. Hinz, El-Mehdi Mehiri
We develop a unified algebraic theory of the weighted Tower of Hanoi with arbitrary nonnegative symmetric move costs depending on both disc index and pegs. Starting from a general…
M-Polynomial of Product Graphs
El-Mehdi Mehiri, Sandi Klavžar
The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomi…
Explicit M-Polynomial and Degree-Based Topological Indices of Generalized Hanoi Graphs
El-Mehdi Mehiri
The M-polynomial, introduced by Deutsch and Klavžar in 2015, provides a unifying algebraic framework for the computation of numerous degree-based topological indices such as the Za…
Block-Separated Overpartitions: Fibonacci Structure and Euler Factorization
El-Mehdi Mehiri
We introduce and study block-separated overpartitions, a constrained family of overpartitions in which no two consecutive distinct part-blocks are both overlined. This local restri…
Bijections Between Smirnov Words and Hamiltonian Cycles in Complete Multipartite Graphs
El-Mehdi Mehiri
We establish a bijective correspondence between Smirnov words with balanced letter multiplicities and Hamiltonian paths in complete -partite graphs . This bije…
The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its State Graph
El-Mehdi Mehiri
We introduce and study a parity-constrained variant of the four-peg Tower of Hanoi problem. In this model, two pegs are neutral, while the two remaining pegs are reserved respectiv…
The Power Contamination Problem on Grids Revisited: Optimality, Combinatorics, and Links to Integer Sequences
El-Mehdi Mehiri, Mohammed L. Nadji
This paper presents a combinatorial study of the power contamination problem, a dynamic variant of power domination modeled on grid graphs. We resolve a conjecture posed by Ainouch…
The Towers of Fibonacci, Lucas, Pell, and Jacobsthal
El-Mehdi Mehiri, Saad Mneimneh, Hacène Belbachir
We present in this paper four new variants of the Tower of Hanoi problem, the optimal solution of each of these variants is related to one of the four known numbers Fibonacci, Luca…
On the restricted Hanoi Graphs
El-Mehdi Mehiri
Consider the restricted Hanoi graphs which correspond to the variants of the famous Tower of Hanoi problem with multiple pegs where moves of the discs are restricted throughout the…
Enumerating moves in the optimal solution of the Tower of Hanoi
Hacène Belbachir, El-Mehdi Mehiri
In the Tower of Hanoi problem, there is six types of moves between the three pegs. The main purpose of the present paper is to find out the number of each of these six elementary m…
The weighted Tower of Hanoi
El-Mehdi Mehiri, Hacène Belbachir
The weighted Tower of Hanoi is a new generalization of the classical Tower of Hanoi problem, where a move of a disc between two pegs and is weighted by a positive real $w_{…