{"id":3530,"date":"2022-04-13T17:39:03","date_gmt":"2022-04-13T15:39:03","guid":{"rendered":"https:\/\/samovar2022.int-evry.fr\/index.php\/acmes-2\/dimitri-watel-2\/"},"modified":"2022-04-13T17:39:41","modified_gmt":"2022-04-13T15:39:41","slug":"dimitri-watel-2","status":"publish","type":"page","link":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/acmes-2\/dimitri-watel-2\/","title":{"rendered":"Dimitri WATEL"},"content":{"rendered":"

\"

SAMOVAR - SAMOVAR
Telecom SudParis
\r\n9 rue Charles Fourier
\r\n91011 EVRY CEDEX<\/p>

Fax : +33 (0) 1 60 76 20 80<\/p><\/div>

Dimitri Watel<\/span>
(ancien membre depuis 2025)<\/em><\/h1>
Ma\u00eetre de Conf\u00e9rences<\/em>
SOP<\/span><\/a><\/span><\/div>
dimitri.watel[@-Code to remove to avoid SPAM-<\/span>]ensiie.fr<\/span><\/div><\/div><\/div>\n
\n

Article dans une revue<\/p>\n

2025<\/p>\n

\n
ref_biblio<\/dt>
Dominique Barth, Dimitri Watel, Marc-Antoine Weisser. Correcting a graph into a linegraph minimizing hamming distance edition is NP-complete and FPT by treewidth. Journal of Graph Algorithms and Applications<\/i>, 2025, 29 (1), pp.63-90. ⟨10.7155\/jgaa.v29i1.3029⟩<\/a>. ⟨hal-05051712⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-05051712\/file\/JGAA-2024.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2024<\/p>\n

\n
ref_biblio<\/dt>
Julien Baste, Dimitri Watel. An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theoretical Computer Science<\/i>, 2024, 990, pp.114406. ⟨10.1016\/j.tcs.2024.114406⟩<\/a>. ⟨hal-04419217⟩<\/a><\/dd>\n
Acc\u00e8s au bibtex<\/dt>\n
\n\n\"BibTex\"<\/a>\n<\/dd>\n<\/dl>\n

2023<\/p>\n

\n
ref_biblio<\/dt>
Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser. Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies. Journal of Global Optimization<\/i>, 2023, 89, pp.223-257. ⟨10.1007\/s10898-023-01338-0⟩<\/a>. ⟨hal-04289472⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-04289472\/file\/JOGO-2023.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2022<\/p>\n

\n
ref_biblio<\/dt>
Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser. A polynomial algorithm for deciding the validity of an electrical distribution tree. Information Processing Letters<\/i>, 2022, 176, pp.106249. ⟨10.1016\/j.ipl.2022.106249⟩<\/a>. ⟨hal-04113551⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-04113551\/file\/IPL-2021.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, Jos\u00e9 Neto, Dimitri Watel. The no-meet matroid. Discrete Applied Mathematics<\/i>, 2022, ⟨10.1016\/j.dam.2022.12.008⟩<\/a>. ⟨hal-03955928⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-03955928\/file\/Revision2.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2021<\/p>\n

\n
ref_biblio<\/dt>
Dominique Barth, Thierry Mautor, Arnaud de Moissac, Dimitri Watel, Marc-Antoine Weisser. Optimisation of electrical network configuration: complexity and algorithms for ring topologies. Theoretical Computer Science<\/i>, 2021, 859, pp.162-173. ⟨10.1016\/j.tcs.2021.01.023⟩<\/a>. ⟨hal-02018217v2⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-02018217\/file\/TCS-2019.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2020<\/p>\n

\n
ref_biblio<\/dt>
Wilfried Ehounou, Dominique Barth, Arnaud de Moissac, Dimitri Watel, Marc-Antoine Weisser. Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network. Journal of Graph Algorithms and Applications<\/i>, 2020, 24 (3), pp.133-153. ⟨10.7155\/jgaa.00522⟩<\/a>. ⟨hal-04113890⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-04113890\/file\/JGAA-2020.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2019<\/p>\n

\n
ref_biblio<\/dt>
Stefi Nouleho Ilemo, Dominique Barth, Olivier David, Franck Quessette, Marc-Antoine Weisser, et al.. Improving graphs of cycles approach to structural similarity of molecules. PLoS ONE<\/i>, 2019, 14 (12), pp.e0226680. ⟨10.1371\/journal.pone.0226680⟩<\/a>. ⟨hal-04113953⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-04113953\/file\/PLOS-ONE_2020.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2018<\/p>\n

\n
ref_biblio<\/dt>
Dimitri Watel, Alain Faye. Taxi-Sharing: Parameterized Complexity and Approximability of the Dial-a-ride problem with money as an incentive. Theoretical Computer Science<\/i>, 2018, 745, pp.202-223. ⟨10.1016\/j.tcs.2018.06.006⟩<\/a>. ⟨hal-01488042v2⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-01488042\/file\/18-TCS.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2016<\/p>\n

\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser. A practical greedy approximation for the directed Steiner tree problem. Journal of Combinatorial Optimization<\/i>, 2016, 32 (4), pp.1327 - 1370. ⟨10.1007\/s10878-016-0074-0⟩<\/a>. ⟨hal-01613990⟩<\/a><\/dd>\n
Acc\u00e8s au bibtex<\/dt>\n
\n\n\"BibTex\"<\/a>\n<\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser, C\u00e9dric Bentz, Dominique Barth. Directed Steiner trees with diffusion costs. Journal of Combinatorial Optimization<\/i>, 2016, 32 (4), pp.1089 - 1106. ⟨10.1007\/s10878-015-9925-3⟩<\/a>. ⟨hal-01613972⟩<\/a><\/dd>\n
Acc\u00e8s au bibtex<\/dt>\n
\n\n\"BibTex\"<\/a>\n<\/dd>\n<\/dl>\n

2015<\/p>\n

\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser, C\u00e9dric Bentz, Dominique Barth. An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes. Information Processing Letters<\/i>, 2015, 115 (2), pp.275-279. ⟨10.1016\/j.ipl.2014.09.027⟩<\/a>. ⟨hal-01103372⟩<\/a><\/dd>\n
Acc\u00e8s au bibtex<\/dt>\n
\n\n\"BibTex\"<\/a>\n<\/dd>\n<\/dl>\n

Communication dans un congr\u00e8s<\/p>\n

2025<\/p>\n

\n
ref_biblio<\/dt>
Florian Galliot, Hoang La, Rapha\u00eblle Maistre, Matthieu Petiteau, Dimitri Watel. Graph reconstruction from queries on triples (Extended abstract). EUROCOMB\u201925 - 13th European Conference on Combinatorics, Graph Theory and Applications<\/i>, Aug 2025, Budapest, Hungary. ⟨hal-05416454⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-05416454\/file\/final_version.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2022<\/p>\n

\n
ref_biblio<\/dt>
Ylene Aboulfath, Dimitri Watel. Maximiser l'intersection de bases de cycles minimum dans un ensemble de graphes dynamiques. 23\u00e8me congr\u00e8s annuel de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d'Aide \u00e0 la D\u00e9cision<\/i>, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03595327⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-03595327\/file\/ROADEF2022_ABOULFATHWATEL.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Dominique Barth, Dimitri Watel, Marc-Antoine Weisser. Distance d'\u00e9dition minimum \u00e0 un linegraph. 23\u00e8me congr\u00e8s annuel de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d'Aide \u00e0 la D\u00e9cision (ROADEF2022)<\/i>, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03595279⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-03595279\/file\/resume.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Julien Baste, Dimitri Watel. An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. The 11th International Colloquium on Graph Theory and combinatorics<\/i>, Jul 2022, Montpellier, France. pp.1-30, ⟨10.2139\/ssrn.4197048⟩<\/a>. ⟨hal-03790659⟩<\/a><\/dd>\n
Acc\u00e8s au bibtex<\/dt>\n
\n\n\"BibTex\"<\/a>\n<\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Cathia Le Hasif, Andrea Araldo, Stefania Dumbrava, Dimitri Watel. A graph-database approach to assess the impact of demand-responsive services on public transit accessibility. The 30th International Conference on Advances in Geographic Information Systems (SIGSPATIAL )<\/i>, Nov 2022, Seattle Washington, United States. pp.1-4, ⟨10.1145\/3557991.3567798⟩<\/a>. ⟨hal-04233161⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-04233161\/file\/2210.08327.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Hyoseok Kim, Dimitri Watel, Alain Faye, C\u00e9dric Hervet. On the complexity of the data-driven Wasserstein distributionally robust binary problem. 23\u00e8me congr\u00e8s annuel de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d'Aide \u00e0 la D\u00e9cision<\/i>, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03595342⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-03595342\/file\/kim2022wasserstein.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2017<\/p>\n

\n
ref_biblio<\/dt>
Egor Gladkikh, Am\u00e9lie Lambert, Alain Faye, Dimitri Watel, Marie-Christine Costa. Optimisation du maillage \u00e9lectrique du parc \u00e9oliennes off-shore \u2013 projet Stationis. ROADEF 17<\/i>, Feb 2017, Metz, France. ⟨hal-02455568⟩<\/a><\/dd>\n
Acc\u00e8s au bibtex<\/dt>\n
\n\n\"BibTex\"<\/a>\n<\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser, Dominique Barth. Parameterized complexity and approximability of coverability problems in weighted Petri nets. International Conference on Application and Theory of Petri Nets and Concurrency<\/i>, Jun 2017, Zaragoza, Spain. pp.330-349, ⟨10.1007\/978-3-319-57861-3_19⟩<\/a>. ⟨hal-01459206⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-01459206\/file\/pn2017.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2016<\/p>\n

\n
ref_biblio<\/dt>
Dimitri Watel, Pierre-Louis Poirion. The Maximum Matrix Contraction Problem. International Symposium on Combinatorial Optimization<\/i>, May 2016, Vietri sul Mare, Italy. pp.426-438, ⟨10.1007\/978-3-319-45587-7_37⟩<\/a>. ⟨hal-04114016⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-04114016\/file\/ISCO-2016.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2014<\/p>\n

\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser. Le probl\u00e8me de l'arborescence de Steiner dans les r\u00e9seaux tout-optiques. ALGOTEL 2014 -- 16\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications<\/i>, Jun 2014, Le Bois-Plage-en-R\u00e9, France. pp.1-4. ⟨hal-00981268⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-00981268\/file\/ALGOTEL-2014.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser, C\u00e9dric Bentz, Dominique Barth. Directed Steiner Tree with Branching Constraint. 20th International Computing and Combinatorics Conference - COCOON<\/i>, Aug 2014, Atlanta, United States. pp.263-275, ⟨10.1007\/978-3-319-08783-2_23⟩<\/a>. ⟨hal-01067142⟩<\/a><\/dd>\n
Acc\u00e8s au bibtex<\/dt>\n
\n\n\"BibTex\"<\/a>\n<\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser. A practical greedy approximation for the Directed Steiner Tree problem. COCOA 2014<\/i>, Dec 2014, Maui, Hawaii, United States. ⟨hal-01067151⟩<\/a><\/dd>\n
Acc\u00e8s au bibtex<\/dt>\n
\n\n\"BibTex\"<\/a>\n<\/dd>\n<\/dl>\n

2013<\/p>\n

\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser, C\u00e9dric Bentz, Dominique Barth. Steiner Problems with Limited Number of Branching Nodes. SIROCCO 2013<\/i>, Jul 2013, Ischia, Italy. ⟨hal-00877222⟩<\/a><\/dd>\n
Acc\u00e8s au bibtex<\/dt>\n
\n\n\"BibTex\"<\/a>\n<\/dd>\n<\/dl>\n

Rapport<\/p>\n

2013<\/p>\n

\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser, C\u00e9dric Bentz. Inapproximability proof of DSTLB and USTLB in planar graphs. [Research Report] Sup\u00e9lec. 2013. ⟨hal-00793424v2⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/centralesupelec.hal.science\/hal-00793424\/file\/planarcasinapprox.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

Th\u00e8se<\/p>\n

2014<\/p>\n

\n
ref_biblio<\/dt>
Dimitri Watel. Approximation de l'arborescence de Steiner. Autre [cs.OH]. Universit\u00e9 de Versailles-Saint Quentin en Yvelines, 2014. Fran\u00e7ais. ⟨NNT : 2014VERS0025⟩<\/a>. ⟨tel-01130029⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/theses.hal.science\/tel-01130029\/file\/2014VERS0025.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

Pr\u00e9-publication, Document de travail<\/p>\n

2024<\/p>\n

\n
ref_biblio<\/dt>
Yl\u00e8ne Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth. Maximizing minimum cycle bases intersection. 2024. ⟨hal-04559959v2⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-04559959\/file\/IWOCA_2024.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Quentin Japhet, Dimitri Watel, Dominique Barth, Marc-Antoine Weisser. Maximal Line Digraphs. 2024. ⟨hal-04587485v2⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-04587485\/file\/zqfbqtqwgqcbgrtnqxkktgkhwyzdnsyg.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2023<\/p>\n

\n
ref_biblio<\/dt>
Hyoseok Kim, Dimitri Watel, Alain Faye, Hervet C\u00e9dric. On the complexity of the data-driven wasserstein distributionally robust binary problem. 2023. ⟨hal-04143445⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-04143445\/file\/01_STACS_2022_HAL.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2020<\/p>\n

\n
ref_biblio<\/dt>
Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser. Configuration of planar electrical networks with and without double adduction. 2020. ⟨hal-02503854⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-02503854\/file\/HAL_configuration_of_planar_electrical_networks.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion, Christophe Picouleau. Adaptive network flow with $k$-Arc Destruction. 2020. ⟨hal-02440948⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-02440948\/file\/1711.00831.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n
\n
ref_biblio<\/dt>
Dimitri Watel. An FPT Algorithm for Spanning, Steiner and Other subTree Problems Parameterized with the Treewidth.. 2020. ⟨hal-02610732⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-02610732\/file\/ICALP-2020.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n

2016<\/p>\n

\n
ref_biblio<\/dt>
Dimitri Watel, Marc-Antoine Weisser. A note on the inapproximability of the Minimum Monotone Satisfying Assignment problem. 2016. ⟨hal-01377704⟩<\/a><\/dd>\n
Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
\n\n\"https:\/\/hal.science\/hal-01377704\/file\/IPL-2016.pdf\"<\/a>\n\n\"BibTex\"<\/a>\n<\/span><\/dd>\n<\/dl>\n<\/div>\n<\/p>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":4,"featured_media":4434,"parent":2438,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"ocean_post_layout":"","ocean_both_sidebars_style":"","ocean_both_sidebars_content_width":0,"ocean_both_sidebars_sidebars_width":0,"ocean_sidebar":"0","ocean_second_sidebar":"0","ocean_disable_margins":"enable","ocean_add_body_class":"","ocean_shortcode_before_top_bar":"","ocean_shortcode_after_top_bar":"","ocean_shortcode_before_header":"","ocean_shortcode_after_header":"","ocean_has_shortcode":"","ocean_shortcode_after_title":"","ocean_shortcode_before_footer_widgets":"","ocean_shortcode_after_footer_widgets":"","ocean_shortcode_before_footer_bottom":"","ocean_shortcode_after_footer_bottom":"","ocean_display_top_bar":"default","ocean_display_header":"default","ocean_header_style":"","ocean_center_header_left_menu":"0","ocean_custom_header_template":"0","ocean_custom_logo":0,"ocean_custom_retina_logo":0,"ocean_custom_logo_max_width":0,"ocean_custom_logo_tablet_max_width":0,"ocean_custom_logo_mobile_max_width":0,"ocean_custom_logo_max_height":0,"ocean_custom_logo_tablet_max_height":0,"ocean_custom_logo_mobile_max_height":0,"ocean_header_custom_menu":"0","ocean_menu_typo_font_family":"0","ocean_menu_typo_font_subset":"","ocean_menu_typo_font_size":0,"ocean_menu_typo_font_size_tablet":0,"ocean_menu_typo_font_size_mobile":0,"ocean_menu_typo_font_size_unit":"px","ocean_menu_typo_font_weight":"","ocean_menu_typo_font_weight_tablet":"","ocean_menu_typo_font_weight_mobile":"","ocean_menu_typo_transform":"","ocean_menu_typo_transform_tablet":"","ocean_menu_typo_transform_mobile":"","ocean_menu_typo_line_height":0,"ocean_menu_typo_line_height_tablet":0,"ocean_menu_typo_line_height_mobile":0,"ocean_menu_typo_line_height_unit":"","ocean_menu_typo_spacing":0,"ocean_menu_typo_spacing_tablet":0,"ocean_menu_typo_spacing_mobile":0,"ocean_menu_typo_spacing_unit":"","ocean_menu_link_color":"","ocean_menu_link_color_hover":"","ocean_menu_link_color_active":"","ocean_menu_link_background":"","ocean_menu_link_hover_background":"","ocean_menu_link_active_background":"","ocean_menu_social_links_bg":"","ocean_menu_social_hover_links_bg":"","ocean_menu_social_links_color":"","ocean_menu_social_hover_links_color":"","ocean_disable_title":"default","ocean_disable_heading":"default","ocean_post_title":"","ocean_post_subheading":"","ocean_post_title_style":"","ocean_post_title_background_color":"","ocean_post_title_background":0,"ocean_post_title_bg_image_position":"","ocean_post_title_bg_image_attachment":"","ocean_post_title_bg_image_repeat":"","ocean_post_title_bg_image_size":"","ocean_post_title_height":0,"ocean_post_title_bg_overlay":0.5,"ocean_post_title_bg_overlay_color":"","ocean_disable_breadcrumbs":"default","ocean_breadcrumbs_color":"","ocean_breadcrumbs_separator_color":"","ocean_breadcrumbs_links_color":"","ocean_breadcrumbs_links_hover_color":"","ocean_display_footer_widgets":"default","ocean_display_footer_bottom":"default","ocean_custom_footer_template":"0","footnotes":""},"class_list":["post-3530","page","type-page","status-publish","has-post-thumbnail","hentry","entry","has-media"],"_links":{"self":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/3530","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/comments?post=3530"}],"version-history":[{"count":1,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/3530\/revisions"}],"predecessor-version":[{"id":3531,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/3530\/revisions\/3531"}],"up":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/2438"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/media\/4434"}],"wp:attachment":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/media?parent=3530"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}