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/algorithmica79.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AgarwalHSYZ17,
author = {Pankaj K. Agarwal and
Sariel Har{-}Peled and
Subhash Suri and
Hakan Yildiz and
Wuzhou Zhang},
title = {Convex Hulls Under Uncertainty},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {340--367},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0195-y},
doi = {10.1007/S00453-016-0195-Y},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalHSYZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersH17a,
author = {Susanne Albers and
Matthias Hellwig},
title = {On the Value of Job Migration in Online Makespan Minimization},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {598--623},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0209-9},
doi = {10.1007/S00453-016-0209-9},
timestamp = {Tue, 01 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersH17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntoniadisBCKNP17,
author = {Antonios Antoniadis and
Neal Barcelo and
Mario E. Consuegra and
Peter Kling and
Michael Nugent and
Kirk Pruhs and
Michele Scquizzato},
title = {Efficient Computation of Optimal Energy and Fractional Weighted Flow
Trade-Off Schedules},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {568--597},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0208-x},
doi = {10.1007/S00453-016-0208-X},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AntoniadisBCKNP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AravindSS17,
author = {N. R. Aravind and
R. B. Sandeep and
Naveen Sivadasan},
title = {On Polynomial Kernelization of H-free Edge Deletion},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {654--666},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0215-y},
doi = {10.1007/S00453-016-0215-Y},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AravindSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AshokKS17,
author = {Pradeesha Ashok and
Sudeshna Kolay and
Saket Saurabh},
title = {Multivariate Complexity Analysis of Geometric Red Blue Set Cover},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {667--697},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0216-x},
doi = {10.1007/S00453-016-0216-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AshokKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AustrinCMPS17,
author = {Per Austrin and
Kai{-}Min Chung and
Mohammad Mahmoody and
Rafael Pass and
Karn Seth},
title = {On the Impossibility of Cryptography with Tamperable Randomness},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1052--1101},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0219-7},
doi = {10.1007/S00453-016-0219-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AustrinCMPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bar-NoyBR17,
author = {Amotz Bar{-}Noy and
Ben Baumer and
Dror Rawitz},
title = {Set It and Forget It: Approximating the Set Once Strip Cover Problem},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {368--386},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0198-8},
doi = {10.1007/S00453-016-0198-8},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Bar-NoyBR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarberoGJS17,
author = {Florian Barbero and
Gregory Z. Gutin and
Mark Jones and
Bin Sheng},
title = {Parameterized and Approximation Algorithms for the Load Coloring Problem},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {211--229},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0259-z},
doi = {10.1007/S00453-016-0259-Z},
timestamp = {Wed, 22 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BarberoGJS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaK17,
author = {Surender Baswana and
Shahbaz Khan},
title = {Incremental Algorithm for Maintaining a {DFS} Tree for Undirected
Graphs},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {466--483},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0204-1},
doi = {10.1007/S00453-016-0204-1},
timestamp = {Thu, 21 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosBKR17,
author = {Michael A. Bekos and
Till Bruckdorfer and
Michael Kaufmann and
Chrysanthi N. Raftopoulou},
title = {The Book Thickness of 1-Planar Graphs is Constant},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {444--465},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0203-2},
doi = {10.1007/S00453-016-0203-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosBKR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosCGHK17,
author = {Michael A. Bekos and
Sabine Cornelsen and
Luca Grilli and
Seok{-}Hee Hong and
Michael Kaufmann},
title = {On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {401--427},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0200-5},
doi = {10.1007/S00453-016-0200-5},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosCGHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelazzouguiC17,
author = {Djamal Belazzougui and
Fabio Cunial},
title = {A Framework for Space-Efficient String Kernels},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {857--883},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0286-4},
doi = {10.1007/S00453-017-0286-4},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BelazzouguiC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-SassonCTV17,
author = {Eli Ben{-}Sasson and
Alessandro Chiesa and
Eran Tromer and
Madars Virza},
title = {Scalable Zero Knowledge Via Cycles of Elliptic Curves},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1102--1160},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0221-0},
doi = {10.1007/S00453-016-0221-0},
timestamp = {Wed, 11 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ben-SassonCTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BitanskyCKP17,
author = {Nir Bitansky and
Ran Canetti and
Yael Tauman Kalai and
Omer Paneth},
title = {On Virtual Grey Box Obfuscation for General Circuits},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1014--1051},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0218-8},
doi = {10.1007/S00453-016-0218-8},
timestamp = {Mon, 09 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BitanskyCKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlasiokK17,
author = {Jaroslaw Blasiok and
Marcin Jakub Kaminski},
title = {Chain Minors are {FPT}},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {698--707},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0220-1},
doi = {10.1007/S00453-016-0220-1},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BlasiokK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BliznetsFGKKS17,
author = {Ivan Bliznets and
Fedor V. Fomin and
Petr A. Golovach and
Nikolay Karpov and
Alexander S. Kulikov and
Saket Saurabh},
title = {Parameterized Complexity of Superstring Problems},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {798--813},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0193-0},
doi = {10.1007/S00453-016-0193-0},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BliznetsFGKKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoissonnatST17,
author = {Jean{-}Daniel Boissonnat and
{Karthik {C. S.}} and
S{\'{e}}bastien Tavenas},
title = {Building Efficient and Compact Data Structures for Simplicial Complexes},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {530--567},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0207-y},
doi = {10.1007/S00453-016-0207-Y},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoissonnatST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonacinaT17,
author = {Ilario Bonacina and
Navid Talebanfard},
title = {Strong {ETH} and Resolution via Games and the Multiplicity of Strategies},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {29--41},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0228-6},
doi = {10.1007/S00453-016-0228-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BonacinaT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonamyKPS17,
author = {Marthe Bonamy and
Lukasz Kowalik and
Michal Pilipczuk and
Arkadiusz Socala},
title = {Linear Kernels for Outbranching Problems in Sparse Digraphs},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {159--188},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0244-6},
doi = {10.1007/S00453-016-0244-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonamyKPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonehZ17,
author = {Dan Boneh and
Mark Zhandry},
title = {Multiparty Key Exchange, Efficient Traitor Tracing, and More from
Indistinguishability Obfuscation},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1233--1285},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0242-8},
doi = {10.1007/S00453-016-0242-8},
timestamp = {Mon, 09 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonehZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannP17,
author = {Karl Bringmann and
Konstantinos Panagiotou},
title = {Efficient Sampling Methods for Discrete Distributions},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {484--508},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0205-0},
doi = {10.1007/S00453-016-0205-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BulianD17,
author = {Jannis Bulian and
Anuj Dawar},
title = {Fixed-Parameter Tractable Distances to Sparse Graph Classes},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {139--158},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0235-7},
doi = {10.1007/S00453-016-0235-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BulianD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChechikJPP17,
author = {Shiri Chechik and
Matthew P. Johnson and
Merav Parter and
David Peleg},
title = {Secluded Connectivity Problems},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {708--741},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0222-z},
doi = {10.1007/S00453-016-0222-Z},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChechikJPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CicaleseLS17,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Aline Medeiros Saettler},
title = {Decision Trees for Function Evaluation: Simultaneous Optimization
of Worst and Expected Cost},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {763--796},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0225-9},
doi = {10.1007/S00453-016-0225-9},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CicaleseLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CzyzowiczGKKKT17,
author = {Jurek Czyzowicz and
Leszek Gasieniec and
Adrian Kosowski and
Evangelos Kranakis and
Danny Krizanc and
Najmeh Taleb},
title = {When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile
Robots},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {925--940},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0233-9},
doi = {10.1007/S00453-016-0233-9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CzyzowiczGKKKT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DellKLMM17,
author = {Holger Dell and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Tobias M{\"{o}}mke},
title = {Complexity and Approximability of Parameterized MAX-CSPs},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {230--250},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0310-8},
doi = {10.1007/S00453-017-0310-8},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DellKLMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Desalvo17,
author = {Stephen Desalvo},
title = {Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via
Probabilistic Divide-and-Conquer},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {742--762},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0223-y},
doi = {10.1007/S00453-016-0223-Y},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Desalvo17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DinurL17,
author = {Itai Dinur and
Ga{\"{e}}tan Leurent},
title = {Improved Generic Attacks Against Hash-Based MACs and {HAIFA}},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1161--1195},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0236-6},
doi = {10.1007/S00453-016-0236-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DinurL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DodisSSW17,
author = {Yevgeniy Dodis and
Adi Shamir and
Noah Stephens{-}Davidowitz and
Daniel Wichs},
title = {How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies
for Compromised RNGs},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1196--1232},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0239-3},
doi = {10.1007/S00453-016-0239-3},
timestamp = {Mon, 09 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DodisSSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ElbassioniM17,
author = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Guest Editors' Foreword},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {884--885},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0359-4},
doi = {10.1007/S00453-017-0359-4},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ElbassioniM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FarrasHKP17,
author = {Oriol Farr{\`{a}}s and
Torben Brandt Hansen and
Tarik Kaced and
Carles Padr{\'{o}}},
title = {On the Information Ratio of Non-perfect Secret Sharing Schemes},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {987--1013},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0217-9},
doi = {10.1007/S00453-016-0217-9},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FarrasHKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FolwarcznyS17,
author = {Luk\'a\v{s} Folwarczn\'y and
Jir{\'{\i}} Sgall},
title = {General Caching Is Hard: Even with Small Pages},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {319--339},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0185-0},
doi = {10.1007/S00453-016-0185-0},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FolwarcznyS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GallN17,
author = {Fran{\c{c}}ois Le Gall and
Shogo Nakajima},
title = {Quantum Algorithm for Triangle Finding in Sparse Graphs},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {941--959},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0267-z},
doi = {10.1007/S00453-016-0267-Z},
timestamp = {Wed, 11 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GallN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GarayO17,
author = {Juan A. Garay and
Rafail Ostrovsky},
title = {Special Issue: Algorithmic Tools in Cryptography},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {985--986},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0368-3},
doi = {10.1007/S00453-017-0368-3},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GarayO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GargGHW17,
author = {Sanjam Garg and
Craig Gentry and
Shai Halevi and
Daniel Wichs},
title = {On the Implausibility of Differing-Inputs Obfuscation and Extractable
Witness Encryption with Auxiliary Input},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1353--1373},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0276-6},
doi = {10.1007/S00453-017-0276-6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GargGHW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GasieniecLLPT17,
author = {Leszek Gasieniec and
Christos Levcopoulos and
Andrzej Lingas and
Rasmus Pagh and
Takeshi Tokuyama},
title = {Efficiently Correcting Matrix Products},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {428--443},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0202-3},
doi = {10.1007/S00453-016-0202-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GasieniecLLPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HalesHMPS17,
author = {Jozef Hales and
Alice H{\'{e}}liou and
J{\'{a}}n Manuch and
Yann Ponty and
Ladislav Stacho},
title = {Combinatorial {RNA} Design: Designability and Structure-Approximating
Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {835--856},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0196-x},
doi = {10.1007/S00453-016-0196-X},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HalesHMPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangLSZ17,
author = {Qin Huang and
Xingwu Liu and
Xiaoming Sun and
Jialin Zhang},
title = {Partial Sorting Problem on Evolving Data},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {960--983},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0295-3},
doi = {10.1007/S00453-017-0295-3},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangLSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HusfeldtK17,
author = {Thore Husfeldt and
Iyad A. Kanj},
title = {Guest Editorial: Special Issue on Parameterized and Exact Computation},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {1--2},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0339-8},
doi = {10.1007/S00453-017-0339-8},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HusfeldtK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenP17,
author = {Bart M. P. Jansen and
Astrid Pieterse},
title = {Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal
{SAT}},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {3--28},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0189-9},
doi = {10.1007/S00453-016-0189-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JefferyMW17,
author = {Stacey Jeffery and
Fr{\'{e}}d{\'{e}}ric Magniez and
Ronald de Wolf},
title = {Optimal Parallel Quantum Query Algorithms},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {509--529},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0206-z},
doi = {10.1007/S00453-016-0206-Z},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JefferyMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KammaK17,
author = {Lior Kamma and
Robert Krauthgamer},
title = {Metric Decompositions of Path-Separable Graphs},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {645--653},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0213-0},
doi = {10.1007/S00453-016-0213-0},
timestamp = {Wed, 11 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KammaK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KanteKKP17,
author = {Mamadou Moustapha Kant{\'{e}} and
Eun Jung Kim and
O{-}joung Kwon and
Christophe Paul},
title = {An {FPT} Algorithm and a Polynomial Kernel for Linear Rankwidth-1
Vertex Deletion},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {66--95},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0230-z},
doi = {10.1007/S00453-016-0230-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KanteKKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KimK17,
author = {Eun Jung Kim and
O{-}joung Kwon},
title = {A Polynomial Kernel for Block Graph Deletion},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {251--270},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0316-2},
doi = {10.1007/S00453-017-0316-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KimK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KociumakaRRW17,
author = {Tomasz Kociumaka and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
title = {String Powers in Trees},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {814--834},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0271-3},
doi = {10.1007/S00453-016-0271-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KociumakaRRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KolayLPS17,
author = {Sudeshna Kolay and
Daniel Lokshtanov and
Fahad Panolan and
Saket Saurabh},
title = {Quick but Odd Growth of Cacti},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {271--290},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0317-1},
doi = {10.1007/S00453-017-0317-1},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KolayLPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KratschS17,
author = {Stefan Kratsch and
Manuel Sorge},
title = {On Kernelization and Approximation for the Vector Connectivity Problem},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {96--138},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0231-y},
doi = {10.1007/S00453-016-0231-Y},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KratschS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KucherovN17,
author = {Gregory Kucherov and
Yakov Nekrich},
title = {Full-Fledged Real-Time Indexing for Constant Size Alphabets},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {387--400},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0199-7},
doi = {10.1007/S00453-016-0199-7},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KucherovN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LingPSS17,
author = {San Ling and
Duong Hieu Phan and
Damien Stehl{\'{e}} and
Ron Steinfeld},
title = {Hardness of k-LWE and Applications in Traitor Tracing},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1318--1352},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0251-7},
doi = {10.1007/S00453-016-0251-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LingPSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NarisawaHIBT17,
author = {Kazuyuki Narisawa and
Hideharu Hiratsuka and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
title = {Efficient Computation of Substring Equivalence Classes with Suffix
Arrays},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {291--318},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0178-z},
doi = {10.1007/S00453-016-0178-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/NarisawaHIBT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SaettlerLC17,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Ferdinando Cicalese},
title = {Trading Off Worst and Expected Cost in Decision Tree Problems},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {886--908},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0211-2},
doi = {10.1007/S00453-016-0211-2},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SaettlerLC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Suchy17,
author = {Ondrej Such{\'{y}}},
title = {Extending the Kernel for Planar Steiner Tree to the Number of Steiner
Vertices},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {189--210},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0249-1},
doi = {10.1007/S00453-016-0249-1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Suchy17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SumitaKM17,
author = {Hanna Sumita and
Naonori Kakimura and
Kazuhisa Makino},
title = {Parameterized Complexity of Sparse Linear Complementarity Problems},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {42--65},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0229-5},
doi = {10.1007/S00453-016-0229-5},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SumitaKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/TirodkarV17,
author = {Sumedh Tirodkar and
Sundar Vishwanathan},
title = {On the Approximability of the Minimum Rainbow Subgraph Problem and
Other Related Problems},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {909--924},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0278-4},
doi = {10.1007/S00453-017-0278-4},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/TirodkarV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WeiH17,
author = {Chia{-}Chen Wei and
Sun{-}Yuan Hsieh},
title = {Random and Conditional (t, k)-Diagnosis of Hypercubes},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {625--644},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0210-3},
doi = {10.1007/S00453-016-0210-3},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WeiH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X17,
title = {Editor's Note: Special Issue on Combinatorial Pattern Matching},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {797},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0355-8},
doi = {10.1007/S00453-017-0355-8},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/X17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/YamakawaYHK17,
author = {Takashi Yamakawa and
Shota Yamada and
Goichiro Hanaoka and
Noboru Kunihiro},
title = {Self-Bilinear Map on Unknown Order Groups from Indistinguishability
Obfuscation and Its Applications},
journal = {Algorithmica},
volume = {79},
number = {4},
pages = {1286--1317},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0250-8},
doi = {10.1007/S00453-016-0250-8},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/YamakawaYHK17.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-04-20 06:31 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:
