COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
Discrete Mathematics
Heuristics for the Maximum Outerplanar Subgraph Problem
Journal of Heuristics
Three-coloring triangle-free planar graphs in linear time
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Untangling Tanglegrams: Comparing Trees by Their Drawings
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Untangling Tanglegrams: Comparing Trees by Their Drawings
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Errors in graph embedding algorithms
Journal of Computer and System Sciences
Three-coloring triangle-free planar graphs in linear time
ACM Transactions on Algorithms (TALG)
A linear time algorithm for finding a maximal planar subgraph based on PC-trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Additional PC-Tree planarity conditions
GD'04 Proceedings of the 12th international conference on Graph Drawing
Tree-representation of set families and applications to combinatorial decompositions
European Journal of Combinatorics
On minimizing the number of label transitions around a vertex of a planar graph
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Information and Computation
| Hi-index | 5.23 |