On Large Vertex Symmetric 2-Reachable Digraphs. - Francesc Comellas; Miguel Angel Fiol; José Gómez (Parallel Process. Lett., 1994)

Vertex-symmetric Digraphs with Small Diameter. - Francesc Comellas; Miguel Angel Fiol (Discret. Appl. Math., 1995)

Distributed Loop Computer Networks: A Survey. - Jean-Claude Bermond; Francesc Comellas; D. Frank Hsu (J. Parallel Distributed Comput., 1995)

Broadcasting in cycle prefix digraphs. - Francesc Comellas; Margarida Mitjana (Discret. Appl. Math., 1998)

Genetic Programming to Design Communication Algorithms for Parallel Architectures. - Francesc Comellas; Gérard Gimenez (Parallel Process. Lett., 1998)

Optical Routing of Uniform Instances in Tori. - Francesc Comellas; Margarida Mitjana; Lata Narayanan; Jaroslav Opatrny (MFCS, 2000)

Deterministic small-world communication networks. - Francesc Comellas; Javier Ozón; Joseph G. Peters (Inf. Process. Lett., 2000)

A multiagent system for frequency assignment in cellular radio networks. - Jaime Abril; Francesc Comellas; Alejandro Cortés; Javier Ozón; Miguel Vaquer (IEEE Trans. Veh. Technol., 2000)

Cycles in the cycle prefix digraph. - Francesc Comellas; Margarida Mitjana (Ars Comb., 2001)

On the Spectrum of a Weakly Distance-Regular Digraph. - Francesc Comellas; Miguel Angel Fiol; Joan Gimbert; Margarida Mitjana (Electron. Notes Discret. Math., 2001)

On the Universality of Small-World Graphs. - Francesc Comellas; Javier Ozón (Electron. Notes Discret. Math., 2001)

Broadcasting in Small-world Communication Networks. - Francesc Comellas; Margarida Mitjana; Joseph G. Peters (SIROCCO, 2002)

New Lower Bounds for Heilbronn Numbers. - Francesc Comellas; J. Luis A. Yebra (Electron. J. Comb., 2002)

Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. - Francesc Comellas; Guillaume Fertin; André Raspaud (SIROCCO, 2003)

Communication Properties of Cycle Prefix Digraphs. - Francesc Comellas; Margarida Mitjana (SIROCCO, 2003)

Messy Broadcasting in Multidimensional Directed Tori. - Francesc Comellas; Hovhannes A. Harutyunyan; Arthur L. Liestman (J. Interconnect. Networks, 2003)

The spectra of wrapped butterfly digraphs. - Francesc Comellas; Miguel Angel Fiol; Joan Gimbert; Margarida Mitjana (Networks, 2003)

Broadcasting in generalized chordal rings. - Francesc Comellas; Pavol Hell (Networks, 2003)

The Spectra of Cycle Prefix Digraphs. - Francesc Comellas; Margarida Mitjana (SIAM J. Discret. Math., 2003)

Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks. - Francesc Comellas; Cristina Dalfó (EvoWorkshops, 2004)

Deterministic Small-World Graphs and the Eigenvalue Power Law of Internet. - Francesc Comellas; Silvia Gago (ISPAN, 2004)

Weakly distance-regular digraphs. - Francesc Comellas; Miguel Angel Fiol; Joan Gimbert; Margarida Mitjana (J. Comb. Theory B, 2004)

Optimal Broadcasting in 2-Dimensional Manhattan Street Networks. - Francesc Comellas; Cristina Dalfó (Parallel and Distributed Computing and Networks, 2005)

Exact Solutions for Minimax Optimization Problems. - Francesc Comellas; José Luis Andres Yebra (Am. Math. Mon., 2005)

A Multiagent Algorithm for Graph Partitioning. - Francesc Comellas; Emili Sapena (EvoWorkshops, 2006)

A Spectral Study of the Manhattan Networks. - Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol; Margarida Mitjana (Electron. Notes Discret. Math., 2007)

The Multidimensional Manhattan Network. - Cristina Dalfó; Francesc Comellas; Miguel Angel Fiol (Electron. Notes Discret. Math., 2007)

Reconstruction of Networks from Their Betweenness Centrality. - Francesc Comellas; Juan Paz-Sánchez (EvoWorkshops, 2008)

Self-similar planar graphs as models for complex networks. - Lichao Chen; Francesc Comellas; Zhongzhi Zhang (IWOCA, 2008)

Multidimensional Manhattan Street Networks. - Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol (SIAM J. Discret. Math., 2008)

Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour. - Francesc Comellas; Jesus Martinez-Navarro (GEC Summit, 2009)

The hierarchical product of graphs. - Lali Barrière; Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol (Discret. Appl. Math., 2009)

A fast and efficient algorithm to identify clusters in networks. - Francesc Comellas; Alicia Miralles (Appl. Math. Comput., 2010)

Farey graphs as models for complex networks. - Zhongzhi Zhang; Francesc Comellas (Theor. Comput. Sci., 2011)

The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs - Francesc Comellas; Alicia Miralles; Hongxiao Liu; Zhongzhi Zhang (CoRR, 2012)

Quantum Google in a Complex Network - Giuseppe Davide Paparo; Markus Müller; Francesc Comellas; Miguel-Angel Martin-Delgado (CoRR, 2013)

The Manhattan product of digraphs. - Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol (Electron. J. Graph Theory Appl., 2013)

Preface. - Francesc Comellas; Robert Elsässer; Dragan Stevanovic (Discret. Appl. Math., 2014)

The number of spanning trees in Apollonian networks. - Zhongzhi Zhang; Bin Wu; Francesc Comellas (Discret. Appl. Math., 2014)

Deterministic hierarchical networks. - Lali Barrière; Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol (CoRR, 2015)

On the spectrum of the normalized Laplacian of iterated triangulations of graphs. - Pinchen Xie; Zhongzhi Zhang; Francesc Comellas (Appl. Math. Comput., 2016)

The normalized Laplacian spectrum of subdivisions of a graph. - Pinchen Xie; Zhongzhi Zhang; Francesc Comellas (Appl. Math. Comput., 2016)

The number and degree distribution of spanning trees in the Tower of Hanoi graph. - Zhongzhi Zhang; Shunqi Wu; Mingyun Li; Francesc Comellas (Theor. Comput. Sci., 2016)

New results on the degree-diameter problem for undirected graphs. - Francesc Comellas (Electron. J. Graph Theory Appl., 2025)