Author:
Panangaden Prakash,Verbrugge Clark
Subject
General Computer Science,Theoretical Computer Science
Reference98 articles.
1. Planar separators;Alon;SIAM J. Discrete Math.,1994
2. M. Andries, G. Engels, Syntax and semantics of hybrid database languages, in: H.J. Schneider, H. Ehrig (Eds.), Graph Transformations in Computer Science: Proc. Int. Workshop, Lecture Notes in Computer Science, vol. 776, Dagstuhl Castle, Germany, Springer, Berlin, January 1993, pp. 19–36.
3. M. Andries, J. Paredaens, A language for generic graph-transformations, in: G. Schmidt, R. Berghammer (Eds.), Graph-Theoretic Concepts in Computer Science: Proc. 17th Int. Workshop, WG ’91, Lecture Notes in Computer Science, vol. 570, Fischbachau, Germany, 17–19 June, Springer, Berlin, 1991, pp. 63–74.
4. Efficient algorithms for combinatorial problems on graphs with bounded decomposability – a survey;Arnborg;BIT,1985
5. S. Arnborg, J. Lagergren, D. Seese, Problems easy for tree-decomposable graphs, in: T. Lepistö, A. Salomaa (Eds.), Proc. 15th Int. Colloquium On Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317, Tampere, Finland, 11–15 July, Springer, Berlin, pp. 38–51. Extended abstract.