Chordal graph recognition is in NC
Information Processing Letters
A topological approach to dynamic graph connectivity
Information Processing Letters
A data structure for dynamic trees
Journal of Computer and System Sciences
Fast parallel algorithms for chordal graphs
SIAM Journal on Computing
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Improved Sampling with Applications to Dynamic Graph Algorithms
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Maintaining Minimum Spanning Trees in Dynamic Graphs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A fully dynamic algorithm for modular decomposition and recognition of cographs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Fully dynamic recognition algorithm and certificate for directed cograph
Discrete Applied Mathematics
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Theoretical Computer Science
Dynamically maintaining split graphs
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
An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Dynamic distance hereditary graphs using split decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A fully dynamic algorithm for the recognition of P4-sparse graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Faster dynamic algorithms for chordal graphs, and an application to phylogeny
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Fully-Dynamic recognition algorithm and certificate for directed cographs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |