On finding minimum-diameter clique trees
Nordic Journal of Computing
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Efficient Implementation of a Minimal Triangulation Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
PAC-learning bounded tree-width graphical models
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Fully dynamic algorithms for chordal graphs and split graphs
ACM Transactions on Algorithms (TALG)
The clique-separator graph for chordal graphs
Discrete Applied Mathematics
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
Information Processing Letters
A simple algorithm to find Hamiltonian cycles in proper interval graphs
Information Processing Letters
Minimum fill-in and treewidth of split+ke and split+kv graphs
Discrete Applied Mathematics
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
A fully dynamic algorithm for recognizing and representing chordal graphs
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
How to use planarity efficiently: new tree-decomposition based algorithms
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Minimum fill-in and treewidth of split+ke and split+kv graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Separator orders in interval, cocomparability, and AT-free graphs
Discrete Applied Mathematics
Linear-Time algorithms for tree root problems
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
| Hi-index | 0.89 |