Skip to main content
main-content

Über dieses Buch

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.

Inhaltsverzeichnis

Frontmatter

Invited Talks

2013 | OriginalPaper | Buchkapitel

Weak Heaps and Friends: Recent Developments

Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß

2013 | OriginalPaper | Buchkapitel

Efficient Exploration of Anonymous Undirected Graphs

Ralf Klasing

Regular Papers

2013 | OriginalPaper | Buchkapitel

On Maximum Rank Aggregation Problems

Christian Bachmaier, Franz Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier

2013 | OriginalPaper | Buchkapitel

Deciding Representability of Sets of Words of Equal Length in Polynomial Time

Francine Blanchet-Sadri, Sinziana Munteanu

2013 | OriginalPaper | Buchkapitel

Prefix Table Construction and Conversion

Widmer Bland, Gregory Kucherov, W. F. Smyth

2013 | OriginalPaper | Buchkapitel

On the Approximability of Splitting-SAT in 2-CNF Horn Formulas

Hans-Joachim Böckenhauer, Lucia Keller

2013 | OriginalPaper | Buchkapitel

Boundary-to-Boundary Flows in Planar Graphs

Glencora Borradaile, Anna Harutyunyan

2013 | OriginalPaper | Buchkapitel

Exact Algorithms for Weak Roman Domination

Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez

2013 | OriginalPaper | Buchkapitel

Verification Problem of Maximal Points under Uncertainty

George Charalambous, Michael Hoffmann

2013 | OriginalPaper | Buchkapitel

Incidence Coloring Game and Arboricity of Graphs

Clément Charpentier, Éric Sopena

2013 | OriginalPaper | Buchkapitel

Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs

Well Y. Chiu, Chiuyuan Chen

2013 | OriginalPaper | Buchkapitel

Phase Transition of Random Non-uniform Hypergraphs

Élie de Panafieu

2013 | OriginalPaper | Buchkapitel

Domino Tatami Covering Is NP-Complete

Alejandro Erickson, Frank Ruskey

2013 | OriginalPaper | Buchkapitel

The Complexity of the Identifying Code Problem in Restricted Graph Classes

Florent Foucaud

2013 | OriginalPaper | Buchkapitel

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes

Robert Ganian, Jan Obdržálek

2013 | OriginalPaper | Buchkapitel

Dynamising Interval Scheduling: The Monotonic Case

Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu

2013 | OriginalPaper | Buchkapitel

Graph Editing to a Fixed Target

Petr A. Golovach, Daniël Paulusma, Iain Stewart

2013 | OriginalPaper | Buchkapitel

Tight Bound on the Diameter of the Knödel Graph

Hayk Grigoryan, Hovhannes A. Harutyunyan

2013 | OriginalPaper | Buchkapitel

Structural Properties of Subdivided-Line Graphs

Toru Hasunuma

2013 | OriginalPaper | Buchkapitel

Induced Subtrees in Interval Graphs

Pinar Heggernes, Pim van ’t Hof, Martin Milanič

2013 | OriginalPaper | Buchkapitel

Protein Folding in 2D-Triangular Lattice Revisited

(Extended Abstract)
A. S. M. Shohidull Islam, M. Sohel Rahman

2013 | OriginalPaper | Buchkapitel

SAT and IP Based Algorithms for Magic Labeling with Applications

Gerold Jäger

2013 | OriginalPaper | Buchkapitel

An Optimal Algorithm for Computing All Subtree Repeats in Trees

Tomáš Flouri, Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis

2013 | OriginalPaper | Buchkapitel

Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks

Sang Hyuk Lee, Tomasz Radzik

2013 | OriginalPaper | Buchkapitel

Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ

Hongliang Lu, Yuqing Lin

2013 | OriginalPaper | Buchkapitel

Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees

Nacho López, Francesc Sebé

2013 | OriginalPaper | Buchkapitel

On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs

Vadim Lozin, Jérôme Monnot, Bernard Ries

2013 | OriginalPaper | Buchkapitel

Construction Techniques for Digraphs with Minimum Diameter

Mirka Miller, Slamin, Joe Ryan, Edy Tri Baskoro

2013 | OriginalPaper | Buchkapitel

Suffix Tree of Alignment: An Efficient Index for Similar Data

Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park

2013 | OriginalPaper | Buchkapitel

Fitting Voronoi Diagrams to Planar Tesselations

Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet-Almaguer

2013 | OriginalPaper | Buchkapitel

Partial Information Network Queries

Ron Y. Pinter, Meirav Zehavi

2013 | OriginalPaper | Buchkapitel

An Application of Completely Separating Systems to Graph Labeling

Leanne Rylands, Oudone Phanalasy, Joe Ryan, Mirka Miller

2013 | OriginalPaper | Buchkapitel

Universal Cycles for Weight-Range Binary Strings

Joe Sawada, Aaron Williams, Dennis Wong

2013 | OriginalPaper | Buchkapitel

Circuit Complexity of Shuffle

Michael Soltys

2013 | OriginalPaper | Buchkapitel

An Optimal Algorithm for the Popular Condensation Problem

Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao

Posters

2013 | OriginalPaper | Buchkapitel

Maximum st-Flow in Directed Planar Graphs via Shortest Paths

Glencora Borradaile, Anna Harutyunyan

2013 | OriginalPaper | Buchkapitel

Hypergraph Covering Problems Motivated by Genome Assembly Questions

Cedric Chauve, Murray Patterson, Ashok Rajaraman

2013 | OriginalPaper | Buchkapitel

Cluster Editing with Locally Bounded Modifications Revisited

Peter Damaschke

2013 | OriginalPaper | Buchkapitel

New Approximation Algorithms for the Vertex Cover Problem

Franc̨ois Delbot, Christian Laforest, Raksmey Phan

2013 | OriginalPaper | Buchkapitel

Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation

Mourad El Ouali, Volkmar Sauerland

2013 | OriginalPaper | Buchkapitel

Motif Matching Using Gapped Patterns

Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Esko Ukkonen

2013 | OriginalPaper | Buchkapitel

Domino Graphs and the Decipherability of Directed Figure Codes

Włodzimierz Moczurad

2013 | OriginalPaper | Buchkapitel

A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem

Christian Schilling, Jan-Georg Smaus, Fabian Wenzelmann

2013 | OriginalPaper | Buchkapitel

Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes

Appala Naidu Tentu, Prabal Paul, China Venkaiah Vadlamudi

2013 | OriginalPaper | Buchkapitel

An FPT Certifying Algorithm for the Vertex-Deletion Problem

Haiko Müller, Samuel Wilson

Backmatter

Weitere Informationen

Premium Partner

Neuer Inhalt

BranchenIndex Online

Die B2B-Firmensuche für Industrie und Wirtschaft: Kostenfrei in Firmenprofilen nach Lieferanten, Herstellern, Dienstleistern und Händlern recherchieren.

Whitepaper

- ANZEIGE -

Product Lifecycle Management im Konzernumfeld – Herausforderungen, Lösungsansätze und Handlungsempfehlungen

Für produzierende Unternehmen hat sich Product Lifecycle Management in den letzten Jahrzehnten in wachsendem Maße zu einem strategisch wichtigen Ansatz entwickelt. Forciert durch steigende Effektivitäts- und Effizienzanforderungen stellen viele Unternehmen ihre Product Lifecycle Management-Prozesse und -Informationssysteme auf den Prüfstand. Der vorliegende Beitrag beschreibt entlang eines etablierten Analyseframeworks Herausforderungen und Lösungsansätze im Product Lifecycle Management im Konzernumfeld.
Jetzt gratis downloaden!

Bildnachweise