default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2013: Rouen, France
- Thierry Lecroq
, Laurent Mouchard:
Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8288, Springer 2013, ISBN 978-3-642-45277-2
Invited Talks
- Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß:
Weak Heaps and Friends: Recent Developments. 1-6 - Ralf Klasing:
Efficient Exploration of Anonymous Undirected Graphs. 7-13
Regular Papers
- Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
On Maximum Rank Aggregation Problems. 14-27 - Francine Blanchet-Sadri, Sinziana Munteanu:
Deciding Representability of Sets of Words of Equal Length in Polynomial Time. 28-40 - Widmer Bland, Gregory Kucherov, W. F. Smyth:
Prefix Table Construction and Conversion. 41-53 - Hans-Joachim Böckenhauer, Lucia Keller:
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas. 54-66 - Glencora Borradaile, Anna Harutyunyan:
Boundary-to-Boundary Flows in Planar Graphs. 67-80 - Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez:
Exact Algorithms for Weak Roman Domination. 81-93 - George Charalambous, Michael Hoffmann:
Verification Problem of Maximal Points under Uncertainty. 94-105 - Clément Charpentier, Éric Sopena:
Incidence Coloring Game and Arboricity of Graphs. 106-114 - Well Y. Chiu, Chiuyuan Chen:
Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs. 115-126 - Elie de Panafieu:
Phase Transition of Random Non-uniform Hypergraphs. 127-139 - Alejandro Erickson, Frank Ruskey:
Domino Tatami Covering Is NP-Complete. 140-149 - Florent Foucaud:
The Complexity of the Identifying Code Problem in Restricted Graph Classes. 150-163 - Robert Ganian, Jan Obdrzálek:
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. 164-177 - Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamising Interval Scheduling: The Monotonic Case. 178-191 - Petr A. Golovach, Daniël Paulusma, Iain A. Stewart:
Graph Editing to a Fixed Target. 192-205 - Hayk Grigoryan, Hovhannes A. Harutyunyan:
Tight Bound on the Diameter of the Knödel Graph. 206-215 - Toru Hasunuma:
Structural Properties of Subdivided-Line Graphs. 216-229 - Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Induced Subtrees in Interval Graphs. 230-243 - A. S. M. Shohidull Islam, M. Sohel Rahman:
Protein Folding in 2D-Triangular Lattice Revisited - (Extended Abstract). 244-257 - Gerold Jäger:
SAT and IP Based Algorithms for Magic Labeling with Applications. 258-268 - Tomás Flouri, Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis:
An Optimal Algorithm for Computing All Subtree Repeats in Trees. 269-282 - Sang-Hyuk Lee, Tomasz Radzik:
Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks. 283-296 - Hongliang Lu, Yuqing Lin:
Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ. 297-302 - Nacho López, Francesc Sebé:
Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees. 303-313 - Vadim V. Lozin, Jérôme Monnot, Bernard Ries:
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. 314-326 - Mirka Miller, Slamin, Joe Ryan, Edy Tri Baskoro:
Construction Techniques for Digraphs with Minimum Diameter. 327-336 - Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. 337-348 - Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet-Almaguer:
Fitting Voronoi Diagrams to Planar Tesselations. 349-361 - Ron Y. Pinter, Meirav Zehavi:
Partial Information Network Queries. 362-375 - Leanne Rylands, Oudone Phanalasy, Joe Ryan, Mirka Miller:
An Application of Completely Separating Systems to Graph Labeling. 376-387 - Joe Sawada, Aaron Williams, Dennis Chi-Him Wong:
Universal Cycles for Weight-Range Binary Strings. 388-401 - Michael Soltys:
Circuit Complexity of Shuffle. 402-411 - Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
An Optimal Algorithm for the Popular Condensation Problem. 412-422
Posters
- Glencora Borradaile, Anna Harutyunyan:
Maximum st-Flow in Directed Planar Graphs via Shortest Paths. 423-427 - Cédric Chauve, Murray Patterson, Ashok Rajaraman:
Hypergraph Covering Problems Motivated by Genome Assembly Questions. 428-432 - Peter Damaschke:
Cluster Editing with Locally Bounded Modifications Revisited. 433-437 - François Delbot, Christian Laforest, Raksmey Phan:
New Approximation Algorithms for the Vertex Cover Problem. 438-442 - Mourad El Ouali, Volkmar Sauerland:
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation. 443-447 - Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Esko Ukkonen:
Motif Matching Using Gapped Patterns. 448-452 - Wlodzimierz Moczurad:
Domino Graphs and the Decipherability of Directed Figure Codes. 453-457 - Christian Schilling, Jan-Georg Smaus, Fabian Wenzelmann:
A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem. 458-462 - Appala Naidu Tentu, Prabal Paul, China Venkaiah Vadlamudi:
Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes. 463-467 - Haiko Müller, Samuel Wilson:
An FPT Certifying Algorithm for the Vertex-Deletion Problem. 468-472
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-11 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
