Combinatorial Algorithms 2009: 20th International Workshop, IWOCA 2009: Hradec Nad Moravicí, Czech Republic, June 28-July 2, 2009: Revised Selected Papers: 5874 - Brossura

Brossura

ISBN 10: 3642102166 ISBN 13: 9783642102165

Casa editrice: Springer-Verlag New York Inc, 2009

Riassunto

The 20th InternationalWorkshop on CombinatorialAlgorithms was held during June 28 – July 2, 2009 in the picturesque castle of Hradec nad Moravic´ ?,located in the north-east corner of the Czech Republic. IWOCA — the workshopthat originated19 yearsagoas AWOCA— madea big step towards globalization this year. After 19 conferences held in Australia, Indonesia, Korea,and Japan, the 20th anniversarywas celebrated by taking the conference outside the Australasian region for the ?rst time. Another novelty this year was that the proceedings are being published by Springer in the LNCS series. Our Call for Papers brought an overwhelming response of the combinatorial community. IWOCA 2009 received over 100 submissions, more than twice the amount it received before. Most of the submissions were of exceptionally high quality and thus the Program Committee was faced with hard work and so- times hard decisions. Many very good papers had to be rejected because of the limitedcapacityoftheconferenceschedule.In the end,41contributedtalkswere presented during the conference — the maximum number that we could ?t in the program. We would like to thank all who sent their submissions and to congratulate all the authors of the accepted papers. They contributed to what was a most successful conference. We also thank all the authors who submitted posters for the poster session (not included in the proceedings).

Su questo libro

Contenuti:

Invited Talks.- Branching Systems.- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology.- Succinct Representations of Trees.- Kt Minors in Large t-Connected Graphs.- Intractability in Graph Drawing and Geometry: FPT Approaches.- Contributed Talks.- Evaluation of Recoverable-Robust Timetables on Tree Networks.- Weighted LCS.- Integrality Properties of Certain Special Balanceable Families.- Forbidden Subgraph Colorings and the Oriented Chromatic Number.- Polynomial Kernels for 3-Leaf Power Graph Modification Problems.- Approximating the Max Edge-Coloring Problem.- Three Complexity Results on Coloring P k -Free Graphs.- Fully Decomposable Split Graphs.- Feedback Vertex Set on Graphs of Low Cliquewidth.- Note on Decomposition of K n,n into (0,j)-prisms.- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids.- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search.- LPF Computation Revisited.- Limiting Distribution for Distances in k-Trees.- Gray Code Compression.- Embedded Trees and the Support of the ISE.- Combinatorial Models for Cooperation Networks.- Polar Permutation Graphs.- A New Algorithm for Efficient Pattern Matching with Swaps.- The Height and Range of Watermelons without Wall.- Fast Convolutions and Their Applications in Approximate String Matching.- Better Polynomial Algorithms on Graphs of Bounded Rank-Width.- Minimax Trees in Linear Time with Applications.- Planar Biconnectivity Augmentation with Fixed Embedding.- Trivially-Perfect Width.- Lightweight Parameterized Suffix Array Construction.- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices.- Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees.- On the Maximal Number of Cubic Subwords in a String.- Solution of Peter Winkler’s Pizza Problem.- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs.- Simpler Parameterized Algorithm for OCT.- Bipartite Graphs of Large Clique-Width.- Kernel in Oriented Circulant Graphs.- Randomized Postoptimization of Covering Arrays.- New Word-Based Adaptive Dense Compressors.- Rainbow Connection in Graphs with Minimum Degree Three.- The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree.- Computability of Width of Submodular Partition Functions.- The Guarding Problem – Complexity and Approximation.- Antibandwidth of d-Dimensional Meshes.

Dalla quarta di copertina:

This book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic.

The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.

Su questa edizione

• Editore: Springer-Verlag New York Inc
• Data di pubblicazione: 2009
• ISBN 10: 3642102166
• ISBN 13: 9783642102165
• Rilegatura: Copertina flessibile
• Numero edizione: 1
• Numero di pagine: 480
• Redattore: Fiala Jiri, Kratochvil Jan, Miller Mirka