Conflict-free channel assignment for an optical cluster-based shuffle network configuration
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Improved Compressions of Cube-Connected Cycles Networks
IEEE Transactions on Parallel and Distributed Systems
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Generalized H-Coloring and H-Covering of Trees
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Generalized H-coloring and H-covering of trees
Nordic Journal of Computing
A complete complexity classification of the role assignment problem
Theoretical Computer Science - Graph colorings
Cantor-Bernstein type theorem for locally constrained graph homomorphisms
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
About the Termination Detection in the Asynchronous Message Passing Model
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
The computational complexity of the role assignment problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Computing role assignments of chordal graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Comparing universal covers in polynomial time
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Computing role assignments of chordal graphs
Theoretical Computer Science
Computing role assignments of proper interval graphs in polynomial time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Complexity of locally injective homomorphism to the theta graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Locally injective homomorphism to the simple weight graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Locally injective graph homomorphism: lists guarantee dichotomy
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Journal of Parallel and Distributed Computing
Matrix and graph orders derived from locally constrained graph homomorphisms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the complexity of planar covering of small graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Computing role assignments of proper interval graphs in polynomial time
Journal of Discrete Algorithms
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
Fundamenta Informaticae
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |