๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Graph Theoretic Concepts in Computer Science: 36th International Workshop, WG 2010, Zarรณs, Crete, Greece, June 28-30, 2010 Revised Papers

โœ Scribed by Dimitris Achlioptas (auth.), Dimitrios M. Thilikos (eds.)


Publisher
Springer-Verlag Berlin Heidelberg
Year
2010
Tongue
English
Leaves
348
Series
Lecture Notes in Computer Science 6410 : Theoretical Computer Science and General Issues
Edition
1
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zarยด os, Crete, Greece, June 28โ€“30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japan, The Netherlands, Norway, Poland, Switzerland, the UK, and the USA) attended the conference. WG has a long tradition. Since 1975, WG has taken place 21 times in Germany, four times in The Netherlands, twice in Austria, twice in France and once in the Czech Republic, Greece, Italy, Norway, Slovakia, Switzerland, and the UK. WG aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, or by extracting new graph theoretic problems from applications. The goal is to presentemergingresearchresultsand to identify and exploredirections of future research.The conference is well-balanced with respect to established researchers and young scientists. There were 94 submissions, two of which where withdrawn before entering the review process. Each submission was carefully reviewed by at least 3, and on average 4.5, members of the Program Committee. The Committee accepted 28 papers, which makes an acceptance ratio of around 30%. I should stress that, due to the high competition and the limited schedule, there were papers that were not accepted while they deserved to be.

โœฆ Table of Contents


Front Matter....Pages -
Algorithmic Barriers from Phase Transitions in Graphs....Pages 1-1
Algorithmic Graph Minors and Bidimensionality....Pages 2-2
Complexity Results for the Spanning Tree Congestion Problem....Pages 3-14
max-cut ย and Containment Relations in Graphs....Pages 15-26
The Longest Path Problem is Polynomial on Cocomparability Graphs....Pages 27-38
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds....Pages 39-50
On Stable Matchings and Flows....Pages 51-62
Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs....Pages 63-74
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time....Pages 75-87
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching....Pages 88-99
Efficient Algorithms for Eulerian Extension....Pages 100-111
On the Small Cycle Transversal of Planar Graphs....Pages 112-122
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective....Pages 123-134
Graphs that Admit Right Angle Crossing Drawings....Pages 135-146
Kernelization Hardness of Connectivity Problems in d -Degenerate Graphs....Pages 147-158
On the Boolean-Width of a Graph: Structure and Applications....Pages 159-170
Generalized Graph Clustering: Recognizing ( p , q )-Cluster Graphs....Pages 171-183
Colouring Vertices of Triangle-Free Graphs....Pages 184-195
A Quartic Kernel for Pathwidth-One Vertex Deletion....Pages 196-207
Network Exploration by Silent and Oblivious Robots....Pages 208-219
Uniform Sampling of Digraphs with a Fixed Degree Sequence....Pages 220-231
Measuring Indifference: Unit Interval Vertex Deletion....Pages 232-243
Parameterized Complexity of the Arc-Preserving Subsequence Problem....Pages 244-255
From Path Graphs to Directed Path Graphs....Pages 256-265
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces....Pages 266-278
Efficient Broadcasting in Random Power Law Networks....Pages 279-291
Graphs with Large Obstacle Numbers....Pages 292-303
The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree....Pages 304-314
The Number of Bits Needed to Represent a Unit Disk Graph....Pages 315-323
Lattices and Maximum Flow Algorithms in Planar Graphs....Pages 324-335
Back Matter....Pages -

โœฆ Subjects


Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Geometry; Algorithms; Computer Communication Networks; Data Structures


๐Ÿ“œ SIMILAR VOLUMES


Graph Theoretic Concepts in Computer Sci
โœ Dimitris Achlioptas (auth.), Dimitrios M. Thilikos (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2010 ๐Ÿ› Springer-Verlag Berlin Heidelberg ๐ŸŒ English

<p>The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zarยด os, Crete, Greece, June 28โ€“30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, J

Graph-Theoretic Concepts in Computer Sci
โœ Dimitrios M. Thilikos ๐Ÿ“‚ Library ๐Ÿ“… 2010 ๐Ÿ› Springer ๐ŸŒ English

This book constitutes the thoroughly refereed post-conference proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2010, held in Zar?s, Crete, Greece, in June 2010. The 28 revised full papers presented together with two invited papers were careful

Graph-Theoretic Concepts in Computer Sci
โœ Dieter Rautenbach (auth.), Martin Charles Golumbic, Michal Stern, Avivit Levy, G ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Springer-Verlag Berlin Heidelberg ๐ŸŒ English

<p>This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The

Graph-Theoretic Concepts in Computer Sci
โœ Isolde Adler, Haiko Mรผller ๐Ÿ“‚ Library ๐Ÿ“… 2020 ๐Ÿ› Springer International Publishing;Springer ๐ŸŒ English

<p><p>This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic.</p><p>The 32 full papers presented in this volume were carefully

Graph-Theoretic Concepts in Computer Sci
โœ Feodor F. Dragan (auth.), Andreas Brandstรคdt, Klaus Jansen, Rรผdiger Reischuk (ed ๐Ÿ“‚ Library ๐Ÿ“… 2013 ๐Ÿ› Springer-Verlag Berlin Heidelberg ๐ŸŒ English

<p>This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lรผbeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book als

Graph-Theoretic Concepts in Computer Sci
โœ Ernst W. Mayr (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› Springer-Verlag Berlin Heidelberg ๐ŸŒ English

<p><p>This book constitutes revised selected papers from the 41<sup>st</sup> International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015, held in Garching, Germany, in June 2015. <br> The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions.