| A practical greedy approximation for the directed Steiner tree problem D Watel, MA Weisser Journal of Combinatorial Optimization 32 (4), 1327-1370, 2016 | 28 | 2016 |
| A practical greedy approximation for the directed Steiner tree problem D Watel, MA Weisser Journal of Combinatorial Optimization 32 (4), 1327-1370, 2016 | 28 | 2016 |
| Improving graphs of cycles approach to structural similarity of molecules S Nouleho Ilemo, D Barth, O David, F Quessette, MA Weisser, D Watel PloS one 14 (12), e0226680, 2019 | 13 | 2019 |
| Steiner problems with limited number of branching nodes D Watel, MA Weisser, C Bentz, D Barth International Colloquium on Structural Information and Communication …, 2013 | 11 | 2013 |
| Directed Steiner trees with diffusion costs D Watel, MA Weisser, C Bentz, D Barth Journal of Combinatorial Optimization 32 (4), 1089-1106, 2016 | 10 | 2016 |
| Directed Steiner tree with branching constraint D Watel, MA Weisser, C Bentz, D Barth International Computing and Combinatorics Conference, 263-275, 2014 | 8 | 2014 |
| Taxi-Sharing: Parameterized Complexity and Approximability of the Dial-a-ride problem with money as an incentive D Watel, A Faye Theoretical Computer Science 745, 202-223, 2018 | 6 | 2018 |
| Approximation de l'arborescence de Steiner D Watel Versailles-St Quentin en Yvelines, 2014 | 5 | 2014 |
| Optimisation of electrical network configuration: complexity and algorithms for ring topologies D Barth, T Mautor, A De Moissac, D Watel, MA Weisser | 4 | 2019 |
| Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network. WJ Ehounou, D Barth, A De Moissac, D Watel, MA Weisser J. Graph Algorithms Appl. 24 (3), 133-153, 2020 | 3 | 2020 |
| Adaptive Network Flow with -Arc Destruction T Ridremont, D Watel, PL Poirion, C Picouleau arXiv preprint arXiv:1711.00831, 2017 | 2 | 2017 |
| A note on the inapproximability of the Minimum Monotone Satisfying Assignment problem D Watel, MA Weisser | 2 | 2016 |
| A new graph modelisation for molecule similarity S Nouleho, D Barth, F Quessette, MA Weisser, D Watel, O David arXiv preprint arXiv:1807.04528, 2018 | 1 | 2018 |
| Parameterized complexity and approximability of coverability problems in weighted Petri nets D Watel, MA Weisser, D Barth International Conference on Application and Theory of Petri Nets and …, 2017 | 1 | 2017 |
| Static Dial-a-Ride Problem with Money as an Incentive: Study of the Cost Constraint A Faye, D Watel | 1 | 2016 |
| An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes D Watel, MA Weisser, C Bentz, D Barth Information Processing Letters 115 (2), 275-279, 2015 | 1 | 2015 |
| Inapproximability proof of DSTLB and USTLB in planar graphs D Watel, MA Weisser, C Bentz | 1 | 2013 |
| An FPT Algorithm for Spanning, Steiner and Other subTree Problems Parameterized with the Treewidth. D Watel | | 2020 |
| Configuration of planar electrical networks with and without double adduction D Barth, T Mautor, D Watel, MA Weisser | | 2020 |
| Parameterized Complexity of Spanning Tree Problems with Local Constraints. D Watel, M Merabet EasyChair, 2020 | | 2020 |
Marc-Antoine WeisserSupélecVerified email at supelec.fr
Marc-Antoine WeisserSupélecVerified email at supelec.fr