Abstract is missing.
- On the Complexity of Computing TreebreadthGuillaume Ducoffe , Sylvain Legay, Nicolas Nisse. 3-15 [doi]
- Online Chromatic Number is PSPACE-CompleteMartin Böhm, Pavel Veselý. 16-28 [doi]
- Bounded Embeddings of Graphs in the PlaneRadoslav Fulek. 31-42 [doi]
- Crushing Disks EfficientlyStefan Funke, Filip Krumpe, Sabine Storandt. 43-54 [doi]
- Essential Constraints of Edge-Constrained Proximity GraphsProsenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid. 55-67 [doi]
- Plane Bichromatic Trees of Low DegreeAhmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid. 68-80 [doi]
- Directing Road Networks by Listing Strong OrientationsAlessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari. 83-95 [doi]
- Evangelism in Social NetworksGennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro. 96-108 [doi]
- Distance Queries in Large-Scale Fully Dynamic Complex NetworksGianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni. 109-121 [doi]
- Minimax Regret 1-Median Problem in Dynamic Path NetworksYuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi. 122-134 [doi]
- On Maximal Chain Subgraphs and Covers of Bipartite GraphsTiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri. 137-150 [doi]
- Weighted de Bruijn Graphs for the Menage Problem and Its GeneralizationsMax A. Alekseyev. 151-162 [doi]
- Reconfiguration of Steiner Trees in an Unweighted GraphHaruka Mizuta, Takehiro Ito, Xiao Zhou. 163-175 [doi]
- Weighted Online Problems with AdviceJoan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen. 179-190 [doi]
- Finding Gapped Palindromes OnlineYuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 191-202 [doi]
- Advice Complexity of the Online Search ProblemJhoirene Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl. 203-212 [doi]
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String ProcessingTakuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura. 213-225 [doi]
- A Boundary Property for Upper DominationHassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev. 229-240 [doi]
- Upper Domination: Complexity and ApproximationCristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos. 241-252 [doi]
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic ClassesKonrad Dabrowski, Vadim V. Lozin, Daniël Paulusma. 253-265 [doi]
- Sufficient Conditions for Tuza's Conjecture on Packing and Covering TrianglesXujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang. 266-277 [doi]
- Linear Time Algorithms for Happy Vertex Coloring Problems for TreesN. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare. 281-292 [doi]
- Speeding up Dynamic Programming in the Line-Constrained k-medianPawel Gawrychowski, Lukasz Zatorski. 293-305 [doi]
- SOBRA - Shielding Optimization for BRAchytherapyGuillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa. 309-320 [doi]
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI ConstraintsK. Subramani, Piotr J. Wojciechowski. 321-333 [doi]
- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph ProblemMarkus Chimani, Ivo Hedtke, Tilo Wiedera. 334-346 [doi]
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus GraphsRobert Benkoczi, Ram Dahal, Daya Ram Gaur. 347-358 [doi]
- Finding Cactus Roots in Polynomial TimePetr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart. 361-372 [doi]
- Computing Giant Graph DiametersPeter Damaschke. 373-384 [doi]
- Faster Computation of Path-WidthMartin Fürer. 385-396 [doi]
- The Solution Space of Sorting with Recurring Comparison FaultsPeter Damaschke. 397-408 [doi]
- Monotone Paths in Geometric TriangulationsAdrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth. 411-422 [doi]
- On Computing the Total Displacement Number via Weighted Motzkin PathsAndreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager. 423-434 [doi]
- Partial Covering Arrays: Algorithms and AsymptoticsKaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro. 437-448 [doi]
- Querying Probabilistic Neighborhoods in Spatial Data Sets EfficientlyMoritz von Looz, Henning Meyerhenke. 449-460 [doi]