Accepted Papers

  1. The Incentive Ratio in Exchange Economies
    Ido Polak
  2. w-Centroids and least (w,l)-central subtrees
    Erfang Shan, Liying Kang
  3. On the Capture Time of Cops and Robbers Game on a Planar Graph
    Photchchara Pisantechakool, Xuehou Tan
  4. Optimal Speed Scaling with a Solar Cell
    Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs
  5. Performing Multicut on Walkable Environments
    Arne Hillebrand, Marjan van den Akker, Roland Geraerts, Han Hoogeveen
  6. The Mixed Evacuation Problem
    Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
  7. On the (parameterized) complexity of recognizing well-covered (r,l)-graphs
    Sancrey Alves, Konrad K. Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau, Ueverton Souza
  8. A Linear Potential Function for Pairing Heaps
    John Iacono, Mark Yagnatinsky
  9. A Comprehensive Reachability Evaluation for Airline Networks with Multi-Constraints
    Xiaotian You, Xiaofeng Gao, Yaru Dang, Guihai Chen
  10. Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound
    Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka
  11. Solving Dynamic Vehicle Routing Problem with Soft Time Window by improved LNS and hybrid PSO
    Xiaohan He, Xiaoli Zeng, Liang Song, Hejiao Huang, Hongwei Du
  12. Convex Independence in Permutation Graphs
    Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu
  13. Approximation and Hardness Results for the Max $k$-Uncut Problem
    Peng Zhang, Chenchen Wu, Dachuan Xu, Xinghe Zhang
  14. Algorithmic Analysis for Ridesharing of Personal Vehicles
    Qianping Gu, Jiajian Liang, Guochuan Zhang
  15. An approximation algorithm for the $k$-median problem with uniform penalties via pseudo-solution
    Chenchen Wu, Donglei Du, Dachuan Xu
  16. On Strong Tree-Breadth
    Arne Leitert, Feodor F. Dragan
  17. Computing a tree having a small vertex cover
    Takuro Fukunaga, Takanori Maehara
  18. On-line Pattern Matching on Uncertain Sequences & Applications
    Carl Barton, Chang Liu, Solon Pissis
  19. Scheduling with Interjob Communication on Parallel Processors
    Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers
  20. An incentive mechanism for selfish bin covering
    Weian Li, Qizhi Fang, Wenjing Liu
  21. The Mixed Center Location Problem
    yi xu, Jigen Peng, Yinfeng Xu
  22. An introduction to coding sequences of graphs
    Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen
  23. On the Complexity of Bounded Deletion Propagation
    dongjing miao, Yingshu Li, Xianmin Liu, Jianzhong Li
  24. Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem
    Étienne Birmelé, Fabien de Montgolfier, Léo Planche
  25. On the Complexity of Extracting Subtree with Keeping Distinguishability
    Xianmin Liu, Zhipeng Cai, Dongjing Miao, Jianzhong Li
  26. The Connected $p$-Center Problem on Cactus Graphs
    Chunsong Bai, Liying Kang, Erfang Shan
  27. Constrained Light Deployment for Reducing Energy Consumption in Buildings
    Huamei Tian, Kui Wu, Sue Whitesides, Cuiying Feng
  28. Comparison of Quadratic Convex Reformulations to solve the Quadratic Assignment Problem
    sourour elloumi, Amélie Lambert
  29. Congestion Games with Mixed Objectives
    Matthias Feldotto, Lennart Leder, Alexander Skopalik
  30. Safe Sets in Graphs: Graph Classes and Structural Parameters
    Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
  31. Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order
    Kung-jui Pai, Ro-yu Wu, Jou-ming Chang, Shun-chieh Chang
  32. Cost-efficient Scheduling on Machines from the Cloud
    Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers
  33. Strategic Online Facility Location
    Maximilian Drees, Björn Feldkord, Alexander Skopalik
  34. On local structures of cubicity 2 graphs
    Sujoy Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
  35. An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints
    Lin Chen, Klaus Jansen, Guochuan Zhang, Wenchang Luo
  36. Approximability of the distance independent set problem on regular graphs and planar graphs
    Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
  37. Algorithmic Aspects of Disjunctive Total Domination in Graphs
    Chin-Fu Lin, Sheng-Lung Peng
  38. Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding
    Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
  39. On the Approximability of Partial VC Dimension
    Cristina Bazgan, Florent Foucaud, Florian Sikora
  40. Improved Precise Fault Diagnosis Algorithm for Hypercube-Like Graphs
    Tai-Ling Ye, Dun-Wei Cheng, Sun-Yuan Hsieh
  41. On Residual Approximation in Solution Extension Problems
    Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
  42. Using Unified Model Checking to Verify Heaps
    Xu Lu, Zhenhua Duan, Cong Tian
  43. On the Parameterized Parallel Complexity and the Vertex Cover Problem
    Faisal Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan
  44. Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis
    Riccardo Dondi, Florian Sikora
  45. Total Dual Integrality of Triangle Covering
    Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang
  46. On the 2-Center Problem Under Convex Polyhedral Distance Function
    Sergey Bereg
  47. A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
    Linus Källberg, Thomas Larsson
  48. Time-optimal broadcasting of multiple messages in 1-in port model
    Petr Gregor, Riste Škrekovski, Vida Vukašinović
  49. Algorithms for Colourful Simplicial Depth and Medians in the Plane
    Olga Zasenko, Tamon Stephen
  50. Relaxations of discrete sets with semicontinuous variables
    Gustavo Angulo
  51. Fast Searching on Complete k-partite Graphs
    Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles
  52. Unfolding the Core Structure of the Reciprocal Graph of a Massive Online Social Network
    Braulio Dumba, Zhi-Li Zhang
  53. A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space
    Noriyuki Fujimoto
  54. An Optimal Strategy for Static Black-Peg Mastermind With Two Pegs
    Gerold Jäger
  55. Tackling Common Due Window Problem With a Two-layered Approach
    Abhishek Awasthi, Jörg Lässig, Thomas Weise, Oliver Kramer
  56. Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks
    Ulrik Brandes, Eugenia Holm, Andreas Karrenbauer
  57. Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem
    Pawan Aurora, Monalisa Jena, Rajiv Raman
  58. Realizability of Graphs as Triangle Cover Contact Graphs
    Shaheena Sultana, Md Saidur Rahman
  59. A Polynomial Time Solution for Permutation Scaffold Filling
    Nan Liu, Peng Zou, Binhai Zhu
  60. A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees
    Wei Ding, Ke Qiu