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)
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
Labeling planar graphs with a condition at distance two
European Journal of Combinatorics
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics
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
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
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)
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
Distance constrained labelings of trees
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The L(h,1,1)-labelling problem for trees
European Journal of Combinatorics
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
k-L(2,1)-labelling for planar graphs is NP-complete for k≥4
Discrete Applied Mathematics
Colorings with few colors: counting, enumeration and combinatorial bounds
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On improved exact algorithms for L(2, 1)-labeling of graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Computing role assignments of proper interval graphs in polynomial time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
On the complexity of exact algorithm for L (2, 1)-labeling of graphs
Information Processing Letters
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
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
Matrix and graph orders derived from locally constrained graph homomorphisms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
L(2, 1, 1)-labeling is NP-complete for trees
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Distance three labelings of trees
Discrete Applied Mathematics
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
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
Exact algorithms for L(2, 1)-labeling of graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Determining the l(2,1)-span in polynomial space
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Determining the L(2,1)-span in polynomial space
Discrete Applied Mathematics
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Fast exact algorithm for L(2,1)-labeling of graphs
Theoretical Computer Science
Hi-index | 0.00 |