Search results for "subtree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
125	Lei Zou 0001, Yansheng Lu, Huaming Zhang, Rong Hu	Mining Frequent Induced Subtree Patterns with Subtree-Constraint.	ICDM Workshops	2006	DBLP DOI BibTeX RDF
117	James W. George, Charles S. Revelle, John R. Current	The Maximum Utilization Subtree Problem.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF
117	Bhaskar DasGupta, Xin He, Tao Jiang 0001, Ming Li 0001, John Tromp	On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.	Algorithmica	1999	DBLP DOI BibTeX RDF	Approximation algorithms, Lower bounds, Evolutionary trees
87	Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz	CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees.	PAKDD	2004	DBLP DOI BibTeX RDF	closed subtree, maximal subtree, enumeration tree, rooted unordered tree, Frequent subtree
80	Justin C. Williams	Optimal Direct and Indirect Covering Trees.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	covering tree, extensive facility, location, transportation network
77	Michael Benedikt, Irini Fundulaki	XML Subtree Queries: Specification and Composition.	DBPL	2005	DBLP DOI BibTeX RDF
77	Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson	Approximate Labelled Subtree Homeomorphism.	CPM	2004	DBLP DOI BibTeX RDF
77	James W. George, Charles S. Revelle	Bi-Objective Median Subtree Location Problems.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	extensive facility location, structure location, tree, network design, median, multiobjective
67	Sun-Yuan Hsieh, Ting-Yu Chou	Finding a Weight-Constrained Maximum-Density Subtree in a Tree.	ISAAC	2005	DBLP DOI BibTeX RDF
66	Oana Muntean, Laura Diosan, Mihai Oltean	Best SubTree genetic programming.	GECCO	2007	DBLP DOI BibTeX RDF	classification, genetic programming, regression, subtree
66	Jing Wang 0066, Ying Li, Xinmei Wang	An Algorithm to Search Minimal Subtree Graphs.	ICPP Workshops	2007	DBLP DOI BibTeX RDF	multicast routing graph, minimal subtree graph, information flow, network coding
66	Ron Shamir, Dekel Tsur	Faster subtree isomorphism.	ISTCS	1997	DBLP DOI BibTeX RDF	subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem
66	Partha Biswas, Girish Venkataramani	Comprehensive isomorphic subtree enumeration.	CASES	2008	DBLP DOI BibTeX RDF	subtree isomorphism, subtree matching algorithm, embedded systems
65	Josiah Carlson, David Eppstein	The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems.	SWAT	2006	DBLP DOI BibTeX RDF
58	Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas	Linear time 3-approximation for the MAST problem.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	maximum agreement subtree, maximum compatible subtree, Approximation algorithm, phylogenetic tree
57	Yun Chi, Yi Xia, Yirong Yang, Richard R. Muntz	Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF	closed frequent subtree, maximal frequent subtree, data mining, Trees, graph algorithms, mining methods and algorithms, frequent subtree
57	Josephine Micallef, Gail E. Kaiser	Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	incremental attribute evaluation, multiple asynchronous subtree replacements, arbitrary noncircular attribute grammars, multiple independent editing cursors, disjoint regions, derivation tree, computational complexity, complexity, trees (mathematics), attribute grammars, tree data structures, text editing, open problems
56	Tomás Flouri, Borivoj Melichar, Jan Janousek	Aho-Corasick like multiple subtree matching by pushdown automata.	SAC	2010	DBLP DOI BibTeX RDF	subtree matching, pattern matching, tree, pushdown automata, subtree
56	Dmitry Keselman, Amihood Amir	Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms	FOCS	1994	DBLP DOI BibTeX RDF	maximum agreement subtree, homeomorphic agreement subtree, approximation algorithm, metrics, efficient algorithms, evolutionary trees
50	Lei Zou 0001, Yansheng Lu, Huaming Zhang, Rong Hu	PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embedded Subtrees.	WISE	2006	DBLP DOI BibTeX RDF
50	Justo Puerto, Arie Tamir	Locating tree-shaped facilities using the ordered median objective.	Math. Program.	2005	DBLP DOI BibTeX RDF
50	Chun-Cheng Lin, Hsu-Chun Yen	On Balloon Drawings of Rooted Trees.	GD	2005	DBLP DOI BibTeX RDF
50	Stephen B. Peckham	Globally Partitionable Attribute Grammars.	WAGA	1990	DBLP DOI BibTeX RDF
48	Wenxin Liang, Haruo Yokota	Exploiting Path Information for Syntax-Based XML Subtree Matching in RDBs.	WAIM	2008	DBLP DOI BibTeX RDF
48	Wenxin Liang, Haruo Yokota	A Path-sequence Based Discrimination for Subtree Matching in Approximate XML Joins.	ICDE Workshops	2006	DBLP DOI BibTeX RDF
48	Zeshan Peng, Hing-Fung Ting	An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees.	ISAAC	2004	DBLP DOI BibTeX RDF
48	Wanida Pensuwon, Rod Adams, Neil Davey	Optimizing a Neural Tree Using Subtree Retraining.	KES	2004	DBLP DOI BibTeX RDF
48	Hiroshi Nagamochi, Kohei Okada	Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem.	ISAAC	2003	DBLP DOI BibTeX RDF
47	Fanica Gavril	Algorithms on Subtree Filament Graphs.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF	subtree filament graph, dominating hole, induced split subgraph, perfect graph
47	Yun Chi, Yirong Yang, Richard R. Muntz	Canonical forms for labelled trees and their applications in frequent subtree mining.	Knowl. Inf. Syst.	2005	DBLP DOI BibTeX RDF	Labelled free tree, Labelled rooted unordered tree, Tree isomorphism, Canonical form, Frequent subtree
40	Byoungyong Lee, Kyungseo Park, Ramez Elmasri	Reducing Energy Consumption through the Union of Disjoint Set Forests Algorithm in Sensor Networks.	ICOIN	2007	DBLP DOI BibTeX RDF
40	Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li 0001, Weizhao Wang	A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees.	ISAAC	2006	DBLP DOI BibTeX RDF
40	Ping Guo 0003, Yang Zhou 0001, Jun Zhuang, Ting Chen, Yan-Rong Kang	An Efficient Algorithm for Mining Both Closed and Maximal Frequent Free Subtrees Using Canonical Forms.	ADMA	2005	DBLP DOI BibTeX RDF
40	Biing-Feng Wang	Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Trees, cores, centers, tree contraction, the Euler-tour technique
39	Gabriel Valiente	Constrained Tree Inclusion.	CPM	2003	DBLP DOI BibTeX RDF	Tree inclusion, subtree homeomorphism, noncrossing bipartite matching, tree pattern matching
39	Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano	Multiple Templates Access of Trees in Parallel Memory Systems.	IPPS	1997	DBLP DOI BibTeX RDF	multiple template access, node mapping algorithms, subtree templates, root-to-leaf path templates, preprocessing phase, data structure, time complexity, tree data structures, load, complete binary trees, conflict-free access, parallel access, memory modules, parallel memory systems
38	Vincent Berry, Zeshan Peng, H. F. Ting	From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time.	Algorithmica	2008	DBLP DOI BibTeX RDF	Maximum agreement subtrees, Constrained maximum agreement subtrees, Bioinformatics, Consensus, Reduction, Evolutionary trees
38	Oana Muntean, Laura Diosan, Mihai Oltean	Solving the even-n-parity problems using Best SubTree Genetic Programming.	AHS	2007	DBLP DOI BibTeX RDF
38	Sylvain Guillemot, François Nicolas	Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees.	CPM	2006	DBLP DOI BibTeX RDF
38	Leonardo Vanneschi, Steven M. Gustafson, Giancarlo Mauri	Using Subtree Crossover Distance to Investigate Genetic Programming Dynamics.	EuroGP	2006	DBLP DOI BibTeX RDF
38	Zeshan Peng, H. F. Ting	An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree.	WABI	2005	DBLP DOI BibTeX RDF
38	Brent Heeringa, Micah Adler	Optimal Website Design with the Constrained Subtree Selection Problem.	ICALP	2004	DBLP DOI BibTeX RDF
38	Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo	Integral Trees: Subtree Depth and Diameter.	IWCIA	2004	DBLP DOI BibTeX RDF
38	Maarten Keijzer	Alternatives in Subtree Caching for Genetic Programming.	EuroGP	2004	DBLP DOI BibTeX RDF
38	Riccardo Poli	General Schema Theory for Genetic Programming with Subtree-Swapping Crossover.	EuroGP	2001	DBLP DOI BibTeX RDF
38	Simon C. Roberts, Daniel Howard 0001, John R. Koza	Evolving Modules in Genetic Programming by Subtree Encapsulation.	EuroGP	2001	DBLP DOI BibTeX RDF
38	Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri	Approximating the Maximum Isomorphic Agreement Subtree Is Hard.	CPM	2000	DBLP DOI BibTeX RDF
38	Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney	Subtree Availability in Binary Tree Architectures.	ICCI	1991	DBLP DOI BibTeX RDF
37	Yoshitaka Kameya, Junichi Kumagai, Yoshiaki Kurata	Accelerating genetic programming by frequent subtree mining.	GECCO	2008	DBLP DOI BibTeX RDF	frequent subtree mining, probabilistic model building genetic programming, genetic programming, building blocks
37	Andrew Vince, Hua Wang	Infinitely Many Trees Have Non-Sperner Subtree Poset.	Order	2007	DBLP DOI BibTeX RDF	Sperner property, Lattice, Poset, Subtree
35	Jessica A. Enright, Lorna Stewart	Subtree filament graphs are subtree overlap graphs.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
35	Josiah Carlson, David Eppstein	The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems	CoRR	2005	DBLP BibTeX RDF
30	Waraporn Viyanon, Sanjay Kumar Madria	A system for detecting xml similarity in content and structure using relational database.	CIKM	2009	DBLP DOI BibTeX RDF	taxonomy analyzer, clustering, similarity measures, xml, keys
30	Show-Jane Yen, Yue-Shi Lee, Chiu-Kuang Wang, Jung-Wei Wu, Liang-Yuh Ouyang	The Studies of Mining Frequent Patterns Based on Frequent Pattern Tree.	PAKDD	2009	DBLP DOI BibTeX RDF	Data Mining, Knowledge Discovery, Frequent Itemset, Frequent Pattern, Transaction Database
30	Roman Filipovych, Eraldo Ribeiro	Learning Structural Models in Multiple Projection Spaces.	ICIAR	2009	DBLP DOI BibTeX RDF	constrained Bayesian trees, substructure discovery, E.M. algorithm, learning, motion recognition
30	Fedja Hadzic, Henry Tan, Tharam S. Dillon	Mining Unordered Distance-Constrained Embedded Subtrees.	Discovery Science	2008	DBLP DOI BibTeX RDF
30	Juryon Paik, Junghyun Nam, Hee Yong Youn, Ung-Mo Kim	Discovery of Useful Patterns from Tree-Structured Documents with Label-Projected Database.	ATC	2008	DBLP DOI BibTeX RDF
30	Erik D. Demaine, Stefan Langerman, Eric Price 0001	Confluently Persistent Tries for Efficient Version Control.	SWAT	2008	DBLP DOI BibTeX RDF
30	Yamin Li, Shietung Peng, Wanming Chu	K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks.	ISPAN	2008	DBLP DOI BibTeX RDF	overlay mesh, tree-core, Mobile ad hoc network (MANET), multicast, stability, efficiency
30	Roman Filipovych, Eraldo Ribeiro	Discovering Constrained Substructures in Bayesian Trees Using the E.M. Algorithm.	ICIAR	2008	DBLP DOI BibTeX RDF	constrained Bayesian trees, substructure discovery, E.M. algorithm, learning, motion recognition
30	Sangeetha Kutty, Tien Tran, Richi Nayak, Yuefeng Li	Clustering XML Documents Using Closed Frequent Subtrees: A Structural Similarity Approach.	INEX	2007	DBLP DOI BibTeX RDF	XML document mining, Frequent Mining, Structural mining, Clustering, INEX, Frequent subtrees
30	Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan	Online Bandwidth Allocation.	ESA	2007	DBLP DOI BibTeX RDF
30	Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti	An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Steiner Arborescence, Prize Collecting, Network Design, Branch-and-Cut
30	James Caverlee, Ling Liu 0001	QA-Pagelet: Data Preparation Techniques for Large-Scale Data Analysis of the Deep Web.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF	pagelets, clustering, Deep Web, data extraction, data preparation
30	Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher	Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.	GECCO (1)	2004	DBLP DOI BibTeX RDF
30	Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting	Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison.	ISAAC	2000	DBLP DOI BibTeX RDF
30	Frank Neven, Thomas Schwentick	Expressive and Efficient Pattern Languages for Tree-Structured Data.	PODS	2000	DBLP DOI BibTeX RDF
30	Ming-Yang Kao	Tree Contractions and Evolutionary Trees.	CIAC	1997	DBLP DOI BibTeX RDF
29	Magnus Bordewich, Olivier Gascuel, Katharina T. Huber, Vincent Moulton	Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	subtree prune and regraft (SPR), BSPR algorithm, Nearest Neighbor Interchange (NNI), BNNI algorithm, balanced minimum evolution principle (BME), tree-length, quartet-distance, Robinson Foulds distance, safety radius, topological move, consistency, phylogenetic tree
29	Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv	Keyword proximity search in complex data graphs.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	approximate top-k answers, information retrieval on graphs, keyword proximity search, subtree enumeration by height, redundancy elimination
29	Masashi Okada, Naohiro Ishii, Nariaki Kato	Information Extraction by XLM.	KES (2)	2007	DBLP DOI BibTeX RDF	embedded subtree, information extraction, xml, tree structure
29	Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker	Matching Hierarchical Structures Using Association Graphs.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	Maximal subtree isomorphisms, replicator dynamical systems, shock trees, shape recognition, maximal cliques, association graphs
29	Joachim Niehren, Manfred Pinkal, Peter Ruhrberg	On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting.	CADE	1997	DBLP DOI BibTeX RDF	tree constraints, subtree relation, string unification, context unification, linear second-order unification, one-step rewriting, semantic processing of natural language
29	Kim S. Larsen, Rolf Fagerberg	B-trees with relaxed balance.	IPPS	1995	DBLP DOI BibTeX RDF	relaxed balance, shared-memory asynchronous parallel architectures, rebalancing, extensive locking, maximal size, parallel architectures, B-trees, tree data structures, subtree
28	Lingyun Wen, Guiquan Liu, Yinghai Zhao	HS-Model: a hierarchical statistical subtree-generating model for genetic programming.	GEC Summit	2009	DBLP DOI BibTeX RDF	subroutine
28	Wai Yin Mok	Characterizing the MVDs That Hold in a Connected Subtree of a Join Tree: A Correction.	IEEE Trans. Knowl. Data Eng.	2008	DBLP DOI BibTeX RDF	Schema and subschema, Data dependencies, Normal forms
28	Tobias Achterberg, Stefan Heinz 0001, Thorsten Koch	Counting Solutions of Integer Programs Using Unrestricted Subtree Detection.	CPAIOR	2008	DBLP DOI BibTeX RDF
28	Anders Dessmark, Jesper Jansson 0001, Andrzej Lingas, Eva-Marta Lundell	Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.	Algorithmica	2007	DBLP DOI BibTeX RDF
28	Jung-Rim Kim, Hyun Sung Chang, Sang Uk Lee, Sanghoon Sull	Efficient Subtree Pruning Scheme in Tree-Structured Hierarchy.	IEEE Trans. Circuits Syst. Video Technol.	2007	DBLP DOI BibTeX RDF
28	Tao Jin, Yuchen Fu, Xinghong Ling, Quan Liu, Zhiming Cui	A Method of Ontology Mapping Based on Subtree Kernel.	IITA	2007	DBLP DOI BibTeX RDF
28	Vincent Berry, François Nicolas	Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	algorithms, pattern matching, trees, consensus, compatibility, fixed-parameter tractability, Phylogenetics
28	Sun-Yuan Hsieh	Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species.	FSTTCS	2006	DBLP DOI BibTeX RDF
28	Steven M. Gustafson, Leonardo Vanneschi	Operator-Based Distance for Genetic Programming: Subtree Crossover Distance.	EuroGP	2005	DBLP DOI BibTeX RDF
28	Hiroshi Nagamochi, Taizo Kawada	Approximating the Minmax Subtree Cover Problem in a Cactus.	ISAAC	2004	DBLP DOI BibTeX RDF
28	Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang	An Improved Algorithm for the Maximum Agreement Subtree Problem.	BIBE	2004	DBLP DOI BibTeX RDF	maximum agreement sub-tree, leaf-labelled tree, k-dimensional range search tree, k-dimensional binary search tree, Evolutionary tree
28	Anders Dessmark, Jesper Jansson 0001, Andrzej Lingas, Eva-Marta Lundell	Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.	CPM	2004	DBLP DOI BibTeX RDF
28	Ling Chen 0006, Sourav S. Bhowmick, Liang-Tien Chia	Mining Maximal Frequently Changing Subtree Patterns from XML Documents.	DaWaK	2004	DBLP DOI BibTeX RDF
28	Alexandros Stamatakis, Thomas Ludwig 0002, Harald Meier, Marty J. Wolf	Accelerating parallel maximum likelihood-based phylogenetic tree calculations using subtree equality vectors.	SC	2002	DBLP DOI BibTeX RDF
28	Riccardo Poli, Jonathan E. Rowe, Christopher R. Stephens, Alden H. Wright	Allele Diffusion in Linear Genetic Programming and Variable-Length Genetic Algorithms with Subtree Crossover.	EuroGP	2002	DBLP DOI BibTeX RDF
28	Terry Van Belle, David H. Ackley	Uniform Subtree Mutation.	EuroGP	2002	DBLP DOI BibTeX RDF
28	Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting	Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.	SWAT	1996	DBLP DOI BibTeX RDF
20	Kunal Agrawal, I-Ting Angelina Lee, Jim Sukha	Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages.	SPAA	2010	DBLP DOI BibTeX RDF	dynamic multithreading, intel threading building blocks, serial-parallel reciprocity, scheduling, work stealing, cilk
20	Leonardo Vanneschi, Steven M. Gustafson	Using crossover based similarity measure to improve genetic programming generalization ability.	GECCO	2009	DBLP DOI BibTeX RDF	crossover based similarity/dissimilarity measure, genetic programming, generalization
20	Balder ten Cate, Luc Segoufin	XPath, transitive closure logic, and nested tree walking automata.	PODS	2008	DBLP DOI BibTeX RDF	tree walking automata, xpath, xml, transitive closure
20	Krzysztof Krawiec, PrzemysBaw Polewski	Potential fitness for genetic programming.	GECCO (Companion)	2008	DBLP DOI BibTeX RDF	semantics, genetic programming, context, evolutionary computation
20	Show-Jane Yen, Yue-Shi Lee, Chiu-Kuang Wang, Jung-Wei Wu	An Efficient Approach for Mining Frequent Patterns Based on Traversing a Frequent Pattern Tree.	CSSE (4)	2008	DBLP DOI BibTeX RDF
20	Amit Dvir, Michael Segal 0001	The (k, l) Coredian Tree for Ad Hoc Networks.	ICDCS Workshops	2008	DBLP DOI BibTeX RDF
20	Svante Janson, Wojciech Szpankowski	Partial fillup and search time in LC tries.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization
20	Fedja Hadzic, Henry Tan, Tharam S. Dillon	UNI3 - efficient algorithm for mining unordered induced subtrees using TMG candidate generation.	CIDM	2007	DBLP DOI BibTeX RDF
20	Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison	Satisfiability of a Spatial Logic with Tree Variables.	CSL	2007	DBLP DOI BibTeX RDF