Efficient use of radio spectrum in wireless networks with channel separation between close stations
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
L(2,1)-labeling of planar graphs
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Channel assignment and graph labeling
Handbook of wireless networks and mobile computing
On generalized Petersen graphs labeled with a condition at distance two
Discrete Mathematics
Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Distance Constrained Labeling of Precolored Trees
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
L(2, 1)-Coloring Matrogenic Graphs
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Fixed-Parameter Complexity of lambda-Labelings
WG '99 Proceedings of the 25th 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
Radio Labeling with Pre-assigned Frequencies
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Online and Offline Distance Constrained Labeling of Disk Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Distance-two labelings of graphs
European Journal of Combinatorics
Channel Assignment with Separation for Interference Avoidance in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Labeling trees with a condition at distance two
Discrete Mathematics
Discrete Applied Mathematics
Algorithms for graphs with small octopus
Discrete Applied Mathematics
A channel assignment problem for optical networks modelled by Cayley graphs
Theoretical Computer Science
L(h,1)-labeling subclasses of planar graphs
Journal of Parallel and Distributed Computing
On distance constrained labeling of disk graphs
Theoretical Computer Science
A characterisation of optimal channel assignments for cellular and square grid wireless networks
Mobile Networks and Applications
Optimal Channel Assignments for Lattices with Conditions at Distance Two
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
L(2, 1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
An exact algorithm for the channel assignment problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
L(2, 1)-labeling of strong products of cycles
Information Processing Letters
Generalized list T-colorings of cycles
Discrete Applied Mathematics
A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles
Discrete Applied Mathematics
List version of L(d, s)-labelings
Theoretical Computer Science - Graph colorings
The L(2, 1)-labelling of trees
Discrete Applied Mathematics
L(p, q)-labelling of K4-minor free graphs
Information Processing Letters
L(2, 1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
Acyclic colorings of products of trees
Information Processing Letters
The 2-dipath chromatic number of Halin graphs
Information Processing Letters
A bound on the chromatic number of the square of a planar graph
Journal of Combinatorial Theory Series B
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing
Discrete Applied Mathematics
Distance-two labelings of digraphs
Discrete Applied Mathematics
Extremal problems on consecutive L(2,1)-labelling
Discrete Applied Mathematics
The minimum span of L(2,1)-labelings of certain generalized Petersen graphs
Discrete Applied Mathematics
An extremal problem on non-full colorable graphs
Discrete Applied Mathematics
Note: On the hole index of L(2,1)-labelings of r-regular graphs
Discrete Applied Mathematics
Labeling planar graphs with a condition at distance two
European Journal of Combinatorics
(2,1)-Total labelling of outerplanar graphs
Discrete Applied Mathematics
Labelling of some planar graphs with a condition at distance two
Journal of Applied Mathematics and Computing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
New bounds for the L(h, k) number of regular grids
International Journal of Mobile Network Design and Innovation
Approximating the L(h, k)-labelling problem
International Journal of Mobile Network Design and Innovation
Optimal frequency assignments of cycles and powers of cycles
International Journal of Mobile Network Design and Innovation
Bounds for the L(d, 1): number of diameter 2 graphs, trees and cacti
International Journal of Mobile Network Design and Innovation
Note: Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs
Theoretical Computer Science
Labelling planar graphs without 4-cycles with a condition on distance two
Discrete Applied Mathematics
Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
On L(d,1)-labeling of Cartesian product of a cycle and a path
Discrete Applied Mathematics
A distance-labelling problem for hypercubes
Discrete Applied Mathematics
Self-stabilizing population protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Coloring the square of the Kneser graph KG(2k+1,k) and the Schrijver graph SG(2k+2,k)
Discrete Applied Mathematics
(2,1)-Total labelling of trees with sparse vertices of maximum degree
Information Processing Letters
Injective coloring of planar graphs
Discrete Applied Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
Distance-two labellings of Hamming graphs
Discrete Applied Mathematics
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
A general approach to L(h,k)-label interconnection networks
Journal of Computer Science and Technology
(2,1)-Total number of trees with maximum degree three
Information Processing Letters
Complexity of (p,1)-total labelling
Discrete Applied Mathematics
Distance constrained labelings of planar graphs with no short cycles
Discrete Applied Mathematics
Graph labellings with variable weights, a survey
Discrete Applied Mathematics
An O(n1.75) algorithm for L(2,1)-labeling of trees
Theoretical Computer Science
Labeling the r-path with a condition at distance two
Discrete Applied Mathematics
On island sequences of labelings with a condition at distance two
Discrete Applied Mathematics
Notes: A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
Generalized list T-colorings of cycles
Discrete Applied Mathematics
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
L(2,1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
An exact algorithm for the channel assignment problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles
Discrete Applied Mathematics
Note: The L(2,1)-labelling of trees
Discrete Applied Mathematics
L(2,1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
L(2,1)-labeling of strong products of cycles
Information Processing Letters
L(p,q)-labelling of K4-minor free graphs
Information Processing Letters
Optimal radio labellings of complete m-ary trees
Discrete Applied Mathematics
Channel assignment for interference avoidance in honeycomb wireless networks
Journal of Parallel and Distributed Computing
L(j,k)-labelling and maximum ordering-degrees for trees
Discrete Applied Mathematics
Distance constrained labelings of trees
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On injective colourings of chordal graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The L(h,1,1)-labelling problem for trees
European Journal of Combinatorics
Note: L(2,1)-Labelings on the composition of n graphs
Theoretical Computer Science
k-L(2,1)-labelling for planar graphs is NP-complete for k≥4
Discrete Applied Mathematics
New upper bounds on the L(2,1)-labeling of the skew and converse skew product graphs
Theoretical Computer Science
Group path covering and distance two labeling of graphs
Information Processing Letters
The (2,1)-total labeling number of outerplanar graphs is at most Δ + 2
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
On the complexity of exact algorithm for L (2, 1)-labeling of graphs
Information Processing Letters
The L(2,1)-labeling of unigraphs
Discrete Applied Mathematics
Fast exact algorithm for L(2, 1)-labeling of graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
L(h,1,1)-Labeling of outerplanar graphs
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Generalized powers of graphs and their algorithmic use
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On the computational complexity of the L(2,1)-labeling problem for regular graphs
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Distance constrained labelings of graphs of bounded treewidth
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Group path covering and L(j,k)-labelings of diameter two graphs
Information Processing Letters
Exact λ-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
Discrete Applied Mathematics
On backbone coloring of graphs
Journal of Combinatorial Optimization
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
Elegant distance constrained labelings of trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
L(2,1) -labelling of generalized prisms
Discrete Applied Mathematics
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
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
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs
Information Processing Letters
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs
Journal of Discrete Algorithms
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
Griggs and Yeh's Conjecture and $L(p,1)$-labelings
SIAM Journal on Discrete Mathematics
Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two
SIAM Journal on Discrete Mathematics
On real number labelings and graph invertibility
Discrete Applied Mathematics
On n-fold L(j,k)-and circular L(j,k)-labelings of graphs
Discrete Applied Mathematics
On L(2,1)-coloring split, chordal bipartite, and weakly chordal graphs
Discrete Applied Mathematics
Labeling outerplanar graphs with maximum degree three
Discrete Applied Mathematics
Some results on the injective chromatic number of graphs
Journal of Combinatorial Optimization
On L(2,1)-labeling of generalized Petersen graphs
Journal of Combinatorial Optimization
Exact algorithms for L(2, 1)-labeling of graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Determining the l(2,1)-span in polynomial space
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
A survey of Nordhaus-Gaddum type relations
Discrete Applied Mathematics
On the L(2,1)-labelings of amalgamations of graphs
Discrete Applied Mathematics
L(2,1) -labeling of oriented planar graphs
Discrete Applied Mathematics
Determining the L(2,1)-span in polynomial space
Discrete Applied Mathematics
Path covering number and L(2,1)-labeling number of graphs
Discrete Applied Mathematics
L(2,1)-labelings of the edge-path-replacement of a graph
Journal of Combinatorial Optimization
On (s,t)-relaxed L (2,1)-labelings of the square lattice
Information Processing Letters
Fast exact algorithm for L(2,1)-labeling of graphs
Theoretical Computer Science
Radio labelings of distance graphs
Discrete Applied Mathematics
The L(p,q)-labelling of planar graphs without 4-cycles
Discrete Applied Mathematics
Circular L(j,k)-labeling number of direct product of path and cycle
Journal of Combinatorial Optimization
L(d,1)-labelings of the edge-path-replacement of a graph
Journal of Combinatorial Optimization
List backbone colouring of graphs
Discrete Applied Mathematics
Multiple L(j,1)-labeling of the triangular lattice
Journal of Combinatorial Optimization
Exact algorithm for graph homomorphism and locally injective graph homomorphism
Information Processing Letters
| Hi-index | 0.01 |