Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Computing roots of graphs is hard
Discrete Applied Mathematics
Algorithms for Square Roots of Graphs
SIAM Journal on Discrete Mathematics
A new model for scheduling packet radio networks
Wireless Networks
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Partitioning graphs into generalized dominating sets
Nordic Journal of Computing
On the Complexity of Distance-2 Coloring
ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
Independent Sets with Domination Constraints
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Broadcast scheduling for TDMA in wireless multihop networks
Handbook of wireless networks and mobile computing
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Frequency Channel Assignment on Planar Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Note: coloring the square of a K4-minor free graph
Discrete Mathematics
The Chromatic Number of Graph Powers
Combinatorics, Probability and Computing
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing
Labeling planar graphs with a condition at distance two
European Journal of Combinatorics
Coloring squares of planar graphs with girth six
European Journal of Combinatorics
Labelling planar graphs without 4-cycles with a condition on distance two
Discrete Applied Mathematics
List 2-distance (Δ+2)-coloring of planar graphs with girth six
European Journal of Combinatorics
Chromatic sets of power graphs and their application to resource placement in multicomputer networks
Computers & Mathematics with Applications
Algorithms and experiments on colouring squares of planar graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
L(h,1,1)-Labeling of outerplanar graphs
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On the approximability of the L(h, k)-labelling problem on bipartite graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
A general framework for coloring problems: old results, new results, and open problems
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Resource placement in networks using chromatic sets of power graphs
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |