Folgen
Mehdi Khosravian Ghadikolaei
Mehdi Khosravian Ghadikolaei
LAMSADE - http://www.lamsade.dauphine.fr
Bestätigte E-Mail-Adresse bei dauphine.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
On the complexity of solution extension of optimization problems
K Casel, H Fernau, MK Ghadikolaei, J Monnot, F Sikora
Theoretical Computer Science 904, 48-65, 2022
172022
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
K Casel, H Fernau, MK Ghadikoalei, J Monnot, F Sikora
International Conference on Algorithms and Complexity, 124-136, 2019
152019
Extension of vertex cover and independent set in some classes of graphs and generalizations
K Casel, H Fernau, MK Ghadikolaei, J Monnot, F Sikora
arXiv preprint arXiv:1810.04629, 2018
15*2018
Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
A Didandeh, BS Bigham, M Khosravian, FB Moghaddam
Information Sciences 234, 203-216, 2013
112013
Weighted upper edge cover: Complexity and approximability
K Khoshkhah, MK Ghadikolaei, J Monnot, F Sikora
International Workshop on Algorithms and Computation, 235-247, 2019
102019
Extension of some edge graph problems: standard and parameterized complexity
K Casel, H Fernau, M Khosravian Ghadikolaei, J Monnot, F Sikora
International Symposium on Fundamentals of Computation Theory, 185-200, 2019
72019
(In) approximability of maximum minimal FVS
L Dublois, T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos
arXiv preprint arXiv:2009.09971, 2020
62020
On the Complexity of the Upper r-Tolerant Edge Cover Problem
A Harutyunyan, MK Ghadikolaei, N Melissinos, J Monnot, A Pagourtzis
International Conference on Topics in Theoretical Computer Science, 32-47, 2020
42020
Extension and its price for the connected vertex cover problem
M Khosravian Ghadikoalei, N Melissinos, J Monnot, A Pagourtzis
International Workshop on Combinatorial Algorithms, 315-326, 2019
42019
Abundant extensions
K Casel, H Fernau, MK Ghadikolaei, J Monnot, F Sikora
Algorithms and Complexity 12701, 3-19, 2021
32021
31st International Symposium on Algorithms and Computation (ISAAC 2020)
S Oum, K Yi, L Dublois, T Hanaka, M Khosravian Ghadikolaei, M Lampis, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
32020
Complexity and approximability of extended spanning star forest problems in general and complete graphs
K Khoshkhah, MK Ghadikolaei, J Monnot, DO Theis
Theoretical Computer Science 775, 1-15, 2019
32019
Extended spanning star forest problems
K Khoshkhah, M Khosravian Ghadikolaei, J Monnot, DO Theis
International Conference on Combinatorial Optimization and Applications, 195-209, 2017
22017
A Reactive-Agent Based Approach for a Facility Location Problem Using Dynamic Addiively Weighted Voronoi Diagram
A Didandeh, M Khosravian, BS Bigham
EuroCG 26, 125-128, 2010
2*2010
(In) approximability of maximum minimal FVS
L Dublois, T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos
Journal of Computer and System Sciences 124, 26-40, 2022
12022
Extension and its price for the connected vertex cover problem
MK Ghadikolaei, N Melissinos, J Monnot, A Pagourtzis
Theoretical Computer Science 904, 66-80, 2022
12022
Extension of NP Optimization Problems
M Khosravian Ghadikolaei
12019
How Bad is the Freedom to Flood-It?
R Belmonte, MK Ghadikolaei, M Kiyomi, M Lampis, Y Otachi
arXiv preprint arXiv:1804.08236, 2018
12018
Exploring Rectangular Grid Environments
M Davoodi, MK Ghadikolaei, MM Malekizadeh
1st Iranian Conference on Computational Geometry,, 2018
12018
Weighted upper edge cover: Complexity and approximability
K Khoshkhah, M Khosravian Ghadikolaei, J Monnot, F Sikora
2020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20