A polynomial approximation algorithm for the minimum fill-in problem

Authors:
Assaf Natanzon;Ron Shamir;Roded Sharan
Affiliations:
Department of Computer Science, Tel Aviv University, Tel Aviv, Israel;Department of Computer Science, Tel Aviv University, Tel Aviv, Israel and Department of Computer Science and Engineering, University of Washington, Seattle, Washington;Department of Computer Science, Tel Aviv University, Tel Aviv, Israel
Venue:
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Year:
1998

Linear-time recognition of bipartite graphs plus two edges

Discrete Mathematics
Parameterized Complexity: The Main Ideas and Some Research Frontiers

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Complexity Classification of Some Edge Modification Problems

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
An out-of-core sparse symmetric-indefinite factorization method

ACM Transactions on Mathematical Software (TOMS)
Characterizing and Computing Minimal Cograph Completions

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Characterizing and computing minimal cograph completions

Discrete Applied Mathematics
A clustering algorithm for interval graph test on noisy data

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Recognizing sparse perfect elimination Bipartite graphs

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Subexponential parameterized algorithm for minimum fill-in

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Computation of chromatic polynomials using triangulations and clique trees

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Hi-index	0.00