Nowhere is a fast-paced conspiracy thriller by debut author Jon Robinson. 'No one's coming for us. Not our families, not the police. No one.' Alyn, Jes, Ryan and Elsa are Nowhere. A concrete cube in the middle of a dense forest. Imprisoned inside are one hundred teenagers from all over the country. They're all criminals. But none of them remember committing any crimes. Who has put them there. What do their captors want? And how will they ever break free . . . ? ***an intensely gripping conspiracy thriller for 11+ readers*** *** a phenomenal debut novel, for readers who love Jason Bourne and Alex Scarrow*** Jon Robinson was born in Middlesex in 1983. When he's not writing, he works for a charity in central London. NOWHERE is his debut novel. Find out more about Jon at www.facebook.com/jonrobinsonbooks
"A resistance novel for our time." - The New York Times "A hopeful story about recovery, empathy, and the bravery of young people." - Booklist "This well-crafted and suspenseful novel touches on the topics of refugees and immigrant integration, terrorism, Islam, Islamophobia, and the Syrian war with sensitivity and grace." - Kirkus, Starred Review Fourteen-year-old Ahmed is stuck in a city that wants nothing to do with him. Newly arrived in Brussels, Belgium, Ahmed fled a life of uncertainty and suffering in Aleppo, Syria, only to lose his father on the perilous journey to the shores of Europe. Now Ahmed’s struggling to get by on his own, but with no one left to trust and nowhere to go, he’s starting to lose hope. Then he meets Max, a thirteen-year-old American boy from Washington, D.C. Lonely and homesick, Max is struggling at his new school and just can’t seem to do anything right. But with one startling discovery, Max and Ahmed’s lives collide and a friendship begins to grow. Together, Max and Ahmed will defy the odds, learning from each other what it means to be brave and how hope can change your destiny. Set against the backdrop of the Syrian refugee crisis, award-winning author of Jepp, Who Defied the Stars Katherine Marsh delivers a gripping, heartwarming story of resilience, friendship and everyday heroes. Barbara O'Connor, author of Wish and Wonderland, says "Move Nowhere Boy to the top of your to-be-read pile immediately."
“Reminiscent of Louis Sachar’s Holes with its quirky characters and unique desert setting, this is a middle-grade read that will easily transport readers somewhere special.” —School Library Journal (Starred review) When you come from Nowhere, can you ever really make it anywhere? Author Dusti Bowling (Insignificant Events in the Life of a Cactus) returns to the desert to create a gripping story about friendship, hope, and finding the power we all have within ourselves. Welcome to Nowhere, Arizona, the least livable town in the United States. For Gus, a bright 13-year-old with dreams of getting out and going to college, life there is made even worse by Bo Taylor, Nowhere’s biggest, baddest bully. When Bo tries to force Gus to eat a dangerously spiny cactus, Rossi Scott, one of the best racers in Nowhere, comes to his rescue—but in return she has to give Bo her prized dirt bike. Determined to buy it back, Gus agrees to go searching for gold in Dead Frenchman Mine, joined by his old friends Jessie Navarro and Matthew Dufort, and Rossi herself. As they hunt for treasure, narrowly surviving everything from cave-ins to mountain lions, they bond over shared stories of how hard life in Nowhere is—and they realize this adventure just may be their way out.
An abused woman is on the run to escape her evil past. In a little town called Nowhere, she finds love, hope, and sanctuary as mysterious events unfold.
Written in 1890, at the close of William Morris’s most intense period of political activism, News from Nowhere is a compelling articulation of his mature views on art, work, community, family, and the nature and structure of the ideal society. A utopian narrative of a future society, it is also an immensely entertaining novel. This Broadview edition includes a wide variety of contextualizing documents, including portions of Morris’s essays, lectures, and journalism; excerpts from precursor utopian texts; writings on Bloody Sunday, art, work, and revolution; and contemporary reviews.
Nowhere in Africa is the extraordinary tale of a Jewish family who flees the Nazi regime in 1938 for a remote farm in Kenya. Abandoning their once-comfortable existence in Germany, Walter Redlich, his wife Jettel, and their five-year-old daughter, Regina, each deal with the harsh realities of their new life in different ways. Attorney Walter is resigned to working the farm as a caretaker; pampered Jettel resists adjustment at every turn; while the shy yet curious Regina immediately embraces the country—learning the local language and customs, and finding a friend in Owuor, the farm's cook. As the war rages on the other side of the world, the family’s relationships with their strange environment become increasingly complicated as Jettel grows more self-assured and Walter more haunted by the life they left behind. In 1946, with the war over, Regina's fondest dream comes true when her brother Max is born. Walter's decision, however, to return to his homeland to help rebuild a new Germany puts his family into turmoil again. Visit the Web site for the film at www.nowhereinafrica.com
Miles from Nowhere is the story of Barbara and Larry Savage’s sometimes dangerous, often zany, but ultimately rewarding 23,000-mile bicycle odyssey, which took them through 25 countries in two years. Along the way, these near-neophyte cyclists on their ten-speeds encountered warm-hearted strangers eager to share food and shelter, bicycle-hating drivers who ran them off the road, various wild animals (including an attack camel), rock-throwing Egyptians, overprotective Thai policeman, motherly New Zealanders, meteorological disasters, bodily indignities, and great personal joys. The stress of traveling together constantly tested yet strengthened the young couple's relationship and as their trip ends, you'll find yourself yearning for Barbara and Larry to jump back on their bikes and keep pedaling. Originally published in 1983, Miles from Nowhere has provided inspiration for legions of modern travel-adventurers and writers.
'We're miles from anywhere, and we don't have a clue where we're going' Deep in a snow-covered forest Alyn, Jes, Ryan and Elsa have escaped from prison. Now they're being hunted. They quickly realise they have a special talent - they can control the world around them. Now they must use this skill to stop themselves falling into greater danger. But can they master it before their deadly enemies close in - for good? This gripping sequel will leave you clamouring for the next instalment. Jon Robinson was born in Middlesex in 1983. When he's not writing, he works for a charity in central London.
We show that every first-order property of graphs can be decided in almost linear time on every nowhere dense class of graphs. For graph classes closed under taking subgraphs, our result is optimal (under a standard complexity theoretic assumption): it was known before that for all classes C of graphs closed under taking subgraphs, if deciding first-order properties of graphs in C is fixed-parameter tractable, parameterized by the length of the input formula, then C must be nowhere dense. Nowhere dense graph classes form a large variety of classes of sparse graphs including the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs and graph classes of bounded expansion. For our proof, we provide two new characterisations of nowhere dense classes of graphs. The first characterisation is in terms of a game, which explains the local structure of graphs from nowhere dense classes. The second characterisation is by the existence of sparse neighbourhood covers. On the logical side, we prove a rank-preserving version of Gaifman's locality theorem. The characterisation by neighbourhood covers is based on a characterisation of nowhere dense classes by generalised colouring numbers. We show several new bounds for the generalised colouring numbers on restricted graph classes, such as for proper minor closed classes and for planar graphs. Finally, we study the parameterized complexity of the first-order model-checking problem on structures where an ordering is available to be used in formulas. We show that first-order logic on ordered structures as well as on structures with a successor relation is essentially intractable on nearly all interesting classes. On the other hand, we show that the model-checking problem of order-invariant monadic second-order logic is tractable essentially on the same classes as plain monadic second-order logic and that the model-checking problem for successor-invariant first-order logic is tractable on planar graphs. Wir zeigen, dass jede Eigenschaft von Graphen aus einer nowhere dense Klasse von Graphen, die in der Präadikatenlogik formuliert werden kann, in fast linearer Zeit entschieden werden kann. Dieses Ergebnis ist optimal für Klassen von Graphen, die unter Subgraphen abgeschlossen sind (unter einer Standardannahme aus der Komplexitätstheorie). Um den obigen Satz zu beweisen, führen wir zwei neue Charakterisierungen von nowhere dense Klassen von Graphen ein. Zunächst charakterisieren wir solche Klassen durch ein Spiel, das die lokalen Eigenschaften von Graphen beschreibt. Weiter zeigen wir, dass eine Klasse, die unter Subgraphen abgeschlossen ist, genau dann nowhere dense ist, wenn alle lokalen Nachbarschaften von Graphen der Klasse dünn überdeckt werden können. Weiterhin beweisen wir eine erweiterte Version von Gaifman's Lokalitätssatz für die Prädikatenlogik, der eine Übersetzung von Formeln in lokale Formeln des gleichen Ranges erlaubt. In Kombination erlauben diese neuen Charakterisierungen einen effizienten, rekursiven Lösungsansatz für das Model-Checking Problem der Prädikatenlogik. Die Charakterisierung der nowhere dense Graphklassen durch die oben beschriebenen Überdeckungen basiert auf einer bekannten Charakterisierung durch verallgemeinerte Färbungszahlen. Unser Studium dieser Zahlen führt zu neuen, verbesserten Schranken für die verallgemeinerten Färbungszahlen von nowhere dense Klassen von Graphen, insbesondere für einige wichtige Subklassen, z. B. für Klassen mit ausgeschlossenen Minoren und für planare Graphen. Zuletzt untersuchen wir, welche Auswirkungen eine Erweiterung der Logik durch Ordnungs- bzw. Nachfolgerrelationen auf die Komplexität des Model-Checking Problems hat. Wir zeigen, dass das Problem auf fast allen interessanten Klassen nicht effizient gelöst werden kann, wenn eine beliebige Ordnungs- oder Nachfolgerrelation zum Graphen hinzugefügt wird. Andererseits zeigen wir, dass das Problem für ordnungsinvariante monadische Logik zweiter Stufe auf allen Klassen, für die bekannt ist, dass es für monadische Logik zweiter Stufe effizient gelöst werden kann, auch effizient gelöst werden kann. Wir zeigen, dass das Problem für nachfolgerinvariante Prädikatenlogik auf planaren Graphen effizient gelöst werden kann.
