Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Dimitri Watel
@article{DBLP:journals/corr/abs-2306-01349,
author = {Dimitri Watel and
Pierre{-}Louis Poirion},
title = {The Maximum Matrix Contraction Problem},
journal = {CoRR},
volume = {abs/2306.01349},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.01349},
doi = {10.48550/ARXIV.2306.01349},
eprinttype = {arXiv},
eprint = {2306.01349},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-01349.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-11707,
author = {Dominique Barth and
Thierry Mautor and
Dimitri Watel and
Marc{-}Antoine Weisser},
title = {Configuring an heterogeneous smartgrid network: complexity and approximations
for tree topologies},
journal = {CoRR},
volume = {abs/2311.11707},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.11707},
doi = {10.48550/ARXIV.2311.11707},
eprinttype = {arXiv},
eprint = {2311.11707},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-11707.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarthMWW22,
author = {Dominique Barth and
Thierry Mautor and
Dimitri Watel and
Marc{-}Antoine Weisser},
title = {A polynomial algorithm for deciding the validity of an electrical
distribution tree},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106249},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106249},
doi = {10.1016/J.IPL.2022.106249},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BarthMWW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/HasifADW22,
author = {Cathia Le Hasif and
Andrea Araldo and
Stefania Dumbrava and
Dimitri Watel},
editor = {Andy Berres and
Kuldeep R. Kurte and
Haowen Xu},
title = {A graph-database approach to assess the impact of demand-responsive
services on public transit accessibility},
booktitle = {Proceedings of the 15th {ACM} {SIGSPATIAL} International Workshop
on Computational Transportation Science, {IWCTS} 2022, Seattle, Washington,
1 November 2022},
pages = {2:1--2:4},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3557991.3567798},
doi = {10.1145/3557991.3567798},
timestamp = {Thu, 17 Nov 2022 16:36:25 +0100},
biburl = {https://dblp.org/rec/conf/gis/HasifADW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BarthMMWW21,
author = {Dominique Barth and
Thierry Mautor and
Arnaud De Moissac and
Dimitri Watel and
Marc{-}Antoine Weisser},
title = {Optimisation of electrical network configuration: Complexity and algorithms
for ring topologies},
journal = {Theor. Comput. Sci.},
volume = {859},
pages = {162--173},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.01.023},
doi = {10.1016/J.TCS.2021.01.023},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BarthMMWW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EhounouBMWW20,
author = {Wilfried Joseph Ehounou and
Dominique Barth and
Arnaud De Moissac and
Dimitri Watel and
Marc{-}Antoine Weisser},
title = {Minimizing the Hamming distance between a graph and a line-graph to
discover the topology of an electrical network},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {133--153},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00522},
doi = {10.7155/JGAA.00522},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EhounouBMWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WatelF18,
author = {Dimitri Watel and
Alain Faye},
title = {Taxi-sharing: Parameterized complexity and approximability of the
dial-a-ride problem with money as an incentive},
journal = {Theor. Comput. Sci.},
volume = {745},
pages = {202--223},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.06.006},
doi = {10.1016/J.TCS.2018.06.006},
timestamp = {Mon, 10 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/WatelF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-04528,
author = {St{\'{e}}fi Nouleho and
Dominique Barth and
Franck Quessette and
Marc{-}Antoine Weisser and
Dimitri Watel and
Olivier David},
title = {A new graph modelisation for molecule similarity},
journal = {CoRR},
volume = {abs/1807.04528},
year = {2018},
url = {http://arxiv.org/abs/1807.04528},
eprinttype = {arXiv},
eprint = {1807.04528},
timestamp = {Thu, 17 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-04528.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apn/WatelWB17,
author = {Dimitri Watel and
Marc{-}Antoine Weisser and
Dominique Barth},
editor = {Wil M. P. van der Aalst and
Eike Best},
title = {Parameterized Complexity and Approximability of Coverability Problems
in Weighted Petri Nets},
booktitle = {Application and Theory of Petri Nets and Concurrency - 38th International
Conference, {PETRI} {NETS} 2017, Zaragoza, Spain, June 25-30, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10258},
pages = {330--349},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57861-3\_19},
doi = {10.1007/978-3-319-57861-3\_19},
timestamp = {Wed, 25 Sep 2019 18:08:03 +0200},
biburl = {https://dblp.org/rec/conf/apn/WatelWB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-00831,
author = {Thomas Ridremont and
Dimitri Watel and
Pierre{-}Louis Poirion and
Christophe Picouleau},
title = {Adaptive Network Flow with k-Arc Destruction},
journal = {CoRR},
volume = {abs/1711.00831},
year = {2017},
url = {http://arxiv.org/abs/1711.00831},
eprinttype = {arXiv},
eprint = {1711.00831},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-00831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WatelWBB16,
author = {Dimitri Watel and
Marc{-}Antoine Weisser and
C{\'{e}}dric Bentz and
Dominique Barth},
title = {Directed Steiner trees with diffusion costs},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1089--1106},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9925-3},
doi = {10.1007/S10878-015-9925-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WatelWBB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WatelW16,
author = {Dimitri Watel and
Marc{-}Antoine Weisser},
title = {A practical greedy approximation for the directed Steiner tree problem},
journal = {J. Comb. Optim.},
volume = {32},
number = {4},
pages = {1327--1370},
year = {2016},
url = {https://doi.org/10.1007/s10878-016-0074-0},
doi = {10.1007/S10878-016-0074-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WatelW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/WatelP16,
author = {Dimitri Watel and
Pierre{-}Louis Poirion},
editor = {Raffaele Cerulli and
Satoru Fujishige and
Ali Ridha Mahjoub},
title = {The Maximum Matrix Contraction Problem},
booktitle = {Combinatorial Optimization - 4th International Symposium, {ISCO} 2016,
Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9849},
pages = {426--438},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-45587-7\_37},
doi = {10.1007/978-3-319-45587-7\_37},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/WatelP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WatelWBB15,
author = {Dimitri Watel and
Marc{-}Antoine Weisser and
C{\'{e}}dric Bentz and
Dominique Barth},
title = {An {FPT} algorithm in polynomial space for the Directed Steiner Tree
problem with Limited number of Diffusing nodes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {275--279},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.027},
doi = {10.1016/J.IPL.2014.09.027},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WatelWBB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Watel14,
author = {Dimitri Watel},
title = {Approximation de l'arborescence de Steiner. (Approximation of the
Directed Steiner Tree Problem)},
school = {Versailles Saint-Quentin-en-Yvelines University, France},
year = {2014},
url = {https://tel.archives-ouvertes.fr/tel-01130029},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Watel14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/WatelW14,
author = {Dimitri Watel and
Marc{-}Antoine Weisser},
editor = {Zhao Zhang and
Lidong Wu and
Wen Xu and
Ding{-}Zhu Du},
title = {A Practical Greedy Approximation for the Directed Steiner Tree Problem},
booktitle = {Combinatorial Optimization and Applications - 8th International Conference,
{COCOA} 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8881},
pages = {200--215},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12691-3\_16},
doi = {10.1007/978-3-319-12691-3\_16},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/WatelW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/WatelWBB14,
author = {Dimitri Watel and
Marc{-}Antoine Weisser and
C{\'{e}}dric Bentz and
Dominique Barth},
editor = {Zhipeng Cai and
Alex Zelikovsky and
Anu G. Bourgeois},
title = {Directed Steiner Tree with Branching Constraint},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}
2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8591},
pages = {263--275},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08783-2\_23},
doi = {10.1007/978-3-319-08783-2\_23},
timestamp = {Thu, 20 Aug 2020 15:36:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/WatelWBB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/WatelWBB13,
author = {Dimitri Watel and
Marc{-}Antoine Weisser and
C{\'{e}}dric Bentz and
Dominique Barth},
editor = {Thomas Moscibroda and
Adele A. Rescigno},
title = {Steiner Problems with Limited Number of Branching Nodes},
booktitle = {Structural Information and Communication Complexity - 20th International
Colloquium, {SIROCCO} 2013, Ischia, Italy, July 1-3, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8179},
pages = {310--321},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03578-9\_26},
doi = {10.1007/978-3-319-03578-9\_26},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/WatelWBB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 18:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
