Francesc Comellas

Orcid: 0000-0003-4523-0240

According to our database1, Francesc Comellas authored at least 43 papers between 1994 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
The number and degree distribution of spanning trees in the Tower of Hanoi graph.
Theor. Comput. Sci., 2016

The normalized Laplacian spectrum of subdivisions of a graph.
Appl. Math. Comput., 2016

On the spectrum of the normalized Laplacian of iterated triangulations of graphs.
Appl. Math. Comput., 2016

2015
Deterministic hierarchical networks.
CoRR, 2015

2014
The number of spanning trees in Apollonian networks.
Discret. Appl. Math., 2014

Preface.
Discret. Appl. Math., 2014

2013
The Manhattan product of digraphs.
Electron. J. Graph Theory Appl., 2013

Quantum Google in a Complex Network
CoRR, 2013

2012
The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs
CoRR, 2012

2011
Farey graphs as models for complex networks.
Theor. Comput. Sci., 2011

2010
A fast and efficient algorithm to identify clusters in networks.
Appl. Math. Comput., 2010

2009
The hierarchical product of graphs.
Discret. Appl. Math., 2009

Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour.
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, 2009

2008
Multidimensional Manhattan Street Networks.
SIAM J. Discret. Math., 2008

Self-similar planar graphs as models for complex networks.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Reconstruction of Networks from Their Betweenness Centrality.
Proceedings of the Applications of Evolutionary Computing, 2008

2007
The Multidimensional Manhattan Network.
Electron. Notes Discret. Math., 2007

A Spectral Study of the Manhattan Networks.
Electron. Notes Discret. Math., 2007

2006
A Multiagent Algorithm for Graph Partitioning.
Proceedings of the Applications of Evolutionary Computing, 2006

2005
Exact Solutions for Minimax Optimization Problems.
Am. Math. Mon., 2005

Optimal Broadcasting in 2-Dimensional Manhattan Street Networks.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2005

2004
Weakly distance-regular digraphs.
J. Comb. Theory B, 2004

Deterministic Small-World Graphs and the Eigenvalue Power Law of Internet.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks.
Proceedings of the Applications of Evolutionary Computing, 2004

2003
The Spectra of Cycle Prefix Digraphs.
SIAM J. Discret. Math., 2003

Broadcasting in generalized chordal rings.
Networks, 2003

The spectra of wrapped butterfly digraphs.
Networks, 2003

Messy Broadcasting in Multidimensional Directed Tori.
J. Interconnect. Networks, 2003

Communication Properties of Cycle Prefix Digraphs.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002
New Lower Bounds for Heilbronn Numbers.
Electron. J. Comb., 2002

Broadcasting in Small-world Communication Networks.
Proceedings of the SIROCCO 9, 2002

2001
On the Universality of Small-World Graphs.
Electron. Notes Discret. Math., 2001

On the Spectrum of a Weakly Distance-Regular Digraph.
Electron. Notes Discret. Math., 2001

Cycles in the cycle prefix digraph.
Ars Comb., 2001

2000
A multiagent system for frequency assignment in cellular radio networks.
IEEE Trans. Veh. Technol., 2000

Deterministic small-world communication networks.
Inf. Process. Lett., 2000

Optical Routing of Uniform Instances in Tori.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1998
Genetic Programming to Design Communication Algorithms for Parallel Architectures.
Parallel Process. Lett., 1998

Broadcasting in cycle prefix digraphs.
Discret. Appl. Math., 1998

1995
Distributed Loop Computer Networks: A Survey.
J. Parallel Distributed Comput., 1995

Vertex-symmetric Digraphs with Small Diameter.
Discret. Appl. Math., 1995

1994
On Large Vertex Symmetric 2-Reachable Digraphs.
Parallel Process. Lett., 1994


  Loading...