default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimitri Watel
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Walid Ben-Ameur, Natalia Kushik
, Alessandro Maddaloni, José Neto, Dimitri Watel:
The no-meet matroid. Discret. Appl. Math. 354: 94-107 (2024)- [j9]Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser:
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies. J. Glob. Optim. 89(1): 223-257 (2024) - [j8]Julien Baste, Dimitri Watel:
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theor. Comput. Sci. 990: 114406 (2024) - [c7]Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth:
Maximizing Minimum Cycle Bases Intersection. IWOCA 2024: 55-68 - [i6]Dimitri Watel, Marc-Antoine Weisser, Dominique Barth, Ylène Aboulfath, Thierry Mautor:
Maximizing Minimum Cycle Bases Intersection. CoRR abs/2404.17223 (2024) - [i5]Quentin Japhet, Dimitri Watel, Dominique Barth, Marc-Antoine Weisser:
Maximal Line Digraphs. CoRR abs/2406.05141 (2024) - 2023
- [i4]Dimitri Watel, Pierre-Louis Poirion:
The Maximum Matrix Contraction Problem. CoRR abs/2306.01349 (2023) - [i3]Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser:
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies. CoRR abs/2311.11707 (2023) - 2022
- [j7]Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser:
A polynomial algorithm for deciding the validity of an electrical distribution tree. Inf. Process. Lett. 176: 106249 (2022) - [c6]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. IWCTS@SIGSPATIAL 2022: 2:1-2:4 - 2021
- [j6]Dominique Barth, Thierry Mautor, Arnaud De Moissac, Dimitri Watel, Marc-Antoine Weisser:
Optimisation of electrical network configuration: Complexity and algorithms for ring topologies. Theor. Comput. Sci. 859: 162-173 (2021) - 2020
- [j5]Wilfried Joseph 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. J. Graph Algorithms Appl. 24(3): 133-153 (2020)
2010 – 2019
- 2018
- [j4]Dimitri Watel, Alain Faye:
Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive. Theor. Comput. Sci. 745: 202-223 (2018) - [i2]Stéfi Nouleho, Dominique Barth, Franck Quessette, Marc-Antoine Weisser, Dimitri Watel, Olivier David:
A new graph modelisation for molecule similarity. CoRR abs/1807.04528 (2018) - 2017
- [c5]Dimitri Watel, Marc-Antoine Weisser, Dominique Barth:
Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets. Petri Nets 2017: 330-349 - [i1]Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion, Christophe Picouleau:
Adaptive Network Flow with k-Arc Destruction. CoRR abs/1711.00831 (2017) - 2016
- [j3]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Directed Steiner trees with diffusion costs. J. Comb. Optim. 32(4): 1089-1106 (2016) - [j2]Dimitri Watel, Marc-Antoine Weisser:
A practical greedy approximation for the directed Steiner tree problem. J. Comb. Optim. 32(4): 1327-1370 (2016) - [c4]Dimitri Watel, Pierre-Louis Poirion:
The Maximum Matrix Contraction Problem. ISCO 2016: 426-438 - 2015
- [j1]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes. Inf. Process. Lett. 115(2): 275-279 (2015) - 2014
- [b1]Dimitri Watel:
Approximation de l'arborescence de Steiner. (Approximation of the Directed Steiner Tree Problem). Versailles Saint-Quentin-en-Yvelines University, France, 2014 - [c3]Dimitri Watel, Marc-Antoine Weisser:
A Practical Greedy Approximation for the Directed Steiner Tree Problem. COCOA 2014: 200-215 - [c2]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Directed Steiner Tree with Branching Constraint. COCOON 2014: 263-275 - 2013
- [c1]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Steiner Problems with Limited Number of Branching Nodes. SIROCCO 2013: 310-321
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:34 CET 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:
