Accepted papers
- André van Renssen, Keenan Lee. Generalized Sweeping Line Spanners
- Hau Chan, Minming Li, Chenhao Wang, Yingchao Zhao. Facility Location Games with Ordinal Preferences
- T-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang. Fully Dynamic $k$-Center Clustering with Outliers
- Milo Roucairol, Tristan Cazenave. Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search
- Hoa Vu. Revisiting Maximum Satisfiability and Related Problems in Data Streams
- Hengzhao Ma, Jianzhong Li, Xiangyu Gao, Tianpeng Gao. Turing Machines with Two-level Memory: A Deep Look into the Input/Output Complexity
- Liqi Zhang, Lingfa Lu. Single machine scheduling with rejection to minimize the $k$-th power of the makespan
- Kento Kimura, Kazuyuki Amano, Shin-ichi Nakano. Escape from the Room
- Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin Krejca, Marcus Pappik. Algorithms for hard-constraint point processes via discretization
- Jianer Chen, Zirui Chu, Yin Guo, Wei Yang. Space Limited Graph Algorithms on Big Data
- Jin-Yi Cai, Ashwin Maran. Counting Cycles on Planar Graphs in Subexponential Time
- Jing Huang, YingYing Ye. Semi-strict chordal digraphs
- Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono. Reallocation Problems with Minimum Completion Time
- Houyu Zhou. Facility Location Games with Group Externalities
- Koki Hamada, Shuichi Miyazaki. Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps
- Johannes Blum, Sabine Storandt. Customizable Hub Labeling: Properties and Algorithms
- Giulia Punzi. Bounding the Number of Eulerian Tours in Undirected Graphs
- Conrado Martínez, Cyril Nicaud, Pablo Rotondo. A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables
- Yuefang Lian, Dachuan Xu, Donglei Du, Yang Zhou. A stochastic algorithm for non-monotone DR-submodular maximziation over a convex set
- Yuan Yuan, Xin Han. Two PTASes for flow shop scheduling problems with transportation constraints
- Conrado Martínez, Gonzalo Solera-Pardo. LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams
- Liting Huang, Wei Yu, Zhaohui Liu. Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants
- Vahideh Keikha. Large k-gons in a 1.5D Terrain
- Tianpeng Gao, Jianzhong Li. Analysis of Approximate sorting in I/O model
- Ivan Bliznets, Danil Sagunov. Two Generalizations of Proper Coloring: Hardness and Approximability
- Hongyi Jiang, Samitha Samaranayake. Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems
- Robert Barish, Tetsuo Shibuya. Proper colorability of segment intersection graphs
- Ivan Bliznets, Anton Bukov, Danil Sagunov. Fair Division with Minimal Withheld Information in Social Networks
- Jerzy Tiuryn, Natalia Rutecka, Paweł Górecki. Rooting Gene Trees via Phylogenetic Networks
- Anthony Bonato. An evolving network model from clique extension
- Hong Chang, Zhicheng Liu, Donglei Du, Xiaoyan Zhang. Two-Stage BP Maximization under $p$-matroid Constraint
- Rahnuma Islam Nishat , Venkatesh Srinivasan , Sue Whitesides. The Hamiltonian Path Graph is Connected for Simple $s,t$ Paths in Rectangular Grid Graphs
- Fei Li. An $O(n^3)$-Time Algorithm for the Min-Gap Unit-Length Job Scheduling Problem
- Xiaoming Sun, Jialin Zhang, Shuo Zhang, Zhijie Zhang. Improved Deterministic Algorithms for Non-monotone Submodular Maximization
- Barun Gorain, Kaushik Mondal, Supantha Pandit. Distributed Dominating Sets in Interval Graphs
- Minati De, Satyam Singh. Hitting Geometric Objects Online via Points in~$\mathbb{Z}^d$
- Rajni Dabas, Neelima Gupta. Capacitated Facility Location with Outliers/Penalties
- Yuan Sha. Improved Separated Red Blue Center Clustering
- Juhi Chaudhary, Sounaka Mishra, B S Panda. On the Complexity of Minimum Maximal Acyclic Matchings
- Xiangyan Kong, Zhen Zhang. Approximation Schemes for k-Facility Location
- Zhongzheng Tang, Zhuo Diao. Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs
- Xiaofei Liu, Zhonghao Liu. The bound coverage problem by aligned disks in L1 metric
- Daniel Bastos, Luis Antonio Kowada. A quantum version of Pollard's Rho of which Shor's Algorithm is a particular case
- Jayalal Sarma, Anoop S K M. On Rotation Distance, Transpositions and Rank Bounded Trees
- Tomoyuki Yamakami. Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
- Hongxiang Zhang, Dachuan Xu, Ling Gai, Zhenning Zhang. Online one-sided smooth function maximization
- Martin Seybold, Milutin Brankovic. Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
- Ta-Yu Mu, Ching-Chi Lin. Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs
- Junkai Feng, Ruiqi Yang, Haibin Zhang, Zhenning Zhang. Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret
- Sizhe Li, Jinghui Xue, Mingming Jin, Kai Wang, Kun He. A 4-Space Bounded Approximation Algorithm \\for Online Bin Packing Problem
- Man Xiao, Weidong Li. Online semi-matching problem with two heterogeneous sensors in a metric space