| 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 | 26 | 2022 |
| 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 | 21 | 2019 |
| 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 | 21* | 2018 |
| 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 | 13 | 2019 |
| 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 | 12 | 2013 |
| (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 | 9 | 2022 |
| Weighted upper edge cover: Complexity and approximability K Khoshkhah, MK Ghadikolaei, J Monnot, F Sikora Journal of Graph Algorithms and Applications 24 (2), 65-88, 2020 | 9 | 2020 |
| On the Complexity of the Upper r-Tolerant Edge Cover Problem A Harutyunyan, MK Ghadikolaei, N Melissinos, J Monnot, A Pagourtzis Topics in Theoretical Computer Science: Third IFIP WG 1.8 International …, 2020 | 5 | 2020 |
| Abundant extensions K Casel, H Fernau, MK Ghadikolaei, J Monnot, F Sikora Algorithms and Complexity (CIAC) 12701, 3-19, 2021 | 4 | 2021 |
| Weighted upper edge cover: Complexity and approximability K Khoshkhah, MK Ghadikolaei, J Monnot, F Sikora International Workshop on Algorithms and Computation, 235-247, 2018 | 4 | 2018 |
| 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 | 3 | 2020 |
| 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 | 3 | 2019 |
| 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 | 3 | 2019 |
| Extended spanning star forest problems K Khoshkhah, M Khosravian Ghadikolaei, J Monnot, DO Theis International Conference on Combinatorial Optimization and Applications, 195-209, 2017 | 3 | 2017 |
| A Transistor Level Relational Semantics for Electrical Rule Checking by SMT Solving O Oulkaid, B Ferres, M Moy, P Raymond, M Khosravian, L Henrio, ... 2024 Design, Automation & Test in Europe Conference & Exhibition (DATE), 1-6, 2024 | 2 | 2024 |
| Extension of NP Optimization Problems MK Ghadikolaei Université Paris sciences et lettres, 2019 | 2 | 2019 |
| How Bad is the Freedom to Flood-It? R Belmonte, MK Ghadikolaei, M Kiyomi, M Lampis, Y Otachi arXiv preprint arXiv:1804.08236, 2018 | 2 | 2018 |
| 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 |
| Electrical Rule Checking of Integrated Circuits using Satisfiability Modulo Theory B Ferres, O Oulkaid, L Henrio, M Moy, G Radanne, P Raymond 2023 Design, Automation & Test in Europe Conference & Exhibition (DATE), 1-2, 2023 | 1 | 2023 |
| 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 | 1 | 2022 |
jerome monnotdirecteur de recherche, Lamsade, université Paris-Dauphine確認したメール アドレス: lamsade.dauphine.fr