Accepted Papers

  1. An Efficient Mechanism for Resource Allocation in Mobile Edge Computing
    Guotai Zeng, Chen Zhang, Hongwei Du

  2. Data Sensing with Limited Mobile Sensors in Sweep Coverage
    Zixiong Nie, Chuang Liu, Hongwei Du

  3. Imbalance on Threshold Graphs and Bipartite Permutation Graphs
    Jan Gorzny

  4. A Two-layers Heuristic Search Algorithm for Milk Run with A New PDPTW Model
    Xuhong Cai, Li Jiang, Songhu Guo, Hejiao Huang, Hongwei Du

  5. Trip-vehicle Assignment Algorithms for Ride-Sharing
    Songhua Li, Minming Li, Victor C.S. Lee

  6. Two-stage Pricing Strategy with Price Discount in Online Social Networks
    He Yuan, Ziwei Liang, Hongwei Du

  7. Approximate Ridesharing of Personal Vehicles Problem
    Qian-Ping Gu, Jiajian Liang, Guochuan Zhang

  8. Minimum Wireless Charger Placement with Individual Energy Requirement
    Xingjian Ding, Jianxiong Guo, Deying Li, Ding-Zhu Du

  9. Online Maximum $k$-Interval Coverage Problem
    Songhua Li, Minming Li, Lingjie Duan, Victor C.S. Lee

  10. On Unit read-once resolutions and Copy complexity
    Piotr Wojciechowski, K. Subramani

  11. Star-critical Ramsey number of large cycle and book
    Yan Li, Yusheng Li, Ye Wang

  12. A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee
    Hengzhao Ma, Jianzhong Li

  13. Propositional Projection Temporal Logic Specification Mining
    Nan Zhang, Xiaoshuai Yuan, Zhenhua Duan

  14. Vertex fault-tolerant spanners for weighted points in polygonal domains
    R Inkulu, Apurv Singh

  15. Competitive Analysis for Two Variants of Online Metric Matching Problem
    Toshiya Itoh, Shuichi Miyazaki, Makoto Satake

  16. Constructing Order Type Graphs using an Axiomatic Approach
    Sergey Bereg, Mohammadreza Haghpanah

  17. An Improved Exact Algorithm for the Exact Satisfiability Problem
    Gordon Hoi

  18. Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives
    Nader Bshouty, Catherine Haddad-Zaknoon

  19. On the Complexity of a Periodic Scheduling Problem with Precedence Relations
    Richard Hladík, Anna Minaeva, Zdenek Hanzalek

  20. An Efficient Algorithm for Routing and Recharging of Electric Vehicles
    Tayebeh Bahreini, Nathan Fisher, Daniel Grosu

  21. Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks
    Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase

  22. Remotely Useful Greedy Algorithms
    Moritz Beck

  23. FISSION: A Practical Algorithm for Computing Minimum Balanced Node Separators
    Johannes Blum, Ruoying Li, Sabine Storandt

  24. Nearly Complete Characterization of 2-Agent Deterministic Strategyproof Mechanisms for Single Facility Location in Lp Space
    Jianan Lin

  25. Transforming Multi-matching Nested Traceable Automata to Multi-matching Nested Expressions
    Jin Liu, zhenhua duan, Cong Tian

  26. Energy-constrained Drone Delivery Scheduling
    Rafael Papa, Ionut Cardei, Mihaela Cardei

  27. Scheduling Jobs with Precedence Constraints to Minimize Peak Demand
    Elliott Pryor, Brendan Mumey, Sean Yaw

  28. Parameterized Algorithms for Fixed-order Book Drawing with Bounded Number of Crossings Per Edge
    Yunlong Liu, Jie Chen, Jingui Huang

  29. Sampling Based Approximate Skyline Calculation on Big Data
    Xingxing Xiao, Jianzhong Li

  30. Fractional Maker-Breaker Resolving Game
    Eunjeong Yi

  31. On the complexity of some facet-defining inequalities of the QAP-polytope
    Pawan Aurora, Hans Raj Tiwary

  32. Price of Fairness in Budget Division for Egalitarian Social Welfare
    Zhongzheng Tang, chenhao wang, Mengqi Zhang

  33. Approximating $k$-orthogonal Line Center
    Barunabha Chakraborty, Arun Kumar Das, Sandip Das, Joydeep Mukherjee

  34. Reachability games for optimal multi-agent scheduling of tasks with variable durations
    Dhananjay Raju, Niklas Lauffer, Ufuk Topcu

  35. Guarding Disjoint Orthogonal Polygons in the Plane
    Ovidiu Daescu, Hemant Malik

  36. Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles
    sharareh alipour, Salman Parsa

  37. Inductive graph invariants and algorithmic applications
    C.R. Subramanian

  38. Matched Participants Maximization Based on Social Spread
    Guoyao Rao, Yongcai Wang, Wenping Chen, Deying Li, Weili Wu

  39. Oriented coloring of msp-digraphs and oriented co-graphs
    Frank Gurski, Dominique Komander, Marvin Lindemann

  40. Inspection Strategy for On-board Fuel Sampling within Emission Control Areas
    Lingyue Li, Gao Sui-xiang, Wenguo Yang

  41. Novel algorithms for maximum DS decomposition
    Shengminjie Chen, Wenguo Yang, Suixiang Gao, Rong Jin

  42. Mixed-case Community Detection Problem in Social Networks
    Yapu Zhang, Jianxiong Guo, Wenguo Yang

  43. Packing and Covering Triangles in Dense Random Graphs
    Zhongzheng Tang, Zhuo Diao

  44. How to get a degree-anonymous graph using minimum number of edge rotations
    Cristina Bazgan, Pierre Cazals, Janka Chlebikova

  45. Improved Scheduling with a Shared Resourcevia Structural Insights
    Christoph Damerius, Peter Kling, Minming Li, Florian Schneider, Ruilong ZHANG

  46. Selecting Sources for Query Approximation with Bounded Resources
    Hongjie Guo, Jianzhong Li, Hong Gao

  47. Mechanism Design for Facility Location Games with Candidate Locations
    Zhongzheng Tang, chenhao wang, Mengqi Zhang, yingchao zhao

  48. Parameterized Complexity of Satisfactory Partition Problem
    Soumen Maity

  49. On the Complexity of Minimum Maximal Uniquely Restricted Matching
    Juhi Chaudhary, B S Panda

  50. The Small Set Vertex Expansion Problem
    Soumen Maity

  51. The Optimization of Self-Interference In Wideband Full-Duplex Phased Array with Joint Transmit and Receive Beamforming
    Xiaoxin Wang, Zhipeng Jiang, Wenguo Yang, Gao Sui-xiang

  52. Reading Articles Online
    Andreas Karrenbauer, Elizaveta Kovalevskaya

  53. Optimal strategies in Single Round Voronoi Game on Convex Polygons with Constraints
    Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Sarvottamananda Swami

  54. An approximation of the zero error capacity by a greedy algorithm
    Marcin Jurkiewicz

  55. Cutting Stock with Rotation: Packing Square Items into Square Bins
    Shahin kamali, Pooya Nikbakht