Marc-Antoine Weisser

Orcid: 0000-0002-5744-1005

According to our database1, Marc-Antoine Weisser authored at least 27 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies.
J. Glob. Optim., May, 2024

Maximal Line Digraphs.
CoRR, 2024

Maximizing Minimum Cycle Bases Intersection.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2022
A polynomial algorithm for deciding the validity of an electrical distribution tree.
Inf. Process. Lett., 2022

2021
Optimisation of electrical network configuration: Complexity and algorithms for ring topologies.
Theor. Comput. Sci., 2021

2020
Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network.
J. Graph Algorithms Appl., 2020

2018
Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability.
Theor. Comput. Sci., 2018

The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem.
Oper. Res., 2018

A new graph modelisation for molecule similarity.
CoRR, 2018

2017
Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2017

2016
Directed Steiner trees with diffusion costs.
J. Comb. Optim., 2016

A practical greedy approximation for the directed Steiner tree problem.
J. Comb. Optim., 2016

2015
Bin packing with fragmentable items: Presentation and approximations.
Theor. Comput. Sci., 2015

An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes.
Inf. Process. Lett., 2015

2014
A Packing Problem Approach to Lightpath Assignment in an Optical Ring.
Comput. J., 2014

Directed Steiner Tree with Branching Constraint.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Steiner Problems with Limited Number of Branching Nodes.
Proceedings of the Structural Information and Communication Complexity, 2013

2012
Optimal configuration of an optical network providing predefined multicast transmissions.
Comput. Networks, 2012

Minimization of the Receiver Cost in an All-Optical Ring with a Limited Number of Wavelengths.
Proceedings of the Computer and Information Sciences III, 2012

The inter-domain hierarchy in measured and randomly generated AS-level topologies.
Proceedings of IEEE International Conference on Communications, 2012

2011
Performance Improvement of an Optical Network Providing Services Based on Multicast.
Proceedings of the Computer and Information Sciences II, 2011

2010
aSHIIP: Autonomous Generator of Random Internet-like Topologies with Inter-domain Hierarchy.
Proceedings of the MASCOTS 2010, 2010

Internet topology on as-level: Model, generation methods and tool.
Proceedings of the 29th International Performance Computing and Communications Conference, 2010

2009
Efficient Micro-Mobility with Congestion Avoiding in Two-Nodes Mobile IP Network Architecture.
Proceedings of the NTMS 2009, 2009

Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks.
Proceedings of the NETWORKING 2009, 2009

2008
Congestion Avoiding Mechanism Based on Inter-domain Hierarchy.
Proceedings of the NETWORKING 2008, Ad Hoc and Sensor Networks, Wireless Networks, 2008

2007
Automatic induction of inter-domain hierarchy in randomly generated network topologies.
Proceedings of the 2007 Spring Simulation Multiconference, 2007


  Loading...