IWOCA 2013
July 10-12, 2013
Rouen, France
 IWOCA2013
Home   Committees   Accepted Papers   Important dates   Programme   Practical information   Contacts
LNCS

Normandie Université

Université de Rouen

litis

GDR IM

Région Haute-Normandie

CREA

Rouen

Conseil Général de Seine-Maritime
Invited speakers
  • E. Birney (European Bioinformatics Institute, UK)
    Annotating the human genome (abstract)

  • S. Edelkamp (University of Bremen, Germany)
    Weak Heaps and Friends - Show me your Bits (abstract)

  • J. R. Griggs (University of South Carolina, USA)
    The Δ2 Conjecture for Graph Labellings with Separation Conditions (abstract)

  • R. Klasing (LaBRI & CNRS, France)
    Efficient exploration of anonymous undirected graphs. (abstract)

  • K. Park (Seoul National University, Korea)
    New Graph Model for Consistent Superstring Problems (abstract)

Programme (preliminary version)
Wednesday, July 10th
9:00-9:50Registration
9:50-10:00Welcome
10:00-11:00K. Park
New Graph Model for Consistent Superstring Problems
11:00-11:20Francine Blanchet-Sadri and Sinziana Munteanu
Deciding Representability of Sets of Words of Equal Length in Polynomial Time
11:20-11:40Kassian Kobert, Tomas Flouri, Solon Pissis and Alexandros Stamatakis
An optimal algorithm for computing all subtree repeats in trees
11:40-12:00Widmer Bland, Gregory Kucherov and W.F. Smyth
Prefix Table Construction & Conversion
12:00-12:20Michael Soltys
A tight circuit-complexity bound for shuffle
12:20-14:00lunch
14:00-15:00E. Birney
Annotating the human genome
15:00-15:10Short break
15:10-15:30Joe Sawada, Aaron Williams and Dennis Wong
Universal cycles for weight-range binary strings
15:30-15:50Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard and Kunsoo Park
Suffix Tree of an Alignment: An Efficient Index for Similar Data
15:50-16:10A. S. M. Sohidull Islam and M. Sohel Rahman
Protein Folding in 2D-triangular Lattice Revisited
16:10-16:30Ron Y. Pinter and Meirav Zehavi
Partial Information Network Queries
16:30-17:00Coffe break
17:00-17:20Robert Ganian and Jan Obdrzalek
Expanding the expressive power of Monadic Second-Order logic on restricted graph classes
17:20-17:40Pinar Heggernes, Pim van 'T Hof and Martin Milanic
Induced Subtrees in Interval Graphs
17:40-18:00Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff and Anthony Perez
Exact algorithms for Weak Roman Domination
18:00-18:20Vadim Lozin, Jerome Monnot and Bernard Ries
On the maximum independent set problem in subclasses of subcubic graphs
Thursday, July 11th
8:40-9:40S. Edelkamp
Weak Heaps and Friends - Show me your Bits
9:40-10:00Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho and Jiamou Liu
Dynamising Interval Scheduling: The Monotonic Case
10:00-10:20Glencora Borradaile and Anna Harutyunyan
Boundary-to-boundary flows in planar graphs
10:20-10:50Coffee break
10:50-11:10Mirka Miller, Slamin, Joe Ryan and Edy Tri Baskoro
Construction techniques for digraphs with minimum diameter
11:10-11:30Yuqing Lin
Maximum spectral radius of graphs with given connectivity and minimum degree
11:30-11:50Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang and Kun-Mao Chao
An Optimal Algorithm for the Popular Condensation Problem
11:50-12:10Petr Golovach, Daniel Paulusma and Iain Stewart
Graph Editing to a Fixed Target
12:10-12:30Toru Hasunuma
Structural Properties of Subdivided-Line Graphs
12:30-14:00lunch
14:00-14:20Leanne Rylands, Oudone Phanalasy, Joe Ryan and Mirka Miller
An Application of Completely Separating Systems to Graph Labeling
14:20-14:40Tao-Ming Wang and Guang-Hui Zhang
On Antimagic Even Regular Graphs
14:40-15:00Clément Charpentier and Eric Sopena
Incidence coloring game and arboricity of graphs
15:00-15:20Nacho López Lorenzo and Francesc Sebe
Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees
15:20-15:40Florent Foucaud
The complexity of the identifying code problem in restricted graph classes
16:30-18:30
20:00-
Friday, July 12th
8:40-9:40J. R. Griggs
The Δ2 Conjecture for Graph Labellings with Separation Conditions
9:40-10:00Sang Hyuk Lee and Tomasz Radzik
Approximation Bounds for the Maximum Mixedcast Rounds in Wireless Ad-hoc Networks
10:00-10:30Coffee break
10:30-10:50Well Y. Chiu and Chiuyuan Chen
Linear-time self-stabilizing algorithms for minimal domination in graphs
10:50-11:10Hayk Grigoryan and Hovhannes Harutyunyan
Tight Bound on the Diameter of the Knödel Graph
11:10-12:20Open problem session
12:20-14:00lunch
14:00-15:00R. Klasing
15:00-15:20Hebert Perez-Roses, Guillermo Pineda-Villavicencio, Perouz Taslakian and Dannier Trinchet-Almaguer
Fitting Voronoi Diagrams to Planar Tesselations
15:20-15:40Alejandro Erickson and Frank Ruskey
Domino Tatami Covering is NP-complete
15:40-16:10Coffee break
16:10-16:30Gerold Jäger
SAT and IP Based Algorithms for Magic Labeling with Applications
16:30-16:50Hans-Joachim Boeckenhauer and Lucia Keller
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas
16:50-17:10George Charalambous and Michael Hoffmann
Verification Problem of Maximal Points under Uncertainty
17:10-17:20Short break
17:20-17:40Christian Bachmaier, Franz Josef Brandenburg, Andreas Gleißner and Andreas Hofmeier
On Maximum Rank Aggregation Problems
17:40-18:00Elie De Panafieu
Phase Transition of Random Non-Uniform Hypergraphs
contacts | crédits | mentions légales

Valid XHTML 1.0 Strict