26 citations · 56 across the 14 of their papers we have counts for
19 papers
The Combined Van-and-Mopeds Routing Problem with Time Windows: Formulation, Variants, and Solution Methods
Pedro Lameiras, Alexandre P. Francisco, Adriano Serrano +1
We introduce and study the Combined Van-and-Mopeds Routing Problem with Time Windows (CVMRPTW), a novel variant of the heterogeneous fleet vehicle routing problem motivated by last…
Identity-Bound Academic Credentials on Blockchain: On-Chain Issuer Accreditation with ERC-3643 and OnchainID
Gonçalo Frutuoso, Diogo Rodrigues, Alexandre P. Francisco +1
Verifying academic credentials remains difficult: records are held by individual institutions in proprietary systems, verification is slow and manual, and counterfeit qualification…
Evolution of collective fairness in complex networks through degree-based role assignment
Andreia Sofia Teixeira, Francisco C. Santos, Alexandre P. Francisco +1
From social contracts to climate agreements, individuals engage in groups that must collectively reach decisions with varying levels of equality and fairness. These dilemmas also p…
Small Longest Tandem Scattered Subsequences
Luís M. S. Russo, Alexandre P. Francisco
We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string.…
Distance-based phylogenetic inference from typing data: a unifying view
Cátia Vaz, Marta Nascimento, João A. Carriço +2
Typing methods are widely used in the surveillance of infectious diseases, outbreaks investigation and studies of the natural history of an infection. And their use is becoming sta…
Hardness of Modern Games
Diogo M. Costa, Alexandre P. Francisco, Luís M. S. Russo
We consider the complexity properties of modern puzzle games, Hexiom, Cut the Rope and Back to Bed. The complexity of games plays an important role in the type of experience they p…
Sparsifying Parity-Check Matrices
Luís M. S. Russo, Tobias Dietz, José Rui Figueira +2
Parity check matrices (PCMs) are used to define linear error correcting codes and ensure reliable information transmission over noisy channels. The set of codewords of such a code…
Incremental Multiple Longest Common Sub-Sequences
Luís M. S. Russo, Alexandre P. Francisco, Tatiana Rocher
We consider the problem of updating the information about multiple longest common sub-sequences. This kind of sub-sequences is used to highlight information that is shared across s…
Approximating Optimal Bidirectional Macro Schemes
Luís M. S. Russo, Ana D. Correia, Gonzalo Navarro +1
Lempel-Ziv is an easy-to-compute member of a wide family of so-called macro schemes; it restricts pointers to go in one direction only. Optimal bidirectional macro schemes are NP-c…
On dynamic succinct graph representations
Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo +3
We address the problem of representing dynamic graphs using -trees. The -tree data structure is one of the succinct data structures proposed for representing static graph…
An analysis of the graph processing landscape
Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
The value of graph-based big data can be unlocked by exploring the topology and metrics of the networks they represent, and the computational approaches to this exploration take on…
Order-Preserving Pattern Matching Indeterminate Strings
Diogo Costa, Luís M. S. Russo, Rui Henriques +2
Given an indeterminate string pattern and an indeterminate string text , the problem of order-preserving pattern matching with character uncertainties (OPPM) is to find a…
VeilGraph: Streaming Graph Approximations
Miguel E. Coimbra, Sérgio Esteves, Alexandre P. Francisco +1
Graphs are found in a plethora of domains, including online social networks, the World Wide Web and the study of epidemics, to name a few. With the advent of greater volumes of inf…
Linking and Cutting Spanning Trees
Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P Francisco
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We de…
Exploiting Computation-Friendly Graph Compression Methods
Alexandre P. Francisco, Travis Gagie, Susana Ladra +1
Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks,…
Study on Resource Efficiency of Distributed Graph Processing
Miguel E. Coimbra, Alexandre P. Francisco, Luis Veiga
Graphs may be used to represent many different problem domains -- a concrete example is that of detecting communities in social networks, which are represented as graphs. With big…
Gelly-Scheduling: Distributed Graph Processing for Network Service Placement in Community Networks
Miguel E. Coimbra, Mennan Selimi, Alexandre P. Francisco +2
Community networks (CNs) have seen an increase in the last fifteen years. Their members contact nodes which operate Internet proxies, web servers, user file storage and video strea…
Beyond NGS data sharing and towards open science
Bruno Dantas, Calmenelias Fleitas, Alexandre P. Francisco +2
Biosciences have been revolutionized by next generation sequencing (NGS) technologies in last years, leading to new perspectives in medical, industrial and environmental applicatio…
Quick HyperVolume
Luís M. S. Russo, Alexandre P. Francisco
We present a new algorithm to calculate exact hypervolumes. Given a set of -dimensional points, it computes the hypervolume of the dominated space. Determining this value is an…