Lúcia Martins

Orcid: 0000-0002-6534-0159

According to our database1, Lúcia Martins authored at least 40 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Access Point Selection for Spectral Efficiency and Load Balancing Optimization in Radio Stripes.
IEEE Commun. Lett., September, 2023

Two Algorithms for the k-Widest Path Problem.
J. Netw. Syst. Manag., July, 2023

A biobjective availability optimization problem with nonlinear constraints.
Ann. des Télécommunications, February, 2023

2022
Near Optimal Network Design for Path Pair Availability Guarantees.
Proceedings of the 12th International Workshop on Resilient Networks Design and Modeling, 2022

Resilient SDN Intercontroller Network Design under Availability Requirements and Geodiversity Constraints.
Proceedings of the 18th International Conference on the Design of Reliable Communication Networks, 2022

2021
Determining the Minimum Cost Steiner Tree for Delay Constrained Problems.
IEEE Access, 2021

Improving East/Westbound SDN Connectivity via Enhanced Availability.
Proceedings of the 12th International Conference on Network of the Future, 2021

2020
Disaster-Resilient Routing Schemes for Regional Failures.
Proceedings of the Guide to Disaster-Resilient Communication Networks, 2020

Enhancing Availability for Critical Services.
Proceedings of the Guide to Disaster-Resilient Communication Networks, 2020

A Heuristic Method for Controller Placement and Enhanced Availability between SDN Controllers.
Proceedings of the 11th International Conference on Network of the Future, 2020

A centrality-based heuristic for network design to support availability differentiation.
Proceedings of the 16th International Conference on the Design of Reliable Communication Networks, 2020

2019
Minimization of the network availability upgrade cost with geodiverse routing for disaster resilience.
Opt. Switch. Netw., 2019

Regeneration and grooming in MPLS over WDM networks.
JOCN, 2019

Dynamic Multicriteria Alternative Routing for single- and multi-service reservation-oriented networks and its performance.
Ann. des Télécommunications, 2019

Heuristic Approach for the Design of a High Availability Structure.
Proceedings of the 15th International Conference on the Design of Reliable Communication Networks, 2019

Weighted Euclidean Steiner Trees for Disaster-Aware Network Design.
Proceedings of the 15th International Conference on the Design of Reliable Communication Networks, 2019

2017
Algorithms for determining a node-disjoint path pair visiting specified nodes.
Opt. Switch. Netw., 2017

Efficient heuristics for determining node-disjoint path pairs visiting specified nodes.
Networks, 2017

Minimizing the network availability upgrade cost with geodiversity guarantees.
Proceedings of the 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM), 2017

2016
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks.
Telecommun. Syst., 2016

A survey on network resiliency methodologies against weather-based disruptions.
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016

A New Arc-Disjoint-Trees scheme for survivable multicasting in mixed-graph sparse-splitting optical networks.
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016

An efficient heuristic for calculating a protected path with specified nodes.
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016

A survey of strategies for communication networks to protect against large-scale natural disasters.
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016

Impairment-aware optimization strategies to dimension optical transport networks with minimal regeneration requirements.
Proceedings of the 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2016

2015
An effective algorithm for computing all-terminal reliability bounds.
Networks, 2015

Protected shortest path visiting specified nodes.
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

2013
A bi-criteria minimum spanning tree routing model for MPLS/overlay networks.
Telecommun. Syst., 2013

Network performance improvement through evaluation of bicriteria routing methods in transport networks.
Proceedings of the 9th International Conference on Network and Service Management, 2013

2012
Protected bicriteria paths in transport networks.
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

2011
A bi-criteria approach for Steiner's tree problems in communication networks.
Proceedings of the 2011 International Workshop on Modeling, 2011

Architecture and traffic modelling of a utility metering wireless sensor network.
Proceedings of EUROCON 2011, 2011

A bi-criteria algorithm for multipoint-to-multipoint virtual connections in transport networks.
Proceedings of the 7th International Conference on Network and Service Management, 2011

2010
Dynamic alternative routing with local protection paths in MPLS networks.
Proceedings of the International Conference on Ultra Modern Telecommunications, 2010

2009
Evaluation of a Multiobjective Alternative Routing Method in Carrier IP/MPLS Networks.
Proceedings of the NETWORKING 2009, 2009

2007
A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes.
Proceedings of the System Modeling and Optimization, 2007

2006
A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance.
Comput. Manag. Sci., 2006

2005
On a bi-dimensional dynamic alternative routing method.
Eur. J. Oper. Res., 2005

2002
An efficient algorithm for sequential generation of failure states in a network with multi-mode components.
Reliab. Eng. Syst. Saf., 2002

2001
An Algorithm for Calculating the k Most Reliable Link Disjoint Paths with a Maximum Number of Arcs in Each Path.
Proceedings of the 3rd International Workshop on the Design of Reliable Communication Networks, 2001


  Loading...