Del i serien Lecture Notes in Computer Science

Graph-Theoretic Concepts in Computer Science

Name: Graph-Theoretic Concepts in Computer Science
SKU: 9783662531730
Price: 719 SEK
Availability: InStock
Author: Ernst W. Mayr
ISBN: 9783662531730

41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers

Häftad, Engelska, 2016

AvErnst W. Mayr

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

949 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

1 219 kr

Skickas inom 10-15 vardagar

Häftad

1 069 kr

Skickas inom 10-15 vardagar

Häftad

1 149 kr

Skickas inom 5-8 vardagar

Häftad

1 149 kr

Skickas inom 5-8 vardagar

Häftad

2 579 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

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. They were organized in topical sections named: invited talks; computational complexity; design and analysis; computational geometry; structural graph theory; graph drawing; and fixed parameter tractability.

Produktinformation

Utgivningsdatum2016-08-05
Mått155 x 235 x 29 mm
Vikt791 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor514
Upplaga16001
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783662531730

Tillhör följande kategorier

Invited Talks.- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics.- Open Problems on Graph Coloring for Special Graph Classes.- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks.- Computational Complexity.- The Stable Fixtures Problem with Payments.- Complexity of Secure Sets.- Efficient Domination for Some Subclasses of P6-free Graphs in Polynomial Time.- On the Tree Search Problem with Non-uniform Costs.- An O(n2) Time Algorithm for the Minimal Permutation Completion Problem.- On the Number of Minimal Separators in Graphs.- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks.- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.- Finding Paths in Grids with Forbidden Transitions.- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results.- Design and Analysis.- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes.- Approximating Source Location and Star Survivable Network Problems.- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph.- Computational Geometry.- Weak Unit Disk and Interval Representation of Graphs.- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes.- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes.- Unsplittable Coverings in the Plane.- Structural Graph Theory.- Induced Minor Free Graphs: Isomorphism and Clique-width.- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.- Colouring and Covering Nowhere Dense Graphs.- Parity Linkage and the Erdös-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs.- Well-quasi-ordering Does Not Imply Bounded Clique-width.- A Slice Theoretic Approach for Embedding Problems on Digraphs.- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs.- Graph Drawing.- Saturated Simple and 2-simple Topological Graphs with Few Edges.- Testing Full Outer-2-planarity in Linear Time.- Fixed Parameter Tractability.- Triangulating Planar Graphs While Keeping the Pathwidth Small.- Polynomial Kernelization for Removing Induced Claws and Diamonds.- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.- Recognizing k-equistable Graphs in FPT Time.- Beyond Classes of Graphs with \Few" Minimal Separators: FPT.- Results Through Potential Maximal Cliques.

Mer från samma författare

Exploring New Frontiers of Theoretical Informatics

Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell

Inbunden, 2004

2 219 kr

Del 155

Exploring New Frontiers of Theoretical Informatics

Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell

Häftad, 2011

2 219 kr

Del 8136

Computer Algebra in Scientific Computing

Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov

Häftad, 2013

719 kr

Computer Algebra in Scientific Computing

V. G. Ganzha, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov

Häftad, 2005

719 kr

Computer Algebra in Scientific Computing

V. G. Ganzha, Mayr E W, Victor Gregor'e Ganzha, Ernst W. Mayr, Evgenii Vasilev Vorozhtsov

Inbunden, 2001

1 149 kr

STACS 94

Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner

Häftad, 1994

749 kr

STACS 95

Ernst W. Mayr, Claude Puech

Häftad, 1995

1 479 kr

Lectures on Proof Verification and Approximation Algorithms

Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger

Häftad, 1998

749 kr

Computer Algebra in Scientific Computing

Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov

Häftad, 2009

749 kr

Computer Science -- Theory and Applications

Farid M. Ablaev, Ernst W. Mayr

Häftad, 2010

719 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

969 kr

Du kanske också är intresserad av

Del 14093