Pedro Martins

Orcid: 0000-0001-9600-082X

Affiliations:
  • Polytechnic Institute of Coimbra, Portugal
  • University of Lisbon, LaSIGE, Portugal


According to our database1, Pedro Martins authored at least 29 papers between 1999 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Launcher nodes for detecting efficient influencers in social networks.
Online Soc. Networks Media, 2021

Launchers and Targets in Social Networks.
CoRR, 2021

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

2017
Corporates' control strategies using network optimization.
Int. Trans. Oper. Res., 2017

Semi-automatic Video Assessment System.
Proceedings of the 15th International Workshop on Content-Based Multimedia Indexing, 2017

2016
Workforce planning and financing on a production/capital discrete-time model.
Int. Trans. Oper. Res., 2016

2015
Maximum cut-clique problem: ILS heuristics and a data analysis application.
Int. Trans. Oper. Res., 2015

Solving the maximum edge-weight clique problem in sparse graphs with compact formulations.
EURO J. Comput. Optim., 2015

2013
Accessing movies based on emotional impact.
Multim. Syst., 2013

Content-based search overviews and exploratory browsing of movies with MovieClouds.
Int. J. Adv. Media Commun., 2013

Clip art retrieval combining raster and vector methods.
Proceedings of the 11th International Workshop on Content-Based Multimedia Indexing, 2013

2012
Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations.
Int. Trans. Oper. Res., 2012

Cliques with maximum/minimum edge neighborhood and neighborhood density.
Comput. Oper. Res., 2012

Going through the clouds: search overviews and browsing of movies.
Proceedings of the International Conference on Media of the Future, 2012

2011
MovieClouds: content-based overviews and exploratory browsing of movies.
Proceedings of the 15th International Academic MindTrek Conference: Envisioning Future Media Environments, 2011

Ifelt: accessing movies through our emotions.
Proceedings of the 9th International Interactive TV&Video Conference, 2011

Being Happy, Healthy and Whole Watching Movies That Affect Our Emotions.
Proceedings of the Affective Computing and Intelligent Interaction, 2011

2010
md-MST is NP-hard for d>=3.
Electron. Notes Discret. Math., 2010

Extended and discretized formulations for the maximum clique problem.
Comput. Oper. Res., 2010

2009
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem.
Comput. Oper. Res., 2009

LX-Center: a center of online linguistic services.
Proceedings of the ACL 2009, 2009

2008
Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem.
Eur. J. Oper. Res., 2008

Supporting e-Learning with Language Technology for Portuguese.
Proceedings of the Computational Processing of the Portuguese Language, 2008

LX-Service: Web Services of Language Technology for Portuguese.
Proceedings of the International Conference on Language Resources and Evaluation, 2008

2007
Enhanced second order algorithm applied to the capacitated minimum spanning tree problem.
Comput. Oper. Res., 2007

2005
Workforce planning in a lotsizing mail processing problem.
Comput. Oper. Res., 2005

The capacitated minimum spanning tree problem: revisiting hop-indexed formulations.
Comput. Oper. Res., 2005

2000
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem.
Networks, 2000

1999
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexedmodel.
Ann. Oper. Res., 1999


  Loading...