Stefan Langerman
Stefan Langerman
Département d'Informatique, Université Libre de Bruxelles
Dirección de correo verificada de ulb.ac.be - Página principal
TítuloCitado porAño
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ...
Discrete & Computational Geometry 33 (4), 593-604, 2005
2082005
Results of the first international contest on evolutionary optimisation (1st ICEO)
H Bersini, M Dorigo, S Langerman, G Seront, L Gambardella
Proceedings of IEEE International Conference on Evolutionary Computation …, 1996
1611996
Reverse facility location problems
S Cabello, JM Díaz-Báñez, S Langerman, C Seara, I Ventura
University of Ljubljana, Inst. of Mathematics, Physics and Mechanics …, 2006
582006
Covering things with things
S Langerman, P Morin
Discrete & Computational Geometry 33 (4), 717-729, 2005
582005
Optimization in arrangements
S Langerman, W Steiger
Annual Symposium on Theoretical Aspects of Computer Science, 50-61, 2003
562003
Space–time trade-offs for stack-based algorithms
L Barba, M Korman, S Langerman, K Sadakane, RI Silveira
Algorithmica 72 (4), 1097-1129, 2015
552015
Algorithms for computing geometric measures of melodic similarity
G Aloupis, T Fevens, S Langerman, T Matsui, A Mesa, Y Nuñez, ...
Computer Music Journal 30 (3), 67-76, 2006
502006
Algorithms for bivariate medians and a Fermat–Torricelli problem for lines
G Aloupis, S Langerman, M Soss, G Toussaint
Computational geometry 26 (1), 69-79, 2003
502003
Retroactive data structures
ED Demaine, J Iacono, S Langerman
ACM Transactions on Algorithms (TALG) 3 (2), 13, 2007
472007
Facility location problems in the plane based on reverse nearest neighbor queries
S Cabello, JM Díaz-Báñez, S Langerman, C Seara, I Ventura
European Journal of Operational Research 202 (1), 99-106, 2010
462010
The Stackelberg minimum spanning tree game
J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59 (2), 129-144, 2011
442011
Necklaces, Convolutions, and X + Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
European Symposium on Algorithms, 160-171, 2006
422006
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
PK Agarwal, R Klein, C Knauer, S Langerman, P Morin, M Sharir, M Soss
Discrete & Computational Geometry 39 (1-3), 17-37, 2008
402008
Dynamic optimality for skip lists and B-trees
P Bose, K Douïeb, S Langerman
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
402008
Output-sensitive algorithms for Tukey depth and related problems
D Bremner, D Chen, J Iacono, S Langerman, P Morin
Statistics and Computing 18 (3), 259, 2008
392008
Online graph exploration algorithms for cycles and trees by multiple searchers
Y Higashikawa, N Katoh, S Langerman, S Tanigawa
Journal of Combinatorial Optimization 28 (2), 480-495, 2014
362014
Cache-oblivious dynamic dictionaries with update/query tradeoffs
GS Brodal, ED Demaine, JT Fineman, J Iacono, S Langerman, JI Munro
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
352010
Computing the maximum detour and spanning ratio of planar paths, trees, and cycles
S Langerman, P Morin, M Soss
Annual Symposium on Theoretical Aspects of Computer Science, 250-261, 2002
352002
Necklaces, Convolutions, and X+Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
Algorithmica 69 (2), 294-314, 2014
342014
Decomposition of multiple coverings into more parts
G Aloupis, J Cardinal, S Collette, S Langerman, D Orden, P Ramos
Discrete & Computational Geometry 44 (3), 706-723, 2010
332010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20