Marta Pascoal

1.2k total citations
42 papers, 923 citations indexed

About

Marta Pascoal is a scholar working on Electrical and Electronic Engineering, Industrial and Manufacturing Engineering and Computer Networks and Communications. According to data from OpenAlex, Marta Pascoal has authored 42 papers receiving a total of 923 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Electrical and Electronic Engineering, 15 papers in Industrial and Manufacturing Engineering and 12 papers in Computer Networks and Communications. Recurrent topics in Marta Pascoal's work include Advanced Optical Network Technologies (16 papers), Vehicle Routing Optimization Methods (14 papers) and Transportation Planning and Optimization (11 papers). Marta Pascoal is often cited by papers focused on Advanced Optical Network Technologies (16 papers), Vehicle Routing Optimization Methods (14 papers) and Transportation Planning and Optimization (11 papers). Marta Pascoal collaborates with scholars based in Portugal, Italy and Canada. Marta Pascoal's co-authors include João Clı́maco, M. Eugénia Captivo, Gilbert Laporte, José Luís Santos, José Craveirinha, Julie Paquette, Jean-François Cordeau, Lúcia Martins, Teresa Gomes and David Tipper and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Transportation Research Part B Methodological.

In The Last Decade

Marta Pascoal

41 papers receiving 858 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Marta Pascoal Portugal 15 301 276 264 222 142 42 923
Roberto Nardone Italy 16 221 0.7× 281 1.0× 129 0.5× 107 0.5× 63 0.4× 55 858
Mathijs de Weerdt Netherlands 20 285 0.9× 208 0.8× 317 1.2× 66 0.3× 66 0.5× 123 1.2k
Dragan Urošević Serbia 25 228 0.8× 1.1k 4.2× 82 0.3× 104 0.5× 78 0.5× 86 1.6k
Spiridon Bakiras Qatar 14 460 1.5× 190 0.7× 233 0.9× 44 0.2× 305 2.1× 57 1.2k
Karla Hoffman United States 15 191 0.6× 482 1.7× 77 0.3× 104 0.5× 22 0.2× 46 1.0k
Neetesh Kumar India 18 426 1.4× 48 0.2× 276 1.0× 97 0.4× 45 0.3× 58 1.0k
Kaj Holmberg Sweden 19 350 1.2× 622 2.3× 187 0.7× 272 1.2× 26 0.2× 70 1.3k
Domenico Salvagnin Italy 14 171 0.6× 427 1.5× 113 0.4× 133 0.6× 28 0.2× 37 967
Raffaele Cerulli Italy 19 250 0.8× 428 1.6× 194 0.7× 82 0.4× 34 0.2× 74 923
Nicolas Zufferey Switzerland 19 242 0.8× 844 3.1× 83 0.3× 74 0.3× 16 0.1× 75 1.3k

Countries citing papers authored by Marta Pascoal

Since Specialization
Citations

This map shows the geographic impact of Marta Pascoal's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Marta Pascoal with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marta Pascoal more than expected).

Fields of papers citing papers by Marta Pascoal

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marta Pascoal. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Marta Pascoal. The network helps show where Marta Pascoal may publish in the future.

Co-authorship network of co-authors of Marta Pascoal

