Mehdi Khosravian Ghadikolaei

25 papers A 1B 4C 3Misc 1Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Modeling Techniques for the Formal Verification of Integrated Circuits at Transistor-Level: Performance Versus Precision Tradeoffs.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Oussama Oulkaid, Bruno Ferres, Matthieu Moy, Pascal Raymond, Mehdi Khosravian Ghadikolaei
2023 A conf
Electrical Rule Checking of Integrated Circuits using Satisfiability Modulo Theory.
DATE
Bruno Ferres, Oussama Oulkaid, Ludovic Henrio, Mehdi Khosravian Ghadikolaei, Matthieu Moy, Gabriel Radanne, Pascal Raymond
2023 J jnl
Extension of some edge graph problems: Standard, parameterized and approximation complexity.
Discret. Appl. Math.
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2022 J jnl
(In)approximability of maximum minimal FVS.
J. Comput. Syst. Sci.
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2022 J jnl
Extension and its price for the connected vertex cover problem.
Theor. Comput. Sci.
Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2022 J jnl
On the complexity of solution extension of optimization problems.
Theor. Comput. Sci.
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2021 C conf
Abundant Extensions.
CIAC
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2020 B conf
(In)approximability of Maximum Minimal FVS.
ISAAC
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2020 J jnl
(In)approximability of Maximum Minimal FVS.
CoRR
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2020 — conf
On the Complexity of the Upper r-Tolerant Edge Cover Problem.
TTCS
Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2020 J jnl
Weighted Upper Edge Cover: Complexity and Approximability.
J. Graph Algorithms Appl.
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019 J jnl
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs.
Theor. Comput. Sci.
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis
2019 B conf
Correction to: Weighted Upper Edge Cover: Complexity and Approximability.
WALCOM
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019 C conf
Extension and Its Price for the Connected Vertex Cover Problem.
IWOCA
Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2019 — —
Extension of NP Optimization Problems. (Extension des problèmes NPO).
Mehdi Khosravian Ghadikolaei
2019 B conf
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity.
FCT
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019 C conf
Extension of Vertex Cover and Independent Set in Some Classes of Graphs.
CIAC
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019 J jnl
How Bad is the Freedom to Flood-It?
J. Graph Algorithms Appl.
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2019 B conf
Weighted Upper Edge Cover: Complexity and Approximability.
WALCOM
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018 J jnl
Extension of vertex cover and independent set in some classes of graphs and generalizations.
CoRR
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018 J jnl
How Bad is the Freedom to Flood-It?
CoRR
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2018 Misc conf
How Bad is the Freedom to Flood-It?.
FUN
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2018 J jnl
On the Complexity of Solution Extension of Optimization Problems.
CoRR
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018 J jnl
Weighted Upper Edge Cover: Complexity and Approximability.
CoRR
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2017 — conf
Extended Spanning Star Forest Problems.
COCOA (1)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis