Abstract is missing.
- Weak Heaps and Friends: Recent DevelopmentsStefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß. 1-6 [doi]
- Efficient Exploration of Anonymous Undirected GraphsRalf Klasing. 7-13 [doi]
- On Maximum Rank Aggregation ProblemsChristian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier. 14-27 [doi]
- Deciding Representability of Sets of Words of Equal Length in Polynomial TimeFrancine Blanchet-Sadri, Sinziana Munteanu. 28-40 [doi]
- Prefix Table Construction and ConversionWidmer Bland, Gregory Kucherov, W. F. Smyth. 41-53 [doi]
- On the Approximability of Splitting-SAT in 2-CNF Horn FormulasHans-Joachim Böckenhauer, Lucia Keller. 54-66 [doi]
- Boundary-to-Boundary Flows in Planar GraphsGlencora Borradaile, Anna Harutyunyan. 67-80 [doi]
- Exact Algorithms for Weak Roman DominationMathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez. 81-93 [doi]
- Verification Problem of Maximal Points under UncertaintyGeorge Charalambous, Michael Hoffmann. 94-105 [doi]
- Incidence Coloring Game and Arboricity of GraphsClément Charpentier, Eric Sopena. 106-114 [doi]
- Linear-Time Self-stabilizing Algorithms for Minimal Domination in GraphsWell Y. Chiu, Chiuyuan Chen. 115-126 [doi]
- Phase Transition of Random Non-uniform HypergraphsElie de Panafieu. 127-139 [doi]
- Domino Tatami Covering Is NP-CompleteAlejandro Erickson, Frank Ruskey. 140-149 [doi]
- The Complexity of the Identifying Code Problem in Restricted Graph ClassesFlorent Foucaud. 150-163 [doi]
- Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph ClassesRobert Ganian, Jan Obdrzálek. 164-177 [doi]
- Dynamising Interval Scheduling: The Monotonic CaseAlexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu. 178-191 [doi]
- Graph Editing to a Fixed TargetPetr A. Golovach, Daniël Paulusma, Iain A. Stewart. 192-205 [doi]
- Tight Bound on the Diameter of the Knödel GraphHayk Grigoryan, Hovhannes A. Harutyunyan. 206-215 [doi]
- Structural Properties of Subdivided-Line GraphsToru Hasunuma. 216-229 [doi]
- Induced Subtrees in Interval GraphsPinar Heggernes, Pim van 't Hof, Martin Milanic. 230-243 [doi]
- Protein Folding in 2D-Triangular Lattice Revisited - (Extended Abstract)A. S. M. Shohidull Islam, M. Sohel Rahman. 244-257 [doi]
- SAT and IP Based Algorithms for Magic Labeling with ApplicationsGerold Jäger. 258-268 [doi]
- An Optimal Algorithm for Computing All Subtree Repeats in TreesTomás Flouri, Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis. 269-282 [doi]
- Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc NetworksSang-Hyuk Lee, Tomasz Radzik. 283-296 [doi]
- Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δHongliang Lu, Yuqing Lin. 297-302 [doi]
- Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime OutdegreesNacho López, Francesc Sebé. 303-313 [doi]
- On the Maximum Independent Set Problem in Subclasses of Subcubic GraphsVadim V. Lozin, Jérôme Monnot, Bernard Ries. 314-326 [doi]
- Construction Techniques for Digraphs with Minimum DiameterMirka Miller, Slamin, Joe Ryan, Edy Tri Baskoro. 327-336 [doi]
- Suffix Tree of Alignment: An Efficient Index for Similar DataJoong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park. 337-348 [doi]
- Fitting Voronoi Diagrams to Planar TesselationsGreg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet-Almaguer. 349-361 [doi]
- Partial Information Network QueriesRon Y. Pinter, Meirav Zehavi. 362-375 [doi]
- An Application of Completely Separating Systems to Graph LabelingLeanne Rylands, Oudone Phanalasy, Joe Ryan, Mirka Miller. 376-387 [doi]
- Universal Cycles for Weight-Range Binary StringsJoe Sawada, Aaron Williams, Dennis Chi-Him Wong. 388-401 [doi]
- Circuit Complexity of ShuffleMichael Soltys. 402-411 [doi]
- An Optimal Algorithm for the Popular Condensation ProblemYen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao. 412-422 [doi]
- Maximum st-Flow in Directed Planar Graphs via Shortest PathsGlencora Borradaile, Anna Harutyunyan. 423-427 [doi]
- Hypergraph Covering Problems Motivated by Genome Assembly QuestionsCedric Chauve, Murray Patterson, Ashok Rajaraman. 428-432 [doi]
- Cluster Editing with Locally Bounded Modifications RevisitedPeter Damaschke. 433-437 [doi]
- New Approximation Algorithms for the Vertex Cover ProblemFrançois Delbot, Christian Laforest, Raksmey Phan. 438-442 [doi]
- Improved Approximation Algorithm for the Number of Queries Necessary to Identify a PermutationMourad El Ouali, Volkmar Sauerland. 443-447 [doi]
- Motif Matching Using Gapped PatternsEmanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Esko Ukkonen. 448-452 [doi]
- Domino Graphs and the Decipherability of Directed Figure CodesWlodzimierz Moczurad. 453-457 [doi]
- A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis ProblemChristian Schilling, Jan-Georg Smaus, Fabian Wenzelmann. 458-462 [doi]
- Conjunctive Hierarchical Secret Sharing Scheme Based on MDS CodesAppala Naidu Tentu, Prabal Paul, China Venkaiah Vadlamudi. 463-467 [doi]
- An FPT Certifying Algorithm for the Vertex-Deletion ProblemHaiko Müller, Samuel Wilson. 468-472 [doi]