Abstract is missing.
- Hypertree Decompositions: Structure, Algorithms, and ApplicationsGeorg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello. 1-15 [doi]
- Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief SurveyMathilde Bouvel, Vladimir Grebinski, Gregory Kucherov. 16-27 [doi]
- Domination Search on Graphs with Low Dominating-Target-NumberDivesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun. 28-37 [doi]
- Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation GraphsChristophe Crespelle, Christophe Paul. 38-48 [doi]
- Approximating Rank-Width and Clique-Width QuicklySang-il Oum. 49-58 [doi]
- Computing the Tutte Polynomial on Graphs of Bounded Clique-WidthOmer Giménez, Petr Hlinený, Marc Noy. 59-68 [doi]
- Minimizing NLC-Width is NP-CompleteFrank Gurski, Egon Wanke. 69-80 [doi]
- Channel Assignment and Improper Choosability of GraphsFrédéric Havet, Jean-Sébastien Sereni. 81-90 [doi]
- Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear TimeDaniel Meister. 91-102 [doi]
- Roman Domination over Some Graph ClassesMathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng. 103-114 [doi]
- Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph HomomorphismsJirí Fiala, Daniël Paulusma, Jan Arne Telle. 115-126 [doi]
- Network Discovery and VerificationZuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram. 127-138 [doi]
- Complete Graph Drawings Up to Triangle MutationsEmeric Gioan. 139-150 [doi]
- Collective Tree 1-Spanners for Interval GraphsDerek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan. 151-162 [doi]
- On Stable Cutsets in Claw-Free Graphs and Planar GraphsVan Bang Le, Raffaele Mosca, Haiko Müller. 163-174 [doi]
- Induced Subgraphs of Bounded Degree and Bounded TreewidthProsenjit Bose, Vida Dujmovic, David R. Wood. 175-186 [doi]
- Optimal Broadcast Domination of Arbitrary Graphs in Polynomial TimePinar Heggernes, Daniel Lokshtanov. 187-198 [doi]
- Ultimate Generalizations of LexBFS and LEX MAnne Berry, Richard Krueger, Geneviève Simonet. 199-213 [doi]
- Adding an Edge in a CographStavros D. Nikolopoulos, Leonidas Palios. 214-226 [doi]
- The Computational Complexity of Delay ManagementMichael Gatto, Riko Jacob, Leon Peeters, Anita Schöbel. 227-238 [doi]
- Acyclic Choosability of Graphs with Small Maximum DegreeDaniel Gonçalves, Mickaël Montassier. 239-248 [doi]
- Generating Colored TreesShin-Ichi Nakano, Takeaki Uno. 249-260 [doi]
- Optimal Hypergraph Tree-RealizationEphraim Korach, Margarita Razgon. 261-270 [doi]
- Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure ConstraintsGuillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. 271-282 [doi]
- On the Fixed-Parameter Enumerability of Cluster EditingPeter Damaschke. 283-294 [doi]
- Locally Consistent Constraint Satisfaction Problems with Binary ConstraintsManuel Bodirsky, Daniel Král. 295-306 [doi]
- On Randomized Broadcasting in Star GraphsRobert Elsässer, Thomas Sauerwald. 307-318 [doi]
- Finding Disjoint Paths on Directed Acyclic GraphsTorsten Tholey. 319-330 [doi]
- Approximation Algorithms for the Bi-criteria Weighted max-cut ProblemEric Angel, Evripidis Bampis, Laurent Gourvès. 331-340 [doi]
- Approximation Algorithms for the Weighted Independent Set ProblemAkihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson. 341-350 [doi]
- Approximation Algorithms for Unit Disk GraphsErik Jan van Leeuwen. 351-361 [doi]
- Computation of Chromatic Polynomials Using Triangulations and Clique TreesPascal Berthomé, Sylvain Lebresne, Kim Nguyen. 362-373 [doi]
- Computing Branchwidth Via Efficient Triangulations and BlocksFedor V. Fomin, Frédéric Mazoit, Ioan Todinca. 374-384 [doi]
- Algorithms Based on the Treewidth of Sparse GraphsJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith. 385-396 [doi]
- Extending the Tractability Border for Closest Leaf PowersMichael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier. 397-408 [doi]
- Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition ModelJoachim Giesen, Dieter Mitsche. 409-420 [doi]
- Algebraic Operations on PQ Trees and Modular Decomposition TreesRoss M. McConnell, Fabien de Montgolfier. 421-432 [doi]
- Linear-Time Counting Algorithms for Independent Sets in Chordal GraphsYoshio Okamoto, Takeaki Uno, Ryuhei Uehara. 433-444 [doi]
- Faster Dynamic Algorithms for Chordal Graphs, and an Application to PhylogenyAnne Berry, Alain Sigayret, Jeremy Spinrad. 445-455 [doi]
- Recognizing HHDS-Free GraphsStavros D. Nikolopoulos, Leonidas Palios. 456-467 [doi]