Abstract is missing.
- Fully Dynamic Arboricity MaintenanceNiranka Banerjee, Venkatesh Raman 0001, Saket Saurabh 0001. 1-12 [doi]
- A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis LatticeGill Barequet, Minati De. 13-24 [doi]
- An FPTAS for a General Class of Parametric Optimization ProblemsCristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten. 25-37 [doi]
- Geodesic Fault-Tolerant Additive Weighted SpannersSukanya Bhattacharjee, R. Inkulu. 38-51 [doi]
- Diameter of Colorings Under Kempe ChangesMarthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa. 52-64 [doi]
- Dominating Set on Overlap Graphs of Rectangles Intersecting a LineDibyayan Chakraborty, Sandip Das 0001, Joydeep Mukherjee. 65-77 [doi]
- Minimizing the Cost of Batch CalibrationsVincent Chau, Minming Li, Yinling Wang, Ruilong Zhang, Yingchao Zhao. 78-89 [doi]
- Variants of Homomorphism Polynomials Complete for Algebraic Complexity ClassesPrasad Chaugule, Nutan Limaye, Aditya Varre. 90-102 [doi]
- Chance-Constrained Submodular Knapsack ProblemJunjie Chen, Takanori Maehara. 103-114 [doi]
- Approximation Hardness of Travelling Salesman via Weighted AmplifiersMiroslav Chlebík, Janka Chlebíková. 115-127 [doi]
- Deleting to Structured TreesPratyush Dayal, Neeldhara Misra. 128-139 [doi]
- Sensitivity, Affine Transforms and Quantum Communication ComplexityKrishnamoorthy Dinesh 0001, Jayalal Sarma. 140-152 [doi]
- On Exactly Learning Disjunctions and DNFs Without Equivalence QueriesNing Ding. 153-165 [doi]
- Interactive Physical Zero-Knowledge Proof for NorinoriJean-Guillaume Dumas, Pascal Lafourcade 0001, Daiki Miyahara, Takaaki Mizuki, Tatsuya Sasaki, Hideaki Sone. 166-177 [doi]
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic ModelsPurnata Ghosal, B. V. Raghavendra Rao. 178-192 [doi]
- Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided TiesKavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy. 193-205 [doi]
- Feasibility Algorithms for the Duplication-Loss CostPawel Górecki, Alexey Markin, Oliver Eulenstein. 206-218 [doi]
- Imbalance, Cutwidth, and the Structure of Optimal OrderingsJan Gorzny, Jonathan F. Buss. 219-231 [doi]
- Smaller Universal Targets for Homomorphisms of Edge-Colored GraphsGrzegorz Guspiel. 232-239 [doi]
- A Simple Construction of Broadcast GraphsHovhannes A. Harutyunyan, Zhiyuan Li. 240-253 [doi]
- No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract)Md. Manzurul Hasan, Md. Saidur Rahman 0001. 254-265 [doi]
- Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy ConflictsAlessandro Hill, Stefan Voß, Roberto Baldacci. 266-278 [doi]
- 3D Path Network Planning: Using a Global Optimization Heuristic for Mine Water-Inrush EvacuationYi Hong 0003, Deying Li, Qiang Wu, Hua Xu. 279-290 [doi]
- Max-Min 3-Dispersion ProblemsTakashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa. 291-300 [doi]
- Matching Cut in Graphs with Large Minimum DegreeSun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng. 301-312 [doi]
- Incremental Optimization of Independent Sets Under the Reconfiguration FrameworkTakehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki. 313-324 [doi]
- Deconstructing Parameterized Hardness of Fair Vertex Deletion ProblemsAshwin Jacob, Venkatesh Raman 0001, Vibha Sahlot. 325-337 [doi]
- On 1-Factorizations of Bipartite Kneser GraphsKai Jin. 338-349 [doi]
- An Optimal Algorithm for 2-Bounded Delay Buffer Management with LookaheadKoji M. Kobayashi. 350-362 [doi]
- Reoptimization of Path Vertex Cover ProblemMehul Kumar, Amit Kumar, C. Pandu Rangan. 363-374 [doi]
- A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free GraphsHung Le, Baigong Zheng. 375-386 [doi]
- The Seeding Algorithm for Functional k-Means ProblemMin Li, Yishui Wang, Dachuan Xu, Dongmei Zhang. 387-396 [doi]
- More Efficient Algorithms for Stochastic Diameter and Some Unapproximated Problems in Metric SpaceDaogao Liu. 397-411 [doi]
- Lower Bounds for Small Ramsey Numbers on HypergraphsS. Cliff Liu. 412-424 [doi]
- APTER: Aggregated Prognosis Through Exponential Re-weightingYang Liu, Kristiaan Pelckmans. 425-436 [doi]
- An Erdős-Pósa Theorem on Neighborhoods and Domination NumberJayakrishnan Madathil, Pranabendu Misra, Saket Saurabh 0001. 437-444 [doi]
- On the Hardness of Reachability ReductionDongjing Miao, Zhipeng Cai. 445-455 [doi]
- Give and Take: Adaptive Balanced Allocation for Peer AssessmentsHideaki Ohashi, Yasuhito Asano, Toshiyuki Shimizu, Masatoshi Yoshikawa. 456-468 [doi]
- LIKE Patterns and ComplexityHolger Petersen 0001. 469-477 [doi]
- Data Structures for Incremental Interval ColoringGirish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy. 478-489 [doi]
- Lower Bounds for the Happy Coloring ProblemsIvan Bliznets, Danil Sagunov. 490-502 [doi]
- An Efficient Decision Procedure for Propositional Projection Temporal LogicXinfeng Shu, Nan Zhang 0001. 503-515 [doi]
- On the Relationship Between Energy Complexity and Other Boolean Function MeasuresXiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia. 516-528 [doi]
- The One-Round Multi-player Discrete Voronoi Game on Grids and TreesXiaoming Sun, Yuan Sun, Zhiyu Xia, Jialin Zhang. 529-540 [doi]
- Competitive Auctions and Envy-Freeness for Group of AgentsTaiki Todo, Atsushi Iwasaki, Makoto Yokoo. 541-553 [doi]
- Upper and Lower Bounds on Approximating Weighted Mixed DominationMingyu Xiao. 554-566 [doi]
- Parameterized Algorithms for the Traveling Purchaser Problem with Additional ConstraintsMingyu Xiao, Jianan Zhang, Weibo Lin. 567-579 [doi]
- An Approximation Algorithm for Sorting by Bounded Singleton MovesShengjun Xie, Haodi Feng, Haitao Jiang, Junfeng Luan, Daming Zhu. 580-590 [doi]
- Universal Facility Location in Generalized Metric SpaceYicheng Xu, Dachuan Xu, Yong Zhang 0001, Juan Zou. 591-602 [doi]
- Activation Probability Maximization for Target Users Under Influence Decay ModelRuidong Yan, Yi Li, Deying Li, Yuqing Zhu 0002, Yongcai Wang, Hongwei Du. 603-614 [doi]
- Maximization of Constrained Non-submodular FunctionsRuiqi Yang, Dachuan Xu, Donglei Du, Yicheng Xu, Xihong Yan. 615-626 [doi]
- Truthful Mechanism Design of Reversed Auction on Cloud ComputingDeshi Ye, Feng Xie, Guochuan Zhang. 627-638 [doi]
- Distance Constrained Vehicle Routing Problem to Minimize the Total CostWei Yu 0011, Zhaohui Liu, Xiaoguang Bao. 639-650 [doi]
- Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack ConstraintZhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu, Dongmei Zhang. 651-662 [doi]
- A Proof System for a Unified Temporal LogicLiang Zhao, Xiaobing Wang, Xinfeng Shu, Nan Zhang 0001. 663-676 [doi]