Accepted papers
Krishnamoorthy Dinesh and Jayalal Sarma. Sensitivity, Affine Transforms and Quantum Communication Complexity
Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki. Incremental Optimization of Independent Sets Under the Reconfiguration Framework
Alessandro Hill, Stefan Voss and Roberto Baldacci. Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa. Max-Min 3-dispersion Problems
Sixue Liu. Lower Bounds for Small Ramsey Numbers on Hypergraphs
Janka Chlebikova and Miroslav Chlebik. Approximation hardness of Travelling Salesman via weighted amplifiers
Jayakrishnan Madathil, Pranabendu Misra and Saket Saurabh. An Erdos–Posa Theorem on Neighborhoods and Domination Number
Taiki Todo, Atsushi Iwasaki and Makoto Yokoo. Competitive Auctions and Envy-Freeness for Group of Agents
Gill Barequet and Minati De. A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice
Dongjing Miao and Zhipeng Cai. On The Hardness of Reachability Reduction
Hung Le and Baigong Zheng. A Simple Local Search gives a PTAS for the Feedback Vertex Set Problem in Minor-free Graphs
Prasad Chaugule, Nutan Limaye and Aditya Varre. Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes
Shengjun Xie, Haodi Feng, Haitao Jiang, Junfeng Luan and Daming Zhu. An Approximation Algorithm for Sorting by Bounded Singleton Moves
Grzegorz Guśpiel. Smaller Universal Targets for Homomorphisms of Edge-colored Graphs
Deshi Ye, Feng Xie and Guochuan Zhang. Truthful Mechanism Design of Reversed Auction on Cloud Computing
Wei Yu, Zhaohui Liu and Xiaoguang Bao. Distance Constrained Vehicle Routing Problem to Minimize the Total Cost
Purnata Ghosal and Raghavendra Rao B V. On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models
Hovhannes A. Harutyunyan and Zhiyuan Li. A Simple Construction of Broadcast Graphs
Daogao Liu. More efficient Algorithms for Stochastic Diameter and Some Unapproximated Problems in Metric Space
Dumas Jean-Guillaume, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Tatsuya Sasaki and Hideaki Sone. Interactive Physical Zero-Knowledge Proof for Norinori
Danil Sagunov and Ivan Bliznets. Lower Bounds for the Happy Coloring Problems
Holger Petersen. LIKE Patterns and Complexity
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen and Daniel Vanderpooten. An FPTAS for a General Class of Parametric Optimization Problems
Pratyush Dayal and Neeldhara Misra. Deleting to Structured Trees
Sukanya Bhattacharjee and R Inkulu. Geodesic fault-tolerant additive weighted spanners
Junjie Chen and Takanori Maehara. Chance-Constrained Submodular Knapsack Problem
Koji M. Kobayashi. An optimal algorithm for 2-bounded delay buffer management with lookahead
Jan Gorzny and Jonathan Buss. Imbalance, Cutwidth, and the Structure of Optimal Orderings
Mehul Kumar, Amit Kumar and C. Pandu Rangan. Reoptimization of Path Vertex Cover Problem
Hideaki Ohashi, Yasuhito Asano, Toshiyuki Shimizu and Masatoshi Yoshikawa. Give and Take: Adaptive Balanced Allocation for Peer Assessments
N.S. Narayanaswamy, Manas Jyothi Kashyop and Girish Raguvir J. Data Structures for Incremental Interval Coloring
Dibyayan Chakraborty, Sandip Das and Joydeep Mukherjee. Dominating set on overlap graphs of rectangles intersecting a line
Kai Jin. On 1-factorizations of Bipartite Kneser Graphs
Sun-Yuan Hsieh, Hoang-Oanh Le, Van Bang Le and Sheng-Lung Peng. Matching Cut in graphs with large minimum degree
Min Li, Yishui Wang, Dachuan Xu and Dongmei Zhang. The Seeding Algorithm for Functional k-Means Problem
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muehlenthaler, Akira Suzuki and Kunihiro Wasa. Diameter of Colorings Under Kempe Changes
Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu and Dongmei Zhang. Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint
Pawel Gorecki, Alexey Markin and Oliver Eulenstein. Feasibility Algorithms for the Duplication-Loss Cost
Xiaoming Sun, Yuan Sun, Kewen Wu and Zhiyu Xia. On the Relationship between Energy Complexity and other Boolean Function Measures
Xiaoming Sun, Yuan Sun, Zhiyu Xia and Jialin Zhang. The One-Round Multi-player Voronoi Game on Grids and Trees
Liang Zhao, Xiaobing Wang, Xinfeng Shu and Nan Zhang. A Proof System for a Unified Temporal Logic
Yi Hong, Deying Li, Qiang Wu and Hua Xu. 3D path network planning: Using a global optimization heuristic for mine water-inrush evacuation
Md. Manzurul Hasan and Md. Saidur Rahman. No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract)
Xinfeng Shu and Nan Zhang. An Efficient Decision Procedure for Propositional Projection Temporal Logic
Yang Liu and Kristiaan Pelckmans. APTER: Aggregated Prognosis Through Exponential Re-weighting
Ruiqi Yang, Dachuan Xu, Donglei Du, Yicheng Xu and Xihong Yan. Maximization of Constrained Non-Submodular Functions
Yicheng Xu, Dachuan Xu, Yong Zhang and Juan Zou. Universal Facility Location in Generalized Metric Space
Mingyu Xiao, Jianan Zhang and Weibo Lin. Parameterized Algorithms For The Traveling Purchaser Problem With Additional Constraints
Ashwin Jacob, Venkatesh Raman and Vibha Sahlot. Deconstructing Parameterized Hardness of Fair Vertex Deletion problems
Ruidong Yan, Yi Li, Deying Li, Yuqing Zhu, Yongcai Wang and Hongwei Du. Activation Probability Maximization for Target Users under Influence Decay Model
Ning Ding. On Exactly Learning Disjunctions and DNFs without Equivalence Queries
Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar and T Pradeep Reddy. Many-to-one popular matchings with two-sided preferences and one-sided ties
Niranka Banerjee, Venkatesh Raman and Saket Saurabh. Fully Dynamic Arboricity Maintenance
Vincent Chau, Minming Li, Yinling Wang, Ruilong Zhang and Yingchao Zhao. Minimizing the Cost of Batch Calibration
Mingyu Xiao. Upper and Lower Bounds on Approximating Weighted Mixed Domination
