Описание: This book analyzes the development of work teams as work itself changes. It shows that fixed and stable teams are being replaced by fluid forms of constantly changing collaboration across organizational boundaries. This is a big learning challenge and an opportunity for practitioners to redesign their work and organizations.
Описание: Two-sided matching provides a model of search processes such as those between firms and workers in labor markets or between buyers and sellers in auctions. This text provides a comprehensive account of recent results concerning the game-theoretic analysis of two-sided matching.
Автор: Andreas Brandst?dt; Klaus Jansen; R?diger Reischuk Название: Graph-Theoretic Concepts in Computer Science ISBN: 3642450423 ISBN-13(EAN): 9783642450426 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lubeck, Germany, in June 2013. graph grammars, graph rewriting systems and graph modeling;
Автор: Ignasi Sau; Dimitrios M. Thilikos Название: Graph-Theoretic Concepts in Computer Science ISBN: 3030307859 ISBN-13(EAN): 9783030307851 Издательство: Springer Рейтинг: Цена: 9222.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Nuria, Spain, in June 2019. The 29 full papers presented in this volume were carefully reviewed and selected from 87 submissions.
Автор: Christophe Paul; Michel Habib Название: Graph-Theoretic Concepts in Computer Science ISBN: 3642114083 ISBN-13(EAN): 9783642114083 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 computer scientists from all over the world (Australia, Belgium, Canada, China, Czech Republic, France, Germany, Greece, Israel, Japan, Korea, The Netherlands, Norway, Spain, UK, USA) attended the conference. Since1975, ithastakenplace20timesinGermany, fourtimesinTheNeth- lands, twice in Austria, as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France, Norway, and the UK. The conference aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from appli- tions. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists. There were 69 submissions. Each submission was reviewed by at least three, and on average four, Program Committee members. The Committee decided to accept 28 papers. Due to the competition and the limited schedule, some good papers could not be accepted. Theprogramalsoincludedexcellentinvitedtalks: onegivenbyDanielKr lon "AlgorithmsforClassesofGraphswithBoundedExpansion," the otherbyDavid Eppsteinon"Graph-TheoreticSolutionstoComputationalGeometryProblems." The proceedings contains two survey papers on these topics.
Автор: Hans L. Bodlaender; Gerhard J. Woeginger Название: Graph-Theoretic Concepts in Computer Science ISBN: 3319687042 ISBN-13(EAN): 9783319687049 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the revised selected papers of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2017, held in Eindhoven, The Netherlands, in June 2017. The 31 full papers presented in this volume were carefully reviewed and selected from 71 submissions.
Автор: Heggernes Название: Graph-Theoretic Concepts in Computer Science ISBN: 3662535351 ISBN-13(EAN): 9783662535356 Издательство: Springer Рейтинг: Цена: 8106.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes revised selected papers from the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2016, held in Istanbul, Turkey, in June 2016. The 25 papers presented in this volume were carefully reviewed and selected from 74 submissions.The WG conferences aim to connect theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas of computer science and by extracting new graph problems from applications. Their goal is to present new research results and to identify and explore directions of future research.
Автор: Martin Charles Golumbic; Michael Stern; Avivit Lev Название: Graph-Theoretic Concepts in Computer Science ISBN: 3642346103 ISBN-13(EAN): 9783642346101 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Account on Intervals.- Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance.- Alternating Reachabillity and Integer Sum of Closed Alternating Trails: The 3rd Annual Uri N. Peled Memorial Lecture.- Triangulation and Clique Separator Decomposition of Claw-Free Graphs.- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs.- Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs.- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area.- The Duals of Upward Planar Graphs on Cylinders.- On the Minimum Degree Up to Local Complementation: Bounds and Complexity.- Bisections above Tight Lower Bounds.- Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications.- Hydras: Directed Hypergraphs and Horn Formulas.- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill.- Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs.- Parameterized Domination in Circle Graphs.- On the Parameterized Complexity of Finding Separators with Non-hereditary Properties.
Автор: Andreas Brandst?dt; Ekkehard K?hler; Klaus Meer Название: Graph-Theoretic Concepts in Computer Science ISBN: 3030002551 ISBN-13(EAN): 9783030002558 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held in Cottbus, Germany, in June 2018.The 30 full papers presented in this volume were carefully reviewed and selected from 66 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.
Автор: Mayr Название: Graph-Theoretic Concepts in Computer Science ISBN: 3662531739 ISBN-13(EAN): 9783662531730 Издательство: Springer Рейтинг: Цена: 10342.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes revised selected papers from the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015, held in Garching, Germany, in June 2015. The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions. structural graph theory; graph drawing;
Описание: This volume investigates the morphosyntactic, semantic, and pragmatic properties of language, and the interactions between them, from the perspective of Optimality Theory. It integrates optimization processes into the formal and functional study of grammar, interpreting optimization as the result of conflicting, violable ranked constraints.
Автор: Skrzypczak Название: Descriptive Set Theoretic Methods in Automata Theory ISBN: 3662529467 ISBN-13(EAN): 9783662529461 Издательство: Springer Рейтинг: Цена: 6988.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The book is based on the PhD thesis “Descriptive Set Theoretic Methods in Automata Theory,” awarded the E.W. Beth Prize in 2015 for outstanding dissertations in the fields of logic, language, and information. The thesis reveals unexpected connections between advanced concepts in logic, descriptive set theory, topology, and automata theory and provides many deep insights into the interplay between these fields. It opens new perspectives on central problems in the theory of automata on infinite words and trees and offers very impressive advances in this theory from the point of view of topology.'…the thesis of Micha? Skrzypczak offers certainly what we expect from excellent mathematics: new unexpected connections between a priori distinct concepts, and proofs involving enlightening ideas.” Thomas Colcombet.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
