All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
We propose in this paper a general framework for integrating inductive and case-based reasoning (CBR) techniques for diagnosis tasks. We present a set of practical integrated appro...
Eric Auriol, Michel Manago, Klaus-Dieter Althoff, ...
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...