Complexity of graph covering problems
Nordic Journal of Computing
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
Leader election in plane cellular automata, only with left-right global convention
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Cantor-Bernstein type theorem for locally constrained graph homomorphisms
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Bilateral Ranking Negotiations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Multilateral Ranking Negotiations
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Romanian Academy Calea Victoriei 125, Bucharest, Romania Locally Derivable Graphs
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Compositional Systems over Reducible Networks
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
Romanian Academy Calea Victoriei 125, Bucharest, Romania Locally Derivable Graphs
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Compositional Systems over Reducible Networks
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Bilateral Ranking Negotiations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Multilateral Ranking Negotiations
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Hi-index | 0.00 |