关注
Jordi Petit
Jordi Petit
在 cs.upc.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
A survey of graph layout problems
J Díaz, J Petit, M Serna
ACM Computing Surveys (CSUR) 34 (3), 313-356, 2002
8212002
MALLBA: A library of skeletons for combinatorial optimisation
E Alba, F Almeida, M Blesa, J Cabeza, C Cotta, M Díaz, I Dorta, J Gabarró, ...
European Conference on Parallel Processing, 927-932, 2002
2232002
Experiments on the minimum linear arrangement problem
J Petit
Journal of Experimental Algorithmics (JEA) 8, 2003
1642003
Approximating layout problems on random geometric graphs
J Dıaz, MD Penrose, J Petit, M Serna
Journal of Algorithms 39 (1), 78-116, 2001
1072001
Jutge. org: an educational programming judge
J Petit, O Giménez, S Roura
Proceedings of the 43rd ACM technical symposium on Computer Science …, 2012
1002012
Efficient parallel LAN/WAN algorithms for optimization. The MALLBA project
E Alba, F Almeida, M Blesa, C Cotta, M Díaz, I Dorta, J Gabarró, C León, ...
Parallel Computing 32 (5-6), 415-440, 2006
982006
A random graph model for optical networks of sensors
J Diaz, J Petit, M Serna
IEEE Transactions on Mobile Computing 2 (3), 186-196, 2003
702003
Convergence theorems for some layout measures on random lattice and random geometric graphs
J Díaz, MD Penrose, J Petit, M Serna
Combinatorics, Probability and Computing 9 (6), 489-511, 2000
552000
Random Geometric Problems on [0, 1]2
J Díaz, J Petit, M Serna
International Workshop on Randomization and Approximation Techniques in …, 1998
511998
Jutge. org: Characteristics and experiences
J Petit, S Roura, J Carmona, J Cortadella, J Duch, O Gimnez, A Mani, ...
IEEE Transactions on Learning Technologies 11 (3), 321-333, 2017
492017
Addenda to the survey of layout problems
J Petit
Bulletin of EATCS 3 (105), 2013
462013
Combining spectral sequencing and parallel simulated annealing for the MinLA problem
J Petit
Parallel Processing Letters 13 (01), 77-91, 2003
382003
Layout problems
J Petit
BULLETIN-EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE 75, 289-292, 2001
302001
A distributed algorithm to find hamiltonian cycles in random graphs
E Levy, G Louchard, J Petit
Workshop on Combinatorial and Algorithmic aspects of networking, 63-74, 2004
282004
A boolean rule-based approach for manufacturability-aware cell routing
J Cortadella, J Petit, S Gomez, F Moll
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2014
262014
A guide to concentration bounds
J Diaz, J Petit, M Serna
COMBINATORIAL OPTIMIZATION-DORDRECHT- 9 (2), 457-504, 2001
262001
Faulty random geometric networks
J Diaz, J Petit, M Serna
Parallel Processing Letters 10 (04), 343-357, 2000
242000
Efficient and reliable high level communication in randomly deployed wireless sensor networks
C Àlvarez, J Díaz, J Petit, J Rolim, M Serna
Proceedings of the second international workshop on Mobility management …, 2004
182004
Approximating layout problems on random graphs
J Dı́az, J Petit, M Serna, L Trevisan
Discrete Mathematics 235 (1-3), 245-253, 2001
172001
Linear orderings of random geometric graphs
J Díaz, MD Penrose, J Petit, M Serna
International Workshop on Graph-Theoretic Concepts in Computer Science, 291-302, 1999
171999
系统目前无法执行此操作,请稍后再试。
文章 1–20