Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
Discrete Mathematics - Algebraic and topological methods in graph theory
2-Local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
Information Processing Letters
Distributive online channel assignment for hexagonal cellular networks with constraints
Discrete Applied Mathematics
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs
Journal of Algorithms
Optimal frequency assignments of cycles and powers of cycles
International Journal of Mobile Network Design and Innovation
SIGACT news online algorithms column 14
ACM SIGACT News
1-local 17/12-competitive algorithm for multicoloring hexagonal graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Deterministic online call control in cellular networks and triangle-free cellular networks
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
1-local 33/24-competitive algorithm for multicoloring hexagonal graphs
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Online call control in cellular networks revisited
Information Processing Letters
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs
Information Processing Letters
A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Every triangle-free induced subgraph of the triangular lattice is (5m,2 m)-choosable
Discrete Applied Mathematics
| Hi-index | 0.05 |