Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/algorithmica/algorithmica65.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/BateniC13,
author = {MohammadHossein Bateni and
Julia Chuzhoy},
title = {Approximation Algorithms for the Directed \emph{k}-Tour and \emph{k}-Stroll
Problems},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {545--561},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9610-6},
doi = {10.1007/S00453-011-9610-6},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BateniC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BienkowskiCDHJJS13,
author = {Marcin Bienkowski and
Marek Chrobak and
Christoph D{\"{u}}rr and
Mathilde Hurand and
Artur Jez and
Lukasz Jez and
Grzegorz Stachowiak},
title = {Collecting Weighted Items from a Dynamic Queue},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {60--94},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9574-6},
doi = {10.1007/S00453-011-9574-6},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BienkowskiCDHJJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Binkele-RaibleFGL13,
author = {Daniel Binkele{-}Raible and
Henning Fernau and
Serge Gaspers and
Mathieu Liedloff},
title = {Exact and Parameterized Algorithms for Max Internal Spanning Tree},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {95--128},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9575-5},
doi = {10.1007/S00453-011-9575-5},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Binkele-RaibleFGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BroersmaFHP13,
author = {Hajo Broersma and
Fedor V. Fomin and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {129--145},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9576-4},
doi = {10.1007/S00453-011-9576-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BroersmaFHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BurtonO13,
author = {Benjamin A. Burton and
Melih Ozlen},
title = {A Tree Traversal Algorithm for Decision Problems in Knot Theory and
3-Manifold Topology},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {772--801},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9645-3},
doi = {10.1007/S00453-012-9645-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BurtonO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CalabroIP13,
author = {Chris Calabro and
Russell Impagliazzo and
Ramamohan Paturi},
title = {On the Exact Complexity of Evaluating Quantified \emph{k} -CNF},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {817--827},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9648-0},
doi = {10.1007/S00453-012-9648-0},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CalabroIP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Chalopin0DMW13,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Shantanu Das and
Yann Disser and
Mat{\'{u}}s Mihal{\'{a}}k and
Peter Widmayer},
title = {Mapping Simple Polygons: How Robots Benefit from Looking Back},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {43--59},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9572-8},
doi = {10.1007/S00453-011-9572-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Chalopin0DMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenC13,
author = {Kuan{-}Yu Chen and
Kun{-}Mao Chao},
title = {A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length
Encoded Strings},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {354--370},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9592-4},
doi = {10.1007/S00453-011-9592-4},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenENRRS13,
author = {Ning Chen and
Roee Engelberg and
C. Thach Nguyen and
Prasad Raghavendra and
Atri Rudra and
Gyanit Singh},
title = {Improved Approximation Algorithms for the Spanning Star Forest Problem},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {498--516},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9607-1},
doi = {10.1007/S00453-011-9607-1},
timestamp = {Sun, 26 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenENRRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CivrilM13,
author = {Ali {\c{C}}ivril and
Malik Magdon{-}Ismail},
title = {Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {159--176},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9582-6},
doi = {10.1007/S00453-011-9582-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CivrilM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CormodeMT13,
author = {Graham Cormode and
Michael Mitzenmacher and
Justin Thaler},
title = {Streaming Graph Computations with a Helpful Advisor},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {409--442},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9598-y},
doi = {10.1007/S00453-011-9598-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CormodeMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CsirikEIL13,
author = {J{\'{a}}nos Csirik and
Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin},
title = {Online Clustering with Variable Sized Clusters},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {251--274},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9586-2},
doi = {10.1007/S00453-011-9586-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CsirikEIL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DasGuptaM13,
author = {Bhaskar DasGupta and
S. Muthukrishnan},
title = {Stochastic Budget Optimization in Internet Advertising},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {634--661},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9614-x},
doi = {10.1007/S00453-012-9614-X},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DasGuptaM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrG13,
author = {Benjamin Doerr and
Leslie Ann Goldberg},
title = {Adaptive Drift Analysis},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {224--250},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9585-3},
doi = {10.1007/S00453-011-9585-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FlocchiniIPS13,
author = {Paola Flocchini and
David Ilcinkas and
Andrzej Pelc and
Nicola Santoro},
title = {Computing Without Communicating: Ring Exploration by Asynchronous
Oblivious Robots},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {562--583},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9611-5},
doi = {10.1007/S00453-011-9611-5},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FlocchiniIPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominGKLS13,
author = {Fedor V. Fomin and
Fabrizio Grandoni and
Dieter Kratsch and
Daniel Lokshtanov and
Saket Saurabh},
title = {Computing Optimal Steiner Trees in Polynomial Space},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {584--604},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9612-z},
doi = {10.1007/S00453-012-9612-Z},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FominGKLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GarciaJT13,
author = {Alfredo Garc{\'{\i}}a Olaverri and
Pedro Jodr{\'{a}} and
Javier Tejel},
title = {Computing a Hamiltonian Path of Minimum Euclidean Length Inside a
Simple Polygon},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {481--497},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9603-5},
doi = {10.1007/S00453-011-9603-5},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GarciaJT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuillemotHPP13,
author = {Sylvain Guillemot and
Fr{\'{e}}d{\'{e}}ric Havet and
Christophe Paul and
Anthony Perez},
title = {On the (Non-)Existence of Polynomial Kernels for \emph{P} \({}_{\mbox{
\emph{l} }}\)-Free Edge Modification Problems},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {900--926},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9619-5},
doi = {10.1007/S00453-012-9619-5},
timestamp = {Mon, 24 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuillemotHPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuillemotS13,
author = {Sylvain Guillemot and
Florian Sikora},
title = {Finding and Counting Vertex-Colored Subtrees},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {828--844},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9600-8},
doi = {10.1007/S00453-011-9600-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuillemotS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HavetS13,
author = {Fr{\'{e}}d{\'{e}}ric Havet and
Leonardo Sampaio Rocha},
title = {On the Grundy and \emph{b}-Chromatic Numbers of a Graph},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {885--899},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9604-4},
doi = {10.1007/S00453-011-9604-4},
timestamp = {Mon, 16 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HavetS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinHKW13,
author = {Danny Hermelin and
Chien{-}Chung Huang and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Parameterized Two-Player Nash Equilibrium},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {802--816},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9609-z},
doi = {10.1007/S00453-011-9609-Z},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinHKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinLLW13,
author = {Danny Hermelin and
Gad M. Landau and
Shir Landau and
Oren Weimann},
title = {Unified Compression-Based Acceleration of Edit-Distance Computation},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {339--353},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9590-6},
doi = {10.1007/S00453-011-9590-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinLLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HershcovitchK13,
author = {Moshe Hershcovitch and
Haim Kaplan},
title = {{I/O} Efficient Dynamic Data Structures for Longest Prefix Queries},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {371--390},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9594-2},
doi = {10.1007/S00453-011-9594-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HershcovitchK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HofV13,
author = {Pim van 't Hof and
Yngve Villanger},
title = {Proper Interval Vertex Deletion},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {845--867},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9661-3},
doi = {10.1007/S00453-012-9661-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HofV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IoannidouN13,
author = {Kyriaki Ioannidou and
Stavros D. Nikolopoulos},
title = {The Longest Path Problem Is Polynomial on Cocomparability Graphs},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {177--205},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9583-5},
doi = {10.1007/S00453-011-9583-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/IoannidouN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ItoMOTU13,
author = {Takehiro Ito and
Yuichiro Miyamoto and
Hirotaka Ono and
Hisao Tamaki and
Ryuhei Uehara},
title = {Route-Enabling Graph Orientation Problems},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {317--338},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9589-z},
doi = {10.1007/S00453-011-9589-Z},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ItoMOTU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhandekarKMS13,
author = {Rohit Khandekar and
Guy Kortsarz and
Vahab S. Mirrokni and
Mohammad R. Salavatipour},
title = {Two-stage Robust Network Design with Exponential Scenarios},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {391--408},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9596-0},
doi = {10.1007/S00453-011-9596-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhandekarKMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KratschN13,
author = {Stefan Kratsch and
Frank Neumann},
title = {Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {754--771},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9660-4},
doi = {10.1007/S00453-012-9660-4},
timestamp = {Mon, 30 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KratschN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LamLTW13,
author = {Tak Wah Lam and
Lap{-}Kei Lee and
Isaac Kar{-}Keung To and
Prudence W. H. Wong},
title = {Online Speed Scaling Based on Active Job Count to Minimize Flow Plus
Energy},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {605--633},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9613-y},
doi = {10.1007/S00453-012-9613-Y},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LamLTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiaoL13,
author = {Chung{-}Shou Liao and
D. T. Lee},
title = {Power Domination in Circular-Arc Graphs},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {443--466},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9599-x},
doi = {10.1007/S00453-011-9599-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiaoL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MarxS13,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Cleaning Interval Graphs},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {275--316},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9588-0},
doi = {10.1007/S00453-011-9588-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MarxS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MisraMRSS13,
author = {Neeldhara Misra and
Hannes Moser and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
title = {The Parameterized Complexity of Unique Coverage and Its Variants},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {517--544},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9608-0},
doi = {10.1007/S00453-011-9608-0},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MisraMRSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Nederlof13,
author = {Jesper Nederlof},
title = {Fast Polynomial-Space Algorithms Using Inclusion-Exclusion},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {868--884},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9630-x},
doi = {10.1007/S00453-012-9630-X},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Nederlof13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NeuburgerS13,
author = {Shoshana Neuburger and
Dina Sokol},
title = {Succinct 2D Dictionary Matching},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {662--684},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9615-9},
doi = {10.1007/S00453-012-9615-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NeuburgerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PangZZHWM13,
author = {Chaoyi Pang and
Qing Zhang and
Xiaofang Zhou and
David P. Hansen and
Sen Wang and
Anthony J. Maeder},
title = {Computing Unrestricted Synopses Under Maximum Error Bound},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {1--42},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9571-9},
doi = {10.1007/S00453-011-9571-9},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PangZZHWM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PelegR13,
author = {David Peleg and
Liam Roditty},
title = {Relaxed Spanners for Directed Disk Graphs},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {146--158},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9580-8},
doi = {10.1007/S00453-011-9580-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PelegR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Praveen13,
author = {M. Praveen},
title = {Small Vertex Cover makes Petri Net Coverability and Boundedness Easier},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {713--753},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9687-6},
doi = {10.1007/S00453-012-9687-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Praveen13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RamanS13,
author = {Venkatesh Raman and
Saket Saurabh},
title = {Guest Editorial: Special Issue on Parameterized and Exact Computation,
Part {II}},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {711--712},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9744-9},
doi = {10.1007/S00453-013-9744-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RamanS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RaskhodnikovaRRS13,
author = {Sofya Raskhodnikova and
Dana Ron and
Ronitt Rubinfeld and
Adam D. Smith},
title = {Sublinear Algorithms for Approximating String Compressibility},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {685--709},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9618-6},
doi = {10.1007/S00453-012-9618-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/RaskhodnikovaRRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Wu13,
author = {Bang Ye Wu},
title = {A Simpler and More Efficient Algorithm for the Next-to-Shortest Path
Problem},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {467--479},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9601-7},
doi = {10.1007/S00453-011-9601-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Wu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/YiZ13,
author = {Ke Yi and
Qin Zhang},
title = {Optimal Tracking of Distributed Heavy Hitters and Quantiles},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {206--223},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9584-4},
doi = {10.1007/S00453-011-9584-4},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/YiZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-05-28 11:27 CEST from data curated 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:
