Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Counting H-colorings of partial k-trees
Theoretical Computer Science
Three-colourbility and forbidden subgraphs. II: polynomial algorithms
Discrete Mathematics
Graph Colouring by Maximal Evidence Edge Adding
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
H-Colorings of Large Degree Graphs
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
The Complexity of Counting Colourings of Subgraphs of the Grid
Combinatorics, Probability and Computing
Efficiency in exponential time for domination-type problems
Discrete Applied Mathematics
Dominating set based exact algorithms for 3-coloring
Information Processing Letters
Narrowing down the gap on the complexity of coloring Pk-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
The complexity of vertex coloring problems in uniform hypergraphs with high degree
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Updating the complexity status of coloring graphs without a fixed induced linear forest
Theoretical Computer Science
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time
Theoretical Computer Science
4-coloring h-free graphs when h is small
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
H-colorings of dense hypergraphs
Information Processing Letters
4-coloring H-free graphs when H is small
Discrete Applied Mathematics
Three complexity results on coloring Pk-free graphs
European Journal of Combinatorics
| Hi-index | 5.23 |