default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 71
Volume 71, Number 1, January 2015
- Fedor V. Fomin
, Geevarghese Philip, Yngve Villanger:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. 1-20 - Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. 21-35 - Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. 36-52 - T.-H. Hubert Chan, Mingfei Li, Li Ning:
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree. 53-65 - Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
Generalised k-Steiner Tree Problems in Normed Planes. 66-86 - Mingyu Xiao, Jiong Guo:
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. 87-97 - Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre:
On Tree-Constrained Matchings and Generalizations. 98-119 - Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. 120-138 - A. Karim Abu-Affash:
The Euclidean Bottleneck Full Steiner Tree Problem. 139-151 - Son Hoang Dau, Yeow Meng Chee:
Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures. 152-180 - Andreas Emil Feldmann, Peter Widmayer:
An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. 181-200 - Ashwin Guha, Ambedkar Dukkipati:
An Algorithmic Characterization of Polynomial Functions over Zpn. 201-218 - Ashish Chiplunkar, Sundar Vishwanathan:
Metrical Service Systems with Multiple Servers. 219-231
Volume 71, Number 2, February 2015
- Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath:
Monotone Drawings of Graphs with Fixed Embedding. 233-257 - Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching. 258-278 - Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György:
Online File Caching with Rejection Penalties. 279-306 - Hakan Yildiz, Subhash Suri:
Computing Klee's Measure of Grounded Boxes. 307-329 - Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz:
Parameterized Analysis of Paging and List Update Algorithms. 330-353 - Andreas Emil Feldmann, Luca Foschini:
Balanced Partitions of Trees and Applications. 354-376 - Gokarna Sharma, Costas Busch:
An Analysis Framework for Distributed Hierarchical Directories. 377-408 - Uriel Feige, Shlomo Jozeph:
Oblivious Algorithms for the Maximum Directed Cut Problem. 409-428 - Chih-Hung Liu, Evanthia Papadopoulou, Der-Tsai Lee:
The k-Nearest-Neighbor Voronoi Diagram Revisited. 429-449 - Quentin F. Stout:
Isotonic Regression for Multiple Independent Variables. 450-470 - Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu:
Linear-Time Algorithms for Tree Root Problems. 471-495 - Noga Alon, Amit Weinstein:
Local Correction with Constant Error Rate. 496-516 - Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Using Patterns to Form Homogeneous Teams. 517-538
Volume 71, Number 3, March 2015
- Gregory Z. Gutin, Stefan Szeider:
Guest Editorial: Special Issue on Parameterized and Exact Computation. 539-540 - Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. 541-565 - Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. 566-580 - Antonis Thomas, Jan van Leeuwen:
Pure Nash Equilibria in Graphical Games and Treewidth. 581-604 - Bart M. P. Jansen:
On Sparsification for Computing Treewidth. 605-635 - Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. 636-660 - Michael Elberfeld, Christoph Stockhusen, Till Tantau:
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness. 661-701 - Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu:
A Completeness Theory for Polynomial (Turing) Kernelization. 702-730 - Leizhen Cai, Yufei Cai:
Incompressibility of H-Free Edge Modification Problems. 731-757 - N. S. Narayanaswamy, R. Subashini:
Obtaining Matrices with the Consecutive Ones Property by Row Deletions. 758-773
Volume 71, Number 4, April 2015
- Ashley Montanaro, Richard Jozsa, Graeme Mitchison:
On Exact Quantum Query Complexity. 775-796 - Martin Knauer, Joachim Spoerhase:
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. 797-811 - Mathew C. Francis, Daniel Gonçalves, Pascal Ochem:
The Maximum Clique Problem in Multiple Interval Graphs. 812-836 - Martin Niemeier, Andreas Wiese:
Scheduling with an Orthogonal Resource Constraint. 837-858 - Alexander Tiskin:
Fast Distance Multiplication of Unit-Monge Matrices. 859-888 - Mangesh Gupte, Darja Krushevskaja, S. Muthukrishnan:
Analyses of Cardinal Auctions. 889-903 - Francisco J. Soulignac:
Fully Dynamic Recognition of Proper Circular-Arc Graphs. 904-968 - Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. 969-988 - Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. 989-1006 - Bernard Chazelle, Wolfgang Mulzer:
Data Structures on Event Graphs. 1007-1020 - Aleksander Vesel:
Linear Recognition and Embedding of Fibonacci Cubes. 1021-1034 - Akira Matsubayashi:
Asymptotically Optimal Online Page Migration on Three Points. 1035-1064 - Shin-ichi Tanigawa, Yuichi Yoshida:
Testing the Supermodular-Cut Condition. 1065-1075
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
