Francesc Comellas - Citegraph

Author Info

Name	Affiliation	Papers
FRANCESC COMELLAS	Dep. Matemàtica Aplicada IV, EETAC, Universitat Politècnica de Catalunya, c/ Esteve Terradas 5, Castelldefels (Barcelona), Catalonia, Spain	31
Collaborators	Citations	PageRank
40	155	25.07
Referers	Referees	References
348	293	151

Search Limit

100348

Publications (31 rows)

Collaborators (40 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
The normalized Laplacian spectrum of subdivisions of a graph	7	1.03	2016
On the spectrum of the normalized Laplacian of iterated triangulations of graphs	10	0.90	2016
The number and degree distribution of spanning trees in the Tower of Hanoi graph.	4	0.51	2015
Deterministic hierarchical networks	0	0.34	2015
Quantum Google In A Complex Network	10	1.04	2013
The number of spanning trees in Apollonian networks.	9	0.77	2012
The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs	3	0.56	2012
Farey graphs as models for complex networks	6	0.43	2011
A fast and efficient algorithm to identify clusters in networks	5	0.53	2010
Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour	6	0.47	2009
Reconstruction of networks from their betweenness centrality	4	0.40	2008
Self-similar planar graphs as models for complex networks	0	0.34	2008
A multiagent algorithm for graph partitioning	4	0.49	2006
Optimal Broadcasting in 2-Dimensional Manhattan Street Networks	1	0.41	2005
Exact Solutions for Minimax Optimization Problems.	0	0.34	2005
Deterministic small-world graphs and the eigenvalue power law of Internet	0	0.34	2004
Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks	0	0.34	2004
The Spectra of Cycle Prefix Digraphs	1	0.43	2003
Messy Broadcasting in Multidimensional Directed Tori	3	0.49	2003
Broadcasting in generalized chordal rings	2	0.43	2003
Communication Properties of Cycle Prefix Digraphs	0	0.34	2003
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs	1	0.64	2003
The spectra of wrapped butterfly digraphs	2	0.39	2003
Broadcasting in Small-world Communication Networks	14	1.25	2002
New Lower Bounds for Heilbronn Numbers	1	0.42	2002
Cycles In The Cycle Prefix Digraph	0	0.34	2001
SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001	24	4.90	2001
Optical Routing of Uniform Instances in Tori	4	0.52	2000
Deterministic small-world communication networks	29	4.90	2000
Genetic Programming to Design Communication Algorithms for Parallel Architectures	3	0.41	1998
On Large Vertex Symmetric 2-Reachable Digraphs	2	0.40	1994