Abstract is missing.
- Going Weighted: Parameterized Algorithms for Cluster EditingSebastian Böcker, Sebastian Briesemeister, Quang Bao Anh Bui, Anke Truß. 1-12 [doi]
- Parameterized Graph Editing with Chosen Vertex DegreesLuke Mathieson, Stefan Szeider. 13-22 [doi]
- Fixed-Parameter Tractability of Anonymizing Data by Suppressing EntriesRhonda Chaytor, Patricia A. Evans, Todd Wareham. 23-31 [doi]
- Multiple Hypernode Hitting Sets and Smallest Two-Cores with TargetsPeter Damaschke. 32-42 [doi]
- Parameterized Complexity of Candidate Control in Elections and Related Digraph ProblemsNadja Betzler, Johannes Uhlmann. 43-53 [doi]
- A Parameterized Perspective on Packing Paths of Length TwoHenning Fernau, Daniel Raible. 54-63 [doi]
- New Algorithms for k-Center and ExtensionsRené Brandenberg, Lucia Roth. 64-78 [doi]
- Separating Sublinear Time Computations by Approximate DiameterBin Fu, Zhiyu Zhao. 79-88 [doi]
- Computational Study on Dominating Set Problem of Planar GraphsMarjan Marzban, Qian-Ping Gu, Xiaohua Jia. 89-102 [doi]
- Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar RegionBinay K. Bhattacharya, B. Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese. 103-115 [doi]
- Parameterized Algorithms for Generalized DominationVenkatesh Raman, Saket Saurabh, Sriganesh Srihari. 116-126 [doi]
- Turán Graphs, Stability Number, and Fibonacci IndexVéronique Bruyère, Hadrien Mélot. 127-138 [doi]
- Vertex-Uncertainty in Graph-ProblemsCécile Murat, Vangelis Th. Paschos. 139-148 [doi]
- Protean Graphs with a Variety of Ranking SchemesPawel Pralat. 149-159 [doi]
- Simplicial Powers of GraphsAndreas Brandstädt, Van Bang Le. 160-170 [doi]
- On k-Versus (k+1)-Leaf PowersAndreas Brandstädt, Peter Wagner 0002. 171-179 [doi]
- Flows with Unit Path Capacities and Related Packing and Covering ProblemsMaren Martens, Martin Skutella. 180-189 [doi]
- Strong Formulations for 2-Node-Connected Steiner Network ProblemsMarkus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel. 190-200 [doi]
- Algorithms and Implementation for Interconnection Graph ProblemHongbing Fan, Christian Hundt, Yu-Liang Wu, Jason Ernst. 201-210 [doi]
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second OrderGerold Jäger, Paul Molitor. 211-224 [doi]
- Fast Computation of Point-to-Point Paths on Time-Dependent Road NetworksGiacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti. 225-234 [doi]
- Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM NetworksXiangyong Li, Yash P. Aneja, Fazle Baki. 235-245 [doi]
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree ProblemsShai Gutner. 246-254 [doi]
- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk GraphZhao Zhang, Xiaofeng Gao, Weili Wu. 255-264 [doi]
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location ProblemHyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa. 265-277 [doi]
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk GraphsFeng Zou, Xianyue Li, Donghyun Kim, Weili Wu. 278-285 [doi]
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing ProblemZhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang. 286-295 [doi]
- Covering Arrays Avoiding Forbidden EdgesPeter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens. 296-308 [doi]
- The Robot Cleans UpMargaret-Ellen Messinger, Richard J. Nowakowski. 309-318 [doi]
- On Recovering Syntenic Blocks from Comparative MapsZhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu. 319-327 [doi]
- Automatic Generation of Symmetry-Breaking ConstraintsLeo Liberti. 328-338 [doi]
- On the Stable Set Polytope of Claw-Free GraphsAnna Galluccio, Claudio Gentile, Paolo Ventura. 339-350 [doi]
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular GraphsCaterina De Simone, Anna Galluccio. 351-360 [doi]
- Magic Labelings on Cycles and WheelsAndrew Baker, Joe Sawada. 361-373 [doi]
- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete DigraphsArvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey. 374-383 [doi]
- The Clique Corona Operation and GreedoidsVadim E. Levit, Eugen Mandrescu. 384-392 [doi]
- On the Surface Area of the (n, k)-Star GraphZhizhang Shen, Ke Qiu, Eddie Cheng. 393-404 [doi]
- Enumerating Isolated Cliques in Synthetic and Financial NetworksFalk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier. 405-416 [doi]
- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller ProblemBing Su, Yinfeng Xu, Peng Xiao, Lei Tian. 417-426 [doi]
- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact DelaysYumei Huo, Haibing Li, Hairong Zhao. 427-437 [doi]
- Efficient Method for Periodic Task Scheduling with Storage Requirement MinimizationKarine Deschinkel, Sid Ahmed Ali Touati. 438-447 [doi]
- Stochastic Online Scheduling RevisitedAndreas S. Schulz. 448-457 [doi]
- Delay Management Problem: Complexity Results and Robust AlgorithmsSerafino Cicerone, Gianlorenzo D Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra. 458-468 [doi]
- Clustered SplitsNetworksLichen Bao, Sergey Bereg. 469-478 [doi]