Abstract is missing.
- Approximate Ridesharing of Personal Vehicles ProblemQian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang. 3-18 [doi]
- A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality GuaranteeHeng-Zhao Ma, Jianzhong Li 0001. 19-31 [doi]
- Sampling-Based Approximate Skyline Calculation on Big DataXingxing Xiao, Jianzhong Li. 32-46 [doi]
- Approximating k-Orthogonal Line CenterBarunabha Chakraborty, Arun Kumar Das, Sandip Das 0001, Joydeep Mukherjee. 47-60 [doi]
- Selecting Sources for Query Approximation with Bounded ResourcesHongjie Guo, Jianzhong Li 0001, Hong Gao 0001. 61-75 [doi]
- Parameterized Complexity of Satisfactory Partition ProblemAjinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi. 76-90 [doi]
- An Approximation of the Zero Error Capacity by a Greedy AlgorithmMarcin Jurkiewicz. 91-104 [doi]
- On the Complexity of a Periodic Scheduling Problem with Precedence RelationsRichard Hladík, Anna Minaeva, Zdenek Hanzálek. 107-124 [doi]
- Energy-Constrained Drone Delivery SchedulingRafael Papa, Ionut Cardei, Mihaela Cardei. 125-139 [doi]
- Scheduling Jobs with Precedence Constraints to Minimize Peak DemandElliott Pryor, Brendan Mumey, Sean Yaw. 140-150 [doi]
- Reachability Games for Optimal Multi-agent Scheduling of Tasks with Variable DurationsDhananjay Raju, Niklas T. Lauffer, Ufuk Topcu. 151-167 [doi]
- Improved Scheduling with a Shared Resource via Structural InsightsChristoph Damerius, Peter Kling, Minming Li, Florian Schneider, Ruilong Zhang. 168-182 [doi]
- Two-Stage Pricing Strategy with Price Discount in Online Social NetworksHe Yuan, Ziwei Liang, Hongwei Du 0001. 185-197 [doi]
- Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path NetworksYuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase. 198-213 [doi]
- Matched Participants Maximization Based on Social SpreadGuoyao Rao, Yongcai Wang, Wenping Chen, Deying Li 0001, Weili Wu. 214-229 [doi]
- Mixed-Case Community Detection Problem in Social NetworksYapu Zhang, Jianxiong Guo, Wenguo Yang. 230-241 [doi]
- How to Get a Degree-Anonymous Graph Using Minimum Number of Edge RotationsCristina Bazgan, Pierre Cazals, Janka Chlebíková. 242-256 [doi]
- The Small Set Vertex Expansion ProblemSoumen Maity. 257-269 [doi]
- On Unit Read-Once Resolutions and Copy ComplexityPiotr J. Wojciechowski, K. Subramani. 273-288 [doi]
- Propositional Projection Temporal Logic Specification MiningNan Zhang 0001, Xiaoshuai Yuan, Zhenhua Duan. 289-303 [doi]
- An Improved Exact Algorithm for the Exact Satisfiability ProblemGordon Hoi. 304-319 [doi]
- Transforming Multi-matching Nested Traceable Automata to Multi-matching Nested ExpressionsJin Liu, Zhenhua Duan, Cong Tian. 320-333 [doi]
- On the Complexity of Some Facet-Defining Inequalities of the QAP-PolytopePawan Aurora, Hans Raj Tiwary. 334-349 [doi]
- Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain ObstaclesSharareh Alipour, Salman Parsa. 350-363 [doi]
- On the Complexity of Minimum Maximal Uniquely Restricted MatchingJuhi Chaudhary, B. S. Panda. 364-376 [doi]
- A Two-Layers Heuristic Search Algorithm for Milk Run with a New PDPTW ModelXuhong Cai, Li Jiang, Songhu Guo, Hejiao Huang, Hongwei Du 0001. 379-392 [doi]
- Optimal Deterministic Group Testing Algorithms to Estimate the Number of DefectivesNader H. Bshouty, Catherine A. Haddad-Zaknoon. 393-410 [doi]
- p SpaceJianan Lin. 411-425 [doi]
- Packing and Covering Triangles in Dense Random GraphsZhongzheng Tang, Zhuo Diao. 426-439 [doi]
- Mechanism Design for Facility Location Games with Candidate LocationsZhongzheng Tang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao. 440-452 [doi]
- Online Maximum k-Interval Coverage ProblemSonghua Li, Minming Li, Lingjie Duan, Victor C. S. Lee. 455-470 [doi]
- Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal DomainsR. Inkulu, Apurv Singh. 471-485 [doi]
- Competitive Analysis for Two Variants of Online Metric Matching ProblemToshiya Itoh, Shuichi Miyazaki, Makoto Satake. 486-498 [doi]
- Guarding Disjoint Orthogonal Polygons in the PlaneOvidiu Daescu, Hemant Malik. 499-514 [doi]
- Optimal Strategies in Single Round Voronoi Game on Convex Polygons with ConstraintsAritra Banik, Arun Kumar Das, Sandip Das 0001, Anil Maheshwari, Swami Sarvottamananda. 515-529 [doi]
- Cutting Stock with Rotation: Packing Square Items into Square BinsShahin Kamali, Pooya Nikbakht. 530-544 [doi]
- Remotely Useful Greedy AlgorithmsMoritz Beck 0001. 547-561 [doi]
- Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per EdgeYunlong Liu, Jie Chen, Jingui Huang. 562-576 [doi]
- Fractional Maker-Breaker Resolving GameEunjeong Yi. 577-593 [doi]
- Price of Fairness in Budget Division for Egalitarian Social WelfareZhongzheng Tang, Chenhao Wang, Mengqi Zhang. 594-607 [doi]
- Inspection Strategy for On-board Fuel Sampling Within Emission Control AreasLingYue Li, Suixiang Gao, Wenguo Yang. 608-623 [doi]
- Novel Algorithms for Maximum DS DecompositionShengminjie Chen, Wenguo Yang, Suixiang Gao, Rong Jin. 624-638 [doi]
- Reading Articles OnlineAndreas Karrenbauer, Elizaveta Kovalevskaya. 639-654 [doi]
- An Efficient Mechanism for Resource Allocation in Mobile Edge ComputingGuotai Zeng, Chen Zhang, Hongwei Du 0001. 657-668 [doi]
- Data Sensing with Limited Mobile Sensors in Sweep CoverageZixiong Nie, Chuang Liu 0007, Hongwei Du 0001. 669-680 [doi]
- Trip-Vehicle Assignment Algorithms for Ride-SharingSonghua Li, Minming Li, Victor C. S. Lee. 681-696 [doi]
- Minimum Wireless Charger Placement with Individual Energy RequirementXingjian Ding, Jianxiong Guo, Deying Li 0001, Ding-Zhu Du. 697-710 [doi]
- An Efficient Algorithm for Routing and Recharging of Electric VehiclesTayebeh Bahreini, Nathan Fisher, Daniel Grosu. 711-726 [doi]
- The Optimization of Self-interference in Wideband Full-Duplex Phased Array with Joint Transmit and Receive BeamformingXiaoxin Wang, Zhipeng Jiang, Wenguo Yang, Suixiang Gao. 727-740 [doi]
- Oriented Coloring of msp-Digraphs and Oriented Co-graphs (Extended Abstract)Frank Gurski, Dominique Komander, Marvin Lindemann. 743-758 [doi]
- Star-Critical Ramsey Number of Large Cycle and BookYan Li, Yusheng Li, Ye Wang. 759-765 [doi]
- Computing Imbalance-Minimal Orderings for Bipartite Permutation Graphs and Threshold GraphsJan Gorzny. 766-779 [doi]
- Inductive Graph Invariants and Algorithmic ApplicationsC. R. Subramanian. 780-801 [doi]
- Constructing Order Type Graphs Using an Axiomatic ApproachSergey Bereg, Mohammadreza Haghpanah. 802-816 [doi]
- FISSION: A Practical Algorithm for Computing Minimum Balanced Node SeparatorsJohannes Blum 0001, Ruoying Li, Sabine Storandt. 817-832 [doi]