Journal: Algorithmica

Volume 80, Issue 1

1 -- 28Franz J. Brandenburg. Recognizing Optimal 1-Planar Graphs in Linear Time
29 -- 47Rémy Belmonte, Yota Otachi, Pascal Schweitzer. Induced Minor Free Graphs: Isomorphism and Clique-Width
48 -- 72Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris. Near-Optimal Asymmetric Binary Matrix Partitions
73 -- 103Katharina T. Huber, G. E. Scholz. Beyond Representing Orthology Relations by Trees
104 -- 115Victor A. Campos, Ana Silva. Edge-b-Coloring Trees
116 -- 135Eun Jung Kim 0002, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition
136 -- 154Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu. 3D Rectangulations and Geometric Matrix Multiplication
155 -- 184Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý. Colored Bin Packing: Online Algorithms and Lower Bounds
185 -- 208Ashwin Arulselvan, Ágnes Cseh, Martin Groß 0001, David F. Manlove, Jannik Matuschke. Matchings with Lower Quotas: Algorithms and Complexity
209 -- 233Frédéric Giroire, Frédéric Havet, Joanna Moulierac. On the Complexity of Compressing Two Dimensional Routing Tables with Order
234 -- 257Stefan Felsner, Alexander Pilz. Ham-Sandwich Cuts for Abstract Order Types
258 -- 278Ildikó Schlotter, Katarína Cechlárová. A Connection Between Sports and Matroids: How Many Teams Can We Beat?
279 -- 299Sariel Har-Peled, Nirman Kumar. Robust Proximity Search for Balls Using Sublinear Space
300 -- 330Ghurumuruhan Ganesan. Stretch and Diameter in Random Geometric Graphs
331 -- 397Abram Magner, Wojciech Szpankowski. Profiles of PATRICIA Tries
398 -- 409Peng Zhang 0008, Bin Fu, Linqing Tang. Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem
410 -- 413Bert Besser, Matthias Poloczek. Erratum to: Greedy Matching: Guarantees and Limitations