• Publications
  • Influence
Some simple distributed algorithms for sparse networks
TLDR
We give simple, deterministic, distributed algorithms for computing maximal matchings, maximal independent sets and colourings. Expand
  • 165
  • 18
  • PDF
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
TLDR
We prove that the problem is APX-hard and present a 2k- 1-approximation algorithm for the case in which each genotype has at most k ambiguous positions. Expand
  • 141
  • 15
  • PDF
The firefighter problem for graphs of maximum degree three
TLDR
We show that the firefighter problem is NP-complete for trees of maximum degree three, but in polynomial time if the fire breaks out at a vertex of degree at most two. Expand
  • 103
  • 12
  • PDF
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
TLDR
We consider an extension of the Markovitz model, in which the variance has been replaced with the Value-at-Risk. Expand
  • 124
  • 12
Cycle bases in graphs characterization, algorithms, complexity, and applications
TLDR
Cycles in graphs play an important role in many applications, e.g., analysis of electrical networks, analysis of chemical and biological pathways, periodic scheduling, and graph drawing. Expand
  • 136
  • 12
  • PDF
Packing cycles in undirected graphs
TLDR
We study the complexity and approximability of CYCLE PACKING, about which very little is known although the problem is natural and has practical applications. Expand
  • 63
  • 10
A novel min-cost flow method for estimating transcript expression with RNA-Seq
TLDR
We proposed a novel radically different method based on minimum-cost network flows for a multiassembly problem arising from isoform identification and quantification with RNA-Seq. Expand
  • 69
  • 9
A greedy approach to compute a minimum cycle basis of a directed graph
TLDR
We adapt the greedy approach proposed by Horton [A polynomial-time algorithm to find the shortest cycle basis of a graph, SIAM J. Sci. 16 (1987) 358] and hereby obtain a very simple exact algorithm of complexity O(m4n), being as fast as the first algorithm proposed for this problem. Expand
  • 41
  • 7
  • PDF
Optimal skewed data allocation on multiple channels with flat broadcast per channel
TLDR
The problem of data broadcasting over multiple channels is considered, assuming skewed data allocation to channels and flat data scheduling per channel, with the objective of minimizing the average waiting time. Expand
  • 59
  • 6
  • PDF
Polynomial and APX-hard cases of the individual haplotyping problem
TLDR
We address the problem of reconstructing two haplotypes for an individual from fragment assembly data. Expand
  • 57
  • 6
  • PDF
...
1
2
3
4
5
...