default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/algorithmica/algorithmica75.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/0001KKPP16,
author = {Matthew Johnson and
Dieter Kratsch and
Stefan Kratsch and
Viresh Patel and
Dani{\"{e}}l Paulusma},
title = {Finding Shortest Paths Between Graph Colourings},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {295--321},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0009-7},
doi = {10.1007/S00453-015-0009-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/0001KKPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArvindKKT16,
author = {Vikraman Arvind and
Johannes K{\"{o}}bler and
Sebastian Kuhnert and
Jacobo Tor{\'{a}}n},
title = {Solving Linear Equations Parameterized by Hamming Weight},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {322--338},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0098-3},
doi = {10.1007/S00453-015-0098-3},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ArvindKKT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArvindR16,
author = {Vikraman Arvind and
Gaurav Rattan},
title = {The Parameterized Complexity of Geometric Graph Isomorphism},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {258--276},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0024-8},
doi = {10.1007/S00453-015-0024-8},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ArvindR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BacherS16,
author = {Axel Bacher and
Andrea Sportiello},
title = {Complexity of Anticipated Rejection Algorithms and the Darling-Mandelbrot
Distribution},
journal = {Algorithmica},
volume = {75},
number = {4},
pages = {812--831},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0040-8},
doi = {10.1007/S00453-015-0040-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BacherS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BasavarajuCGMR16,
author = {Manu Basavaraju and
L. Sunil Chandran and
Martin Charles Golumbic and
Rogers Mathew and
Deepak Rajendraprasad},
title = {Separation Dimension of Graphs and Hypergraphs},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {187--204},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0050-6},
doi = {10.1007/S00453-015-0050-6},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BasavarajuCGMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BehsazSS16,
author = {Babak Behsaz and
Mohammad R. Salavatipour and
Zoya Svitkina},
title = {New Approximation Algorithms for the Unsplittable Capacitated Facility
Location Problem},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {53--83},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0012-z},
doi = {10.1007/S00453-015-0012-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BehsazSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosGR16,
author = {Michael A. Bekos and
Martin Gronemann and
Chrysanthi N. Raftopoulou},
title = {Two-Page Book Embeddings of 4-Planar Graphs},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {158--185},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0016-8},
doi = {10.1007/S00453-015-0016-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosGR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bousquet-MelouS16,
author = {Mireille Bousquet{-}M{\'{e}}lou and
Robert Sedgewick and
Mich{\`{e}}le Soria},
title = {Introduction for {S.I.} AofA14},
journal = {Algorithmica},
volume = {75},
number = {4},
pages = {577--578},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0156-5},
doi = {10.1007/S00453-016-0156-5},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Bousquet-MelouS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrunerL16,
author = {Marie{-}Louise Bruner and
Martin Lackner},
title = {A Fast Algorithm for Permutation Pattern Matching Based on Alternating
Runs},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {84--117},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0013-y},
doi = {10.1007/S00453-015-0013-Y},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrunerL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BulianD16,
author = {Jannis Bulian and
Anuj Dawar},
title = {Graph Isomorphism Parameterized by Elimination Distance to Bounded
Degree},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {363--382},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0045-3},
doi = {10.1007/S00453-015-0045-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BulianD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CambyS16,
author = {Eglantine Camby and
Oliver Schaudt},
title = {A New Characterization of P\({}_{\mbox{k}}\)-Free Graphs},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {205--217},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-9989-6},
doi = {10.1007/S00453-015-9989-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CambyS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaoM16,
author = {Yixin Cao and
D{\'{a}}niel Marx},
title = {Chordal Editing is Fixed-Parameter Tractable},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {118--137},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0014-x},
doi = {10.1007/S00453-015-0014-X},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CaoM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenLLW16,
author = {Danny Z. Chen and
Jian Li and
Hongyu Liang and
Haitao Wang},
title = {Matroid and Knapsack Center Problems},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {27--52},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0010-1},
doi = {10.1007/S00453-015-0010-1},
timestamp = {Sat, 06 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenLLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganH16,
author = {Marek Cygan and
Pinar Heggernes},
title = {Foreword: Special Issue on {IPEC} 2014},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {255--256},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0151-x},
doi = {10.1007/S00453-016-0151-X},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganH16a,
author = {Marek Cygan and
Pinar Heggernes},
title = {Erratum to: Foreword: Special Issue on {IPEC} 2014},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {257},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0161-8},
doi = {10.1007/S00453-016-0161-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganH16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DangL16,
author = {Duc{-}Cuong Dang and
Per Kristian Lehre},
title = {Runtime Analysis of Non-elitist Populations: From Classical Optimisation
to Partial Information},
journal = {Algorithmica},
volume = {75},
number = {3},
pages = {428--461},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0103-x},
doi = {10.1007/S00453-015-0103-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DangL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Dell16,
author = {Holger Dell},
title = {AND-Compression of NP-Complete Problems: Streamlined Proof and Minor
Observations},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {403--423},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0110-y},
doi = {10.1007/S00453-015-0110-Y},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Dell16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrD16,
author = {Benjamin Doerr and
Carola Doerr},
title = {The Impact of Random Initialization on the Runtime of Randomized Search
Heuristics},
journal = {Algorithmica},
volume = {75},
number = {3},
pages = {529--553},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0019-5},
doi = {10.1007/S00453-015-0019-5},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrW16,
author = {Benjamin Doerr and
Carsten Witt},
title = {Guest Editorial: Theory of Evolutionary Computation},
journal = {Algorithmica},
volume = {75},
number = {3},
pages = {425--427},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0157-4},
doi = {10.1007/S00453-016-0157-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DrmotaJ16,
author = {Michael Drmota and
Emma Yu Jin},
title = {An Asymptotic Analysis of Labeled and Unlabeled k-Trees},
journal = {Algorithmica},
volume = {75},
number = {4},
pages = {579--605},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0039-1},
doi = {10.1007/S00453-015-0039-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DrmotaJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DuchLM16,
author = {Amalia Duch and
Gustavo Lau and
Conrado Mart{\'{\i}}nez},
title = {On the Cost of Fixed Partial Match Queries in K-d Trees},
journal = {Algorithmica},
volume = {75},
number = {4},
pages = {684--723},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0097-4},
doi = {10.1007/S00453-015-0097-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DuchLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiessenK16,
author = {Christian Gie{\ss}en and
Timo K{\"{o}}tzing},
title = {Robustness of Populations in Stochastic Environments},
journal = {Algorithmica},
volume = {75},
number = {3},
pages = {462--489},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0072-0},
doi = {10.1007/S00453-015-0072-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GiessenK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GutinKW16,
author = {Gregory Z. Gutin and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Polynomial Kernels and User Reductions for the Workflow Satisfiability
Problem},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {383--402},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-9986-9},
doi = {10.1007/S00453-015-9986-9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GutinKW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansonV16,
author = {Svante Janson and
Alfredo Viola},
title = {A Unified Approach to Linear Probing Hashing with Buckets},
journal = {Algorithmica},
volume = {75},
number = {4},
pages = {724--781},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0111-x},
doi = {10.1007/S00453-015-0111-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansonV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KitsunaiKKTT16,
author = {Kenta Kitsunai and
Yasuaki Kobayashi and
Keita Komuro and
Hisao Tamaki and
Toshihiro Tano},
title = {Computing Directed Pathwidth in O(1.89\({}^{\mbox{n}}\)) Time},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {138--157},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0015-9},
doi = {10.1007/S00453-015-0015-9},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KitsunaiKKTT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kotzing16,
author = {Timo K{\"{o}}tzing},
title = {Concentration of First Hitting Times Under Additive Drift},
journal = {Algorithmica},
volume = {75},
number = {3},
pages = {490--506},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0048-0},
doi = {10.1007/S00453-015-0048-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kotzing16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KratschT16,
author = {Dieter Kratsch and
Ioan Todinca},
title = {Guest Editorial: Selected Papers from {WG} 2014},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {186},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0135-x},
doi = {10.1007/S00453-016-0135-X},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KratschT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KrennW16,
author = {Daniel Krenn and
Stephan G. Wagner},
title = {Compositions into Powers of b: Asymptotic Enumeration and Parameters},
journal = {Algorithmica},
volume = {75},
number = {4},
pages = {606--631},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0061-3},
doi = {10.1007/S00453-015-0061-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KrennW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LissovoiW16,
author = {Andrei Lissovoi and
Carsten Witt},
title = {{MMAS} Versus Population-Based {EA} on a Family of Dynamic Fitness
Functions},
journal = {Algorithmica},
volume = {75},
number = {3},
pages = {554--576},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-9975-z},
doi = {10.1007/S00453-015-9975-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LissovoiW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MelczerM16,
author = {Stephen Melczer and
Marni Mishna},
title = {Asymptotic Lattice Path Enumeration Using Diagonals},
journal = {Algorithmica},
volume = {75},
number = {4},
pages = {782--811},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0063-1},
doi = {10.1007/S00453-015-0063-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MelczerM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NebelWM16,
author = {Markus E. Nebel and
Sebastian Wild and
Conrado Mart{\'{\i}}nez},
title = {Analysis of Pivot Sampling in Dual-Pivot Quicksort: {A} Holistic Analysis
of Yaroslavskiy's Partitioning Scheme},
journal = {Algorithmica},
volume = {75},
number = {4},
pages = {632--683},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0041-7},
doi = {10.1007/S00453-015-0041-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NebelWM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/OrdyniakP16,
author = {Sebastian Ordyniak and
Alexandru Popa},
title = {A Parameterized Study of Maximum Generalized Pattern Matching Problems},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {1--26},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0008-8},
doi = {10.1007/S00453-015-0008-8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/OrdyniakP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Razgon16,
author = {Igor Razgon},
title = {On the Read-Once Property of Branching Programs and CNFs of Bounded
Treewidth},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {277--294},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0059-x},
doi = {10.1007/S00453-015-0059-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Razgon16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SaetherT16,
author = {Sigve Hortemo S{\ae}ther and
Jan Arne Telle},
title = {Between Treewidth and Clique-Width},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {218--253},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0033-7},
doi = {10.1007/S00453-015-0033-7},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SaetherT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Sutton16,
author = {Andrew M. Sutton},
title = {Superpolynomial Lower Bounds for the {(1+1)} {EA} on Some Easy Combinatorial
Problems},
journal = {Algorithmica},
volume = {75},
number = {3},
pages = {507--528},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0027-5},
doi = {10.1007/S00453-015-0027-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Sutton16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Traxler16,
author = {Patrick Traxler},
title = {The Relative Exponential Time Complexity of Approximate Counting Satisfying
Assignments},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {339--362},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0134-y},
doi = {10.1007/S00453-016-0134-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Traxler16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-09-21 19: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:
