Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 65
Volume 65, Number 1, January 2013
- Chaoyi Pang, Qing Zhang, Xiaofang Zhou
, David P. Hansen, Sen Wang, Anthony J. Maeder:
Computing Unrestricted Synopses Under Maximum Error Bound. 1-42 - Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: How Robots Benefit from Looking Back. 43-59 - Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak:
Collecting Weighted Items from a Dynamic Queue. 60-94 - Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff:
Exact and Parameterized Algorithms for Max Internal Spanning Tree. 95-128 - Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. 129-145 - David Peleg, Liam Roditty:
Relaxed Spanners for Directed Disk Graphs. 146-158 - Ali Çivril, Malik Magdon-Ismail:
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. 159-176 - Kyriaki Ioannidou, Stavros D. Nikolopoulos:
The Longest Path Problem Is Polynomial on Cocomparability Graphs. 177-205 - Ke Yi, Qin Zhang:
Optimal Tracking of Distributed Heavy Hitters and Quantiles. 206-223 - Benjamin Doerr, Leslie Ann Goldberg:
Adaptive Drift Analysis. 224-250
Volume 65, Number 2, February 2013
- János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
Online Clustering with Variable Sized Clusters. 251-274 - Dániel Marx, Ildikó Schlotter:
Cleaning Interval Graphs. 275-316 - Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara:
Route-Enabling Graph Orientation Problems. 317-338 - Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
Unified Compression-Based Acceleration of Edit-Distance Computation. 339-353 - Kuan-Yu Chen, Kun-Mao Chao:
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. 354-370 - Moshe Hershcovitch, Haim Kaplan:
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. 371-390 - Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-stage Robust Network Design with Exponential Scenarios. 391-408 - Graham Cormode, Michael Mitzenmacher, Justin Thaler:
Streaming Graph Computations with a Helpful Advisor. 409-442 - Chung-Shou Liao, D. T. Lee:
Power Domination in Circular-Arc Graphs. 443-466 - Bang Ye Wu:
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. 467-479
Volume 65, Number 3, March 2013
- Alfredo García Olaverri, Pedro Jodrá, Javier Tejel:
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon. 481-497 - Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh:
Improved Approximation Algorithms for the Spanning Star Forest Problem. 498-516 - Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Parameterized Complexity of Unique Coverage and Its Variants. 517-544 - MohammadHossein Bateni, Julia Chuzhoy:
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. 545-561 - Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. 562-583 - Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh:
Computing Optimal Steiner Trees in Polynomial Space. 584-604 - 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. 605-633 - Bhaskar DasGupta, S. Muthukrishnan:
Stochastic Budget Optimization in Internet Advertising. 634-661 - Shoshana Neuburger, Dina Sokol:
Succinct 2D Dictionary Matching. 662-684 - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith:
Sublinear Algorithms for Approximating String Compressibility. 685-709
Volume 65, Number 4, April 2013
- Venkatesh Raman, Saket Saurabh:
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. 711-712 - M. Praveen:
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. 713-753 - Stefan Kratsch, Frank Neumann:
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem. 754-771 - Benjamin A. Burton, Melih Ozlen:
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology. 772-801 - Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström:
Parameterized Two-Player Nash Equilibrium. 802-816 - Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k -CNF. 817-827 - Sylvain Guillemot, Florian Sikora:
Finding and Counting Vertex-Colored Subtrees. 828-844 - Pim van 't Hof, Yngve Villanger:
Proper Interval Vertex Deletion. 845-867 - Jesper Nederlof:
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. 868-884 - Frédéric Havet, Leonardo Sampaio Rocha:
On the Grundy and b-Chromatic Numbers of a Graph. 885-899 - Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez:
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. 900-926
a service of 
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-04-26 18:25 CEST 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:
