Abstract is missing.
- A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex SetYuefang Lian, Dachuan Xu, Donglei Du, Yang Zhou. 1-11 [doi]
- Flow Shop Scheduling Problems with Transportation Constraints RevisitedYuan Yuan, Xin Han, Yan Lan. 12-23 [doi]
- LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data StreamsConrado Martínez, Gonzalo Solera-Pardo. 24-35 [doi]
- Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its VariantsLiting Huang, Wei Yu, Zhaohui Liu. 36-48 [doi]
- Large k-Gons in a 1.5D TerrainVahideh Keikha. 49-60 [doi]
- Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits - (Extended Abstract)Tomoyuki Yamakami. 61-69 [doi]
- Analysis of Approximate Sorting in I/O ModelTianpeng Gao, Jianzhong Li. 70-81 [doi]
- Two Generalizations of Proper Coloring: Hardness and ApproximabilityIvan Bliznets, Danil Sagunov. 82-93 [doi]
- Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation SystemsHongyi Jiang, Samitha Samaranayake. 94-105 [doi]
- On the Complexity of Minimum Maximal Acyclic MatchingsJuhi Chaudhary, Sounaka Mishra, B. S. Panda 0001. 106-117 [doi]
- Online Non-monotone DR-Submodular Maximization: 1/4 Approximation Ratio and Sublinear RegretJunkai Feng, Ruiqi Yang, Haibin Zhang, Zhenning Zhang. 118-125 [doi]
- Fair Division with Minimal Withheld Information in Social NetworksIvan Bliznets, Anton Bukov, Danil Sagunov. 126-137 [doi]
- Facility Location Games with Ordinal PreferencesHau Chan, Minming Li, Chenhao Wang 0001, Yingchao Zhao 0001. 138-149 [doi]
- Fully Dynamic k-Center Clustering with OutliersT.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang. 150-161 [doi]
- Refutation of Spectral Graph Theory Conjectures with Monte Carlo SearchMilo Roucairol, Tristan Cazenave. 162-176 [doi]
- Online One-Sided Smooth Function MaximizationHongxiang Zhang, Dachuan Xu, Ling Gai, Zhenning Zhang. 177-185 [doi]
- Revisiting Maximum Satisfiability and Related Problems in Data StreamsHoa T. Vu. 186-198 [doi]
- Turing Machines with Two-Level Memory: A Deep Look into the Input/Output ComplexityHengzhao Ma, Jianzhong Li, Xiangyu Gao, Tianpeng Gao. 199-211 [doi]
- A Quantum Version of Pollard's Rho of Which Shor's Algorithm is a Particular CaseDaniel Chicayban Bastos, Luis Antonio Brasil Kowada. 212-219 [doi]
- Single Machine Scheduling with Rejection to Minimize the k-th Power of the MakespanLiqi Zhang, Lingfa Lu. 220-231 [doi]
- Escape from the RoomKento Kimura, Kazuyuki Amano, Shin-Ichi Nakano. 232-241 [doi]
- Algorithms for Hard-Constraint Point Processes via DiscretizationTobias Friedrich 0001, Andreas Göbel 0001, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik. 242-254 [doi]
- Space Limited Graph Algorithms on Big DataJianer Chen, Zirui Chu, Ying Guo, Wei Yang. 255-267 [doi]
- Counting Cycles on Planar Graphs in Subexponential TimeJin-yi Cai, Ashwin Maran. 268-279 [doi]
- Semi-strict Chordal DigraphsJing Huang 0007, Ying Ying Ye. 280-291 [doi]
- Reallocation Problems with Minimum Completion TimeToshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono. 292-304 [doi]
- 1 MetricXiaofei Liu, Zhonghao Liu. 305-312 [doi]
- Facility Location Games with Group ExternalitiesHouyu Zhou. 313-324 [doi]
- Some New Results on Gallai Theorem and Perfect Matching for k-Uniform HypergraphsZhongzheng Tang, Zhuo Diao. 325-332 [doi]
- Refined Computational Complexities of Hospitals/Residents Problem with Regional CapsKoki Hamada, Shuichi Miyazaki. 333-344 [doi]
- Customizable Hub Labeling: Properties and AlgorithmsJohannes Blum 0001, Sabine Storandt. 345-356 [doi]
- Linear-Time Algorithm for Paired-Domination on Distance-Hereditary GraphsTa-Yu Mu, Ching-Chi Lin. 357-367 [doi]
- Bounding the Number of Eulerian Tours in Undirected GraphsGiulia Punzi. 368-380 [doi]
- A Probabilistic Model Revealing Shortcomings in Lua's Hybrid TablesConrado Martínez, Cyril Nicaud, Pablo Rotondo. 381-393 [doi]
- A 4-Space Bounded Approximation Algorithm for Online Bin Packing ProblemSizhe Li, Jinghui Xue, Mingming Jin, Kai Wang, Kun He. 394-405 [doi]
- Generalized Sweeping Line SpannersKeenan Lee, André van Renssen. 406-418 [doi]
- Rooting Gene Trees via Phylogenetic NetworksJerzy Tiuryn, Natalia Rutecka, Pawel Górecki 0001. 419-431 [doi]
- An Evolving Network Model from Clique ExtensionAnthony Bonato, Ryan Cushman, Trent G. Marbach, Zhiyuan Zhang. 432-443 [doi]
- Online Semi-matching Problem with Two Heterogeneous Sensors in a Metric SpaceMan Xiao, Weidong Li. 444-451 [doi]
- Two-Stage BP Maximization Under p-matroid ConstraintHong Chang, Zhicheng Liu, Donglei Du, Xiaoyan Zhang 0001. 452-462 [doi]
- The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid GraphsRahnuma Islam Nishat, Venkatesh Srinivasan 0001, Sue Whitesides. 463-475 [doi]
- 3)-Time Algorithm for the Min-Gap Unit-Length Job Scheduling ProblemFei Li 0001. 476-487 [doi]
- Approximation Schemes for k-Facility LocationXiangyan Kong, Zhen Zhang. 488-495 [doi]
- Improved Deterministic Algorithms for Non-monotone Submodular MaximizationXiaoming Sun, Jialin Zhang 0001, Shuo Zhang, Zhijie Zhang. 496-507 [doi]
- Distributed Dominating Sets in Interval GraphsBarun Gorain, Kaushik Mondal 0001, Supantha Pandit. 508-520 [doi]
- Optimal Window Queries on Line Segments Using the Trapezoidal Search DAGMilutin Brankovic, Martin P. Seybold. 521-528 [doi]
- Rotation Distance for Rank Bounded TreesS. K. M. Anoop, Jayalal Sarma. 529-536 [doi]
- Hitting Geometric Objects Online via Points in $\mathbb {Z}^d$Minati De, Satyam Singh. 537-548 [doi]
- Capacitated Facility Location with Outliers/PenaltiesRajni Dabas, Neelima Gupta. 549-560 [doi]
- Improved Separated Red-Blue Center ClusteringYuan Sha. 561-572 [doi]
- Proper Colorability of Segment Intersection GraphsRobert D. Barish, Tetsuo Shibuya. 573-584 [doi]