Fast parallel algorithms for chordal graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
NC Algorithms for Recognizing Chordal Graphs and k Trees
IEEE Transactions on Computers
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs
IEEE Transactions on Parallel and Distributed Systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
NC coloring algorithms for permutation graphs
Nordic Journal of Computing
An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Coloring permutation graphs in parallel
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Planarizing gadgets for perfect matching do not exist
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |