Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers

Front Matter....Pages -
Weak Heaps and Friends: Recent Developments....Pages 1-6
Efficient Exploration of Anonymous Undirected Graphs....Pages 7-13
On Maximum Rank Aggregation Problems....Pages 14-27
Deciding Representability of Sets of Words of Equal Length in Polynomial Time....Pages 28-40
Prefix Table Construction and Conversion....Pages 41-53
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas....Pages 54-66
Boundary-to-Boundary Flows in Planar Graphs....Pages 67-80
Exact Algorithms for Weak Roman Domination....Pages 81-93
Verification Problem of Maximal Points under Uncertainty....Pages 94-105
Incidence Coloring Game and Arboricity of Graphs....Pages 106-114
Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs....Pages 115-126
Phase Transition of Random Non-uniform Hypergraphs....Pages 127-139
Domino Tatami Covering Is NP-Complete....Pages 140-149
The Complexity of the Identifying Code Problem in Restricted Graph Classes....Pages 150-163
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes....Pages 164-177
Dynamising Interval Scheduling: The Monotonic Case....Pages 178-191
Graph Editing to a Fixed Target....Pages 192-205
Tight Bound on the Diameter of the Knödel Graph....Pages 206-215
Structural Properties of Subdivided-Line Graphs....Pages 216-229
Induced Subtrees in Interval Graphs....Pages 230-243
Protein Folding in 2D-Triangular Lattice Revisited....Pages 244-257
SAT and IP Based Algorithms for Magic Labeling with Applications....Pages 258-268
An Optimal Algorithm for Computing All Subtree Repeats in Trees....Pages 269-282
Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks....Pages 283-296
Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ ....Pages 297-302
Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees....Pages 303-313
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs....Pages 314-326
Construction Techniques for Digraphs with Minimum Diameter....Pages 327-336
Suffix Tree of Alignment: An Efficient Index for Similar Data....Pages 337-348
Fitting Voronoi Diagrams to Planar Tesselations....Pages 349-361
Partial Information Network Queries....Pages 362-375
An Application of Completely Separating Systems to Graph Labeling....Pages 376-387
Universal Cycles for Weight-Range Binary Strings....Pages 388-401
Circuit Complexity of Shuffle....Pages 402-411
An Optimal Algorithm for the Popular Condensation Problem....Pages 412-422
Maximum st -Flow in Directed Planar Graphs via Shortest Paths....Pages 423-427
Hypergraph Covering Problems Motivated by Genome Assembly Questions....Pages 428-432
Cluster Editing with Locally Bounded Modifications Revisited....Pages 433-437
New Approximation Algorithms for the Vertex Cover Problem....Pages 438-442
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation....Pages 443-447
Motif Matching Using Gapped Patterns....Pages 448-452
Domino Graphs and the Decipherability of Directed Figure Codes....Pages 453-457
A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem....Pages 458-462
Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes....Pages 463-467
An FPT Certifying Algorithm for the Vertex-Deletion Problem....Pages 468-472
Back Matter....Pages -