Journal: Algorithmica

Volume 71, Issue 4

775 -- 796Ashley Montanaro, Richard Jozsa, Graeme Mitchison. On Exact Quantum Query Complexity
797 -- 811Martin Knauer, Joachim Spoerhase. Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
812 -- 836Mathew C. Francis, Daniel Gonçalves 0001, Pascal Ochem. The Maximum Clique Problem in Multiple Interval Graphs
837 -- 858Martin Niemeier, Andreas Wiese. Scheduling with an Orthogonal Resource Constraint
859 -- 888Alexander Tiskin. Fast Distance Multiplication of Unit-Monge Matrices
889 -- 903Mangesh Gupte, Darja Krushevskaja, S. Muthukrishnan. Analyses of Cardinal Auctions
904 -- 968Francisco J. Soulignac. Fully Dynamic Recognition of Proper Circular-Arc Graphs
969 -- 988Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
989 -- 1006Esha Ghosh, Sudeshna Kolay, Mrinal Kumar 0001, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan. Faster Parameterized Algorithms for Deletion to Split Graphs
1007 -- 1020Bernard Chazelle, Wolfgang Mulzer. Data Structures on Event Graphs
1021 -- 1034Aleksander Vesel. Linear Recognition and Embedding of Fibonacci Cubes
1035 -- 1064Akira Matsubayashi. Asymptotically Optimal Online Page Migration on Three Points
1065 -- 1075Shin-ichi Tanigawa, Yuichi Yoshida. Testing the Supermodular-Cut Condition