CSC '93 Proceedings of the 1993 ACM conference on Computer science
A Versatile Ring-Connected Hypercube
IEEE Micro
Optimal Elections in Faulty Loop Networks and Applications
IEEE Transactions on Computers
Periodically Regular Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Parallel and Distributed Systems
Gossiping in chordal rings under the line model
Theoretical Computer Science
A complementary survey on double-loop networks
Theoretical Computer Science
Discrete Mathematics
On connectivity of consecutive-d digraphs
Discrete Mathematics - Kleitman and combinatorics: a celebration
DCC Linear Congruential Graphs: A New Class of Interconnection Networks
IEEE Transactions on Computers
A simple algorithm to find the steps of double-loop networks
Discrete Applied Mathematics
On the Ádám Conjecture on Circulant Graphs
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Optimal Irreversible Dynamos in Chordal Rings
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Recognizing Bipartite Incident-Graphs of Circulant Digraphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Uniform multi-hop all-to-all optical routings in rings
Theoretical Computer Science - Latin American theoretical informatics
A survey on multi-loop networks
Theoretical Computer Science
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Permutation routing in double-loop networks: design and empirical evaluation
Journal of Systems Architecture: the EUROMICRO Journal
The existence of hyper-L triple-loop networks
Discrete Mathematics
The obnoxious center problem on weighted cactus graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks
IEEE Transactions on Parallel and Distributed Systems
An Optimal Fault-Tolerant Routing Algorithm for Weighted Bidirectional Double-Loop Networks
IEEE Transactions on Parallel and Distributed Systems
An optimal message routing algorithm for circulant networks
Journal of Systems Architecture: the EUROMICRO Journal
An efficient algorithm to find a double-loop network that realizes a given L-shape
Theoretical Computer Science
Fault-diameter of Cartesian graph bundles
Information Processing Letters
Efficient domination in circulant graphs with two chord lengths
Information Processing Letters
Reducing the Height of Independent Spanning Trees in Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
Optimal routing in double loop networks
Theoretical Computer Science
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Discrete Applied Mathematics
Restricted shortest paths in 2-circulant graphs
Computer Communications
The edge fault-diameter of Cartesian graph bundles
European Journal of Combinatorics
On the guessing number of shift graphs
Journal of Discrete Algorithms
Improved upper and lower bounds on the optimization of mixed chordal ring networks
Information Processing Letters
Global data computation in chordal rings
Journal of Parallel and Distributed Computing
Edge fault-diameter of Cartesian product of graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
On routing in circulant graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Infinite families of optimal double-loop networks
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Self-healing in binomial graph networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
An algorithm to find optimal double-loop networks with non-unit steps
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Developing fault-tolerant distributed loops
Information Processing Letters
Decontamination of chordal rings and tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On the wide diameter of directed double-loop networks
Journal of Network and Computer Applications
Powers of cycles, powers of paths, and distance graphs
Discrete Applied Mathematics
Fault diameters of graph products and bundles
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Extending a distributed loop network to tolerate node failures
Proceedings of the Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
CIS'04 Proceedings of the First international conference on Computational and Information Science
A parallel routing algorithm on circulant networks employing the hamiltonian circuit latin square
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
A parallel routing algorithm on 2-circulant networks employing the hamiltonian circuit latin square
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
On finding a shortest path in circulant graphs with two jumps
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Minimal chordal sense of direction and circulant graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Counting spanning trees and other structures in non-constant-jump circulant graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Circulant digraphs and monomial ideals
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Efficient computation of the lovász theta function for a class of circulant graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square
Information Sciences: an International Journal
A case for random shortcut topologies for HPC interconnects
Proceedings of the 39th Annual International Symposium on Computer Architecture
Theoretical Computer Science
Fault-tolerant circulant digraphs networks
Proceedings of the 2013 Research in Adaptive and Convergent Systems
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Theoretical Computer Science
Discrete Applied Mathematics
Testing set proportionality and the Ádám isomorphism of circulant graphs
Journal of Discrete Algorithms
Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
European Journal of Combinatorics
Dense bipartite circulants and their routing via rectangular twisted torus
Discrete Applied Mathematics
On the partition dimension of a class of circulant graphs
Information Processing Letters
| Hi-index | 0.01 |