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/algorithmica69.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AckermannBKS14,
author = {Marcel R. Ackermann and
Johannes Bl{\"{o}}mer and
Daniel Kuntze and
Christian Sohler},
title = {Analysis of Agglomerative Clustering},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {184--215},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9717-4},
doi = {10.1007/S00453-012-9717-4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AckermannBKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Allamigeon14,
author = {Xavier Allamigeon},
title = {On the Complexity of Strongly Connected Components in Directed Hypergraphs},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {335--369},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9729-0},
doi = {10.1007/S00453-012-9729-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Allamigeon14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmossenCP14,
author = {Rasmus Resen Amossen and
Andrea Campagna and
Rasmus Pagh},
title = {Better Size Estimation for Sparse Matrix Products},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {741--757},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9692-9},
doi = {10.1007/S00453-012-9692-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmossenCP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BarbayCGNN14,
author = {J{\'{e}}r{\'{e}}my Barbay and
Francisco Claude and
Travis Gagie and
Gonzalo Navarro and
Yakov Nekrich},
title = {Efficient Fully-Compressed Sequence Representations},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {232--268},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9726-3},
doi = {10.1007/S00453-012-9726-3},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BarbayCGNN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteGHHKP14,
author = {R{\'{e}}my Belmonte and
Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {Detecting Fixed Patterns in Chordal Graphs in Polynomial Time},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {501--521},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9748-5},
doi = {10.1007/S00453-013-9748-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteGHHKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BenoitGGR14,
author = {Anne Benoit and
Matthieu Gallet and
Bruno Gaujal and
Yves Robert},
title = {Computing the Throughput of Probabilistic and Replicated Streaming
Applications},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {925--957},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9768-1},
doi = {10.1007/S00453-013-9768-1},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BenoitGGR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleG14,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Substring Range Reporting},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {384--396},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9733-4},
doi = {10.1007/S00453-012-9733-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseCDFKM14,
author = {Prosenjit Bose and
Paz Carmi and
Mirela Damian and
Robin Y. Flatland and
Matthew J. Katz and
Anil Maheshwari},
title = {Switching to Directional Antennas with Constant Increase in Radius
and Hop Distance},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {397--409},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9739-y},
doi = {10.1007/S00453-012-9739-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BoseCDFKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BremnerCDEHILPT14,
author = {David Bremner and
Timothy M. Chan and
Erik D. Demaine and
Jeff Erickson and
Ferran Hurtado and
John Iacono and
Stefan Langerman and
Mihai P{u{a}}tra{c{s}}cu and
Perouz Taslakian},
title = {Necklaces, Convolutions, and {X+Y}},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {294--314},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9734-3},
doi = {10.1007/S00453-012-9734-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BremnerCDEHILPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuschLT14,
author = {Costas Busch and
Ryan LaFortune and
Srikanta Tirthapura},
title = {Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {658--684},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9757-4},
doi = {10.1007/S00453-013-9757-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuschLT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanCR14,
author = {T.{-}H. Hubert Chan and
Kevin L. Chang and
Rajiv Raman},
title = {An {SDP} Primal-Dual Algorithm for Approximating the Lov{\'{a}}sz-Theta
Function},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {605--618},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9756-5},
doi = {10.1007/S00453-013-9756-5},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanCR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenMW14,
author = {Zhi{-}Zhong Chen and
Wenji Ma and
Lusheng Wang},
title = {The Parameterized Complexity of the Shared Center Problem},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {269--293},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9730-7},
doi = {10.1007/S00453-012-9730-7},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenW14,
author = {Danny Z. Chen and
Haitao Wang},
title = {New Algorithms for Facility Location Problems on the Real Line},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {370--383},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9737-0},
doi = {10.1007/S00453-012-9737-0},
timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenW14a,
author = {Danny Z. Chen and
Haitao Wang},
title = {Outlier Respecting Points Approximation},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {410--430},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9738-z},
doi = {10.1007/S00453-012-9738-Z},
timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenW14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChristodoulouMP14,
author = {Giorgos Christodoulou and
Kurt Mehlhorn and
Evangelia Pyrga},
title = {Improving the Price of Anarchy for Selfish Routing via Coordination
Mechanisms},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {619--640},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9753-8},
doi = {10.1007/S00453-013-9753-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChristodoulouMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CohenY14,
author = {Keren Cohen and
Raphael Yuster},
title = {On Minimum Witnesses for Boolean Matrix Multiplication},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {431--442},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9742-3},
doi = {10.1007/S00453-012-9742-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CohenY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CookW14,
author = {Atlas F. Cook IV and
Carola Wenk},
title = {Shortest Path Problems on a Polyhedral Surface},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {58--77},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9723-6},
doi = {10.1007/S00453-012-9723-6},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CookW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DiazGMRSS14,
author = {Josep D{\'{\i}}az and
Leslie Ann Goldberg and
George B. Mertzios and
David Richerby and
Maria J. Serna and
Paul G. Spirakis},
title = {Approximating Fixation Probabilities in the Generalized Moran Process},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {78--91},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9722-7},
doi = {10.1007/S00453-012-9722-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DiazGMRSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DraganK14,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler},
title = {An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted
Graphs via Generalized Chordal Graphs},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {884--905},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9765-4},
doi = {10.1007/S00453-013-9765-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DraganK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DumitrescuJP14,
author = {Adrian Dumitrescu and
Minghui Jiang and
J{\'{a}}nos Pach},
title = {Opaque Sets},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {315--334},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9735-2},
doi = {10.1007/S00453-012-9735-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DumitrescuJP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinL14,
author = {Leah Epstein and
Asaf Levin},
title = {Robust Algorithms for Preemptive Scheduling},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {26--57},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9718-3},
doi = {10.1007/S00453-012-9718-3},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FarzanK14,
author = {Arash Farzan and
Shahin Kamali},
title = {Compact Navigation and Distance Oracles for Graphs with Small Treewidth},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {92--116},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9712-9},
doi = {10.1007/S00453-012-9712-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FarzanK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominHKPV14,
author = {Fedor V. Fomin and
Pinar Heggernes and
Dieter Kratsch and
Charis Papadopoulos and
Yngve Villanger},
title = {Enumerating Minimal Subset Feedback Vertex Sets},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {216--231},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9731-6},
doi = {10.1007/S00453-012-9731-6},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominHKPV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FriasR14,
author = {Leonor Frias and
Salvador Roura},
title = {Multikey Quickselect},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {958--973},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9775-2},
doi = {10.1007/S00453-013-9775-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FriasR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FujiwaraJ14,
author = {Hiroshi Fujiwara and
Tobias Jacobs},
title = {On the Huffman and Alphabetic Tree Problem with General Cost Functions},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {582--604},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9755-6},
doi = {10.1007/S00453-013-9755-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FujiwaraJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GioanPTC14,
author = {Emeric Gioan and
Christophe Paul and
Marc Tedder and
Derek G. Corneil},
title = {Practical and Efficient Circle Graph Recognition},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {759--788},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9745-8},
doi = {10.1007/S00453-013-9745-8},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GioanPTC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GioanPTC14a,
author = {Emeric Gioan and
Christophe Paul and
Marc Tedder and
Derek G. Corneil},
title = {Practical and Efficient Split Decomposition via Graph-Labelled Trees},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {789--843},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9752-9},
doi = {10.1007/S00453-013-9752-9},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GioanPTC14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolynskiOR014,
author = {Alexander Golynski and
Alessio Orlandi and
Rajeev Raman and
S. Srinivasa Rao},
title = {Optimal Indexes for Sparse Bit Vectors},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {906--924},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9767-2},
doi = {10.1007/S00453-013-9767-2},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolynskiOR014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IshiiM14,
author = {Toshimasa Ishii and
Kazuhisa Makino},
title = {Augmenting Edge-Connectivity between Vertex Subsets},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {130--147},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9724-5},
doi = {10.1007/S00453-012-9724-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/IshiiM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Jukna14,
author = {Stasys Jukna},
title = {Limitations of Incremental Dynamic Programming},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {461--492},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9747-6},
doi = {10.1007/S00453-013-9747-6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Jukna14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhandekarKM14,
author = {Rohit Khandekar and
Guy Kortsarz and
Vahab S. Mirrokni},
title = {On the Advantage of Overlapping Clusters for Minimizing Conductance},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {844--863},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9761-8},
doi = {10.1007/S00453-013-9761-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhandekarKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhaniS14,
author = {M. Reza Khani and
Mohammad R. Salavatipour},
title = {Improved Approximation Algorithms for the Min-max Tree Cover and Bounded
Tree Cover Problems},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {443--460},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9740-5},
doi = {10.1007/S00453-012-9740-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhaniS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LohP14,
author = {Po{-}Shen Loh and
Rasmus Pagh},
title = {Thresholds for Extreme Orientability},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {522--539},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9749-4},
doi = {10.1007/S00453-013-9749-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LohP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MaheshwariSSZ14,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Kaveh Shahbaz and
Hamid Zarrabi{-}Zadeh},
title = {Improved Algorithms for Partial Curve Matching},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {641--657},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9758-3},
doi = {10.1007/S00453-013-9758-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MaheshwariSSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Mertzios14,
author = {George B. Mertzios},
title = {An Intersection Model for Multitolerance Graphs: Efficient Algorithms
and Hierarchy},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {540--581},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9743-2},
doi = {10.1007/S00453-012-9743-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Mertzios14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MountNPSW14,
author = {David M. Mount and
Nathan S. Netanyahu and
Christine D. Piatko and
Ruth Silverman and
Angela Y. Wu},
title = {On the Least Trimmed Squares Estimator},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {148--183},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9721-8},
doi = {10.1007/S00453-012-9721-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MountNPSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NederlofRD14,
author = {Jesper Nederlof and
Johan M. M. van Rooij and
Thomas C. van Dijk},
title = {Inclusion/Exclusion Meets Measure and Conquer},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {685--740},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9759-2},
doi = {10.1007/S00453-013-9759-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NederlofRD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PaghWYZ14,
author = {Rasmus Pagh and
Zhewei Wei and
Ke Yi and
Qin Zhang},
title = {Cache-Oblivious Hashing},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {864--883},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9763-6},
doi = {10.1007/S00453-013-9763-6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PaghWYZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RizziC14,
author = {Romeo Rizzi and
David Cariolaro},
title = {Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour
Classes},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {494--500},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9746-7},
doi = {10.1007/S00453-013-9746-7},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RizziC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SeshadhriV14,
author = {C. Seshadhri and
Jan Vondr{\'{a}}k},
title = {Is Submodularity Testable?},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {1--25},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9719-2},
doi = {10.1007/S00453-012-9719-2},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SeshadhriV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Wild14,
author = {Marcel Wild},
title = {Counting or Producing All Fixed Cardinality Transversals},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {117--129},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9716-5},
doi = {10.1007/S00453-012-9716-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Wild14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X14,
title = {Editor's Note},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {493},
year = {2014},
url = {https://doi.org/10.1007/s00453-014-9880-x},
doi = {10.1007/S00453-014-9880-X},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/X14.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-24 06:51 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:
