E-LIB Suche - Ergebnisse für: Weisser, Marc-Antoine

1

Maximizing Minimum Cycle Bases Intersection:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Aboulfath, Ylène ; Watel, Dimitri ; Weisser, Marc-Antoine.. - p. 55-68 , 2024

Link: https://doi.org/10.1007/..

2

Configuring an heterogeneous smartgrid network: complexity ..:

Barth, Dominique ; Mautor, Thierry ; Watel, Dimitri.
Journal of Global Optimization. 89 (2023) 1 - p. 223-257 , 2023

Link: https://doi.org/10.1007/..

3

A polynomial algorithm for deciding the validity of an elec..:

Barth, Dominique ; Mautor, Thierry ; Watel, Dimitri.
Information Processing Letters. 176 (2022) - p. 106249 , 2022

Link: https://doi.org/10.1016/..

4

Optimisation of electrical network configuration: Complexit..:

Barth, Dominique ; Mautor, Thierry ; de Moissac, Arnaud..
Theoretical Computer Science. 859 (2021) - p. 162-173 , 2021

Link: https://doi.org/10.1016/..

5

Minimizing the Hamming distance between a graph and a line-..:

Ehounou, Wilfried ; Barth, Dominique ; de Moissac, Arnaud..
Journal of Graph Algorithms and Applications. 24 (2020) 3 - p. 133-153 , 2020

Link: https://doi.org/10.7155/..

6

Improving graphs of cycles approach to structural similarit..:

Nouleho Ilemo, Stefi ; Barth, Dominique ; David, Olivier...
PLOS ONE. 14 (2019) 12 - p. e0226680 , 2019

Link: https://doi.org/10.1371/..

7

The First Approximation Algorithm for the Maximin Latin Hyp..:

Le Guiban, Kaourintin ; Rimmel, Arpad ; Weisser, Marc-Antoine.
Operations Research. 66 (2018) 1 - p. 253-266 , 2018

Link: https://www.jstor.org/st..

8

Completion of partial Latin Hypercube Designs: NP-completen..:

Le Guiban, Kaourintin ; Rimmel, Arpad ; Weisser, Marc-Antoine.
Theoretical Computer Science. 715 (2018) - p. 1-20 , 2018

Link: https://doi.org/10.1016/..

9

A practical greedy approximation for the directed Steiner t..:

Watel, Dimitri ; Weisser, Marc-Antoine
Journal of Combinatorial Optimization. 32 (2016) 4 - p. 1327-1370 , 2016

Link: https://doi.org/10.1007/..

10

Bin packing with fragmentable items: Presentation and appro..:

LeCun, Bertrand ; Mautor, Thierry ; Quessette, Franck.
Theoretical Computer Science. 602 (2015) - p. 50-59 , 2015

Link: https://doi.org/10.1016/..

11

An FPT algorithm in polynomial space for the Directed Stein..:

Watel, Dimitri ; Weisser, Marc-Antoine ; Bentz, Cédric.
Information Processing Letters. 115 (2015) 2 - p. 275-279 , 2015

Link: https://doi.org/10.1016/..

12

Directed Steiner trees with diffusion costs:

Watel, Dimitri ; Weisser, Marc-Antoine ; Bentz, Cédric.
Journal of Combinatorial Optimization. 32 (2015) 4 - p. 1089-1106 , 2015

Link: https://doi.org/10.1007/..

13

Optimal configuration of an optical network providing prede..:

Reinhard, Vincent ; Cohen, Johanne ; Tomasik, Joanna..
Computer Networks. 56 (2012) 8 - p. 2097-2106 , 2012

Link: https://doi.org/10.1016/..

14

Automatic induction of inter-domain hierarchy in randomly g..:

, In: Proceedings of the 2007 spring simulaiton multiconference - Volume 1,

Weisser, Marc-Antoine ; Tomasik, Joanna - p. 77-84 , 2007

Link: https://dl.acm.org/doi/1..

15

Configuring an heterogeneous smartgrid network: complexity ..:

Barth, Dominique ; Mautor, Thierry ; Watel, Dimitri.
info:eu-repo/semantics/altIdentifier/arxiv/2311.11707. , 2023

Link: https://hal.science/hal-..