Founded in 1960 by a group of relatively unknown young writers, Tel Quel quickly became one of the most influential literary journals and controversial intellectual movements in France. During the following two decades Tel Quel published the best in French intellectual thought and writing, including Roland Barthes, Georges Bataille, Jacques Derrida, Jean-Pierre Faye, Michel Foucault, Gerard Genette, Julia Kristeva, Bernard-Henri Levy, Marcelin Pleynet, Philippe Sollers, and Tzvetan Todorov. By focusing on Tel Quel as an instrument of cultural renewal, Danielle Marx-Scouras demonstrates that literature--even when it claims to he disengaged--can never escape its historical ties.

The book elucidates the complexities of French intellectual life and the role played by Tel Quel in the evolution of intellectual thought and writing in the 1960s and 1970s. Tel Quel's cultural politics have been fashioned as much by the unpredictable historical changes of the post-World War II and Cold War era as they have by the advances in literary studies, semiotics, philosophy, and psychoanalysis during this period. The journal ceased publication in 1982, shortly before the dissolution of Marxism-Communism marked by the demolition of the Berlin Wall, the reunification of Europe, and the collapse of the Soviet Union. Marx-Scouras ultimately finds in its cultural venture some significant parting thoughts on a vigorous period of European literary and intellectual history.

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.

Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows.
This Festschrift has been published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows's unique and broad range of interests, including his work on the popularization of discrete mathematics for young children.
The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.