Polynomial time recognition of P4-structure
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Euler graphs, triangle-free graphs and bipartite graphs in switching classes
Fundamenta Informaticae - Special issue on the first international conference on graph transformation (ICGT 2002)
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Unifying two graph decompositions with modular decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Switching to hedgehog-free graphs is NP-complete
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On the complexity of the G-reconstruction problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes
Fundamenta Informaticae - The First International Conference on Graph Transformation (ICGT 2002)
| Hi-index | 0.00 |