dododododo's library 58 articles Export

	Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs [My Copy] : Algorithms and Data Structures (1993), pp. 175-187. by O. Berkman, Y. Matias, P. Ragde posted to ragde by dododododo on 2007-04-08 10:34:28 as
	Videotape safaris: Entering the field with a camera [My Copy] Qualitative Sociology, Vol. 8, No. 4. (1 December 1985), pp. 325-344. by Gary L. Albrecht posted to directed experimental theory tree-width by dododododo on 2007-04-08 02:35:33 as
	Molecular basis of MAPK-activated protein kinase 2:p38 assembly. [My Copy] Proc Natl Acad Sci U S A (29 March 2007) by Andre White, Christopher A A. Pargellis, Joey M M. Studts, Brian G G. Werneburg, Bennett T T. Farmer posted to graph by dododododo on 2007-04-05 04:26:56 as
	Dynamic genome architecture in the nuclear space: regulation of gene expression in three dimensions [My Copy] Nat Rev Genet, Vol. 8 (February 2007), pp. 104-115. by Christian Lanctot posted to directed by dododododo on 2007-01-18 21:39:20 as
	Improved annotation of the blogosphere via autotagging and hierarchical clustering [My Copy] In WWW '06: Proceedings of the 15th international conference on World Wide Web (2006), pp. 625-632. by Christopher H. Brooks, Nancy Montanez posted to no-tag by dododododo on 2007-01-18 21:30:11 as along with 42 people and 8 groups meikipp thegoose tmancill dreamedge Gussoh snowland eipa rabourn rickl tyfn pdlug takeha-e wcrosbie libah jrsinclair shilad ianturton krisl meyoukey beanformer abbyworld benhockenberry juutela mook3000 bangb stefans nroovers hanshee magnusyi theodora discopatrick menjo y3snoozer Tronhus intrect bde adamsi cherhan anandmg djsaab wartaalman fryanpan GroupLens Wikipedia CoP_CMS ETEC533 Ontology memoir tag_clustering Social Tagging
	Finite extinction time for the solutions to the Ricci flow on certain three-manifolds [My Copy] (17 Jul 2003) by Grisha Perelman posted to directed experimental theory tree-width by dododododo on 2006-11-15 03:49:14 as along with 2 people jrw proportional
	Directed Tree-Width [My Copy] (2003) by M. A. Safari posted to directed tree-width by dododododo on 2006-06-15 02:09:50 as
	Tree decomposition: a feasibility study [My Copy] (1998) by H. Röhrig posted to experimental tree-width by dododododo on 2006-06-15 02:09:50 as
	Finding and counting small induced subgraphs efficiently [My Copy] Information Processing Letters, Vol. 74, No. 3--4. (2000), pp. 115-121. by T. Kloks, D. Kratsch, H. Müller posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Graph minors. V. Excluding a planar graph [My Copy] Journal of Combinatorial Theory (Series B), Vol. 41 (1986), pp. 92-114. by N. Robertson, P. Seymour posted to graph theory tree-width by dododododo on 2006-06-15 02:09:50 as
	Graph Minors. X. Obstructions to tree-decomposition [My Copy] Journal of Combinatorial Theory (Series B), Vol. 52 (1991), pp. 153-190. by P. Seymour, R. Thomas posted to tree-width by dododododo on 2006-06-15 02:09:50 as along with 1 person mna28
	Graph searching, and a min-max theorem for treewidth [My Copy] Journal of Combinatorial Theory (Series B), Vol. 58 (1993), pp. 239-257. by P. Seymour, R. Thomas posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	An Improved Approximation Algorithm for Multiway Cut [My Copy] Journal of Computer and System Sciences, Vol. 60, No. 3. (2000), pp. 564-574. by G. Calinescu, H. Karloff, Y. Rabani posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Multicuts in Unweighted Graphs and Digraphs with Bounded Degree and Bounded Tree-Width [My Copy] Journal of Algorithms (To Apper) by G. Calinescu, C. G. Fernandes, B. Reed posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Easy Problems for Tree-Decomposable Graphs [My Copy] Journal of Algorithms, Vol. 12, No. 2. (1991), pp. 308-340. by S. Arnborg, J. Lagergren, D. Seese posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Better algorithms for the pathwidth and treewidth of graphs [My Copy] (1991) by H. Bodlaender, T. Kloks posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Algorithms Finding Tree-Decompositions of Graphs [My Copy] Journal of Algorithms, Vol. 12, No. 1. (1991), pp. 1-22. by J. Matousek, R. Thomas posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Complexity of finding embedding in a k-tree [My Copy] SIAM Journal on Algebraic and Discrete Methods, Vol. 8 (1987), pp. 277-284. by S. Arnborg, D. G. Corneil, A. Proskurowski posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	A practical algorithm for finding optimal triangulations [My Copy] In Proceedings of the National Conference on Artificial Intelligence (AAAI 97) (1997), pp. 185-190. by K. Shoikhet, D. Geiger posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Graphs with interlinked directed circuits [My Copy] In Proceedings of the Mid-west Symposium on Circuit Theory, Vol. 2 (1973) by D. H. Younger posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Problem 6 [My Copy] Theory of Graphs, Proc. Colloq. Tihany (1966) by T. Gallai posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	On packing directed circuits [My Copy] Combinatorica, Vol. 16 (1996), pp. 535-554. by B. Reed, N. Robertson, P. Seymour, R. Thomas posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Tree Width and Tangles: A New Connectivity Measure And Some Applications [My Copy] Suervey in Combinatorics, Vol. 241 (1997), pp. 87-158. by B. Reed posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Introducing directed tree width [My Copy] In Electronic Notes in Discrete Mathematics, Vol. 3 (2000) by B. Reed edited by H. J. Broersma, U. Faigle, C. Hoede, J. L. Hurink posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Directed Tree-Width [My Copy] Journal of Combinatorial Theory(Series B), Vol. 82 (2001), pp. 128-154. by T. Johnson, N. Robertson, P. D. Seymour, R. Thomas posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Graph minors XIII: The disjoint path problem [My Copy] Journal of Combinatorial Theory(Series B), Vol. 63 (1995), pp. 65-110. by N. Robertson, P. D. Seymour posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Graph minors II: algorithmic aspects of tree-width [My Copy] Journal Algorithms, Vol. 7 (1986), pp. 309-322. by N. Robertson, P. D. Seymour posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	A separator theorem for chordal graphs [My Copy] SIAM Journal on Algebraic and Discrete Methods, Vol. 5, No. 3. (1984), pp. 306-313. by J. R. Gilbert, D. J. Rose, A. Edenbrandt posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Finding approximate separators and computing treewidth quickly [My Copy] In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (1992), pp. 221-228. by B. Reed posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Treewidth: Algorithmic Techniques and Results [My Copy] In Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97, Lecture Notes in Computer Science, volume 1295 (1997), pp. 19-36. by H. L. Bodlaender edited by Igor Privara, Peter Ruzicka posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	A partial k-arboretum of graphs with bounded treewidth [My Copy] (1998) by H. Bodlaender posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Efficient Parallel Algorithms for Tree-Decomposition and Related Problems [My Copy] In {IEEE} Symposium on Foundations of Computer Science (1990), pp. 173-182. by J. Lagergren posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	A Tourist Guide through Treewidth [My Copy] Acta Cybernetica (1993), pp. 1-21. by H. L. Bodlaender posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Graph Class/Comarability Graph [My Copy] (\\ online at http://www.cs.ualberta.ca/\~\ stewart/GRAPH/comparability/comparability.html) posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Advanced Topics in Graph Algorithms. Lecture notes of a graduate course, Tel-Aviv University [My Copy] (online at http://www.math.tau.ac.il/\~\ rshamir/atga/atga.html) posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Treewidth, Computation and Approximation [My Copy] (1994) by T. Kloks posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth [My Copy] SIAM Journal on Computing, Vol. 25 (1996), pp. 1305-1317. by H. L. Bodlaender posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability --- A Survey [My Copy] BIT, Vol. 25 (1985), pp. 2-33. by S. Arnborg posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Linear Time Algorithms for NP-Hard Problems Restricted to Partial k-Trees [My Copy] DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, Vol. 23 (1989), pp. 11-24. by S. Arnborg, A. Proskurowski posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Dynamic programming on graphs of bounded treewidth [My Copy] (1988) by H. Bodlaender posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	NC-Algorithms for Graphs with Small Treewidth [My Copy] In Workshop on Graph-Theoretic Concepts in Computer Science (1988), pp. 1-10. by H. L. Bodlaender posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth [My Copy] In Workshop on Graph-Theoretic Concepts in Computer Science (1989), pp. 232-244. by H. L. Bodlaender posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees [My Copy] Journal of Algorithms, Vol. 11(4) (1990), pp. 631-643. by H. L. Bodlaender posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	The Monadic Second-Order Logic of Graphs, II: Infinite Graphs of Bounded Width [My Copy] Mathematical Systems Theory, Vol. 21, No. 4. (1989), pp. 187-221. by B. Courcelle posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	$My PDF hopcroft_73_nfrac32.pdf$ An $n^\frac32$ algorithm for maximum matchings in bipartite graphs [My Copy] SIAM Journal on Computing, Vol. 2 (1973), pp. 225-231. by J. Hopcroft, R. Karp posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	The role of elimination trees in sparse factorization [My Copy] SIAM Journal on Matrix Analysis and Applications, Vol. 11, No. 1. (1990), pp. 134-172. by Liu posted to tree-width by dododododo on 2006-06-15 02:09:50 as along with 1 person fluctuate
	Two short proofs concerning tree-decompositions [My Copy] Combinatoric, Probability and Computing, Vol. 11 (2002), pp. 1-7. by P. Bellenbaum, R. Diestel posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Approximating Treewidth, Pathwidt, Frontsize, and Shortest Elimination Tree [My Copy] Journal of Algorithms, Vol. 18, No. 2. (1995), pp. 238-255. by H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, T. Kloks posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Algorithmic graph theory and perfect graphs [My Copy] (1980) by M. C. Golumbic posted to tree-width by dododododo on 2006-06-15 02:09:50 as
	Introduction to Algorithms, 2nd edition [My Copy] (2000) by T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein posted to tree-width by dododododo on 2006-06-15 02:09:50 as

Note: You may cite this page as: http://www.citeulike.org/user/dododododo

Result page: 1 2 Next

dododododo's library 58 articles Export

dododododo's tags