Stefan Langerman
Université libre de Bruxelles
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Stefan Langerman.
Discrete and Computational Geometry | 2005
Stefan Langerman; Pat Morin
Abstract An abstract NP-hard covering problem is presented and fixed-parameter tractable algorithms for this problem are described. The running times of the algorithms are expressed in terms of three parameters:
symposium on theoretical aspects of computer science | 2003
Stefan Langerman; William L. Steiger
n
Discrete and Computational Geometry | 2008
Pankaj K. Agarwal; Rolf Klein; Christian Knauer; Stefan Langerman; Pat Morin; Micha Sharir; Michael M. Soss
, the number of elements to be covered,
Computer Music Journal | 2006
Greg Aloupis; Thomas Fevens; Stefan Langerman; Tomomi Matsui; Antonio A. Mesa; Yurai Y. Nuñez; David Rappaport; Godfried G. Toussaint
k
canadian conference on computational geometry | 2003
Greg Aloupis; Stefan Langerman; Michael A. Soss; Godfried T. Toussaint
, the number of sets allowed in the covering, and
European Journal of Operational Research | 2010
Sergio Cabello; José Miguel Díaz-Báñez; Stefan Langerman; Carlos Seara; Inmaculada Ventura
d
Discrete and Computational Geometry | 2010
Greg Aloupis; Jean Cardinal; Sébastien Collette; Stefan Langerman; David Orden; Pedro P. Ramos
, the combinatorial dimension of the problem. The first algorithm is deterministic and has a running time of
Theory of Computing Systems \/ Mathematical Systems Theory | 2003
Prosenjit Bose; Danny Krizanc; Stefan Langerman; Pat Morin
O’(k^{dk}n)
Algorithmica | 2015
Luis Barba; Matias Korman; Stefan Langerman; Kunihiko Sadakane; Rodrigo I. Silveira
. The second algorithm is also deterministic and has a running time of
Algorithmica | 2014
David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson; Ferran Hurtado; John Iacono; Stefan Langerman; Mihai Pǎtraşcu; Perouz Taslakian
O’(k^{d(k+1)}+n^{d+1})
