| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISANNIOBVEE022845 |
|
|
Autore |
Homerus |
|
|
Titolo |
Poieseis Homerou ampho hete Ilias kai he Odysseia, ypo te Iacobou tou Mikyllou kai Ioacheimou Kamerariou, ... Opus vtrumque Homeri Iliados et Odysseae, diligenti opera Iacobi Micylli & Ioachimi Camerarii recognitum. Adiecta etiam est eiusdem Batrachomyomachia. Porphyriou philosophou Homerika zetemata. Tou autou Porphyriou, Peri tou en Odysseiai ton nymphon antrou. Porphyrij philosophi Homericarum quaestionum liber. Eiusdem, De nympharum antro in Odyssea, opusculum |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Basileae : per Ioan. Heruagium, 1551 ( (Basileae) : per Ioannem Heruagium, 1551. Mense Augusto |
|
|
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Collocazione |
|
GEA 3 0137 |
BNSALA FARN.40. G 19 |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Testo e commento in greco su due colonne |
Cors. ; gr. ; rom |
Iniziali xil |
Marche xilogr. sui front. e alla fine dei vol. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910972613903321 |
|
|
Autore |
Schnitzler Arthur |
|
|
Titolo |
Werke in historisch-kritischen Ausgaben. Die Toten schweigen ; Historisch-kritische Ausgabe / / Arthur Schnitzler; Martin Anton Müller |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin ; ; Boston : , : De Gruyter, , [2016] |
|
©2016 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
|
|
Edizione |
[1st ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (283 p.) : 116 Faks., 1 Karte |
|
|
|
|
|
|
Collana |
|
Werke in historisch-kritischen Ausgaben |
|
|
|
|
|
|
Altri autori (Persone) |
|
BörnerIngo |
LindnerAnna |
SchwentnerIsabella |
|
|
|
|
|
|
|
|
Soggetti |
|
Schnitzler, Arthur |
Viennese modernism |
Wiener Moderne |
LITERARY COLLECTIONS / European / General |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Frontmatter -- Inhalt -- Vorbemerkung -- 1. Handschriften -- 2. Drucktext -- 3. Kommentar -- 4. Anhang |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Wie schon in Ein Abschied (1896) experimentiert Arthur Schnitzler in Die Toten schweigen mit dem Stoffkern vom Verlust eines Liebesobjekts. In dieser Novelle erlebt eine Ehefrau den Unfalltod ihres Geliebten. Das erlittene Trauma und die Furcht vor der Entdeckung führen zu einer schweren psychischen Krise. Die am Ende angedeutete Lösung bildet eine Parallele zu dem von Sigmund Freud und Josef Breuer in den Studien über Hysterie (1895) entwickelten therapeutischen Verfahren. Die tiefenpsychologische Qualität erreicht der Text - wie sich anhand des Entstehungsprozesses nun erstmals nachvollziehen lässt - durch eine zunehmende Korrelation zwischen geschilderter Außenwelt und subjektiven Bewusstseinsvorgängen. Der siebente Band der Historisch-kritischen Ausgabe von Schnitzlers Frühwerk, herausgegeben von Konstanze Fliedl, ermöglicht das Studium der Textgenese anhand sämtlicher Handschriften aus dem |
|
|
|
|
|
|
|
|
|
|
|
|
|
Nachlass, die als Faksimile mit Transkription wiedergegeben werden. Der konstituierte Text folgt dem Erstdruck in der Zeitschrift Cosmopolis (1897), der Apparat bietet die Varianten bis zur Ausgabe letzter Hand. Ein Vorwort gibt Auskunft über die Entstehung und die Druckgeschichte der Novelle, der Kommentar liefert topographische, historische und sprachliche Erläuterungen. |
|
|
|
|
|
|
3. |
Record Nr. |
UNINA9910437865003321 |
|
|
Autore |
Jungnickel Dieter |
|
|
Titolo |
Graphs, Networks and Algorithms / / by Dieter Jungnickel |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[4th ed. 2013.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (676 p.) |
|
|
|
|
|
|
Collana |
|
Algorithms and Computation in Mathematics, , 2512-3254 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Discrete mathematics |
Mathematical optimization |
Computer science - Mathematics |
Discrete Mathematics |
Optimization |
Mathematics of Computing |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Prefaces -- Basic Graph Theory -- Algorithms and Complexity -- Shortest Paths -- Spanning Trees -- The Greedy Algorithm -- Flows -- Combinatorial Applications -- Connectivity and Depth First Search -- Colorings -- Circulations -- The Network Simplex Algorithm -- Synthesis of Networks -- Matchings -- Weighted Matchings -- A Hard Problem: The TSP -- Appendix A: Some NP-Complete Problems -- Appendix B: Solutions -- Appendix C: List of Symbols -- References -- Index. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
From the reviews of the previous editions ".... The book is a first class textbook and seems to be indispensable for everybody who has to |
|
|
|
|
|
|
|
|
|
|
teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..." K.Engel, Mathematical Reviews 2002 The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt für Mathematik 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises – as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof forthe more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added. |
|
|
|
|
|
| |