| One sided crossing minimization is NP-hard for sparse graphs X Muñoz, W Unger, I Vrt’o Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria …, 2002 | 72 | 2002 |
| Graphs and Algorithms in Communication Networks AMCA Koster, X Munoz Springer-Verlag, Heidelberg, 2010 | 56* | 2010 |
| Graphs and algorithms in communication networks: studies in broadband, optical, wireless and ad hoc networks A Koster, X Muñoz Springer Science & Business Media, 2009 | 56 | 2009 |
| Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case JC Bermond, D Coudert, X Munoz 7th IFIP Working Conference on Optical Network Design & Modelling (ONDM …, 2003 | 55 | 2003 |
| Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6 JC Bermond, CJ Colbourn, D Coudert, G Ge, ACH Ling, X Munoz SIAM Journal on Discrete Mathematics 19 (2), 523-542, 2005 | 37 | 2005 |
| Topologies for optical interconnection networks based on the optical transpose interconnection system D Coudert, A Ferreira, X Munoz Applied Optics 39 (17), 2965-2974, 2000 | 27 | 2000 |
| Multiprocessor architectures using multi-hop multi-ops lightwave networks and distributed control D Coudert, A Ferreira, X Muñoz Proceedings of the First Merged International Parallel Processing Symposium …, 1998 | 18 | 1998 |
| Traffic grooming in unidirectional WDM rings with bounded degree request graph X Munoz, I Sau International Workshop on Graph-Theoretic Concepts in Computer Science, 300-311, 2008 | 17 | 2008 |
| Traffic grooming in bidirectional WDM ring networks JC Bermond, D Coudert, X Muñoz, I Sau 2006 International Conference on Transparent Optical Networks 3, 19-22, 2006 | 16 | 2006 |
| Traffic grooming in bidirectional WDM ring networks JC Bermond, D Coudert, X Muñoz, I Sau 2006 International Conference on Transparent Optical Networks 3, 19-22, 2006 | 16 | 2006 |
| The minimal Manhattan network problem in three dimensions X Munoz, S Seibert, W Unger International Workshop on Algorithms and Computation, 369-380, 2009 | 14 | 2009 |
| Asymptotically Optimal (D D', s)-Digraphs X Munoz, J Gómez Ars Combinatoria 49, 97-112, 1998 | 12 | 1998 |
| Online graph coloring with advice and randomized adversary E Burjons, J Hromkovič, X Munoz, W Unger International Conference on Current Trends in Theory and Practice of …, 2016 | 11 | 2016 |
| Induced broadcasting algorithms in iterated line digraphs JC Bermond, X Muñoz, A Marchetti-Spaccamela Euro-Par'96 Parallel Processing: Second International Euro-Par Conference …, 1996 | 8 | 1996 |
| A study of network capacity under deflection routing schemes J Fàbrega, X Muñoz Euro-Par 2003 Parallel Processing: 9th International Euro-Par Conference …, 2003 | 7 | 2003 |
| A multihop multi-OPS optical interconnection network D Coudert, A Ferreira, X Muñoz Journal of lightwave technology 18 (12), 2076-2085, 2000 | 7 | 2000 |
| On the unilateral (Δ, D*)‐problem J Gómez, EA Canale, X Muñoz Networks: An International Journal 36 (3), 164-171, 2000 | 6 | 2000 |
| OTIS-based multi-hop multi-OPS lightwave networks D Coudert, A Ferreira, X Muñoz International Parallel Processing Symposium, 897-910, 1999 | 6 | 1999 |
| Graphs and algorithms in communication networks on seven league boots AMCA Koster, X Munoz Graphs and Algorithms in Communication Networks, 1-59, 2009 | 5 | 2009 |
| Unilaterally connected large digraphs and generalized cycles J Gómez, EA Canale, X Muñoz Networks: An International Journal 42 (4), 181-188, 2003 | 5 | 2003 |
