A Fast Algorithm for Testing Isomorphism of Permutation Networks
IEEE Transactions on Computers
An introduction to chromatic sums
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Using graph distance in object recognition
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Fault tolerant planar communication networks
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The Partial Line Digraph Technique in the Design of Large Interconnection Networks
IEEE Transactions on Computers
Bounds on the efficiency of message-passing protocols for parallel computers
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
The communication requirements of mutual exclusion
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
CMOS analog circuit stack generation with matching constraints
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Galois Graphs: Walks, Trees and Automorphisms
Journal of Algebraic Combinatorics: An International Journal
Roots of Independence Polynomials of Well Covered Graphs
Journal of Algebraic Combinatorics: An International Journal
Revisiting decomposition analysis of geometric constraint graphs
Proceedings of the seventh ACM symposium on Solid modeling and applications
Some extremal problems of graphs with local constraints
Discrete Mathematics
Hamiltonicity of planar cubic multigraphs
Discrete Mathematics
Efficient and inefficient ant coverage methods
Annals of Mathematics and Artificial Intelligence
Cycles in multipartite tournaments: results and problems
Discrete Mathematics
Graph partition into paths containing specified vertices
Discrete Mathematics
Signed 2-independence in graphs
Discrete Mathematics
Essential independent sets and long cycles
Discrete Mathematics
Structural and enumerative properties of the Fibonacci cubes
Discrete Mathematics
4-connected maximal planar graphs are 4-ordered
Discrete Mathematics - Kleitman and combinatorics: a celebration
On a 2-factor with a specified edge in a graph satisfying the Ore condition
Discrete Mathematics - Kleitman and combinatorics: a celebration
IEEE Transactions on Computers
Access Graphs: A Model for Investigating Memory Consistency
IEEE Transactions on Parallel and Distributed Systems
Discrete Mathematics
Some new large compound graphs
European Journal of Combinatorics
Renewal processes on partially ordered sets
Random Structures & Algorithms
A closure concept in factor-critical graphs
Discrete Mathematics
Vertices contained in all or in no minimum total dominating set of a tree
Discrete Mathematics
The Korean Journal of Computational & Applied Mathematics
What Designers of Bus and Network Architectures Should Know about Hypercubes
IEEE Transactions on Computers
On a condition for the union of spherical caps to be connected
Journal of Combinatorial Theory Series A
On strong distances in oriented graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Observability of the extended Fibonacci cubes
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Cycles having the same modularity and removable edges in 2-connected graphs
Discrete Mathematics
A linear-programming approach to the generalized Randić index
Discrete Applied Mathematics
Journal of Combinatorial Theory Series B
Splitting and contractible edges in 4-connected graphs
Journal of Combinatorial Theory Series B
Hamiltonian decompositions of Cayley graphs on abelian groups of even order
Journal of Combinatorial Theory Series B
Sorting a sequence of strong kings in a tournament
Information Processing Letters
Cycles through a prescribed vertex set in N-connected graphs
Journal of Combinatorial Theory Series B
Algorithms for optimal orientations of a unicyclic graph
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Superfluous edges and exponential expansions of De Bruijn and Kautz graphs
Discrete Applied Mathematics
Graph properties checkable in linear time in the number of vertices
Journal of Computer and System Sciences
The characteristic ideal of a finite, connected, regular graph
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Long cycles in triangle-free graphs with prescribed independence number and connectivity
Journal of Combinatorial Theory Series B
On Arc-Regular Permutation Groups Using Latin Squares
Journal of Algebraic Combinatorics: An International Journal
Asymptotically large (Δ, D)-graphs
Discrete Applied Mathematics
Matrix games in the multicast networks: maximum information flows with network switching
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Lower bounds on the vertex-connectivity of digraphs and graphs
Information Processing Letters
A pair of forbidden subgraphs and perfect matchings
Journal of Combinatorial Theory Series B
The strong metric dimension of graphs and digraphs
Discrete Applied Mathematics
Note: On an extremal problem related to a theorem of Whitney
Discrete Applied Mathematics
The game chromatic number and the game colouring number of cactuses
Information Processing Letters
The signed star domination numbers of the Cartesian product graphs
Discrete Applied Mathematics
Distance distributions for graphs modeling computer networks
Discrete Applied Mathematics
Ubiquity
Parameterized complexity of the clique partition problem
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Optimization of logical rings for multi-hop transmissions in WDM optical star networks
Computer Communications
A new parallel algorithm for the maximal independent set problem
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
International Journal of Systems, Control and Communications
Total domination in partitioned trees and partitioned graphs with minimum degree two
Journal of Global Optimization
Note: On multicolour noncomplete Ramsey graphs of star graphs
Discrete Applied Mathematics
Chvátal---Erdős Theorem: Old Theorem with New Aspects
Computational Geometry and Graph Theory
Inducing regulation of any digraphs
Discrete Applied Mathematics
The observable part of a network
IEEE/ACM Transactions on Networking (TON)
Asymptotically large (Δ,D)-graphs
Discrete Applied Mathematics
Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian
Discrete Applied Mathematics
Improvement of multi-hop packet transmission scheduling in WDM optical star networks
Computer Communications
An upper bound on the total restrained domination number of a tree
Journal of Combinatorial Optimization
Counting extensional acyclic digraphs
Information Processing Letters
Fast and simple approximation of the diameter and radius of a graph
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Sphere of influence graphs: Edge density and clique size
Mathematical and Computer Modelling: An International Journal
Constraints on the number of maximal independent sets in graphs
Journal of Graph Theory
Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem
Fundamenta Informaticae
An improved parameterized algorithm for the minimum node multiway cut problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Labeling constructions using digraph products
Discrete Applied Mathematics
Residual Closeness in Cycles and Related Networks
Fundamenta Informaticae
| Hi-index | 0.01 |