Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities. - Arman Didandeh; Bahram Sadeghi Bigham; Mehdi Khosravian; Farshad Bakhshandegan Moghaddam (Inf. Sci., 2013)

Extended Spanning Star Forest Problems. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Dirk Oliver Theis (COCOA (1), 2017)

Extension of vertex cover and independent set in some classes of graphs and generalizations. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CoRR, 2018)

Extension of Vertex Cover and Independent Set in Some Classes of Graphs. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 2019)

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (FCT, 2019)

Correction to: Weighted Upper Edge Cover: Complexity and Approximability. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (WALCOM, 2019)

How Bad is the Freedom to Flood-It? - Rémy Belmonte; Mehdi Khosravian Ghadikolaei; Masashi Kiyomi; Michael Lampis; Yota Otachi (J. Graph Algorithms Appl., 2019)

Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Dirk Oliver Theis (Theor. Comput. Sci., 2019)

Extension of NP Optimization Problems. (Extension des problèmes NPO). - Mehdi Khosravian Ghadikolaei (2019)

On the Complexity of the Upper r-Tolerant Edge Cover Problem. - Ararat Harutyunyan; Mehdi Khosravian Ghadikolaei; Nikolaos Melissinos; Jérôme Monnot; Aris Pagourtzis (TTCS, 2020)

Weighted Upper Edge Cover: Complexity and Approximability. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (J. Graph Algorithms Appl., 2020)

Abundant Extensions. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 2021)

(In)approximability of maximum minimal FVS. - Louis Dublois; Tesshu Hanaka; Mehdi Khosravian Ghadikolaei; Michael Lampis; Nikolaos Melissinos (J. Comput. Syst. Sci., 2022)

On the complexity of solution extension of optimization problems. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Theor. Comput. Sci., 2022)

Extension and its price for the connected vertex cover problem. - Mehdi Khosravian Ghadikolaei; Nikolaos Melissinos; Jérôme Monnot; Aris Pagourtzis (Theor. Comput. Sci., 2022)

Electrical Rule Checking of Integrated Circuits using Satisfiability Modulo Theory. - Bruno Ferres; Oussama Oulkaid; Ludovic Henrio; Mehdi Khosravian Ghadikolaei; Matthieu Moy; Gabriel Radanne; Pascal Raymond (DATE, 2023)

Extension of some edge graph problems: Standard, parameterized and approximation complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Discret. Appl. Math., 2023)

A Transistor Level Relational Semantics for Electrical Rule Checking by SMT Solving. - Oussama Oulkaid; Bruno Ferres; Matthieu Moy; Pascal Raymond; Mehdi Khosravian; Ludovic Henrio; Gabriel Radanne (DATE, 2024)