Every planar graph is 5-choosable
Journal of Combinatorial Theory Series B
Good orders for incremental (re)construction
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Generalized map coloring for use in geographical information systems
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Graph separators: a parameterized view
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Inertia-based distributed channel allocation
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
On problems without polynomial kernels
Journal of Computer and System Sciences
On injective colourings of chordal graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Local 7-coloring for planar subgraphs of unit disk graphs
Theoretical Computer Science
ICDT'07 Proceedings of the 11th international conference on Database Theory
Acyclically 3-colorable planar graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Acyclically 3-colorable planar graphs
Journal of Combinatorial Optimization
Maximal strip recovery problem with gaps: Hardness and approximation algorithms
Journal of Discrete Algorithms
Coloring planar homothets and three-dimensional hypergraphs
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |