Allen J. F.1981. An interval-based representation of temporal knowledge. InIJCAI.

Amaneddine N., Condotta J.-F. & Sioutis M.2013. Efficient approach to solve the minimal labeling problem of temporal and spatial qualitative constraints. InIJCAI.

Baget J.-F. & Tognetti Y. S.2001. Backtracking through biconnected components of a constraint graph. In IJCAI.

Balbiani P., Condotta J.-F. & Cerro L. F. d.2002. Tractability results in the block algebra. Journal of Logic and Computation12,885–909.

Barabasi A.-L. & Bonabeau E.2003. Scale-free networks.Scientific American288,50–59.

Beek P. v. & Manchak D. W.1996. The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research4, 1–18.

Bhatt M., Guesgen H., Wölfl S. & Hazarika S.2011. Qualitative spatial and temporal reasoning: emerging applications, trends, and directions.Spatial Cognition & Computation11, 1–14.

Bliek C. & Sam-Haroud D.1999. Path consistency on triangulated constraint graphs. InIJCAI.

Bodirsky M. & Wölfl S.2011. RCC8 is polynomial on networks of bounded treewidth. InIJCAI.

Brand S.2004. Relation variables in qualitative spatial reasoning. InKI.

Chmeiss A. & Condotta J.-F.2011. Consistency of triangulated temporal qualitative constraint networks. In ICTAI.

Condotta J.-F. & D’Almeida D.2011. Consistency of qualitative constraint networks from tree decompositions. In TIME.

Condotta J.-F., Dalmeida D., Lecoutre C. & Sais L.2006. From qualitative to discrete constraint networks. InKI Workshop on Qualitative Constraint Calculi.

Dechter R.2003. Constraint Processing.Elsevier Morgan Kaufmann.

Dechter R. & Pearl J.1989. Tree clustering for constraint networks. Artificial Intelligence38,353–366.

Del Genio C. I., Gross T. & Bassler K. E.2011. All scale-free networks are sparse. Physical Review Letters107, 178701.

Diestel R.2012. Graph Theory, 4th Edition, 173.Springer.

Duckham M., Li S., Liu W. & Long Z.2014. On redundant topological constraints. InKR.

Dylla F., Mossakowski T., Schneider T. & Wolter D.2013. Algebraic properties of qualitative spatio-temporal calculi. In COSIT.

Elidan G. & Gould S.2008. Learning bounded treewidth Bayesian networks. InNIPS.

Frank A. U.1991. Qualitative spatial reasoning with cardinal directions. InÖGAI.

Gantner Z., Westphal M. & Wölfl S.2008. GQR—a fast reasoner for binary qualitative constraint calculi. In AAAI Workshop on Spatial and Temporal Reasoning.

Garey M. R., Johnson D. S. & Stockmeyer L. J.1976. Some simplified NP-complete graph problems. Theoretical Computer Science1,237–267.

Goodwin J., Dolbear C. & Hart G.2008. Geographical linked data: the administrative geography of Great Britain on the semantic web.Transactions in GIS12,19–30.

Gottlob G., Leone N. & Scarcello F.2000. A comparison of structural CSP decomposition methods. Artificial Intelligence124,243–282.

Hazarika S. M.2012. Qualitative Spatio-Temporal Representation and Reasoning: Trends and Future Directions. IGI Global.

Huang J.2012. Compactness and its implications for qualitative spatial and temporal reasoning. In KR.

Huang J., Li J. J. & Renz J.2013. Decomposition and tractability in qualitative spatial and temporal reasoning. Artificial Intelligence195,140–164.

Jégou P., Ndiaye S. & Terrioux C.2005. Computing and exploiting tree-decompositions for solving constraint networks. In CP.

Jégou P., Ndiaye S. & Terrioux C.2006. An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP. In CP.

Jégou P., Ndiaye S. & Terrioux C.2007. Dynamic heuristics for backtrack search on tree-decomposition of CSPs. In IJCAI.

Jégou P. & Terrioux C.2003. Hybrid backtracking bounded by tree-decomposition of constraint networks.Artificial Intelligence146,43–75.

Jégou P. & Terrioux C.2014a. Bag-connected tree-width: a new parameter for graph decomposition. In ISAIM.

Jégou P. & Terrioux C.2014b. Tree-decompositions with connected clusters for solving constraint networks. In CP.

Ladkin P. B. & Maddux R. D.1994. On binary constraint problems.Journal of the ACM41,435–469.

Li J. J., Huang J. & Renz J.2009. A divide-and-conquer approach for solving interval algebra networks. In IJCAI.

Li S., Long Z., Liu W., Duckham M. & Both A.2015. On redundant topological constraints. Artificial Intelligence225,51–76.

Ligozat G.1998. Reasoning about cardinal directions. Journal of Visual Languages and Computing9, 23–44.

Ligozat G.2011. Qualitative Spatial and Temporal Reasoning, Iste Series. Wiley.

Liu W. & Li S.2012. Solving minimal constraint networks in qualitative spatial and temporal reasoning. In CP.

Lutz C. & Milicic M.2007. A tableau algorithm for DLs with concrete domains and GCIs. Journal of Automated Reasoning38,227–259.

Montanari U.1974. Networks of constraints: fundamental properties and applications to picture processing.Information Sciences7,95–132.

Nebel B.1997. Solving hard qualitative temporal reasoning problems: evaluating the efficiency of using the ORD-Horn class. Constraints1,175–190.

Nebel B. & Bürckert H.-J.1995. Reasoning about temporal relations: a maximal tractable subclass of Allen’s interval algebra.Journal of the ACM42,43–66.

Nikolaou C. & Koubarakis M.2014. Fast consistency checking of very large real-world RCC-8 constraint networks using graph partitioning. InAAAI.

Randell D. A., Cui Z. & Cohn A.1992. A spatial logic based on regions and connection. InKR.

Renz J.1999. Maximal tractable fragments of the region connection calculus: a complete analysis. In IJCAI.

Renz J.2002a. A canonical model of the region connection calculus. Journal of Applied Non-Classical Logics12,469–494.

Renz J.2002b. Qualitative Spatial Reasoning with Topological Information.Springer-Verlag.

Renz J. & Ligozat G.2005. Weak composition for qualitative spatial and temporal reasoning. In CP.

Renz J. & Nebel B.1999. On the complexity of qualitative spatial reasoning: a maximal tractable fragment of the region connection calculus. Artificial Intelligence108,69–123.

Renz J. & Nebel B.2001. Efficient methods for qualitative spatial reasoning. Journal of Artificial Intelligence Research15,289–318.

Sioutis M.2014. Triangulation versus graph partitioning for tackling large real world qualitative spatial networks. InICTAI.

Sioutis M. & Condotta J.-F.2014. Tackling large qualitative spatial networks of scale-free-like structure. In SETN.

Sioutis M., Condotta J.-F. & Koubarakis M.2016. An efficient approach for tackling large real world qualitative spatial networks. International Journal of Artificial Intelligence Tools25, 1–33.

Sioutis M. & Koubarakis M.2012. Consistency of chordal RCC-8 networks. InICTAI.

Sioutis M., Li S. & Condotta J.-F.2015b. Efficiently characterizing non-redundant constraints in large real world qualitative spatial networks. InIJCAI.

Sioutis M., Salhi Y. & Condotta J.-F.2015c. A simple decomposition scheme for large real world qualitative constraint networks. In FLAIRS.

Sioutis M., Salhi Y. & Condotta J.-F.2015d. On the use and effect of graph decomposition in qualitative spatial and temporal reasoning. In SAC.

Tarjan R. E. & Yannakakis M.1984. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing13,566–579.

Tarski A.1941. On the calculus of relations.Journal of Symbolic Logic6, 73–89.

Vilain M., Kautz H. & Beek P. v.1990. Readings in qualitative reasoning about physical systems. InConstraint Propagation Algorithms for Temporal Reasoning: A Revised Report, Weld, D. S. & de Kleer, J. (eds). Morgan Kaufmann Publishers Inc., 373–381.

Walsh T.2001. Search on high degree graphs. InIJCAI.

Westphal M. & Hué J.2014. A concise Horn theory for RCC8. InECAI.

Westphal M., Hué J. & Wölfl S.2013. On the propagation strength of SAT encodings for qualitative temporal reasoning. In ICTAI.

Westphal M. & Wölfl S.2009. Qualitative CSP, finite CSP, and SAT: comparing methods for qualitative constraint-based reasoning. InIJCAI.

Yannakakis M.1981. Computing the minimum fill-in is NP-complete. SIAM Journal on Algebraic Discrete Methods2, 77–79.