A homomorphism from a graph G to a graph H is a vertex mapping f : VG → VH such that f(u) and f(v) form an edge in H whenever u and v form an edge in G. The H-Coloring problem is to test if a graph G allows a homomorphism to a given graph H. A well-known result of Hell and Nešetřil determines the computational complexity of this problem for any fixed graph H. We study a natural variant of this ...

Publisher's copyright statement: NOTICE: this is the author's version of a work that was accepted for publication in Hearing Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be re ected in this document. Changes may have been made to this work since it was submitted for publica...

This study investigated semantic and episodic memory in autism spectrum disorder (ASD), using a task which assessed recognition and self-other source memory. Children with ASD showed undiminished recognition memory but significantly diminished source memory, relative to ageand verbal ability-matched comparison children. Both children with and without ASD showed an “enactment effect”, demonstrat...

We investigate holography for asymptotically Schrödinger spacetimes, using a frame formalism. Our dictionary is based on the anisotropic scaling symmetry. We consider z < 2, where the holographic dictionary is cleaner; we make some comments on z = 2. We propose a definition of asymptotically locally Schrödinger spacetime where the leading components of the frame fields provide suitable geometri...

The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-pro t purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be...

The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-pro t purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be...

The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-pro t purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be...

The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-pro t purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be...

The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-pro t purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be...

The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-pro t purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be...