default search action
Marc-Antoine Weisser
2020 – today
- 2024
- [j12]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) - [c14]Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth:
Maximizing Minimum Cycle Bases Intersection. IWOCA 2024: 55-68 - [i5]Dimitri Watel, Marc-Antoine Weisser, Dominique Barth, Ylène Aboulfath, Thierry Mautor:
Maximizing Minimum Cycle Bases Intersection. CoRR abs/2404.17223 (2024) - [i4]Quentin Japhet, Dimitri Watel, Dominique Barth, Marc-Antoine Weisser:
Maximal Line Digraphs. CoRR abs/2406.05141 (2024) - 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
- [j11]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) - 2021
- [j10]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
- [j9]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
- [j8]Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik:
The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem. Oper. Res. 66(1): 253-266 (2018) - [j7]Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik:
Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability. Theor. Comput. Sci. 715: 1-20 (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
- [c13]Dimitri Watel, Marc-Antoine Weisser, Dominique Barth:
Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets. Petri Nets 2017: 330-349 - 2016
- [j6]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Directed Steiner trees with diffusion costs. J. Comb. Optim. 32(4): 1089-1106 (2016) - [j5]Dimitri Watel, Marc-Antoine Weisser:
A practical greedy approximation for the directed Steiner tree problem. J. Comb. Optim. 32(4): 1327-1370 (2016) - 2015
- [j4]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) - [j3]Bertrand Le Cun, Thierry Mautor, Franck Quessette, Marc-Antoine Weisser:
Bin packing with fragmentable items: Presentation and approximations. Theor. Comput. Sci. 602: 50-59 (2015) - 2014
- [j2]David Poulain, Joanna Tomasik, Marc-Antoine Weisser, Dominique Barth:
A Packing Problem Approach to Lightpath Assignment in an Optical Ring. Comput. J. 57(8): 1155-1166 (2014) - [c12]Dimitri Watel, Marc-Antoine Weisser:
A Practical Greedy Approximation for the Directed Steiner Tree Problem. COCOA 2014: 200-215 - [c11]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Directed Steiner Tree with Branching Constraint. COCOON 2014: 263-275 - 2013
- [c10]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Steiner Problems with Limited Number of Branching Nodes. SIROCCO 2013: 310-321 - 2012
- [j1]Vincent Reinhard, Johanne Cohen, Joanna Tomasik, Dominique Barth, Marc-Antoine Weisser:
Optimal configuration of an optical network providing predefined multicast transmissions. Comput. Networks 56(8): 2097-2106 (2012) - [c9]Joanna Tomasik, Marc-Antoine Weisser:
The inter-domain hierarchy in measured and randomly generated AS-level topologies. ICC 2012: 1448-1453 - [c8]David Poulain, Joanna Tomasik, Marc-Antoine Weisser, Dominique Barth:
Minimization of the Receiver Cost in an All-Optical Ring with a Limited Number of Wavelengths. ISCIS 2012: 239-247 - 2011
- [c7]Vincent Reinhard, Johanne Cohen, Joanna Tomasik, Dominique Barth, Marc-Antoine Weisser:
Performance Improvement of an Optical Network Providing Services Based on Multicast. ISCIS 2011: 239-246 - [i1]Vincent Reinhard, Johanne Cohen, Joanna Tomasik, Dominique Barth, Marc-Antoine Weisser:
Performance improvement of an optical network providing services based on multicast. CoRR abs/1105.0438 (2011) - 2010
- [c6]Joanna Tomasik, Marc-Antoine Weisser:
Internet topology on as-level: Model, generation methods and tool. IPCCC 2010: 263-270 - [c5]Joanna Tomasik, Marc-Antoine Weisser:
aSHIIP: Autonomous Generator of Random Internet-like Topologies with Inter-domain Hierarchy. MASCOTS 2010: 388-390
2000 – 2009
- 2009
- [c4]Vincent Reinhard, Joanna Tomasik, Dominique Barth, Marc-Antoine Weisser:
Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks. Networking 2009: 859-870 - [c3]Yacine Benallouche, Dominique Barth, Salah Karouia, Marc-Antoine Weisser:
Efficient Micro-Mobility with Congestion Avoiding in Two-Nodes Mobile IP Network Architecture. NTMS 2009: 1-6 - 2008
- [c2]Marc-Antoine Weisser, Joanna Tomasik, Dominique Barth:
Congestion Avoiding Mechanism Based on Inter-domain Hierarchy. Networking 2008: 470-481 - 2007
- [c1]Marc-Antoine Weisser, Joanna Tomasik:
Automatic induction of inter-domain hierarchy in randomly generated network topologies. SpringSim (1) 2007: 77-84
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.
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.
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.
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 2025-01-09 12:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint