The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexedmodel. - Luis Eduardo Neves Gouveia; Pedro Martins 002 (Ann. Oper. Res., 1999)

A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem. - Luis Eduardo Neves Gouveia; Pedro Martins 002 (Networks, 2000)

The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. - Luis Eduardo Neves Gouveia; Pedro Martins 002 (Comput. Oper. Res., 2005)

Workforce planning in a lotsizing mail processing problem. - Joaquim Júdice; Pedro Martins 002; Jacinto Nunes (Comput. Oper. Res., 2005)

Enhanced second order algorithm applied to the capacitated minimum spanning tree problem. - Pedro Martins 002 (Comput. Oper. Res., 2007)

LX-Service: Web Services of Language Technology for Portuguese. - António Branco; Francisco Costa; Pedro Martins 002; Filipe Nunes; João Ricardo Silva; Sara Silveira (LREC, 2008)

Supporting e-Learning with Language Technology for Portuguese. - Mariana Avelãs; António Branco; Rosa Del Gaudio; Pedro Martins 002 (PROPOR, 2008)

Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem. - Maurício C. de Souza; Pedro Martins 002 (Eur. J. Oper. Res., 2008)

LX-Center: a center of online linguistic services. - António Branco; Francisco Costa; Eduardo Ferreira; Pedro Martins 002; Filipe Nunes; João Ricardo Silva; Sara Silveira (ACL/IJCNLP (Software Demonstrations), 2009)

VNS and second order heuristics for the min-degree constrained minimum spanning tree problem. - Pedro Martins 002; Maurício C. de Souza (Comput. Oper. Res., 2009)

Extended and discretized formulations for the maximum clique problem. - Pedro Martins 002 (Comput. Oper. Res., 2010)

md-MST is NP-hard for d>=3. - Ana Maria de Almeida 002; Pedro Martins 002; Maurício C. de Souza (Electron. Notes Discret. Math., 2010)

Being Happy, Healthy and Whole Watching Movies That Affect Our Emotions. - Teresa Chambel; Eva Oliveira; Pedro Martins 002 (ACII (1), 2011)

Ifelt: accessing movies through our emotions. - Eva Oliveira; Pedro Martins 002; Teresa Chambel (EuroITV, 2011)

MovieClouds: content-based overviews and exploratory browsing of movies. - Pedro Martins 002; Thibault Langlois; Teresa Chambel (MindTrek, 2011)

Going through the clouds: search overviews and browsing of movies. - Nuno Gil; Nuno Tavares Silva; A. Eduardo Dias; Pedro Martins 002; Thibault Langlois; Teresa Chambel (MindTrek, 2012)

Cliques with maximum/minimum edge neighborhood and neighborhood density. - Pedro Martins 002 (Comput. Oper. Res., 2012)

Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations. - Ana Maria de Almeida 002; Pedro Martins 002; Maurício C. de Souza (Int. Trans. Oper. Res., 2012)

Clip art retrieval combining raster and vector methods. - Pedro Martins 002; Rui Jesus 001; Manuel J. Fonseca; Nuno Correia 001 (CBMI, 2013)

Content-based search overviews and exploratory browsing of movies with MovieClouds. - Teresa Chambel; Thibault Langlois; Pedro Martins 002; Nuno Gil; Nuno Tavares Silva; Eduardo Duarte (Int. J. Adv. Media Commun., 2013)

Accessing movies based on emotional impact. - Eva Oliveira; Pedro Martins 002; Teresa Chambel (Multim. Syst., 2013)

Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. - Luis Eduardo Neves Gouveia; Pedro Martins 002 (EURO J. Comput. Optim., 2015)

Maximum cut-clique problem: ILS heuristics and a data analysis application. - Pedro Martins 002; Antonio Ladrón; Helena Ramalhinho Dias Lourenço (Int. Trans. Oper. Res., 2015)

Modeling the maximum edge-weight k-plex partitioning problem. - Pedro Martins 002 (CoRR, 2016)

Workforce planning and financing on a production/capital discrete-time model. - Pedro Martins 002; Ana Paula Quelhas (Int. Trans. Oper. Res., 2016)

Semi-automatic Video Assessment System. - Pedro Martins 002; Nuno Correia 001 (CBMI, 2017)

Goal Clustering: VNS based heuristics. - Pedro Martins 002 (CoRR, 2017)

Corporates' control strategies using network optimization. - Pedro Martins 002; Elisabete Neves (Int. Trans. Oper. Res., 2017)

Planning Production and Workforce in a Discrete-Time Financial Model Using Scenarios Modeling. - Pedro Martins 002 (Oper. Res. Forum, 2020)

Launchers and Targets in Social Networks. - Pedro Martins 002; Filipa Alarcão Martins (CoRR, 2021)

Launcher nodes for detecting efficient influencers in social networks. - Pedro Martins 002; Filipa Alarcão Martins (Online Soc. Networks Media, 2021)

Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems. - Daniela Scherer dos Santos; Kathrin Klamroth; Pedro Martins 002; Luís Paquete (CoRR, 2024)

A Path-Relinking-based Heuristic for the Multiobjective Subgraph Problem. - Daniela Scherer dos Santos; Kathrin Klamroth; Pedro Martins 002; Luís Paquete (GECCO, 2025)

Solving the Multiobjective Quasi-clique Problem. - Daniela Scherer dos Santos; Kathrin Klamroth; Pedro Martins 002; Luís Paquete (Eur. J. Oper. Res., 2025)