Abstract is missing.
- A Time-Space Trade-Off for Triangulations of Points in the PlaneHee-Kap Ahn, Nicola Baraldo, Eunjin Oh 0001, Francesco Silvestri. 3-12 [doi]
- V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-PolytopesEi Ando, Shuji Kijima. 13-24 [doi]
- Local Search Strikes Again: PTAS for Variants of Geometric Covering and PackingPradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan. 25-37 [doi]
- Depth Distribution in High DimensionsJérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma. 38-49 [doi]
- An Improved Lower Bound on the Growth Constant of PolyiamondsGill Barequet, Mira Shalah, Yufei Zheng. 50-61 [doi]
- Constrained Routing Between Non-Visible VerticesProsenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot. 62-74 [doi]
- Deletion Graph Problems Based on Deadlock ResolutionAlan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza. 75-86 [doi]
- Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and ApplicationsSankardeep Chakraborty, Srinivasa Rao Satti. 87-98 [doi]
- Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few HolesPanagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 99-111 [doi]
- The Approximability of the p-hub Center Problem with Parameterized Triangle InequalityLi-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing. 112-123 [doi]
- Approximation Algorithms for the Maximum Weight Internal Spanning Tree ProblemZhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang. 124-136 [doi]
- Incentive Ratios of a Proportional Sharing Mechanism in Resource SharingZhou Chen, Yukun Cheng, Qi Qi, Xiang Yan. 137-149 [doi]
- Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal GraphAlessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa. 150-161 [doi]
- Reoptimization of Minimum Latency ProblemWenkai Dai. 162-174 [doi]
- Pure Nash Equilibria in Restricted Budget GamesMaximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik. 175-187 [doi]
- A New Kernel for Parameterized Max-Bisection Above Tight Lower BoundQilong Feng, Senmin Zhu, Jianxin Wang. 188-199 [doi]
- Information Complexity of the AND Function in the Two-Party and Multi-party SettingsYuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You. 200-211 [doi]
- Optimal Online Two-Way Trading with Bounded Number of TransactionsStanley P. Y. Fung. 212-223 [doi]
- Parameterized Shifted Combinatorial OptimizationJakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn. 224-236 [doi]
- Approximate Minimum DiameterMohammad Ghodsi, Hamid Homapour, Masoud Seddighin. 237-249 [doi]
- On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth ReductionPurnata Ghosal, Om Prakash, B. V. Raghavendra Rao. 250-261 [doi]
- A Tighter Relation Between Sensitivity Complexity and Certificate ComplexityKun He, Qian Li, Xiaoming Sun. 262-274 [doi]
- Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary GenusKuan-Yi Ho, Yi-Jun Chang, Hsu-Chun Yen. 275-286 [doi]
- Reconfiguration of Maximum-Weight b-Matchings in a GraphTakehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto. 287-296 [doi]
- Constant Approximation for Stochastic Orienteering Problem with (1+ε)-Budget RelaxiationYiyao Jiang. 297-308 [doi]
- Quantum Query Complexity of Unitary Operator DiscriminationAkinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki. 309-320 [doi]
- Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and ExtendedElena Khramtcova, Evanthia Papadopoulou. 321-332 [doi]
- NP-completeness Results for Partitioning a Graph into Total Dominating SetsMikko Koivisto, Petteri Laakkonen, Juho Lauri. 333-345 [doi]
- Strong Triadic Closure in Cographs and Graphs of Low Maximum DegreeAthanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos. 346-358 [doi]
- Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite GraphsHoàng-Oanh Le, Van Bang Le. 359-370 [doi]
- Faster Graph Coloring in Polynomial SpaceSerge Gaspers, Edward J. Lee. 371-383 [doi]
- On the Modulo Degree Complexity of Boolean FunctionsQian Li, Xiaoming Sun. 384-395 [doi]
- Approximating Weighted Duo-Preservation in Comparative GenomicsSaeed Mehrabi. 396-406 [doi]
- An Incentive Compatible, Efficient Market for Air Traffic Flow ManagementRuta Mehta, Vijay V. Vazirani. 407-419 [doi]
- Linear Representation of Transversal Matroids and Gammoids Parameterized by RankPranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh. 420-432 [doi]
- Dynamic Rank-Maximal MatchingsPrajakta Nimbhorkar, Arvind Rameshwar V. 433-444 [doi]
- Bend Complexity and Hamiltonian Cycles in Grid GraphsRahnuma Islam Nishat, Sue Whitesides. 445-456 [doi]
- Optimal Covering and Hitting of Line Segments by Two Axis-Parallel SquaresSanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy. 457-468 [doi]
- Complexity and Algorithms for Finding a Subset of Vectors with the Longest SumVladimir Shenmaier. 469-480 [doi]
- Simple O(n~log^2~n) Algorithms for the Planar 2-Center ProblemXuehou Tan, Bo Jiang. 481-491 [doi]
- Stable Matchings in TreesSatoshi Tayu, Shuichi Ueno. 492-503 [doi]
- Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph ModelsSumedh Tirodkar, Sundar Vishwanathan. 504-515 [doi]
- Approximation Algorithms for Scheduling Multiple Two-Stage FlowshopsGuangwei Wu, Jianxin Wang. 516-528 [doi]
- The Existence of Universally Agreed Fairest Semi-matchings in Any Given Bipartite GraphJian Xu, Soumya Banerjee, Wenjing Rao. 529-541 [doi]
- Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover ProblemsWei Yu 0011, Zhaohui Liu. 542-554 [doi]
- On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random GraphsCongsong Zhang, Yong Gao. 555-567 [doi]
- A Local Search Approximation Algorithm for the k-means Problem with PenaltiesDongmei Zhang, Chunlin Hao, Chenchen wu, Dachuan Xu, Zhenning Zhang. 568-574 [doi]
- Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures PredictionAizhong Zhou, Haitao Jiang, Jiong Guo, Haodi Feng, Nan Liu, Binhai Zhu. 575-587 [doi]
- Cooperative Game Theory Approaches for Network PartitioningKonstantin E. Avrachenkov, Aleksei Yu. Kondratev, Vladimir V. Mazalov. 591-602 [doi]
- Chain of Influencers: Multipartite Intra-community RankingPavla Drázdilová, Jan Konecny, Milos Kudelka. 603-614 [doi]
- Influence Spread in Social Networks with both Positive and Negative InfluencesJing (Selena) He, Ying Xie, Tianyu Du, Shouling Ji, Zhao Li. 615-629 [doi]
- Guided Genetic Algorithm for the Influence Maximization ProblemPavel Krömer, Jana Nowaková. 630-641 [doi]
- Optimal Local Routing Strategies for Community Structured Time Varying Communication NetworksSuchi Kumari, Anurag Singh, Hocine Cherifi. 642-653 [doi]
- Graph Construction Based on Local RepresentativenessEliska Ochodkova, Sarka Zehnalova, Milos Kudelka. 654-665 [doi]
- SHADE Algorithm Dynamic Analyzed Through Complex NetworkAdam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy. 666-677 [doi]
- An Efficient Potential Member Promotion Algorithm in Social Networks via SkylineSiman Zhang, Jiping Zheng. 678-690 [doi]