Abstract is missing.
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition ProblemLi-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith. [doi]
- Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External ForcesAaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt. [doi]
- Structural Pattern Matching - SuccinctlyArnab Ganguly 0002, Rahul Shah, Sharma V. Thankachan. [doi]
- On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss TransformsCasper Benjamin Freksen, Kasper Green Larsen. [doi]
- Dynamic Conflict-Free Colorings in the PlaneMark de Berg, Aleksandar Markovic 0001. [doi]
- On Maximal Cliques with Connectivity Constraints in Directed GraphsAlessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa. [doi]
- Voronoi Diagrams for Parallel Halflines and Line Segments in SpaceFranz Aurenhammer, Bert Jüttler, Günter Paulini. [doi]
- A Simple Greedy Algorithm for Dynamic Graph OrientationEdvin Berglin, Gerth Stølting Brodal. [doi]
- Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow ProblemsMordecai J. Golin, Hadi Khodabande, Bo Qin. [doi]
- Tight Approximation for Partial Vertex Cover with Hard CapacitiesJia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee. [doi]
- Finding Pairwise Intersections of Rectangles in a Query RectangleEunjin Oh 0001, Hee-Kap Ahn. [doi]
- Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}Piotr Sankowski, Piotr Wygocki. [doi]
- Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval GraphsAthanasios L. Konstantinidis, Charis Papadopoulos. [doi]
- Complexity of Coloring Reconfiguration under Recolorability ConstraintsHiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou. [doi]
- Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded StringsYuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
- Structural Parameters, Tight Bounds, and Approximation for (k, r)-CenterIoannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos. [doi]
- Smart Contract Execution - the (+-)-Biased Ballot ProblemLin Chen, Lei Xu 0012, Zhimin Gao, Nolan Shah, Yang Lu, Weidong Shi. [doi]
- Improved Algorithms for Scheduling Unsplittable Flows on PathsHamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman. [doi]
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree SpannerDavide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. [doi]
- Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for PolygonsJoachim Gudmundsson, Rasmus Pagh. [doi]
- Improved Bounds for Online Dominating Sets of TreesKoji M. Kobayashi. [doi]
- Faster DBScan and HDBScan in Low-Dimensional Euclidean SpacesMark de Berg, Ade Gunawan, Marcel Roeloffzen. [doi]
- Dominance Product and High-Dimensional Closest Pair under L_inftyOmer Gold, Micha Sharir. [doi]
- Succinct Color Searching in One DimensionHicham El-Zein, J. Ian Munro, Yakov Nekrich. [doi]
- Fast Compressed Self-Indexes with Deterministic Linear-Time ConstructionJ. Ian Munro, Gonzalo Navarro, Yakov Nekrich. [doi]
- Embedding Graphs into Embedded GraphsRadoslav Fulek. [doi]
- Front Matter, Table of Contents, Preface, External Reviewers [doi]
- Complexity of the Multi-Service Center ProblemTakehiro Ito, Naonori Kakimura, Yusuke Kobayashi 0001. [doi]
- Hybrid VCSPs with Crisp and Valued Conservative TemplatesRustem Takhanov. [doi]
- Computational Philosophy: On Fairness in Automated Decision MakingSuresh Venkatasubramanian. [doi]
- Orthogonal Vectors IndexingIsaac Goldstein, Moshe Lewenstein, Ely Porat. [doi]
- On Structural Parameterizations of the Edge Disjoint Paths ProblemRobert Ganian, Sebastian Ordyniak, Ramanujan Sridharan. [doi]
- Optimal Matroid Partitioning ProblemsYasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita. [doi]
- Jointly Stable MatchingsShuichi Miyazaki, Kazuya Okamoto. [doi]
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo ProblemYao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang 0008. [doi]
- A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off AlgorithmsEunjin Oh 0001, Hee-Kap Ahn. [doi]
- Routing on the Visibility GraphProsenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot. [doi]
- On the Convergence Time of a Natural Dynamics for Linear ProgrammingVincenzo Bonifaci. [doi]
- Placing your Coins on a ShelfHelmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn. [doi]
- Faster Algorithms for Half-Integral T-Path PackingMaxim A. Babenko, Stepan Artamonov. [doi]
- Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested GraphsGiordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson. [doi]
- On Directed Covering and Domination ProblemsTesshu Hanaka, Naomi Nishimura, Hirotaka Ono. [doi]
- An Efficient Sum Query Algorithm for Distance-based Locally Dominating FunctionsZiyun Huang, Jinhui Xu 0001. [doi]
- Routing in Polygonal DomainsBahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert. [doi]
- Settlement Fund Circulation ProblemHitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno. [doi]
- Non-Crossing Geometric Steiner ArborescencesIrina Kostitsyna, Bettina Speckmann, Kevin Verbeek. [doi]
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching ProgramsAtsuki Nagao, Kazuhisa Seto, Junichi Teruyama. [doi]
- Envy-free Matchings with Lower QuotasYu Yokoi. [doi]
- Barrier Coverage with Non-uniform Lengths to Minimize Aggregate MovementsSerge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele. [doi]
- Temporal Hierarchical ClusteringTamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos. [doi]
- Study of a Combinatorial Game in Graphs Through Linear ProgrammingNathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. [doi]
- Faster Algorithms for Growing Prioritized Disks and RectanglesHee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh 0001, Ji-Won Park, André van Renssen, Antoine Vigneron. [doi]
- Conflict-Free Coloring of Intersection GraphsSándor P. Fekete, Phillip Keldenich. [doi]
- Precedence-Constrained Min Sum Set CoverJessica McClintock, Julián Mestre, Anthony Wirth. [doi]
- Independent Feedback Vertex Set for P_5-free GraphsMarthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma. [doi]
- Agnostically Learning Boolean Functions with Finite Polynomial RepresentationNing Ding. [doi]
- Decomposing a Graph into Shortest Paths with Bounded EccentricityEtienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot. [doi]
- On the Number of p4-Tilings by an n-OminoKazuyuki Amano, Yoshinobu Haruyama. [doi]
- Shortcuts for the CircleSang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos. [doi]
- Network Optimization on Partitioned Pairs of PointsEsther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell. [doi]
- Maximum Induced Matching Algorithms via Vertex Ordering CharacterizationsMichel Habib, Lalla Mouatadid. [doi]
- On-the-Fly Array Initialization in Less SpaceTorben Hagerup, Frank Kammer. [doi]
- Weighted Linear Matroid ParitySatoru Iwata. [doi]
- Crossing Number for Graphs with Bounded~PathwidthTherese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel. [doi]
- Sorting with Recurrent Comparison ErrorsBarbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu, Paolo Penna. [doi]
- An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position ConstraintGruia Calinescu, Florian Jaehn, Minming Li, Kai Wang. [doi]
- Fully Dynamic Connectivity Oracles under General Vertex UpdatesKengo Nakamura. [doi]
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to PointsMark de Berg, Tim Leijsen, Aleksandar Markovic 0001, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger. [doi]