VLSI layout of trees into grids of minimum width
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n
The Journal of Machine Learning Research
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
Assessing the vulnerability of replicated network services
Proceedings of the 6th International COnference
Active pebbles: parallel programming for data-driven applications
Proceedings of the international conference on Supercomputing
The size and depth of layered boolean circuits
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
Expressing graph algorithms using generalized active messages
Proceedings of the 27th international ACM conference on International conference on supercomputing
| Hi-index | 0.00 |
When a subject area develops a sufficiently rich, albeit scattered, mass of results, one can argue that the Theory community would be well served by a central, theory-oriented (rather than application oriented) repository for mass results. The present book has been written in response to our perception of such need in the area of graph separators.