This figure shows the co-authorship network connecting the top 25 collaborators of Marta Pascoal. A scholar is included among the top collaborators of Marta Pascoal based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Marta Pascoal. Marta Pascoal is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Craveirinha, José, et al.. (2024). Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends. Algorithms. 17(6). 222–222.
2.
Craveirinha, José, Marta Pascoal, & João Clı́maco. (2023). An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks. INFOR Information Systems and Operational Research. 61(3). 399–418. 2 indexed citations
3.
Pascoal, Marta, et al.. (2022). Finding K dissimilar paths: Single-commodity and discretized flow formulations. Computers & Operations Research. 147. 105939–105939. 1 indexed citations
4.
Pascoal, Marta, et al.. (2021). Finding shortest and dissimilar paths. International Transactions in Operational Research. 29(3). 1573–1601. 7 indexed citations
5.
Pascoal, Marta, José Craveirinha, & João Clı́maco. (2021). An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks. Top. 30(2). 405–425. 4 indexed citations
6.
Gomes, Teresa, et al.. (2016). Algorithms for determining a node-disjoint path pair visiting specified nodes. Optical Switching and Networking. 23. 189–204. 18 indexed citations
7.
Laporte, Gilbert & Marta Pascoal. (2015). Path based algorithms for metro network design. Computers & Operations Research. 62. 78–94. 25 indexed citations
8.
Pascoal, Marta, et al.. (2015). Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios. Discrete Optimization. 22. 122–140. 1 indexed citations
9.
Craveirinha, José, João Clı́maco, Lúcia Martins, & Marta Pascoal. (2015). An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks. Telecommunication Systems. 62(2). 327–346. 1 indexed citations
10.
Gomes, Teresa, et al.. (2015). Protected shortest path visiting specified nodes. Virtual Community of Pathological Anatomy (University of Castilla La Mancha). 120–127. 13 indexed citations
11.
Pascoal, Marta, et al.. (2014). The minmax regret robust shortest path problem in a finite multi-scenario model. Applied Mathematics and Computation. 241. 88–111. 8 indexed citations
12.
Laporte, Gilbert & Marta Pascoal. (2012). The pipeline and valve location problem. European J of Industrial Engineering. 6(3). 301–301. 4 indexed citations
13.
Clı́maco, João & Marta Pascoal. (2011). Multicriteria path and tree problems: discussion on exact algorithms and applications. International Transactions in Operational Research. 19(1-2). 63–98. 35 indexed citations
14.
Clı́maco, João & Marta Pascoal. (2009). Finding non-dominated bicriteria shortest pairs of disjoint simple paths. Computers & Operations Research. 36(11). 2892–2898. 14 indexed citations
15.
Almeida, Ana de, J. Fernandes, Marta Pascoal, & Susana P. Pereira. (2009). Experiential Learning in Science: Getting the Laboratory Inside the Classroom Using the Web. Virtual Community of Pathological Anatomy (University of Castilla La Mancha). 327–328. 2 indexed citations
16.
Craveirinha, José, et al.. (2007). Traffic splitting in MPLS networks – a hierarchical multicriteria approach. Journal of Telecommunications and Information Technology. 3–10. 5 indexed citations
17.
Clı́maco, João, Marta Pascoal, José Craveirinha, & M. Eugénia Captivo. (2006). Internet packet routing: Application of a K-quickest path algorithm. European Journal of Operational Research. 181(3). 1045–1054. 63 indexed citations
18.
Pascoal, Marta, M. Eugénia Captivo, & João Clı́maco. (2003). A note on a new variant of Murty’s ranking assignments algorithm. Estudo Geral (Universidade de Coimbra). 16 indexed citations
19.
Pedro, António M. G., et al.. (2002). PRACTICAL STABILIZATION OF THE EXTENDED NONHOLONOMIC DOUBLE INTEGRATOR. 8 indexed citations
20.
Pascoal, Marta, et al.. (1999). DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS. International Journal of Foundations of Computer Science. 10(3). 247–261. 113 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Roberto Nardone Breakdown of academic impact, for papers by Mathijs de Weerdt Breakdown of academic impact, for papers by Dragan Urošević Breakdown of academic impact, for papers by Spiridon Bakiras Breakdown of academic impact, for papers by Karla Hoffman Breakdown of academic impact, for papers by Neetesh Kumar Breakdown of academic impact, for papers by Kaj Holmberg Breakdown of academic impact, for papers by Domenico Salvagnin Breakdown of academic impact, for papers by Raffaele Cerulli Breakdown of academic impact, for papers by Nicolas Zufferey
Rankless by CCL
2026