Восстановить пароль
FAQ по входу

Brandstädt A., Köhler E., Meer K. (Eds.) Graph-Theoretic Concepts in Computer Science

  • Файл формата pdf
  • размером 3,56 МБ
  • Добавлен пользователем
  • Отредактирован
Brandstädt A., Köhler E., Meer K. (Eds.) Graph-Theoretic Concepts in Computer Science
Springer Nature Switzerland AG, 2018. — XIII+384 p. — (Lecture Notes in Computer Science, 11159). — ISBN 978-3-030-00256-5.
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.
Эта книга представляет собой пересмотренные избранные статьи 44-го Международного семинара по теоретико-графовымм концепциям в области компьютерных наук, WG 2018, состоявшегося в Котбусе (Германия) в июне 2018 года.
30 полных докладов, представленных в этом томе, были тщательно рассмотрены и отобраны из 66 представленных материалов. Они охватывают широкий спектр областей, направленных на соединение теории и приложений, демонстрируя, как теоретико-графовые концепции могут быть применены в различных областях информатики. Еще одним направлением является представление последних результатов, а также выявление и изучение перспективных направлений будущих исследований.
On Dispersable Book Embeddings
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, and Sergey Pupyrev
Characterising AT-free Graphs with BFS
Jesse Beisegel
Edge Partitions of Optimal 2-plane and 3-plane Graphs
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, and Chrysanthi Raftopoulou
On Minimum Connecting Transition Sets in Graphs
Thomas Bellitto and Benjamin Bergougnoux
Recognizing Hyperelliptic Graphs in Polynomial Time
Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, and Marieke van der Wegen
On Directed Feedback Vertex Set Parameterized by Treewidth
Marthe Bonamy, Łukasz Kowalik, Jesper Nederlof, Michał Pilipczuk, Arkadiusz Socała, and Marcin Wrochna
Optimality Program in Segment and String Graphs
Édouard Bonnet and Paweł Rzążewski
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded
Paz Carmi, Vida Dujmović, and Pat Morin
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, and Luca Versari
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, and Siddharth Gupta
Computing Small Pivot-Minors
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, and Daniël Paulusma
Saving Probe Bits by Cube Domination
Peter Damaschke
Graph Amalgamation Under Logical Constraints
Mateus de Oliveira Oliveira
VⅎR -Completeness and Area-Universality
Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, and Paweł Rzążewski
Optimal General Matchings
Szymon Dudycz and Katarzyna Paluch
Quasimonotone Graphs
Martin Dyer and Haiko Müller
Equiangular Polygon Contact Representations
Stefan Felsner, Hendrik Schrezenmaier, and Raphael Steiner
Temporal Graph Classes: A View Through Temporal Separators
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, and Philipp Zschoche
Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization
Renzo Gómez and Yoshiko Wakabayashi
On the Relation of Strong Triadic Closure and Cluster Deletion
Niels Grüttemeier and Christian Komusiewicz
On Perfect Linegraph Squares
Meike Hatzel and Sebastian Wiederrecht
On Weak Isomorphism of Rooted Vertex-Colored Graphs
Lars Jaffke and Mateus de Oliveira Oliveira
Connected Vertex Cover for (sP1+P5)-Free Graphs
Matthew Johnson, Giacomo Paesani, and Daniël Paulusma
Structurally Parameterized d-Scattered Set
Ioannis Katsikarelis, Michael Lampis, and Vangelis Th. Paschos
Popular Matchings of Desired Size
Telikepalli Kavitha
Convexity-Increasing Morphs of Planar Graphs
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, and Darren Strash
Treedepth Bounds in Linear Colorings
Jeremy Kun, Michael P. O’Brien, and Blair D. Sullivan
An Improved FPT Algorithm for Independent Feedback Vertex Set
Shaohua Li and Marcin Pilipczuk
Construction and Local Routing for Angle-Monotone Graphs
Anna Lubiw and Debajyoti Mondal
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three
B.S. Panda and Anita Das
Author Index
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация