- 2013
- MohammadHossein Bateni, Julia Chuzhoy:
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. Algorithmica 65(3): 545-561 (2013) - Marcin Bienkowski
, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez
, Lukasz Jez, Grzegorz Stachowiak
:
Collecting Weighted Items from a Dynamic Queue. Algorithmica 65(1): 60-94 (2013) - Daniel Binkele-Raible, Henning Fernau
, Serge Gaspers, Mathieu Liedloff:
Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica 65(1): 95-128 (2013) - Hajo Broersma
, Fedor V. Fomin
, Pim van 't Hof
, Daniël Paulusma
:
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65(1): 129-145 (2013) - Benjamin A. Burton
, Melih Ozlen
:
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology. Algorithmica 65(4): 772-801 (2013) - Chris Calabro, Russell Impagliazzo
, Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k -CNF. Algorithmica 65(4): 817-827 (2013) - Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65(1): 43-59 (2013) - Kuan-Yu Chen, Kun-Mao Chao
:
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. Algorithmica 65(2): 354-370 (2013) - Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh:
Improved Approximation Algorithms for the Spanning Star Forest Problem. Algorithmica 65(3): 498-516 (2013) - Ali Çivril
, Malik Magdon-Ismail:
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. Algorithmica 65(1): 159-176 (2013) - Graham Cormode
, Michael Mitzenmacher, Justin Thaler:
Streaming Graph Computations with a Helpful Advisor. Algorithmica 65(2): 409-442 (2013) - János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
:
Online Clustering with Variable Sized Clusters. Algorithmica 65(2): 251-274 (2013) - Bhaskar DasGupta, S. Muthukrishnan:
Stochastic Budget Optimization in Internet Advertising. Algorithmica 65(3): 634-661 (2013) - Benjamin Doerr, Leslie Ann Goldberg:
Adaptive Drift Analysis. Algorithmica 65(1): 224-250 (2013) - Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Algorithmica 65(3): 562-583 (2013) - Fedor V. Fomin
, Fabrizio Grandoni
, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh:
Computing Optimal Steiner Trees in Polynomial Space. Algorithmica 65(3): 584-604 (2013) - Alfredo García Olaverri, Pedro Jodrá, Javier Tejel
:
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon. Algorithmica 65(3): 481-497 (2013) - Sylvain Guillemot, Frédéric Havet, Christophe Paul
, Anthony Perez:
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. Algorithmica 65(4): 900-926 (2013) - Sylvain Guillemot, Florian Sikora:
Finding and Counting Vertex-Colored Subtrees. Algorithmica 65(4): 828-844 (2013) - Frédéric Havet, Leonardo Sampaio Rocha
:
On the Grundy and b-Chromatic Numbers of a Graph. Algorithmica 65(4): 885-899 (2013) - Danny Hermelin
, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström
:
Parameterized Two-Player Nash Equilibrium. Algorithmica 65(4): 802-816 (2013) - Danny Hermelin
, Gad M. Landau, Shir Landau, Oren Weimann
:
Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica 65(2): 339-353 (2013) - Moshe Hershcovitch, Haim Kaplan:
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. Algorithmica 65(2): 371-390 (2013) - Pim van 't Hof
, Yngve Villanger:
Proper Interval Vertex Deletion. Algorithmica 65(4): 845-867 (2013) - Kyriaki Ioannidou, Stavros D. Nikolopoulos:
The Longest Path Problem Is Polynomial on Cocomparability Graphs. Algorithmica 65(1): 177-205 (2013) - Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono
, Hisao Tamaki, Ryuhei Uehara
:
Route-Enabling Graph Orientation Problems. Algorithmica 65(2): 317-338 (2013) - Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-stage Robust Network Design with Exponential Scenarios. Algorithmica 65(2): 391-408 (2013) - Stefan Kratsch, Frank Neumann
:
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem. Algorithmica 65(4): 754-771 (2013) - Tak Wah Lam
, Lap-Kei Lee
, Isaac Kar-Keung To, Prudence W. H. Wong
:
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy. Algorithmica 65(3): 605-633 (2013) - Chung-Shou Liao, D. T. Lee:
Power Domination in Circular-Arc Graphs. Algorithmica 65(2): 443-466 (2013)