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

Volume 71, Issue 3

539 -- 540Gregory Z. Gutin, Stefan Szeider. Guest Editorial: Special Issue on Parameterized and Exact Computation
541 -- 565Edouard Bonnet, Bruno Escoffier, Eun Jung Kim 0002, Vangelis Th. Paschos. On Subexponential and FPT-Time Inapproximability
566 -- 580Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire. Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization
581 -- 604Antonis Thomas, Jan van Leeuwen. Pure Nash Equilibria in Graphical Games and Treewidth
605 -- 635Bart M. P. Jansen. On Sparsification for Computing Treewidth
636 -- 660Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof. Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
661 -- 701Michael Elberfeld, Christoph Stockhusen, Till Tantau. On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness
702 -- 730Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu. A Completeness Theory for Polynomial (Turing) Kernelization
731 -- 757Leizhen Cai, Yufei Cai. Incompressibility of H-Free Edge Modification Problems
758 -- 773N. S. Narayanaswamy, R. Subashini. Obtaining Matrices with the Consecutive Ones Property by Row Deletions

Volume 71, Issue 2

233 -- 257Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath. Monotone Drawings of Graphs with Fixed Embedding
258 -- 278Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter. Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching
279 -- 306Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György. Online File Caching with Rejection Penalties
307 -- 329Hakan Yildiz, Subhash Suri. Computing Klee's Measure of Grounded Boxes
330 -- 353Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz. Parameterized Analysis of Paging and List Update Algorithms
354 -- 376Andreas Emil Feldmann, Luca Foschini. Balanced Partitions of Trees and Applications
377 -- 408Gokarna Sharma, Costas Busch. An Analysis Framework for Distributed Hierarchical Directories
409 -- 428Uriel Feige, Shlomo Jozeph. Oblivious Algorithms for the Maximum Directed Cut Problem
429 -- 449Chih-Hung Liu, Evanthia Papadopoulou, Der-Tsai Lee. The k-Nearest-Neighbor Voronoi Diagram Revisited
450 -- 470Quentin F. Stout. Isotonic Regression for Multiple Independent Variables
471 -- 495Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu. Linear-Time Algorithms for Tree Root Problems
496 -- 516Noga Alon, Amit Weinstein. Local Correction with Constant Error Rate
517 -- 538Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip. Using Patterns to Form Homogeneous Teams

Volume 71, Issue 1

1 -- 20Fedor V. Fomin, Geevarghese Philip, Yngve Villanger. Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
21 -- 35Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma. List Coloring in the Absence of a Linear Forest
36 -- 52Aparna Das, Emden R. Gansner, Michael Kaufmann 0001, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff. Approximating Minimum Manhattan Networks in Higher Dimensions
53 -- 65T.-H. Hubert Chan, Mingfei Li, Li Ning. Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree
66 -- 86Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas. Generalised k-Steiner Tree Problems in Normed Planes
87 -- 97Mingyu Xiao, Jiong Guo. A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments
98 -- 119Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre. On Tree-Constrained Matchings and Generalizations
120 -- 138Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda. Colored Hypergraph Isomorphism is Fixed Parameter Tractable
139 -- 151A. Karim Abu-Affash. The Euclidean Bottleneck Full Steiner Tree Problem
152 -- 180Son Hoang Dau, Yeow Meng Chee. Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures
181 -- 200Andreas Emil Feldmann, Peter Widmayer. 4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
201 -- 218Ashwin Guha, Ambedkar Dukkipati. n
219 -- 231Ashish Chiplunkar, Sundar Vishwanathan. Metrical Service Systems with Multiple Servers