Suivre
Stefan Langerman
Stefan Langerman
Département d'Informatique, Université Libre de Bruxelles
Adresse e-mail validée de ulb.ac.be - Page d'accueil
Titre
Citée par
Citée par
Année
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, 593-604, 2005
2762005
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
1781996
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
1022010
Covering things with things
S Langerman, P Morin
Discrete & Computational Geometry 33, 717-729, 2005
842005
Necklaces, Convolutions, and X+Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
Algorithmica 69 (2), 294-314, 2014
672014
Retroactive data structures
ED Demaine, J Iacono, S Langerman
ACM Transactions on Algorithms (TALG) 3 (2), 13-es, 2007
662007
Algorithms for computing geometric measures of melodic similarity
G Aloupis, T Fevens, S Langerman, T Matsui, A Mesa, Y Nunez, ...
Computer Music Journal, 67-76, 2006
652006
Necklaces, Convolutions, and X + Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
European Symposium on Algorithms, 160-171, 2006
652006
Optimization in arrangements
S Langerman, W Steiger
Annual Symposium on Theoretical Aspects of Computer Science, 50-61, 2003
632003
Space–time trade-offs for stack-based algorithms
L Barba, M Korman, S Langerman, K Sadakane, RI Silveira
Algorithmica 72, 1097-1129, 2015
622015
The Stackelberg minimum spanning tree game
J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59, 129-144, 2011
622011
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
602003
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
592008
Online graph exploration algorithms for cycles and trees by multiple searchers
Y Higashikawa, N Katoh, S Langerman, S Tanigawa
Journal of Combinatorial Optimization 28, 480-495, 2014
562014
Output-sensitive algorithms for Tukey depth and related problems
D Bremner, D Chen, J Iacono, S Langerman, P Morin
Statistics and Computing 18, 259-266, 2008
562008
Dynamic graph coloring
L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ...
Algorithmica 81, 1319-1341, 2019
512019
Linear reconfiguration of cube-style modular robots
G Aloupis, S Collette, M Damian, ED Demaine, R Flatland, S Langerman, ...
Computational Geometry 42 (6-7), 652-663, 2009
502009
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
482010
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), 17-37, 2008
482008
Proximity graphs: E, δ, Δ, χ and ω
P Bose, V Dujmović, F Hurtado, J Iacono, S Langerman, H Meijer, ...
International Journal of Computational Geometry & Applications 22 (05), 439-469, 2012
472012
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20