Abstract is missing.
- Subspace Approximation with OutliersAmit Deshpande, Rameshwar Pratap. 1-13 [doi]
- Linear-Time Algorithms for Eliminating Claws in GraphsFlavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter. 14-26 [doi]
- A New Lower Bound for the Eternal Vertex Cover Number of GraphsJasine Babu, Veena Prabhakaran. 27-39 [doi]
- Bounded-Degree Spanners in the Presence of Polygonal ObstaclesAndré van Renssen, Gladys Wong. 40-51 [doi]
- End-Vertices of AT-free BigraphsJan Gorzny, Jing Huang. 52-63 [doi]
- Approaching Optimal Duplicate Detection in a Sliding WindowRémi Géraud-Stewart, Marius Lombard-Platet, David Naccache. 64-84 [doi]
- Computational Complexity Characterization of Protecting Elections from BriberyLin Chen 0009, Ahmed Sunny, Lei Xu 0012, Shouhuai Xu, Zhimin Gao, Yang Lu 0010, Weidong Shi, Nolan Shah. 85-97 [doi]
- Coding with Noiseless Feedback over the Z-ChannelChristian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii. 98-109 [doi]
- Path-Monotonic Upward Drawings of GraphsSeok-Hee Hong, Hiroshi Nagamochi. 110-122 [doi]
- Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road NetworksStefan Funke. 123-135 [doi]
- Visibility Polygon Queries Among Dynamic Polygonal Obstacles in PlaneSanjana Agrawal, R. Inkulu. 136-148 [doi]
- How Hard Is Completeness Reasoning for Conjunctive Queries?Xianmin Liu, Jianzhong Li 0001, Yingshu Li. 149-161 [doi]
- Imbalance Parameterized by Twin Cover RevisitedNeeldhara Misra, Harshil Mittal. 162-173 [doi]
- Local Routing in a Tree Metric 1-SpannerMilutin Brankovic, Joachim Gudmundsson, André van Renssen. 174-185 [doi]
- Deep Specification Mining with AttentionZhi Cao, Nan Zhang. 186-197 [doi]
- Constructing Independent Spanning Trees in Alternating Group NetworksJie-Fu Huang, Sun-Yuan Hsieh. 198-209 [doi]
- W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton DimensionJohannes Blum. 210-221 [doi]
- An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the PlanePatrick Eades, Julián Mestre. 222-233 [doi]
- Quantum Speedup for the Minimum Steiner Tree ProblemMasayuki Miyamoto, Masakazu Iwamura, Koichi Kise, François Le Gall. 234-245 [doi]
- Access Structure Hiding Secret Sharing from Novel Set Systems and Vector FamiliesVipin Singh Sehrawat, Yvo Desmedt. 246-261 [doi]
- Approximation Algorithms for Car-Sharing ProblemsKelin Luo, Frits C. R. Spieksma. 262-273 [doi]
- Realization Problems on Reachability SequencesMatthew Dippel, Ravi Sundaram, Akshar Varma. 274-286 [doi]
- Power of Decision Trees with Monotone QueriesPrashanth Amireddy, Sai Jayasurya, Jayalal Sarma. 287-298 [doi]
- Computing a Maximum Clique in Geometric Superclasses of Disk GraphsNicolas Grelier. 299-310 [doi]
- Shortest Watchman Tours in Simple Polygons Under Rotated Monotone VisibilityBengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski. 311-323 [doi]
- Tight Approximation for the Minimum Bottleneck Generalized Matching ProblemJulián Mestre, Nicolás E. Stier Moses. 324-334 [doi]
- Graph Classes and Approximability of the Happy Set ProblemYuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru. 335-346 [doi]
- A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning SubgraphsStephan Beyer, Markus Chimani, Joachim Spoerhase. 347-359 [doi]
- Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix GamesGregory Z. Gutin, Philip R. Neary, Anders Yeo. 360-371 [doi]
- On the Enumeration of Minimal Non-pairwise Compatibility GraphsNaveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi. 372-383 [doi]
- Constructing Tree Decompositions of Graphs with Bounded GonalityHans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit. 384-396 [doi]
- Election Control Through Social Influence with Unknown PreferencesMohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo. 397-410 [doi]
- 5-Free GraphsKathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi. 411-422 [doi]
- New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing ProblemKhadija Hadj Salem, Yann Kieffer. 423-434 [doi]
- On the Area Requirements of Planar Greedy Drawings of Triconnected Planar GraphsGiordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati. 435-447 [doi]
- On the Restricted 1-Steiner Tree ProblemProsenjit Bose, Anthony D'Angelo, Stephane Durocher. 448-459 [doi]
- Computational Complexity of Synchronization Under Regular Commutative ConstraintsStefan Hoffmann. 460-471 [doi]
- Approximation Algorithms for General Cluster Routing ProblemXiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun. 472-483 [doi]
- Hardness of Sparse Sets and Minimal Circuit Size ProblemBin Fu. 484-495 [doi]
- Succinct Monotone Circuit Certification: Planarity and Parameterized ComplexityMateus Rodrigues Alves, Mateus de Oliveira Oliveira, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza. 496-507 [doi]
- On Measures of Space over Real and Complex NumbersOm Prakash 0002, B. V. Raghavendra Rao. 508-519 [doi]
- Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality ConstraintHongxiang Zhang, Dachuan Xu, Longkun Guo, Jingjing Tan. 520-531 [doi]
- An Improved Bregman k-means++ Algorithm via Local SearchXiaoyun Tian, Dachuan Xu, Longkun Guo, Dan Wu. 532-541 [doi]
- Approximating Maximum Acyclic Matchings by Greedy and Local Search StrategiesJulien Baste, Maximilian Fürst, Dieter Rautenbach. 542-553 [doi]
- On the Complexity of Directed Intersection Representation of DAGsAndrea Caucchiolo, Ferdinando Cicalese. 554-565 [doi]
- On the Mystery of Negations in Circuits: Structure vs PowerPrashanth Amireddy, Sai Jayasurya, Jayalal Sarma. 566-577 [doi]
- Even Better Fixed-Parameter Algorithms for Bicluster EditingManuel Lafond. 578-590 [doi]
- Approximate Set Union via Approximate RandomizationBin Fu, Pengfei Gu, Yuming Zhao. 591-602 [doi]
- A Non-Extendibility Certificate for Submodularity and ApplicationsUmang Bhaskar, Gunjan Kumar. 603-614 [doi]
- Parameterized Complexity of Maximum Edge Colorable SubgraphAkanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh 0001, Prafullkumar Tale. 615-626 [doi]
- Approximation Algorithms for the Lower-Bounded k-Median and Its GeneralizationsLu Han, Chunlin Hao, Chenchen wu, Zhenning Zhang. 627-639 [doi]
- A Survey for Conditional Diagnosability of Alternating Group NetworksNai-Wen Chang 0002, Sun-Yuan Hsieh. 640-651 [doi]
- Fixed Parameter Tractability of Graph Deletion Problems over Data StreamsArijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh 0001. 652-663 [doi]
- Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded SeparatorsIvona Bezáková, Wenbo Sun. 664-676 [doi]