Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:journals/jda:"
download as .bib file
@article{DBLP:journals/jda/BanksGHP18,
author = {Jacqueline Banks and
Scott Garrabrant and
Mark L. Huber and
Anne Perizzolo},
title = {Using {TPA} to count linear extensions},
journal = {J. Discrete Algorithms},
volume = {51},
pages = {1--11},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.04.001},
doi = {10.1016/J.JDA.2018.04.001},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BanksGHP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BilleGGP18,
author = {Philip Bille and
Travis Gagie and
Inge Li G{\o}rtz and
Nicola Prezza},
title = {A separation between RLSLPs and {LZ77}},
journal = {J. Discrete Algorithms},
volume = {50},
pages = {36--39},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.09.002},
doi = {10.1016/J.JDA.2018.09.002},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BilleGGP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BiswasGST18,
author = {Sudip Biswas and
Arnab Ganguly and
Rahul Shah and
Sharma V. Thankachan},
title = {Space-efficient indexes for forbidden extension queries},
journal = {J. Discrete Algorithms},
volume = {50},
pages = {23--35},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.09.001},
doi = {10.1016/J.JDA.2018.09.001},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BiswasGST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BrankovicRS18,
author = {Ljiljana Brankovic and
Joe Ryan and
William F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {1},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.015},
doi = {10.1016/J.JDA.2018.11.015},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BrankovicRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CatalanoRF18,
author = {Dario Catalano and
Mario Di Raimondo and
Simone Faro},
title = {Verifiable pattern matching on outsourced texts},
journal = {J. Discrete Algorithms},
volume = {51},
pages = {39--50},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.08.002},
doi = {10.1016/J.JDA.2018.08.002},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CatalanoRF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CohenHMSW18,
author = {Nathann Cohen and
Fr{\'{e}}d{\'{e}}ric Havet and
Dorian Mazauric and
Ignasi Sau and
R{\'{e}}mi Watrigant},
title = {Complexity dichotomies for the MinimumF-Overlay problem},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {133--142},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.010},
doi = {10.1016/J.JDA.2018.11.010},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CohenHMSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CooperR18,
author = {Colin Cooper and
Nicol{\'{a}}s Rivera},
title = {Threshold behaviour of discordant voting on the complete graph},
journal = {J. Discrete Algorithms},
volume = {50},
pages = {10--22},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.07.001},
doi = {10.1016/J.JDA.2018.07.001},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CooperR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrocePS18,
author = {Federico Della Croce and
Ulrich Pferschy and
Rosario Scatamacchia},
title = {Approximating the 3-period Incremental Knapsack Problem},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {55--69},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.005},
doi = {10.1016/J.JDA.2018.11.005},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CrocePS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DartiesCCGW18,
author = {Beno{\^{\i}}t Darties and
Nicolas Champseix and
Annie Chateau and
Rodolphe Giroudeau and
Mathias Weller},
title = {Complexity and lowers bounds for Power Edge Set Problem},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {70--91},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.006},
doi = {10.1016/J.JDA.2018.11.006},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/DartiesCCGW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GalleT18,
author = {Matthias Gall{\'{e}} and
Mat{\'{\i}}as Tealdi},
title = {\emph{xkcd}-repeats: {A} new taxonomy of repeats defined by their
context diversity},
journal = {J. Discrete Algorithms},
volume = {48},
pages = {1--16},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2017.10.005},
doi = {10.1016/J.JDA.2017.10.005},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GalleT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GuKMZ18,
author = {Hanyu Gu and
Alexander V. Kononov and
Julia Memar and
Yakov Zinder},
title = {Efficient Lagrangian heuristics for the two-stage flow shop with job
dependent buffer requirements},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {143--155},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.011},
doi = {10.1016/J.JDA.2018.11.011},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GuKMZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HassineBRT18,
author = {Ghada Ben Hassine and
Pierre Berg{\'{e}} and
Arpad Rimmel and
Joanna Tomasik},
title = {A lower bound for weak Schur numbers with a deterministic algorithm},
journal = {J. Discrete Algorithms},
volume = {51},
pages = {12--25},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.10.002},
doi = {10.1016/J.JDA.2018.10.002},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HassineBRT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HiraishiK18,
author = {Kunihiko Hiraishi and
Koichi Kobayashi},
title = {A pathfinding problem for search trees with unknown edge length},
journal = {J. Discrete Algorithms},
volume = {49},
pages = {1--7},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.04.002},
doi = {10.1016/J.JDA.2018.04.002},
timestamp = {Thu, 08 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HiraishiK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/InoueNMIBT18,
author = {Hiroe Inoue and
Yuto Nakashima and
Takuya Mieno and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
title = {Algorithms and combinatorial properties on shortest unique palindromic
substrings},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {122--132},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.009},
doi = {10.1016/J.JDA.2018.11.009},
timestamp = {Mon, 24 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/InoueNMIBT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KelarevRRSY18,
author = {Andrei Kelarev and
Joe Ryan and
Leanne Rylands and
Jennifer Seberry and
Xun Yi},
title = {Discrete algorithms and methods for security of statistical databases
related to the work of Mirka Miller},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {112--121},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.008},
doi = {10.1016/J.JDA.2018.11.008},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/KelarevRRSY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KonecnyKNPST18,
author = {Matej Konecn{\'{y}} and
Stanislav Kucera and
Jana Novotn{\'{a}} and
Jakub Pek{\'{a}}rek and
Step{\'{a}}n Simsa and
Martin T{\"{o}}pfer},
title = {Minimal sum labeling of graphs},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {29--37},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.003},
doi = {10.1016/J.JDA.2018.11.003},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/KonecnyKNPST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KunduM18,
author = {Ritu Kundu and
Manal Mohamed},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {50},
pages = {1},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.10.001},
doi = {10.1016/J.JDA.2018.10.001},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/KunduM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LewisS18,
author = {Rhyd Lewis and
Kate Smith{-}Miles},
title = {A heuristic algorithm for finding cost-effective solutions to real-world
school bus routing problems},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {2--17},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.001},
doi = {10.1016/J.JDA.2018.11.001},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/LewisS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LouzaSMT18,
author = {Felipe A. Louza and
William F. Smyth and
Giovanni Manzini and
Guilherme P. Telles},
title = {Lyndon array construction during Burrows-Wheeler inversion},
journal = {J. Discrete Algorithms},
volume = {50},
pages = {2--9},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.08.001},
doi = {10.1016/J.JDA.2018.08.001},
timestamp = {Fri, 10 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/LouzaSMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Mallach18,
author = {Sven Mallach},
title = {Linear ordering based {MIP} formulations for the vertex separation
or pathwidth problem},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {156--167},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.012},
doi = {10.1016/J.JDA.2018.11.012},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/Mallach18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MasseCG18,
author = {Alexandre Blondin Mass{\'{e}} and
Julien de Carufel and
Alain Goupil},
title = {Saturated fully leafed tree-like polyforms and polycubes},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {38--54},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.004},
doi = {10.1016/J.JDA.2018.11.004},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/MasseCG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/McIntyreS18,
author = {Ryan McIntyre and
Michael Soltys},
title = {An improved upper bound and algorithm for clique covers},
journal = {J. Discrete Algorithms},
volume = {48},
pages = {42--56},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.03.002},
doi = {10.1016/J.JDA.2018.03.002},
timestamp = {Sat, 01 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/McIntyreS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MhaskarS18,
author = {Neerja Mhaskar and
William F. Smyth},
title = {String covering with optimal covers},
journal = {J. Discrete Algorithms},
volume = {51},
pages = {26--38},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.09.003},
doi = {10.1016/J.JDA.2018.09.003},
timestamp = {Thu, 10 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MhaskarS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MiloszH18,
author = {Robin Milosz and
Sylvie Hamel},
title = {Exploring the median of permutations problem},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {92--111},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.007},
doi = {10.1016/J.JDA.2018.11.007},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/MiloszH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OhnoSTIS18,
author = {Tatsuya Ohno and
Kensuke Sakai and
Yoshimasa Takabatake and
Tomohiro I and
Hiroshi Sakamoto},
title = {A faster implementation of online {RLBWT} and its application to {LZ77}
parsing},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {18--28},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.002},
doi = {10.1016/J.JDA.2018.11.002},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/OhnoSTIS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PelletierR18,
author = {L{\'{e}}o Pelletier and
Irena Rusu},
title = {Common intervals and permutation reconstruction from MinMax-betweenness
constraints},
journal = {J. Discrete Algorithms},
volume = {49},
pages = {8--26},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.05.001},
doi = {10.1016/J.JDA.2018.05.001},
timestamp = {Thu, 08 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PelletierR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RaniR18,
author = {Seema Rani and
Dharmveer Singh Rajpoot},
title = {Improvised divide and conquer approach for the {LIS} problem},
journal = {J. Discrete Algorithms},
volume = {48},
pages = {17--26},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.01.001},
doi = {10.1016/J.JDA.2018.01.001},
timestamp = {Thu, 08 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RaniR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RyuP18,
author = {Cheol Ryu and
Kunsoo Park},
title = {Improved pattern-scan-order algorithms for string matching},
journal = {J. Discrete Algorithms},
volume = {49},
pages = {27--36},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.05.002},
doi = {10.1016/J.JDA.2018.05.002},
timestamp = {Sat, 01 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RyuP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Schauz18,
author = {Uwe Schauz},
title = {Computing the list chromatic index of graphs},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {182--191},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.014},
doi = {10.1016/J.JDA.2018.11.014},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/Schauz18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Vikas18,
author = {Narayan Vikas},
title = {Computational Complexity Relationship between Compaction, Vertex-Compaction,
and Retraction},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {168--181},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.013},
doi = {10.1016/J.JDA.2018.11.013},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/Vikas18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/dAuriacBMKMMNRT18,
author = {Jean{-}Alexandre Angl{\`{e}}s d'Auriac and
Csilla Bujt{\'{a}}s and
Abdelhakim El Maftouhi and
Marek Karpinski and
Yannis Manoussakis and
Leandro Montero and
N. Narayanan and
Laurent Rosaz and
Johan Thapper and
Zsolt Tuza},
title = {Tropical dominating sets in vertex-coloured graphs},
journal = {J. Discrete Algorithms},
volume = {48},
pages = {27--41},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.03.001},
doi = {10.1016/J.JDA.2018.03.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/dAuriacBMKMMNRT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Abu-Khzam17,
author = {Faisal N. Abu{-}Khzam},
title = {On the complexity of multi-parameterized cluster editing},
journal = {J. Discrete Algorithms},
volume = {45},
pages = {26--34},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.07.003},
doi = {10.1016/J.JDA.2017.07.003},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Abu-Khzam17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Alvarez-GarciaB17,
author = {Sandra {\'{A}}lvarez{-}Garc{\'{\i}}a and
Guillermo de Bernardo and
Nieves R. Brisaboa and
Gonzalo Navarro},
title = {A succinct data structure for self-indexing ternary relations},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {38--53},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.10.002},
doi = {10.1016/J.JDA.2016.10.002},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Alvarez-GarciaB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AudritoBNP17,
author = {Giorgio Audrito and
Alan A. Bertossi and
Alfredo Navarra and
Maria Cristina Pinotti},
title = {Maximizing the overall end-user satisfaction of data broadcast in
wireless mesh networks},
journal = {J. Discrete Algorithms},
volume = {45},
pages = {14--25},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.07.002},
doi = {10.1016/J.JDA.2017.07.002},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AudritoBNP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BaruchKS17,
author = {Gilad Baruch and
Shmuel T. Klein and
Dana Shapira},
title = {A space efficient direct access data structure},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {26--37},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.12.001},
doi = {10.1016/J.JDA.2016.12.001},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BaruchKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BealAS17,
author = {Richard Beal and
Donald A. Adjeroh and
W. F. Smyth},
title = {A prefix array for parameterized strings},
journal = {J. Discrete Algorithms},
volume = {42},
pages = {23--34},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.11.002},
doi = {10.1016/J.JDA.2016.11.002},
timestamp = {Wed, 03 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BealAS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BekosKKSV17,
author = {Michael A. Bekos and
Michael Kaufmann and
Stephen G. Kobourov and
Konstantinos S. Stavropoulos and
Sankar Veeramoni},
title = {The maximum k-differential coloring problem},
journal = {J. Discrete Algorithms},
volume = {45},
pages = {35--53},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.08.001},
doi = {10.1016/J.JDA.2017.08.001},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BekosKKSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BergDM17,
author = {Mark de Berg and
Stephane Durocher and
Saeed Mehrabi},
title = {Guarding monotone art galleries with sliding cameras in linear time},
journal = {J. Discrete Algorithms},
volume = {44},
pages = {39--47},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.04.005},
doi = {10.1016/J.JDA.2017.04.005},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BergDM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BilleGS17,
author = {Philip Bille and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen},
title = {Subsequence automata with default transitions},
journal = {J. Discrete Algorithms},
volume = {44},
pages = {48--55},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.05.001},
doi = {10.1016/J.JDA.2017.05.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BilleGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BiswasKST17,
author = {Sudip Biswas and
Tsung{-}Han Ku and
Rahul Shah and
Sharma V. Thankachan},
title = {Position-restricted substring searching over small alphabets},
journal = {J. Discrete Algorithms},
volume = {46-47},
pages = {36--39},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.10.001},
doi = {10.1016/J.JDA.2017.10.001},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BiswasKST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CioniniDDFGPZ17,
author = {Alessio Cionini and
Gianlorenzo D'Angelo and
Mattia D'Emidio and
Daniele Frigioni and
Kalliopi Giannakopoulou and
Andreas Paraskevopoulos and
Christos D. Zaroliagis},
title = {Engineering graph-based models for dynamic timetable information systems},
journal = {J. Discrete Algorithms},
volume = {46-47},
pages = {40--58},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.09.001},
doi = {10.1016/J.JDA.2017.09.001},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CioniniDDFGPZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DidierT17,
author = {Gilles Didier and
Laurent Tichit},
title = {Designing optimal- and fast-on-average pattern matching algorithms},
journal = {J. Discrete Algorithms},
volume = {42},
pages = {45--60},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.11.001},
doi = {10.1016/J.JDA.2016.11.001},
timestamp = {Wed, 03 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/DidierT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DinitzI17,
author = {Yefim Dinitz and
Rotem Itzhak},
title = {Hybrid Bellman-Ford-Dijkstra algorithm},
journal = {J. Discrete Algorithms},
volume = {42},
pages = {35--44},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.01.001},
doi = {10.1016/J.JDA.2017.01.001},
timestamp = {Wed, 03 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/DinitzI17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FerradaN17,
author = {H{\'{e}}ctor Ferrada and
Gonzalo Navarro},
title = {Improved Range Minimum Queries},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {72--80},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.09.002},
doi = {10.1016/J.JDA.2016.09.002},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FerradaN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gagie17,
author = {Travis Gagie},
title = {Preface - Compact Data Structures},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {1},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.04.002},
doi = {10.1016/J.JDA.2017.04.002},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/Gagie17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GerencserHDJ17,
author = {Bal{\'{a}}zs Gerencs{\'{e}}r and
Romain Hollanders and
Jean{-}Charles Delvenne and
Rapha{\"{e}}l M. Jungers},
title = {A complexity analysis of Policy Iteration through combinatorial matrices
arising from Unique Sink Orientations},
journal = {J. Discrete Algorithms},
volume = {44},
pages = {21--38},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.04.004},
doi = {10.1016/J.JDA.2017.04.004},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GerencserHDJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GloverR17,
author = {Fred W. Glover and
C{\'{e}}sar Rego},
title = {New relationships for multi-neighborhood search for the minimum linear
arrangement problem},
journal = {J. Discrete Algorithms},
volume = {46-47},
pages = {16--24},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.10.003},
doi = {10.1016/J.JDA.2017.10.003},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GloverR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KarmakarKPS17,
author = {Sushanta Karmakar and
Paraschos Koutris and
Aris Pagourtzis and
Dimitris Sakavalas},
title = {Energy-efficient broadcasting in ad hoc wireless networks},
journal = {J. Discrete Algorithms},
volume = {42},
pages = {2--13},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.11.004},
doi = {10.1016/J.JDA.2016.11.004},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KarmakarKPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KolpakovPPK17,
author = {Roman Kolpakov and
Mikhail Podolskiy and
Mikhail Posypkin and
Nickolay Khrapov},
title = {Searching of gapped repeats and subrepetitions in a word},
journal = {J. Discrete Algorithms},
volume = {46-47},
pages = {1--15},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.10.004},
doi = {10.1016/J.JDA.2017.10.004},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KolpakovPPK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KulekciT17,
author = {M. Oguzhan K{\"{u}}lekci and
Sharma V. Thankachan},
title = {Range selection and predecessor queries in data aware space and time},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {18--25},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.01.002},
doi = {10.1016/J.JDA.2017.01.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KulekciT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LabeitSB17,
author = {Julian Labeit and
Julian Shun and
Guy E. Blelloch},
title = {Parallel lightweight wavelet tree, suffix array and FM-index construction},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {2--17},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.04.001},
doi = {10.1016/J.JDA.2017.04.001},
timestamp = {Wed, 03 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/LabeitSB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LiXAJ17,
author = {Yuan Li and
Jie Xue and
Akash Agrawal and
Ravi Janardan},
title = {On the arrangement of stochastic lines in {\(\mathbb{Z}\)}\({}^{\mbox{2}}\)},
journal = {J. Discrete Algorithms},
volume = {44},
pages = {1--20},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.04.003},
doi = {10.1016/J.JDA.2017.04.003},
timestamp = {Fri, 27 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LiXAJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LouzaGT17,
author = {Felipe A. Louza and
Travis Gagie and
Guilherme P. Telles},
title = {Burrows-Wheeler transform and {LCP} array construction in constant
space},
journal = {J. Discrete Algorithms},
volume = {42},
pages = {14--22},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.11.003},
doi = {10.1016/J.JDA.2016.11.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/LouzaGT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MercasP17,
author = {Robert Mercas and
Nadia Pisanti},
title = {Preface},
journal = {J. Discrete Algorithms},
volume = {42},
pages = {1},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.12.002},
doi = {10.1016/J.JDA.2016.12.002},
timestamp = {Wed, 03 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/MercasP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PereiraNB17,
author = {Alberto Ord{\'{o}}{\~{n}}ez Pereira and
Gonzalo Navarro and
Nieves R. Brisaboa},
title = {Grammar compressed sequences with rank/select support},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {54--71},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.10.001},
doi = {10.1016/J.JDA.2016.10.001},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PereiraNB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SawadaW17,
author = {Joe Sawada and
Aaron Williams},
title = {Practical algorithms to rank necklaces, Lyndon words, and de Bruijn
sequences},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {95--110},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.01.003},
doi = {10.1016/J.JDA.2017.01.003},
timestamp = {Tue, 02 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/SawadaW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SawadaWW17,
author = {Joe Sawada and
Aaron Williams and
Dennis Wong},
title = {Necklaces and Lyndon words in colexicographic and binary reflected
Gray code order},
journal = {J. Discrete Algorithms},
volume = {46-47},
pages = {25--35},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.10.002},
doi = {10.1016/J.JDA.2017.10.002},
timestamp = {Tue, 02 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/SawadaWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ShachnaiVZ17,
author = {Hadas Shachnai and
Ariella Voloshin and
Shmuel Zaks},
title = {Optimizing bandwidth allocation in elastic optical networks with application
to scheduling},
journal = {J. Discrete Algorithms},
volume = {45},
pages = {1--13},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.07.001},
doi = {10.1016/J.JDA.2017.07.001},
timestamp = {Fri, 20 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ShachnaiVZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ZhuW0W17,
author = {Daxin Zhu and
Yingjie Wu and
Lei Wang and
Xiaodong Wang},
title = {A note on the largest number of red nodes in red-black trees},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {81--94},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.03.001},
doi = {10.1016/J.JDA.2017.03.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ZhuW0W17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/0001P16,
author = {Johannes Fischer and
Daniel Peters},
title = {{GLOUDS:} Representing tree-like graphs},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {39--49},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2015.10.004},
doi = {10.1016/J.JDA.2015.10.004},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/0001P16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AdamaszekP16,
author = {Anna Adamaszek and
Alexandru Popa},
title = {Approximation and hardness results for the maximum edge q-coloring
problem},
journal = {J. Discrete Algorithms},
volume = {38-41},
pages = {1--8},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.09.003},
doi = {10.1016/J.JDA.2016.09.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/AdamaszekP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BaiDF16,
author = {Haoyue Bai and
Antoine Deza and
Frantisek Franek},
title = {Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete
Algorithms 34 {(2015)} 18-22]},
journal = {J. Discrete Algorithms},
volume = {38-41},
pages = {50--51},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.05.003},
doi = {10.1016/J.JDA.2016.05.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BaiDF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BarbayGSS16,
author = {J{\'{e}}r{\'{e}}my Barbay and
Ankur Gupta and
Srinivasa Rao Satti and
Jonathan Sorenson},
title = {Near-optimal online multiselection in internal and external memory},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {3--17},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2015.11.001},
doi = {10.1016/J.JDA.2015.11.001},
timestamp = {Thu, 29 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BarbayGSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BergM16,
author = {Mark de Berg and
Ali D. Mehrabi},
title = {Straight-path queries in trajectory data},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {27--38},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2015.08.002},
doi = {10.1016/J.JDA.2015.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BergM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BhagatCM16,
author = {Subhash Bhagat and
Sruti Gan Chaudhuri and
Krishnendu Mukhopadhyaya},
title = {Fault-tolerant gathering of asynchronous oblivious mobile robots under
one-axis agreement},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {50--62},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2015.10.005},
doi = {10.1016/J.JDA.2015.10.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BhagatCM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BrlekBF16,
author = {Srecko Brlek and
Stefano Brocchi and
Andrea Frosini},
title = {Reconstructing binary matrices with timetabling constraints},
journal = {J. Discrete Algorithms},
volume = {38-41},
pages = {20--31},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.07.001},
doi = {10.1016/J.JDA.2016.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BrlekBF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BulteauFK16,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz},
title = {(Prefix) reversal distance for (signed) strings with few blocks or
small alphabets},
journal = {J. Discrete Algorithms},
volume = {37},
pages = {44--55},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.05.002},
doi = {10.1016/J.JDA.2016.05.002},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BulteauFK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CazauxR16,
author = {Bastien Cazaux and
Eric Rivals},
title = {A linear time algorithm for Shortest Cyclic Cover of Strings},
journal = {J. Discrete Algorithms},
volume = {37},
pages = {56--67},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.05.001},
doi = {10.1016/J.JDA.2016.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CazauxR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CoxGRS16,
author = {Anthony J. Cox and
Fabio Garofalo and
Giovanna Rosone and
Marinella Sciortino},
title = {Lightweight {LCP} construction for very large collections of strings},
journal = {J. Discrete Algorithms},
volume = {37},
pages = {17--33},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.03.003},
doi = {10.1016/J.JDA.2016.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CoxGRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DemaineEHILUU16,
author = {Erik D. Demaine and
David Eppstein and
Adam Hesterberg and
Hiro Ito and
Anna Lubiw and
Ryuhei Uehara and
Yushi Uno},
title = {Folding a paper strip to minimize thickness},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {18--26},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2015.09.003},
doi = {10.1016/J.JDA.2015.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DemaineEHILUU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HanT16,
author = {Yijie Han and
Tadao Takaoka},
title = {An O(n\({}^{\mbox{3}}\)log{\unicode{8289}}log{\unicode{8289}}n/log\({}^{\mbox{2}}\){\unicode{8289}}n)
time algorithm for all pairs shortest paths},
journal = {J. Discrete Algorithms},
volume = {38-41},
pages = {9--19},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.09.001},
doi = {10.1016/J.JDA.2016.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HanT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JagerCZ16,
author = {Gerold J{\"{a}}ger and
Sharlee Climer and
Weixiong Zhang},
title = {The complete parsimony haplotype inference problem and algorithms
based on integer programming, branch-and-bound and Boolean satisfiability},
journal = {J. Discrete Algorithms},
volume = {37},
pages = {68--83},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.06.001},
doi = {10.1016/J.JDA.2016.06.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/JagerCZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JayapaulJRRS16,
author = {Varunkumar Jayapaul and
Seungbum Jo and
Rajeev Raman and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Space efficient data structures for nearest larger neighbor},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {63--75},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.01.001},
doi = {10.1016/J.JDA.2016.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JayapaulJRRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KoblerKV16,
author = {Johannes K{\"{o}}bler and
Sebastian Kuhnert and
Oleg Verbitsky},
title = {Solving the canonical representation and Star System Problems for
proper circular-arc graphs in logspace},
journal = {J. Discrete Algorithms},
volume = {38-41},
pages = {38--49},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.03.001},
doi = {10.1016/J.JDA.2016.03.001},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/KoblerKV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RadoszewskiR16,
author = {Jakub Radoszewski and
Tomasz Radzik},
title = {2015 London Stringology Days and London Algorithmic Workshop {(LSD}
{\&} {LAW)}},
journal = {J. Discrete Algorithms},
volume = {37},
pages = {1--2},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.06.002},
doi = {10.1016/J.JDA.2016.06.002},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/RadoszewskiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RahmanT16,
author = {M. Sohel Rahman and
Etsuji Tomita},
title = {Special issue on {WALCOM} 2015},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {1--2},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.01.002},
doi = {10.1016/J.JDA.2016.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RahmanT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Sritharan16,
author = {R. Sritharan},
title = {Graph modification problem for some classes of graphs},
journal = {J. Discrete Algorithms},
volume = {38-41},
pages = {32--37},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.06.003},
doi = {10.1016/J.JDA.2016.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Sritharan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/TustumiGTL16,
author = {William H. A. Tustumi and
Simon Gog and
Guilherme P. Telles and
Felipe A. Louza},
title = {An improved algorithm for the all-pairs suffix-prefix problem},
journal = {J. Discrete Algorithms},
volume = {37},
pages = {34--43},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.04.002},
doi = {10.1016/J.JDA.2016.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/TustumiGTL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/VrolandSBT16,
author = {Christophe Vroland and
Mika{\"{e}}l Salson and
S{\'{e}}bastien Bini and
H{\'{e}}l{\`{e}}ne Touzet},
title = {Approximate search of short patterns with high error rates using the
01\({}^{\mbox{{\unicode{8270}}}}\)0 lossless seeds},
journal = {J. Discrete Algorithms},
volume = {37},
pages = {3--16},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.03.002},
doi = {10.1016/J.JDA.2016.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/VrolandSBT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WilliamsonS16,
author = {Matthew D. Williamson and
K. Subramani},
title = {Corrigendum to "On the negative cost girth problem in planar networks"
[Journal of Discrete Algorithms 35 {(2015)} 40-50]},
journal = {J. Discrete Algorithms},
volume = {38-41},
pages = {52--53},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.04.001},
doi = {10.1016/J.JDA.2016.04.001},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WilliamsonS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Abu-AffashCK15,
author = {A. Karim Abu{-}Affash and
Paz Carmi and
Matthew J. Katz},
title = {Bottleneck Steiner tree with bounded number of Steiner vertices},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {96--100},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.004},
doi = {10.1016/J.JDA.2014.12.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Abu-AffashCK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Agostino15,
author = {Sergio De Agostino},
title = {The greedy approach to dictionary-based static text compression on
a distributed system},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {54--61},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.001},
doi = {10.1016/J.JDA.2015.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Agostino15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AgrawalRLJ15,
author = {Akash Agrawal and
Saladi Rahul and
Yuan Li and
Ravi Janardan},
title = {Range search on tuples of points},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {1--12},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.10.006},
doi = {10.1016/J.JDA.2014.10.006},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/AgrawalRLJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AlatabbiRS15,
author = {Ali Alatabbi and
M. Sohel Rahman and
William F. Smyth},
title = {Inferring an indeterminate string from a prefix graph},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {6--13},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.006},
doi = {10.1016/J.JDA.2014.12.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AlatabbiRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ArslanHHW15,
author = {Abdullah N. Arslan and
Dan He and
Yu He and
Xindong Wu},
title = {Pattern matching with wildcards and length constraints using maximum
network flow},
journal = {J. Discrete Algorithms},
volume = {35},
pages = {9--16},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.08.003},
doi = {10.1016/J.JDA.2015.08.003},
timestamp = {Thu, 16 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ArslanHHW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BachmaierBGH15,
author = {Christian Bachmaier and
Franz J. Brandenburg and
Andreas Glei{\ss}ner and
Andreas Hofmeier},
title = {On the hardness of maximum rank aggregation problems},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {2--13},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.10.002},
doi = {10.1016/J.JDA.2014.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BachmaierBGH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BaiDF15,
author = {Haoyue Bai and
Antoine Deza and
Frantisek Franek},
title = {On a lemma of Crochemore and Rytter},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {18--22},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.006},
doi = {10.1016/J.JDA.2015.05.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BaiDF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BannaiP15,
author = {Hideo Bannai and
Solon P. Pissis},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {1},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.008},
doi = {10.1016/J.JDA.2015.05.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BannaiP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BasappaAD15,
author = {Manjanna Basappa and
Rashmisnata Acharyya and
Gautam K. Das},
title = {Unit disk cover problem in 2D},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {193--201},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.002},
doi = {10.1016/J.JDA.2015.05.002},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BasappaAD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BaudonBS15,
author = {Olivier Baudon and
Julien Bensmail and
{\'{E}}ric Sopena},
title = {On the complexity of determining the irregular chromatic index of
a graph},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {113--127},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.008},
doi = {10.1016/J.JDA.2014.12.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BaudonBS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BerettaCD15,
author = {Stefano Beretta and
Mauro Castelli and
Riccardo Dondi},
title = {Correcting gene tree by removal and modification: Tractability and
approximability},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {115--129},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.03.005},
doi = {10.1016/J.JDA.2015.03.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BerettaCD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BharatiS15,
author = {R. Bharati and
W. F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {1},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.02.001},
doi = {10.1016/J.JDA.2015.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BharatiS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BhattacherjeeS15,
author = {Sanjay Bhattacherjee and
Palash Sarkar},
title = {Tree based symmetric key broadcast encryption},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {78--107},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.010},
doi = {10.1016/J.JDA.2015.05.010},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BhattacherjeeS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BiniazMS15,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {On the hardness of full Steiner tree problems},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {118--127},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.013},
doi = {10.1016/J.JDA.2015.05.013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BiniazMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BonaseraFFPP15,
author = {Biagio Bonasera and
Emilio Ferrara and
Giacomo Fiumara and
Francesco Pagano and
Alessandro Provetti},
title = {Adaptive search over sorted sets},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {128--133},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.007},
doi = {10.1016/J.JDA.2014.12.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BonaseraFFPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BygiG15,
author = {Mojtaba Nouri Bygi and
Mohammad Ghodsi},
title = {Near optimal line segment queries in simple polygons},
journal = {J. Discrete Algorithms},
volume = {35},
pages = {51--61},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.10.002},
doi = {10.1016/J.JDA.2015.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BygiG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CharpentierS15,
author = {Cl{\'{e}}ment Charpentier and
{\'{E}}ric Sopena},
title = {The incidence game chromatic number of (a, d)-decomposable graphs},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {14--25},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.10.001},
doi = {10.1016/J.JDA.2014.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CharpentierS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChaudhuriM15,
author = {Sruti Gan Chaudhuri and
Krishnendu Mukhopadhyaya},
title = {Leader election and gathering for asynchronous fat robots without
common chirality},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {171--192},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.04.001},
doi = {10.1016/J.JDA.2015.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChaudhuriM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CondonMT15,
author = {Anne Condon and
J{\'{a}}n Manuch and
Chris Thachuk},
title = {The complexity of string partitioning},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {24--43},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.11.002},
doi = {10.1016/J.JDA.2014.11.002},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CondonMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreDL15,
author = {Maxime Crochemore and
Jacqueline W. Daykin and
Zsuzsanna Lipt{\'{a}}k},
title = {StringMasters 2012 {\&} 2013 special issue - volume 2},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {1--2},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.007},
doi = {10.1016/J.JDA.2015.01.007},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreDL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreGKL15,
author = {Maxime Crochemore and
Roberto Grossi and
Juha K{\"{a}}rkk{\"{a}}inen and
Gad M. Landau},
title = {Computing the Burrows-Wheeler transform in place and in small space},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {44--52},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.004},
doi = {10.1016/J.JDA.2015.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreGKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreIKKLR15,
author = {Maxime Crochemore and
Costas S. Iliopoulos and
Tomasz Kociumaka and
Marcin Kubica and
Alessio Langiu and
Jakub Radoszewski and
Wojciech Rytter and
Bartosz Szreder and
Tomasz Walen},
title = {A note on the longest common compatible prefix problem for partial
words},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {49--53},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.003},
doi = {10.1016/J.JDA.2015.05.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreIKKLR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DabbaghianW15,
author = {Vahid Dabbaghian and
Tiankuang Wu},
title = {Constructing non-cyclic pandiagonal Latin squares of prime orders},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {70--77},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.001},
doi = {10.1016/J.JDA.2014.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DabbaghianW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DasGKS15,
author = {Ananda Swarup Das and
Prosenjit Gupta and
Kishore Kothapalli and
Kannan Srinathan},
title = {Reporting and counting maximal points in a query orthogonal rectangle},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {78--95},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.002},
doi = {10.1016/J.JDA.2014.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DasGKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EhlersMMN15,
author = {Thorsten Ehlers and
Florin Manea and
Robert Mercas and
Dirk Nowotka},
title = {k-Abelian pattern matching},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {37--48},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.004},
doi = {10.1016/J.JDA.2015.05.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EhlersMMN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Foucaud15,
author = {Florent Foucaud},
title = {Decision and approximation complexity for identifying codes and locating-dominating
sets in restricted graph classes},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {48--68},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.08.004},
doi = {10.1016/J.JDA.2014.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Foucaud15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FriedrichH15,
author = {Tobias Friedrich and
Christian Hercher},
title = {On the kernel size of clique cover reductions for random intersection
graphs},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {128--136},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.014},
doi = {10.1016/J.JDA.2015.05.014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FriedrichH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FulekT15,
author = {Radoslav Fulek and
Csaba D. T{\'{o}}th},
title = {Universal point sets for planar three-trees},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {101--112},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.005},
doi = {10.1016/J.JDA.2014.12.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FulekT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GagieGP15,
author = {Travis Gagie and
Pawel Gawrychowski and
Simon J. Puglisi},
title = {Approximate pattern matching in LZ77-compressed texts},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {64--68},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.10.003},
doi = {10.1016/J.JDA.2014.10.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GagieGP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GanMZ15,
author = {Heng{-}Soon Gan and
Hamid Mokhtar and
Sanming Zhou},
title = {Forwarding and optical indices of 4-regular circulant networks},
journal = {J. Discrete Algorithms},
volume = {35},
pages = {27--39},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.09.002},
doi = {10.1016/J.JDA.2015.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GanMZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gavril15,
author = {Fanica Gavril},
title = {Algorithms for {GA-H} reduced graphs},
journal = {J. Discrete Algorithms},
volume = {35},
pages = {17--26},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.09.001},
doi = {10.1016/J.JDA.2015.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Gavril15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GiordanoLMSW15,
author = {Francesco Giordano and
Giuseppe Liotta and
Tamara Mchedlidze and
Antonios Symvonis and
Sue Whitesides},
title = {Computing upward topological book embeddings of upward planar digraphs},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {45--69},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.11.006},
doi = {10.1016/J.JDA.2014.11.006},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GiordanoLMSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GogNP15,
author = {Simon Gog and
Gonzalo Navarro and
Matthias Petri},
title = {Improved and extended locating functionality on compressed suffix
arrays},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {53--63},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.006},
doi = {10.1016/J.JDA.2015.01.006},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GogNP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GrigoryanH15,
author = {Hayk Grigoryan and
Hovhannes A. Harutyunyan},
title = {The shortest path problem in the Kn{\"{o}}del graph},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {40--47},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.11.008},
doi = {10.1016/J.JDA.2014.11.008},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GrigoryanH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HasanRRRSY15,
author = {Masud Hasan and
Atif Rahman and
Md. Khaledur Rahman and
Mohammad Sohel Rahman and
Mahfuza Sharmin and
Rukhsana Yeasmin},
title = {Pancake flipping and sorting permutations},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {139--149},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.03.007},
doi = {10.1016/J.JDA.2015.03.007},
timestamp = {Thu, 26 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/HasanRRRSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Hasunuma15,
author = {Toru Hasunuma},
title = {Structural properties of subdivided-line graphs},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {69--86},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.008},
doi = {10.1016/J.JDA.2015.01.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Hasunuma15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HirasakaKM15,
author = {Mitsugu Hirasaka and
Kyoung{-}Tark Kim and
Yoshihiro Mizoguchi},
title = {Uniqueness of Butson Hadamard matrices of small degrees},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {70--77},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.009},
doi = {10.1016/J.JDA.2015.05.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HirasakaKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HsiaoC15,
author = {Yu{-}Hsiang Hsiao and
Keh{-}Ning Chang},
title = {A top down algorithm for constrained tree inclusion},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {62--69},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.012},
doi = {10.1016/J.JDA.2015.05.012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HsiaoC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HyyroNI15,
author = {Heikki Hyyr{\"{o}} and
Kazuyuki Narisawa and
Shunsuke Inenaga},
title = {Dynamic edit distance table under a general weighted cost function},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {2--17},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.007},
doi = {10.1016/J.JDA.2015.05.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HyyroNI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JagerA15,
author = {Gerold J{\"{a}}ger and
Florian Arnold},
title = {{SAT} and {IP} based algorithms for magic labeling including a complete
search for total magic labelings},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {87--103},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.011},
doi = {10.1016/J.JDA.2015.01.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JagerA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JordanS15,
author = {Tibor Jord{\'{a}}n and
Ildik{\'{o}} Schlotter},
title = {Parameterized complexity of spare capacity allocation and the multicost
Steiner subgraph problem},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {29--44},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.11.005},
doi = {10.1016/J.JDA.2014.11.005},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/JordanS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KarpinskiSV15,
author = {Marek Karpinski and
Richard Schmied and
Claus Viehmann},
title = {Nearly tight approximation bounds for vertex cover on dense k-uniform
k-partite hypergraphs},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {49--57},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.010},
doi = {10.1016/J.JDA.2014.12.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KarpinskiSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KloksPUW15,
author = {Ton Kloks and
Sheung{-}Hung Poon and
Chin{-}Ting Ung and
Yue{-}Li Wang},
title = {On the strong chromatic index and maximum induced matching of tree-cographs,
permutation graphs and chordal bipartite graphs},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {21--28},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.11.004},
doi = {10.1016/J.JDA.2014.11.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KloksPUW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KloudaS15,
author = {Karel Klouda and
Step{\'{a}}n Starosta},
title = {An algorithm for enumerating all infinite repetitions in a D0L-system},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {130--138},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.03.006},
doi = {10.1016/J.JDA.2015.03.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KloudaS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KoblerK015,
author = {Johannes K{\"{o}}bler and
Sebastian Kuhnert and
Osamu Watanabe},
title = {Interval graph representation with given interval and intersection
lengths},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {108--117},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.011},
doi = {10.1016/J.JDA.2015.05.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KoblerK015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LecroqM15,
author = {Thierry Lecroq and
Laurent Mouchard},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {1},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.010},
doi = {10.1016/J.JDA.2015.01.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LecroqM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LozinMR15,
author = {Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot and
Bernard Ries},
title = {On the maximum independent set problem in subclasses of subcubic graphs},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {104--112},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.08.005},
doi = {10.1016/J.JDA.2014.08.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LozinMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LuL15,
author = {Hongliang Lu and
Yuqing Lin},
title = {Maximum spectral radius of graphs with given connectivity, minimum
degree and independence number},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {113--119},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.08.006},
doi = {10.1016/J.JDA.2014.08.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LuL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MaSW15,
author = {Meijie Ma and
Huangping Shi and
Douglas B. West},
title = {The adversary degree-associated reconstruction number of double-brooms},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {150--159},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.03.008},
doi = {10.1016/J.JDA.2015.03.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MaSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MhaskarS15,
author = {Neerja Mhaskar and
Michael Soltys},
title = {String shuffle: Circuits and graphs},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {120--128},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.003},
doi = {10.1016/J.JDA.2015.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MhaskarS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MishraPD15,
author = {Sounaka Mishra and
Ashwin Pananjady and
N. Safina Devi},
title = {On the complexity of making a distinguished vertex minimum or maximum
degree by vertex deletion},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {71--80},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.03.002},
doi = {10.1016/J.JDA.2015.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MishraPD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NavarroT15,
author = {Gonzalo Navarro and
Sharma V. Thankachan},
title = {Bottom-k document retrieval},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {69--74},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.009},
doi = {10.1016/J.JDA.2014.12.009},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NavarroT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OhlebuschB15,
author = {Enno Ohlebusch and
Timo Beller},
title = {Alphabet-independent algorithms for finding context-sensitive repeats
in linear time},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {23--36},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.05.005},
doi = {10.1016/J.JDA.2015.05.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OhlebuschB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OuardiCZ15,
author = {Faissal Ouardi and
Jean{-}Marc Champarnaud and
Djelloul Ziadi},
title = {Extended to multi-tilde-bar regular expressions and efficient finite
automata constructions},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {58--70},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.03.001},
doi = {10.1016/J.JDA.2015.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OuardiCZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Panafieu15,
author = {Elie de Panafieu},
title = {Phase transition of random non-uniform hypergraphs},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {26--39},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.009},
doi = {10.1016/J.JDA.2015.01.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Panafieu15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PinterSZ15,
author = {Ron Y. Pinter and
Hadas Shachnai and
Meirav Zehavi},
title = {Partial Information Network Queries},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {129--145},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.11.007},
doi = {10.1016/J.JDA.2014.11.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PinterSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PurcellR15,
author = {Christopher Purcell and
M. Puck Rombach},
title = {On the complexity of role colouring planar graphs, trees and cographs},
journal = {J. Discrete Algorithms},
volume = {35},
pages = {1--8},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.08.001},
doi = {10.1016/J.JDA.2015.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PurcellR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RahmanR15,
author = {Md. Khaledur Rahman and
M. Sohel Rahman},
title = {Prefix and suffix transreversals on binary and ternary strings},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {160--170},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.03.009},
doi = {10.1016/J.JDA.2015.03.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RahmanR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RajasinghRPR15,
author = {Indra Rajasingh and
R. Sundara Rajan and
N. Parthiban and
T. M. Rajalaxmi},
title = {Bothway embedding of circulant network into grid},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {2--9},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.001},
doi = {10.1016/J.JDA.2015.01.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/RajasinghRPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RajasinghSM15,
author = {Indra Rajasingh and
A. S. Shanthi and
Albert Muthumalai},
title = {Excessive index for mesh derived networks},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {43--48},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.07.001},
doi = {10.1016/J.JDA.2014.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RajasinghSM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SchauerteZ15,
author = {Boris Schauerte and
Carol T. Zamfirescu},
title = {Small k-pyramids and the complexity of determining k},
journal = {J. Discrete Algorithms},
volume = {30},
pages = {13--20},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.11.003},
doi = {10.1016/J.JDA.2014.11.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SchauerteZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ShiZQ15,
author = {Cong Shi and
Huanan Zhang and
Chao Qin},
title = {A faster algorithm for the resource allocation problem with convex
cost functions},
journal = {J. Discrete Algorithms},
volume = {34},
pages = {137--146},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.06.001},
doi = {10.1016/J.JDA.2015.06.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ShiZQ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Smyth15,
author = {Bill Smyth},
title = {Perspectives: Journal of Discrete Algorithms Special StringMasters
Issue {(2015)}},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {3--5},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.002},
doi = {10.1016/J.JDA.2015.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Smyth15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/StarikovskayaV15,
author = {Tatiana Starikovskaya and
Hjalte Wedel Vildh{\o}j},
title = {A suffix tree or not a suffix tree?},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {14--23},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.005},
doi = {10.1016/J.JDA.2015.01.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/StarikovskayaV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/StephenRRGW15,
author = {Sudeep Stephen and
Bharati Rajan and
Joe Ryan and
Cyriac Grigorious and
Albert William},
title = {Power domination in certain chemical structures},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {10--18},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.003},
doi = {10.1016/J.JDA.2014.12.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/StephenRRGW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/VallikannuGS15,
author = {R. Vallikannu and
A. George and
S. K. Srivatsa},
title = {Autonomous localization based energy saving mechanism in indoor MANETs
using {ACO}},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {19--30},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.11.001},
doi = {10.1016/J.JDA.2014.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/VallikannuGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/VenkatesanTRN15,
author = {A. S. Prasanna Venkatesan and
D. Gnanaraj Thomas and
T. Robinson and
Atulya K. Nagar},
title = {Computing with membranes and picture arrays},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {31--42},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.09.001},
doi = {10.1016/J.JDA.2014.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/VenkatesanTRN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WeiHLP15,
author = {Chia{-}Chen Wei and
Sun{-}Yuan Hsieh and
Chia{-}Wei Lee and
Sheng{-}Lung Peng},
title = {An improved approximation algorithm for the partial-terminal Steiner
tree problem with edge cost 1 or 2},
journal = {J. Discrete Algorithms},
volume = {35},
pages = {62--71},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.10.003},
doi = {10.1016/J.JDA.2015.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WeiHLP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WilliamsonS15,
author = {Matthew D. Williamson and
K. Subramani},
title = {On the negative cost girth problem in planar networks},
journal = {J. Discrete Algorithms},
volume = {35},
pages = {40--50},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.10.001},
doi = {10.1016/J.JDA.2015.10.001},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WilliamsonS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/YanC15,
author = {Li Yan and
Marek Chrobak},
title = {LP-rounding algorithms for the fault-tolerant facility placement problem},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {93--114},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.03.004},
doi = {10.1016/J.JDA.2015.03.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/YanC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/YoshidaK15,
author = {Satoshi Yoshida and
Takuya Kida},
title = {An efficient Variable-to-Fixed length encoding using multiplexed parse
trees},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {75--86},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.10.005},
doi = {10.1016/J.JDA.2014.10.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/YoshidaK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/0002KT14,
author = {Michael Hirsch and
Shmuel Tomi Klein and
Yair Toaff},
title = {Layouts for improved hierarchical parallel computations},
journal = {J. Discrete Algorithms},
volume = {28},
pages = {23--30},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.06.002},
doi = {10.1016/J.JDA.2014.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/0002KT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AkutsuTFT14,
author = {Tatsuya Akutsu and
Takeyuki Tamura and
Daiji Fukagawa and
Atsuhiro Takasu},
title = {Efficient exponential-time algorithms for edit distance between unordered
trees},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {79--93},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.09.001},
doi = {10.1016/J.JDA.2013.09.001},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/AkutsuTFT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BampisKLM14,
author = {Evripidis Bampis and
Alexander V. Kononov and
Giorgio Lucarelli and
Ioannis Milis},
title = {Bounded max-colorings of graphs},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {56--68},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.11.003},
doi = {10.1016/J.JDA.2013.11.003},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BampisKLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BazganCNS14,
author = {Cristina Bazgan and
Morgan Chopin and
Andr{\'{e}} Nichterlein and
Florian Sikora},
title = {Parameterized approximability of maximizing the spread of influence
in networks},
journal = {J. Discrete Algorithms},
volume = {27},
pages = {54--65},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.05.001},
doi = {10.1016/J.JDA.2014.05.001},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BazganCNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BekosKKV14,
author = {Michael A. Bekos and
Michael Kaufmann and
Stephen G. Kobourov and
Sankar Veeramoni},
title = {A note on maximum differential coloring of planar graphs},
journal = {J. Discrete Algorithms},
volume = {29},
pages = {1--7},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.06.004},
doi = {10.1016/J.JDA.2014.06.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BekosKKV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BerendG14,
author = {Daniel Berend and
Shahar Golan},
title = {Counting solutions to {CSP} using generating polynomials},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {89--97},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.01.004},
doi = {10.1016/J.JDA.2014.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BerendG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BilleGSV14,
author = {Philip Bille and
Inge Li G{\o}rtz and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j},
title = {Time-space trade-offs for longest common extensions},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {42--50},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.06.003},
doi = {10.1016/J.JDA.2013.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BilleGSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BourdonR14,
author = {J{\'{e}}r{\'{e}}mie Bourdon and
Mireille R{\'{e}}gnier},
title = {Large deviation properties for patterns},
journal = {J. Discrete Algorithms},
volume = {24},
pages = {2--11},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.09.004},
doi = {10.1016/J.JDA.2013.09.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BourdonR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BrodalGPS14,
author = {Gerth St{\o}lting Brodal and
Mark Greve and
Vineet Pandey and
Srinivasa Rao Satti},
title = {Integer representations towards efficient counting in the bit probe
model},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {34--44},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.11.001},
doi = {10.1016/J.JDA.2013.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BrodalGPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CantoneF14,
author = {Domenico Cantone and
Simone Faro},
title = {Fast shortest-paths algorithms in the presence of few destinations
of negative-weight arcs},
journal = {J. Discrete Algorithms},
volume = {24},
pages = {12--25},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.03.005},
doi = {10.1016/J.JDA.2013.03.005},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CantoneF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CantoneF14a,
author = {Domenico Cantone and
Simone Faro},
title = {Improved and self-tuned occurrence heuristics},
journal = {J. Discrete Algorithms},
volume = {28},
pages = {73--84},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.07.006},
doi = {10.1016/J.JDA.2014.07.006},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CantoneF14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CazauxR14,
author = {Bastien Cazaux and
Eric Rivals},
title = {Reverse engineering of compact suffix trees and links: {A} novel algorithm},
journal = {J. Discrete Algorithms},
volume = {28},
pages = {9--22},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.07.002},
doi = {10.1016/J.JDA.2014.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CazauxR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChegraneB14,
author = {Ibrahim Chegrane and
Djamal Belazzougui},
title = {Simple, compact and robust approximate string dictionary},
journal = {J. Discrete Algorithms},
volume = {28},
pages = {49--60},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.08.003},
doi = {10.1016/J.JDA.2014.08.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChegraneB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreDL14,
author = {Maxime Crochemore and
Jacqueline W. Daykin and
Zsuzsanna Lipt{\'{a}}k},
title = {StringMasters 2012 {\&} 2013 special issue - volume 1},
journal = {J. Discrete Algorithms},
volume = {28},
pages = {1},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.08.002},
doi = {10.1016/J.JDA.2014.08.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreDL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DAngeloSN14,
author = {Gianlorenzo D'Angelo and
Gabriele Di Stefano and
Alfredo Navarra},
title = {Gathering six oblivious robots on anonymous symmetric rings},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {16--27},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.09.006},
doi = {10.1016/J.JDA.2013.09.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DAngeloSN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DondiES14,
author = {Riccardo Dondi and
Nadia El{-}Mabrouk and
Krister M. Swenson},
title = {Gene tree correction for reconciliation and species tree inference:
Complexity and algorithms},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {51--65},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.06.001},
doi = {10.1016/J.JDA.2013.06.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DondiES14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FaroK14,
author = {Simone Faro and
M. Oguzhan K{\"{u}}lekci},
title = {Fast and flexible packed string matching},
journal = {J. Discrete Algorithms},
volume = {28},
pages = {61--72},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.07.003},
doi = {10.1016/J.JDA.2014.07.003},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/FaroK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Ferrari14,
author = {Luca Ferrari},
title = {Greedy algorithms and poset matroids},
journal = {J. Discrete Algorithms},
volume = {29},
pages = {21--26},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.07.005},
doi = {10.1016/J.JDA.2014.07.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Ferrari14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FiciGKK14,
author = {Gabriele Fici and
Travis Gagie and
Juha K{\"{a}}rkk{\"{a}}inen and
Dominik Kempa},
title = {A subquadratic algorithm for minimum palindromic factorization},
journal = {J. Discrete Algorithms},
volume = {28},
pages = {41--48},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.08.001},
doi = {10.1016/J.JDA.2014.08.001},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/FiciGKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FraczakGMT14,
author = {Wojciech Fraczak and
Loukas Georgiadis and
Andrew Miller and
Robert Endre Tarjan},
title = {Corrections to "Finding dominators via disjoint set union" {[J.} Discrete
Algorithms 23 {(2013)} 2-20]},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {106--110},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.01.002},
doi = {10.1016/J.JDA.2014.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FraczakGMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gawrychowski14,
author = {Pawel Gawrychowski},
title = {Simple and efficient LZW-compressed multiple pattern matching},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {34--41},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.10.004},
doi = {10.1016/J.JDA.2013.10.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Gawrychowski14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GogKKMV14,
author = {Simon Gog and
Kalle Karhu and
Juha K{\"{a}}rkk{\"{a}}inen and
Veli M{\"{a}}kinen and
Niko V{\"{a}}lim{\"{a}}ki},
title = {Multi-pattern matching with bidirectional indexes},
journal = {J. Discrete Algorithms},
volume = {24},
pages = {26--39},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.03.007},
doi = {10.1016/J.JDA.2013.03.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GogKKMV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GolovachHKS14,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Reza Saei},
title = {Subset feedback vertex sets in chordal graphs},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {7--15},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.09.005},
doi = {10.1016/J.JDA.2013.09.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GolovachHKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JanssonL14,
author = {Jesper Jansson and
Andrzej Lingas},
title = {Computing the rooted triplet distance between galled trees by counting
triangles},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {66--78},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.10.002},
doi = {10.1016/J.JDA.2013.10.002},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/JanssonL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KopelowitzKNS14,
author = {Tsvi Kopelowitz and
Gregory Kucherov and
Yakov Nekrich and
Tatiana Starikovskaya},
title = {Cross-document pattern matching},
journal = {J. Discrete Algorithms},
volume = {24},
pages = {40--47},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.05.002},
doi = {10.1016/J.JDA.2013.05.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KopelowitzKNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KorpelainenLP14,
author = {Nicholas Korpelainen and
Vadim V. Lozin and
Christopher Purcell},
title = {Dominating induced matchings in graphs without a skew star},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {45--55},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.11.002},
doi = {10.1016/J.JDA.2013.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KorpelainenLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Lecroq14,
author = {Thierry Lecroq},
title = {Preface},
journal = {J. Discrete Algorithms},
volume = {24},
pages = {1},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.12.001},
doi = {10.1016/J.JDA.2013.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Lecroq14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LevitT14,
author = {Vadim E. Levit and
David Tankus},
title = {On relating edges in graphs without cycles of length 4},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {28--33},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.09.007},
doi = {10.1016/J.JDA.2013.09.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LevitT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LiskiewiczS14,
author = {Maciej Liskiewicz and
Martin R. Schuster},
title = {A new upper bound for the traveling salesman problem in cubic graphs},
journal = {J. Discrete Algorithms},
volume = {27},
pages = {1--20},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.02.001},
doi = {10.1016/J.JDA.2014.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LiskiewiczS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MantaciRRS14,
author = {Sabrina Mantaci and
Antonio Restivo and
Giovanna Rosone and
Marinella Sciortino},
title = {Suffix array and Lyndon factorization of a text},
journal = {J. Discrete Algorithms},
volume = {28},
pages = {2--8},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.06.001},
doi = {10.1016/J.JDA.2014.06.001},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MantaciRRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Navarro14,
author = {Gonzalo Navarro},
title = {Wavelet trees for all},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {2--20},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.07.004},
doi = {10.1016/J.JDA.2013.07.004},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Navarro14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OhlebuschBA14,
author = {Enno Ohlebusch and
Timo Beller and
Mohamed Ibrahim Abouelhoda},
title = {Computing the Burrows-Wheeler transform of a string and its reverse
in parallel},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {21--33},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.06.002},
doi = {10.1016/J.JDA.2013.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OhlebuschBA14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PinhasMKZ14,
author = {Tamar Pinhas and
Nimrod Milo and
Gregory Kucherov and
Michal Ziv{-}Ukelson},
title = {Algorithms for path-constrained sequence alignment},
journal = {J. Discrete Algorithms},
volume = {24},
pages = {48--58},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.09.003},
doi = {10.1016/J.JDA.2013.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PinhasMKZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PinterZ14,
author = {Ron Y. Pinter and
Meirav Zehavi},
title = {Algorithms for topology-free and alignment network queries},
journal = {J. Discrete Algorithms},
volume = {27},
pages = {29--53},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.03.002},
doi = {10.1016/J.JDA.2014.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PinterZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PuSS14,
author = {Ida M. Pu and
Daniel Stamate and
Yuji Shen},
title = {Improving time-efficiency in blocking expanding ring search for mobile
ad hoc networks},
journal = {J. Discrete Algorithms},
volume = {24},
pages = {59--67},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.03.006},
doi = {10.1016/J.JDA.2013.03.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PuSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RajasekaranN14,
author = {Sanguthevar Rajasekaran and
Marius Nicolae},
title = {An elegant algorithm for the construction of suffix arrays},
journal = {J. Discrete Algorithms},
volume = {27},
pages = {21--28},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.03.001},
doi = {10.1016/J.JDA.2014.03.001},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RajasekaranN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RautenbachSS14,
author = {Dieter Rautenbach and
Vin{\'{\i}}cius Fernandes dos Santos and
Philipp Matthias Sch{\"{a}}fer},
title = {Irreversible conversion processes with deadlines},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {69--76},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.12.002},
doi = {10.1016/J.JDA.2013.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RautenbachSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Rusu14,
author = {Irena Rusu},
title = {Extending common intervals searching from permutations to sequences},
journal = {J. Discrete Algorithms},
volume = {29},
pages = {27--46},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.10.004},
doi = {10.1016/J.JDA.2014.10.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Rusu14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SawadaWW14,
author = {Joe Sawada and
Aaron Williams and
Dennis Wong},
title = {The lexicographically smallest universal cycle for binary strings
with minimum specified weight},
journal = {J. Discrete Algorithms},
volume = {28},
pages = {31--40},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.06.003},
doi = {10.1016/J.JDA.2014.06.003},
timestamp = {Tue, 02 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/SawadaWW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ShimizuFN14,
author = {Toshihiro Shimizu and
Takuro Fukunaga and
Hiroshi Nagamochi},
title = {Unranking of small combinations from large sets},
journal = {J. Discrete Algorithms},
volume = {29},
pages = {8--20},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.07.004},
doi = {10.1016/J.JDA.2014.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ShimizuFN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/StoyeK14,
author = {Jens Stoye and
Juha K{\"{a}}rkk{\"{a}}inen},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {1},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.01.003},
doi = {10.1016/J.JDA.2014.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/StoyeK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Vajnovszki14,
author = {Vincent Vajnovszki},
title = {An efficient Gray code algorithm for generating all permutations with
a given major index},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {77--88},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.01.001},
doi = {10.1016/J.JDA.2014.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Vajnovszki14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WuWZW14,
author = {Yingjie Wu and
Lei Wang and
Daxin Zhu and
Xiaodong Wang},
title = {An efficient dynamic programming algorithm for the generalized {LCS}
problem with multiple substring exclusive constraints},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {98--105},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.01.005},
doi = {10.1016/J.JDA.2014.01.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/WuWZW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/XuF14,
author = {Dacheng Xu and
Jianxi Fan},
title = {On the metric dimension of {HDN}},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {1--6},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.09.002},
doi = {10.1016/J.JDA.2013.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/XuF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AdamczykR13,
author = {Zbigniew Adamczyk and
Wojciech Rytter},
title = {A note on a simple computation of the maximal suffix of a string},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {61--64},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.03.002},
doi = {10.1016/J.JDA.2013.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AdamczykR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AhmedIR13,
author = {Pritom Ahmed and
A. S. M. Shohidull Islam and
M. Sohel Rahman},
title = {A graph-theoretic model to solve the approximate string matching problem
allowing for translocations},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {143--156},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.08.004},
doi = {10.1016/J.JDA.2013.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AhmedIR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ArulprakasamDG13,
author = {R. Arulprakasam and
V. Rajkumar Dare and
S. Gnanasekaran},
title = {Fuzzy local {\(\omega\)}-systems},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {157--164},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.07.007},
doi = {10.1016/J.JDA.2013.07.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ArulprakasamDG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ArumugamS13,
author = {S. Arumugam and
William F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {1},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.10.001},
doi = {10.1016/J.JDA.2013.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ArumugamS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Badkobeh13,
author = {Golnaz Badkobeh},
title = {Infinite words containing the minimal number of repetitions},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {38--42},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.03.001},
doi = {10.1016/J.JDA.2013.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Badkobeh13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BakerDF13,
author = {Andrew Baker and
Antoine Deza and
Frantisek Franek},
title = {A computational framework for determining run-maximal strings},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {43--50},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.12.004},
doi = {10.1016/J.JDA.2012.12.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BakerDF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BazganGM13,
author = {Cristina Bazgan and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {Approximation with a fixed number of solutions of some multiobjective
maximization problems},
journal = {J. Discrete Algorithms},
volume = {22},
pages = {19--29},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.006},
doi = {10.1016/J.JDA.2013.06.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BazganGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BealA13,
author = {Richard Beal and
Donald A. Adjeroh},
title = {The structural border array},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {98--112},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.07.003},
doi = {10.1016/J.JDA.2013.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BealA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BelazzouguiKR13,
author = {Djamal Belazzougui and
Roman Kolpakov and
Mathieu Raffinot},
title = {Various improvements to text fingerprinting},
journal = {J. Discrete Algorithms},
volume = {22},
pages = {1--18},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.004},
doi = {10.1016/J.JDA.2013.06.004},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BelazzouguiKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BelazzouguiNV13,
author = {Djamal Belazzougui and
Gonzalo Navarro and
Daniel Valenzuela},
title = {Improved compressed indexes for full-text document retrieval},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {3--13},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.07.005},
doi = {10.1016/J.JDA.2012.07.005},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BelazzouguiNV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BelazzouguiR13,
author = {Djamal Belazzougui and
Mathieu Raffinot},
title = {Approximate regular expression matching with multi-strings},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {14--21},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.07.008},
doi = {10.1016/J.JDA.2012.07.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BelazzouguiR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BellerGOS13,
author = {Timo Beller and
Simon Gog and
Enno Ohlebusch and
Thomas Schnattinger},
title = {Computing the longest common prefix array based on the Burrows-Wheeler
transform},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {22--31},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.07.007},
doi = {10.1016/J.JDA.2012.07.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BellerGOS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Blanchet-SadriLS13,
author = {Francine Blanchet{-}Sadri and
Andrew Lohr and
Shane Scott},
title = {Computing the partial word avoidability indices of binary patterns},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {113--118},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.007},
doi = {10.1016/J.JDA.2013.06.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Blanchet-SadriLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Blanchet-SadriLS13a,
author = {Francine Blanchet{-}Sadri and
Andrew Lohr and
Shane Scott},
title = {Computing the partial word avoidability indices of ternary patterns},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {119--142},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.009},
doi = {10.1016/J.JDA.2013.06.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Blanchet-SadriLS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BockenhauerMS13,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Tobias M{\"{o}}mke and
Monika Steinov{\'{a}}},
title = {Improved approximations for {TSP} with simple precedence constraints},
journal = {J. Discrete Algorithms},
volume = {21},
pages = {32--40},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.04.002},
doi = {10.1016/J.JDA.2013.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BockenhauerMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoriaBEP13,
author = {Nicolas Boria and
Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Exponential approximation schemata for some network design problems},
journal = {J. Discrete Algorithms},
volume = {22},
pages = {43--52},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.011},
doi = {10.1016/J.JDA.2013.06.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoriaBEP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BreslauerI13,
author = {Dany Breslauer and
Giuseppe F. Italiano},
title = {Near real-time suffix tree construction via the fringe marked ancestor
problem},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {32--48},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.07.003},
doi = {10.1016/J.JDA.2012.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BreslauerI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BulteauFR13,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
title = {Maximal strip recovery problem with gaps: Hardness and approximation
algorithms},
journal = {J. Discrete Algorithms},
volume = {19},
pages = {1--22},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.12.006},
doi = {10.1016/J.JDA.2012.12.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BulteauFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CarmiC13,
author = {Paz Carmi and
Lilach Chaitman{-}Yerushalmi},
title = {Minimum weight Euclidean t-spanner is NP-hard},
journal = {J. Discrete Algorithms},
volume = {22},
pages = {30--42},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.010},
doi = {10.1016/J.JDA.2013.06.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CarmiC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChristouFIJMPZ13,
author = {Michalis Christou and
Tom{\'{a}}s Flouri and
Costas S. Iliopoulos and
Jan Janousek and
Borivoj Melichar and
Solon P. Pissis and
Jan Zd{\'{a}}rek},
title = {Tree template matching in unranked ordered trees},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {51--60},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.02.001},
doi = {10.1016/J.JDA.2013.02.001},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ChristouFIJMPZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CorreaFS13,
author = {Ricardo C. Corr{\^{e}}a and
Pablo Mayckon Silva Farias and
Cr{\'{\i}}ston P. de Souza},
title = {Insertion and sorting in a sequence of numbers minimizing the maximum
sum of a contiguous subsequence},
journal = {J. Discrete Algorithms},
volume = {21},
pages = {1--10},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.03.003},
doi = {10.1016/J.JDA.2013.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CorreaFS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CostaSMO13,
author = {Veronica Gil{-}Costa and
Rodrygo L. T. Santos and
Craig Macdonald and
Iadh Ounis},
title = {Modelling efficient novelty-based search result diversification in
metric spaces},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {75--88},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.07.004},
doi = {10.1016/J.JDA.2012.07.004},
timestamp = {Wed, 21 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CostaSMO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreD13,
author = {Maxime Crochemore and
Jacqueline W. Daykin},
title = {StringMasters 2011 Special Issue},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {1--2},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.05.001},
doi = {10.1016/J.JDA.2013.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DimitrovP13,
author = {Nedialko B. Dimitrov and
C. Greg Plaxton},
title = {Optimal cover time for a graph-based coupon collector process},
journal = {J. Discrete Algorithms},
volume = {19},
pages = {39--51},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.02.003},
doi = {10.1016/J.JDA.2013.02.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DimitrovP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Dondi13,
author = {Riccardo Dondi},
title = {The constrained shortest common supersequence problem},
journal = {J. Discrete Algorithms},
volume = {21},
pages = {11--17},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.03.004},
doi = {10.1016/J.JDA.2013.03.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Dondi13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DupretP13,
author = {Georges Dupret and
Benjamin Piwowarski},
title = {Model Based Comparison of Discounted Cumulative Gain and Average Precision},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {49--62},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.10.002},
doi = {10.1016/J.JDA.2012.10.002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/DupretP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EdelkampEK13,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
title = {Weak heaps engineered},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {83--97},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.07.002},
doi = {10.1016/J.JDA.2013.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EdelkampEK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FoucaudK13,
author = {Florent Foucaud and
Matjaz Kovse},
title = {Identifying path covers in graphs},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {21--34},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.07.006},
doi = {10.1016/J.JDA.2013.07.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FoucaudK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FraczakGMT13,
author = {Wojciech Fraczak and
Loukas Georgiadis and
Andrew Miller and
Robert Endre Tarjan},
title = {Finding dominators via disjoint set union},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {2--20},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.10.003},
doi = {10.1016/J.JDA.2013.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FraczakGMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Fukunaga13,
author = {Takuro Fukunaga},
title = {Approximating minimum cost source location problems with local vertex-connectivity
demands},
journal = {J. Discrete Algorithms},
volume = {19},
pages = {30--38},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.02.002},
doi = {10.1016/J.JDA.2013.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Fukunaga13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GhodsniaTML13,
author = {Pedram Ghodsnia and
Kamran Tirdad and
J. Ian Munro and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {A novel approach for leveraging co-occurrence to improve the false
positive error in signature files},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {63--74},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.10.006},
doi = {10.1016/J.JDA.2012.10.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GhodsniaTML13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GotoBIT13,
author = {Keisuke Goto and
Hideo Bannai and
Shunsuke Inenaga and
Masayuki Takeda},
title = {Fast q-gram mining on {SLP} compressed strings},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {89--99},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.07.006},
doi = {10.1016/J.JDA.2012.07.006},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GotoBIT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GrossiSS13,
author = {Roberto Grossi and
Fabrizio Sebastiani and
Fabrizio Silvestri},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {1--2},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.12.008},
doi = {10.1016/J.JDA.2012.12.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GrossiSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Hauptmann13,
author = {Mathias Hauptmann},
title = {On the approximability of Dense Steiner Problems},
journal = {J. Discrete Algorithms},
volume = {21},
pages = {41--51},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.005},
doi = {10.1016/J.JDA.2013.06.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Hauptmann13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HonKSTV13,
author = {Wing{-}Kai Hon and
Tsung{-}Han Ku and
Rahul Shah and
Sharma V. Thankachan and
Jeffrey Scott Vitter},
title = {Compressed text indexing with wildcards},
journal = {J. Discrete Algorithms},
volume = {19},
pages = {23--29},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.12.003},
doi = {10.1016/J.JDA.2012.12.003},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HonKSTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IndhumathiC13,
author = {Indhumathi Raman and
Sheshayya A. Choudum},
title = {Embedding certain height-balanced trees and complete \emph{p}\({}^{\mbox{\emph{m}}}\)-ary
trees into hypercubes},
journal = {J. Discrete Algorithms},
volume = {22},
pages = {53--65},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.07.005},
doi = {10.1016/J.JDA.2013.07.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IndhumathiC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Kucherov13,
author = {Gregory Kucherov},
title = {On-line construction of position heaps},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {3--11},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.08.002},
doi = {10.1016/J.JDA.2012.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Kucherov13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Langiu13,
author = {Alessio Langiu},
title = {On parsing optimality for dictionary-based text compression - the
Zip case},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {65--70},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.04.001},
doi = {10.1016/J.JDA.2013.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Langiu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MahadeokarS13,
author = {Jay Mahadeokar and
Sanjeev Saxena},
title = {Faster replacement paths algorithms in case of edge or node failure
for undirected, positive integer weighted graphs},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {54--62},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.08.001},
doi = {10.1016/J.JDA.2013.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MahadeokarS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MaruyamaNKS13,
author = {Shirou Maruyama and
Masaya Nakahara and
Naoya Kishiue and
Hiroshi Sakamoto},
title = {ESP-index: {A} compressed index based on edit-sensitive parsing},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {100--112},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.07.009},
doi = {10.1016/J.JDA.2012.07.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MaruyamaNKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MondalN0W13,
author = {Debajyoti Mondal and
Rahnuma Islam Nishat and
Md. Saidur Rahman and
Sue Whitesides},
title = {Acyclic coloring with few division vertices},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {42--53},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.08.002},
doi = {10.1016/J.JDA.2013.08.002},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MondalN0W13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MonikandanDR13,
author = {S. Monikandan and
P. Anusha Devi and
S. Sundar Raj},
title = {Degree associated edge reconstruction number of graphs},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {35--41},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.08.003},
doi = {10.1016/J.JDA.2013.08.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MonikandanDR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MoosaRZ13,
author = {Johra Muhammad Moosa and
M. Sohel Rahman and
Fatema Tuz Zohora},
title = {Computing a longest common subsequence that is almost increasing on
sequences having no repeated elements},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {12--20},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.12.005},
doi = {10.1016/J.JDA.2012.12.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MoosaRZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MukhopadhyayP13,
author = {Asish Mukhopadhyay and
Satish Panigrahi},
title = {All-maximum and all-minimum problems under some measures},
journal = {J. Discrete Algorithms},
volume = {21},
pages = {18--31},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.03.008},
doi = {10.1016/J.JDA.2013.03.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MukhopadhyayP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RidderKWFR13,
author = {Corn{\'{e}} de Ridder and
Derrick G. Kourie and
Bruce W. Watson and
T. R. Fourie and
P. V. Reyneke},
title = {Fine-tuning the search for microsatellites},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {21--37},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.12.007},
doi = {10.1016/J.JDA.2012.12.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RidderKWFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Thachuk13,
author = {Chris Thachuk},
title = {Indexing hypertext},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {113--122},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.10.001},
doi = {10.1016/J.JDA.2012.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Thachuk13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WangZ13,
author = {Tao{-}Ming Wang and
Guang{-}Hui Zhang},
title = {On antimagic labeling of regular graphs with particular factors},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {76--82},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.008},
doi = {10.1016/J.JDA.2013.06.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WangZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WasadikarS13,
author = {Meenakshi Wasadikar and
Pradnya Survase},
title = {Lattices, whose incomparability graphs have horns},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {63--75},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.07.001},
doi = {10.1016/J.JDA.2013.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WasadikarS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WeiJ13,
author = {Xiangzhi Wei and
Ajay Joneja},
title = {An improved algorithm for the shortest descending path on a convex
terrain},
journal = {J. Discrete Algorithms},
volume = {19},
pages = {52--56},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.12.001},
doi = {10.1016/J.JDA.2012.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WeiJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AlamR12,
author = {Muhammad Rashed Alam and
M. Sohel Rahman},
title = {The substring inclusion constraint longest common subsequence problem
can be solved in quadratic time},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {67--73},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.11.004},
doi = {10.1016/J.JDA.2012.11.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AlamR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AllaliCFG12,
author = {Julien Allali and
C{\'{e}}dric Chauve and
Pascal Ferraro and
Anne{-}Laure Gaillard},
title = {Efficient chaining of seeds in ordered trees},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {107--118},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.013},
doi = {10.1016/J.JDA.2011.12.013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AllaliCFG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AminiSS12,
author = {Omid Amini and
Ignasi Sau and
Saket Saurabh},
title = {Parameterized complexity of finding small degree-constrained subgraphs},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {70--83},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.05.001},
doi = {10.1016/J.JDA.2011.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AminiSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AmirP12,
author = {Amihood Amir and
Haim Parienty},
title = {Towards a theory of patches},
journal = {J. Discrete Algorithms},
volume = {12},
pages = {61--73},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.022},
doi = {10.1016/J.JDA.2011.12.022},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AmirP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AngeliniBFPR12,
author = {Patrizio Angelini and
Giuseppe Di Battista and
Fabrizio Frati and
Maurizio Patrignani and
Ignaz Rutter},
title = {Testing the simultaneous embeddability of two graphs whose intersection
is a biconnected or a connected graph},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {150--172},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.015},
doi = {10.1016/J.JDA.2011.12.015},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/AngeliniBFPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ApostolicoEGLP12,
author = {Alberto Apostolico and
P{\'{e}}ter L. Erd{\"{o}}s and
Ervin Gy{\"{o}}ri and
Zsuzsanna Lipt{\'{a}}k and
Cinzia Pizzi},
title = {Efficient algorithms for the periodic subgraphs mining problem},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {24--30},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.05.002},
doi = {10.1016/J.JDA.2012.05.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ApostolicoEGLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AraujoBGHMM12,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Jean{-}Claude Bermond and
Fr{\'{e}}d{\'{e}}ric Giroire and
Fr{\'{e}}d{\'{e}}ric Havet and
Dorian Mazauric and
Remigiusz Modrzejewski},
title = {Weighted improper colouring},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {53--66},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.07.001},
doi = {10.1016/J.JDA.2012.07.001},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AraujoBGHMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BakerDF12,
author = {Andrew Baker and
Antoine Deza and
Frantisek Franek},
title = {On the structure of run-maximal strings},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {10--14},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.08.005},
doi = {10.1016/J.JDA.2011.08.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BakerDF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BatuBC12,
author = {Tugkan Batu and
Petra Berenbrink and
Colin Cooper},
title = {Chains-into-bins processes},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {21--28},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.006},
doi = {10.1016/J.JDA.2011.12.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BatuBC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BealA12,
author = {Richard Beal and
Donald A. Adjeroh},
title = {Variations of the parameterized longest previous factor},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {129--150},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.05.004},
doi = {10.1016/J.JDA.2012.05.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BealA12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BealA12a,
author = {Richard Beal and
Donald A. Adjeroh},
title = {p-Suffix sorting as arithmetic coding},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {151--169},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.05.001},
doi = {10.1016/J.JDA.2012.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BealA12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Belazzougui12,
author = {Djamal Belazzougui},
title = {Worst-case efficient single and multiple string matching on packed
texts in the word-RAM model},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {91--106},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.011},
doi = {10.1016/J.JDA.2011.12.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Belazzougui12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BenkertGMW12,
author = {Marc Benkert and
Joachim Gudmundsson and
Damian Merrick and
Thomas Wolle},
title = {Approximate one-to-one point pattern matching},
journal = {J. Discrete Algorithms},
volume = {15},
pages = {1--15},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.03.002},
doi = {10.1016/J.JDA.2012.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BenkertGMW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BentzCPRW12,
author = {C{\'{e}}dric Bentz and
Marie{-}Christine Costa and
Christophe Picouleau and
Bernard Ries and
Dominique de Werra},
title = {d-Transversals of stable sets and vertex covers in weighted bipartite
graphs},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {95--102},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.06.002},
doi = {10.1016/J.JDA.2012.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BentzCPRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Binkele-RaibleF12,
author = {Daniel Binkele{-}Raible and
Henning Fernau},
title = {An exact exponential-time algorithm for the Directed Maximum Leaf
Spanning Tree problem},
journal = {J. Discrete Algorithms},
volume = {15},
pages = {43--55},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.03.006},
doi = {10.1016/J.JDA.2012.03.006},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Binkele-RaibleF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Blanchet-SadriCC12,
author = {Francine Blanchet{-}Sadri and
Bob Chen and
Aleksandar Chakarov},
title = {Number of holes in unavoidable sets of partial words {I}},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {55--64},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.001},
doi = {10.1016/J.JDA.2011.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Blanchet-SadriCC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Blanchet-SadriJR12,
author = {Francine Blanchet{-}Sadri and
Steven Ji and
Elizabeth Reiland},
title = {Number of holes in unavoidable sets of partial words {II}},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {65--73},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.002},
doi = {10.1016/J.JDA.2011.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Blanchet-SadriJR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Blanchet-SadriMS12,
author = {Francine Blanchet{-}Sadri and
Travis Mandel and
Gautam Sisodia},
title = {Periods in partial words: An algorithm},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {113--128},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.001},
doi = {10.1016/J.JDA.2012.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Blanchet-SadriMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BockenhauerFHMSS12,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Karin Freiermuth and
Juraj Hromkovic and
Tobias M{\"{o}}mke and
Andreas Sprock and
Bj{\"{o}}rn Steffen},
title = {Steiner tree reoptimization in graphs with sharpened triangle inequality},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {73--86},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.03.014},
doi = {10.1016/J.JDA.2011.03.014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BockenhauerFHMSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Bocker12,
author = {Sebastian B{\"{o}}cker},
title = {A golden ratio parameterized algorithm for Cluster Editing},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {79--89},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.005},
doi = {10.1016/J.JDA.2012.04.005},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/Bocker12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Bonsma12,
author = {Paul S. Bonsma},
title = {Max-leaves spanning tree is APX-hard for cubic graphs},
journal = {J. Discrete Algorithms},
volume = {12},
pages = {14--23},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.06.005},
doi = {10.1016/J.JDA.2011.06.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Bonsma12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BonsmaBPP12,
author = {Paul S. Bonsma and
Hajo Broersma and
Viresh Patel and
Artem V. Pyatkin},
title = {The complexity of finding uniform sparsest cuts in various graph classes},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {136--149},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.008},
doi = {10.1016/J.JDA.2011.12.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BonsmaBPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BorradaileHW12,
author = {Glencora Borradaile and
Brent Heeringa and
Gordon T. Wilfong},
title = {The knapsack problem with neighbour constraints},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {224--235},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.011},
doi = {10.1016/J.JDA.2012.04.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BorradaileHW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseCC12,
author = {Prosenjit Bose and
Paz Carmi and
Lilach Chaitman{-}Yerushalmi},
title = {On bounded degree plane strong geometric spanners},
journal = {J. Discrete Algorithms},
volume = {15},
pages = {16--31},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.03.004},
doi = {10.1016/J.JDA.2012.03.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoseCC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseDM12,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Pat Morin},
title = {Skip lift: {A} probabilistic alternative to red-black trees},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {13--20},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.017},
doi = {10.1016/J.JDA.2011.12.017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoseDM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseHM12,
author = {Prosenjit Bose and
John Howat and
Pat Morin},
title = {A distribution-sensitive dictionary with low space overhead},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {140--145},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.11.003},
doi = {10.1016/J.JDA.2011.11.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoseHM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BrandesCPS12,
author = {Ulrik Brandes and
Sabine Cornelsen and
Barbara Pampel and
Arnaud Sallaberry},
title = {Path-based supports for hypergraphs},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {248--261},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.009},
doi = {10.1016/J.JDA.2011.12.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BrandesCPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CantoneFG12,
author = {Domenico Cantone and
Simone Faro and
Emanuele Giaquinta},
title = {On the bit-parallel simulation of the nondeterministic Aho-Corasick
and suffix automata for a set of patterns},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {25--36},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.02.001},
doi = {10.1016/J.JDA.2011.02.001},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CantoneFG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CardinalKSV12,
author = {Jean Cardinal and
Marek Karpinski and
Richard Schmied and
Claus Viehmann},
title = {Approximating vertex cover in dense hypergraphs},
journal = {J. Discrete Algorithms},
volume = {13},
pages = {67--77},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.01.003},
doi = {10.1016/J.JDA.2012.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CardinalKSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CarrascosaCGL12,
author = {Rafael Carrascosa and
Fran{\c{c}}ois Coste and
Matthias Gall{\'{e}} and
Gabriel G. Infante L{\'{o}}pez},
title = {Searching for smallest grammars on large sequences and application
to {DNA}},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {62--72},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.04.006},
doi = {10.1016/J.JDA.2011.04.006},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CarrascosaCGL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CharbitHTV12,
author = {Pierre Charbit and
Michel Habib and
Nicolas Trotignon and
Kristina Vuskovic},
title = {Detecting 2-joins faster},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {60--66},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.11.003},
doi = {10.1016/J.JDA.2012.11.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CharbitHTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CheboluCM12,
author = {Prasad Chebolu and
Mary Cryan and
Russell Martin},
title = {Exact counting of Euler tours for generalized series-parallel graphs},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {110--122},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.03.011},
doi = {10.1016/J.JDA.2011.03.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CheboluCM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChimaniMZ12,
author = {Markus Chimani and
Petra Mutzel and
Bernd Zey},
title = {Improved Steiner tree algorithms for bounded treewidth},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {67--78},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.016},
doi = {10.1016/J.JDA.2012.04.016},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ChimaniMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChristouCGIP12,
author = {Michalis Christou and
Maxime Crochemore and
Ondrej Guth and
Costas S. Iliopoulos and
Solon P. Pissis},
title = {On left and right seeds of a string},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {31--44},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.10.004},
doi = {10.1016/J.JDA.2012.10.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChristouCGIP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CiacciaP12,
author = {Paolo Ciaccia and
Marco Patella},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {13},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.10.001},
doi = {10.1016/J.JDA.2011.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CiacciaP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CicaleseEL12,
author = {Ferdinando Cicalese and
P{\'{e}}ter L. Erd{\"{o}}s and
Zsuzsanna Lipt{\'{a}}k},
title = {A linear algorithm for string reconstruction in the reverse complement
equivalence model},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {37--54},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.003},
doi = {10.1016/J.JDA.2011.12.003},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CicaleseEL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ClaudeNPST12,
author = {Francisco Claude and
Gonzalo Navarro and
Hannu Peltola and
Leena Salmela and
Jorma Tarhio},
title = {String matching with alphabet sampling},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {37--50},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2010.09.004},
doi = {10.1016/J.JDA.2010.09.004},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ClaudeNPST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ColbournHS12,
author = {Charles J. Colbourn and
Daniel Horsley and
Violet R. Syrotiuk},
title = {Strengthening hash families and compressive sensing},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {170--186},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.004},
doi = {10.1016/J.JDA.2012.04.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ColbournHS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CondonT12,
author = {Anne Condon and
Chris Thachuk},
title = {Efficient codon optimization with motif engineering},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {104--112},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.017},
doi = {10.1016/J.JDA.2012.04.017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CondonT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CouturierGKP12,
author = {Jean{-}Fran{\c{c}}ois Couturier and
Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma},
title = {On the parameterized complexity of coloring graphs in the absence
of a linear forest},
journal = {J. Discrete Algorithms},
volume = {15},
pages = {56--62},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.008},
doi = {10.1016/J.JDA.2012.04.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CouturierGKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreGLMR12,
author = {Maxime Crochemore and
Laura Giambruno and
Alessio Langiu and
Filippo Mignosi and
Antonio Restivo},
title = {Dictionary-symbolwise flexible parsing},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {74--90},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.021},
doi = {10.1016/J.JDA.2011.12.021},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreGLMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreIKRW12,
author = {Maxime Crochemore and
Costas S. Iliopoulos and
Marcin Kubica and
Wojciech Rytter and
Tomasz Walen},
title = {Efficient algorithms for three variants of the {LPF} table},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {51--61},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.02.002},
doi = {10.1016/J.JDA.2011.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreIKRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreKRRW12,
author = {Maxime Crochemore and
Marcin Kubica and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
title = {On the maximal sum of exponents of runs in a string},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {29--36},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.016},
doi = {10.1016/J.JDA.2011.12.016},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreKRRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DabrowskiLMR12,
author = {Konrad K. Dabrowski and
Vadim V. Lozin and
Haiko M{\"{u}}ller and
Dieter Rautenbach},
title = {Parameterized complexity of the weighted independent set problem beyond
graphs of bounded clique number},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {207--213},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.012},
doi = {10.1016/J.JDA.2011.12.012},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DabrowskiLMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DaykinSZ12,
author = {Jacqueline W. Daykin and
Bill Smyth and
Lynette van Zijl},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.08.004},
doi = {10.1016/J.JDA.2011.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DaykinSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DezaFL12,
author = {Antoine Deza and
Frantisek Franek and
Min Jing Liu},
title = {On a conjecture of Erd{\H{o}}s for multiplicities of cliques},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {9--14},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.10.005},
doi = {10.1016/J.JDA.2012.10.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DezaFL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DurocherLMRW12,
author = {Stephane Durocher and
Pak Ching Li and
Debajyoti Mondal and
Frank Ruskey and
Aaron Williams},
title = {Cool-lex order and k-ary Catalan structures},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {287--307},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.015},
doi = {10.1016/J.JDA.2012.04.015},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/DurocherLMRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DvorakFGKR12,
author = {Tom{\'{a}}s Dvor{\'{a}}k and
Jir{\'{\i}} Fink and
Petr Gregor and
V{\'{a}}clav Koubek and
Tomasz Radzik},
title = {Testing connectivity of faulty networks in sublinear time},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {223--231},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.014},
doi = {10.1016/J.JDA.2011.12.014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DvorakFGKR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EdelkampEK12,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
title = {The weak-heap data structure: Variants and applications},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {187--205},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.010},
doi = {10.1016/J.JDA.2012.04.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EdelkampEK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Elmasry12,
author = {Amr Elmasry},
title = {Enumerating trichromatic triangles containing the origin in linear
time},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {45--50},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.11.001},
doi = {10.1016/J.JDA.2012.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Elmasry12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ElmasryFI12,
author = {Amr Elmasry and
Arash Farzan and
John Iacono},
title = {A priority queue with the time-finger property},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {206--212},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.014},
doi = {10.1016/J.JDA.2012.04.014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ElmasryFI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EricksonS12,
author = {Alejandro Erickson and
Mark Schurch},
title = {Monomer-dimer tatami tilings of square regions},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {258--269},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.002},
doi = {10.1016/J.JDA.2012.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EricksonS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FialaKP12,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {Detecting induced star-like minors in polynomial time},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {74--85},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.11.002},
doi = {10.1016/J.JDA.2012.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FialaKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FlouriIJMP12,
author = {Tom{\'{a}}s Flouri and
Costas S. Iliopoulos and
Jan Janousek and
Borivoj Melichar and
Solon P. Pissis},
title = {Tree template matching in ranked ordered trees by pushdown automata},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {15--23},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.10.003},
doi = {10.1016/J.JDA.2012.10.003},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/FlouriIJMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranekFSS12,
author = {Frantisek Franek and
Robert C. G. Fuller and
Jamie Simpson and
William F. Smyth},
title = {More results on overlapping squares},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {2--8},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.03.003},
doi = {10.1016/J.JDA.2012.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranekFSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gagie12,
author = {Travis Gagie},
title = {Bounds from a card trick},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {2--4},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.08.001},
doi = {10.1016/J.JDA.2011.08.001},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/Gagie12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GamarnikK12,
author = {David Gamarnik and
Dmitriy Katz},
title = {Correlation decay and deterministic {FPTAS} for counting colorings
of a graph},
journal = {J. Discrete Algorithms},
volume = {12},
pages = {29--47},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2010.10.002},
doi = {10.1016/J.JDA.2010.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GamarnikK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GiacomoGKLR12,
author = {Emilio Di Giacomo and
Luca Grilli and
Marcus Krug and
Giuseppe Liotta and
Ignaz Rutter},
title = {Hamiltonian orthogeodesic alternating paths},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {34--52},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.012},
doi = {10.1016/J.JDA.2012.04.012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GiacomoGKLR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GutinJRSY12,
author = {Gregory Z. Gutin and
Adrian Johnstone and
Joseph Reddington and
Elizabeth Scott and
Anders Yeo},
title = {An algorithm for finding input-output constrained convex sets in an
acyclic digraph},
journal = {J. Discrete Algorithms},
volume = {13},
pages = {47--58},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.02.002},
doi = {10.1016/J.JDA.2012.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GutinJRSY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HabgoodA12,
author = {Ken Habgood and
Itamar Arel},
title = {A condensation-based application of Cramer's rule for solving large-scale
linear systems},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {98--109},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.06.007},
doi = {10.1016/J.JDA.2011.06.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HabgoodA12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HasunumaIOU12,
author = {Toru Hasunuma and
Toshimasa Ishii and
Hirotaka Ono and
Yushi Uno},
title = {A tight upper bound on the (2, 1)-total labeling number of outerplanar
graphs},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {189--206},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.020},
doi = {10.1016/J.JDA.2011.12.020},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HasunumaIOU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HauptmannSV12,
author = {Mathias Hauptmann and
Richard Schmied and
Claus Viehmann},
title = {Approximation complexity of Metric Dimension problem},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {214--222},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.010},
doi = {10.1016/J.JDA.2011.12.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HauptmannSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HaynesAP12,
author = {Paul S. Haynes and
Lyuba Alboul and
Jacques Penders},
title = {Dynamic graph-based search in unknown environments},
journal = {J. Discrete Algorithms},
volume = {12},
pages = {2--13},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.06.004},
doi = {10.1016/J.JDA.2011.06.004},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HaynesAP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HeggernesHP12,
author = {Pinar Heggernes and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Computing role assignments of proper interval graphs in polynomial
time},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {173--188},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.004},
doi = {10.1016/J.JDA.2011.12.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HeggernesHP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HonSTV12,
author = {Wing{-}Kai Hon and
Rahul Shah and
Sharma V. Thankachan and
Jeffrey Scott Vitter},
title = {On position restricted substring searching in succinct space},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {109--114},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.09.002},
doi = {10.1016/J.JDA.2012.09.002},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HonSTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IliopoulosKMMPR12,
author = {Costas S. Iliopoulos and
Derrick G. Kourie and
Laurent Mouchard and
Themba K. Musombuka and
Solon P. Pissis and
Corn{\'{e}} de Ridder},
title = {An algorithm for mapping short reads to a dynamically changing genomic
sequence},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {15--22},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.08.006},
doi = {10.1016/J.JDA.2011.08.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IliopoulosKMMPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IliopoulosS12,
author = {Costas S. Iliopoulos and
William F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.03.005},
doi = {10.1016/J.JDA.2012.03.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IliopoulosS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IliopoulosS12a,
author = {Costas S. Iliopoulos and
William F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.07.002},
doi = {10.1016/J.JDA.2012.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IliopoulosS12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IwamaMY12,
author = {Kazuo Iwama and
Shuichi Miyazaki and
Hiroki Yanagisawa},
title = {Improved approximation bounds for the Student-Project Allocation problem
with preferences over projects},
journal = {J. Discrete Algorithms},
volume = {13},
pages = {59--66},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.02.001},
doi = {10.1016/J.JDA.2012.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IwamaMY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KanetaAR12,
author = {Yusaku Kaneta and
Hiroki Arimura and
Rajeev Raman},
title = {Faster bit-parallel algorithms for unordered pseudo-tree matching
and tree homeomorphism},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {119--135},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.018},
doi = {10.1016/J.JDA.2011.12.018},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KanetaAR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KnauerSST12,
author = {Christian Knauer and
Lena Schlipf and
Jens M. Schmidt and
Hans Raj Tiwary},
title = {Largest inscribed rectangles in convex polygons},
journal = {J. Discrete Algorithms},
volume = {13},
pages = {78--85},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.01.002},
doi = {10.1016/J.JDA.2012.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KnauerSST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KopylovaS12,
author = {Evguenia Kopylova and
William F. Smyth},
title = {The three squares lemma revisited},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {3--14},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.03.009},
doi = {10.1016/J.JDA.2011.03.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KopylovaS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LeonardMS12,
author = {Martine L{\'{e}}onard and
Laurent Mouchard and
Mika{\"{e}}l Salson},
title = {On the number of elements to reorder when updating a suffix array},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {87--99},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.01.002},
doi = {10.1016/J.JDA.2011.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LeonardMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MamakaniMR12,
author = {Khalegh Mamakani and
Wendy J. Myrvold and
Frank Ruskey},
title = {Generating simple convex Venn diagrams},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {270--286},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.013},
doi = {10.1016/J.JDA.2012.04.013},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/MamakaniMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MaoMM12,
author = {Rui Mao and
Willard L. Miranker and
Daniel P. Miranker},
title = {Pivot selection: Dimension reduction for distance-based indexing},
journal = {J. Discrete Algorithms},
volume = {13},
pages = {32--46},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.10.004},
doi = {10.1016/J.JDA.2011.10.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MaoMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Mishra12,
author = {Sounaka Mishra},
title = {Complexity of majority monopoly and signed domination problems},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {49--60},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.019},
doi = {10.1016/J.JDA.2011.12.019},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Mishra12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MondalNW012,
author = {Debajyoti Mondal and
Rahnuma Islam Nishat and
Sue Whitesides and
Md. Saidur Rahman},
title = {Acyclic colorings of graph subdivisions revisited},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {90--103},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.06.001},
doi = {10.1016/J.JDA.2012.06.001},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MondalNW012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MoosaR12,
author = {Tanaeem M. Moosa and
M. Sohel Rahman},
title = {Sub-quadratic time and linear space data structures for permutation
matching in binary strings},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {5--9},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.08.003},
doi = {10.1016/J.JDA.2011.08.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MoosaR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MouchardP12,
author = {Laurent Mouchard and
Simon J. Puglisi},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.12.002},
doi = {10.1016/J.JDA.2012.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MouchardP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NavarraPF12,
author = {Alfredo Navarra and
Maria Cristina Pinotti and
Andrea Formisano},
title = {Distributed colorings for collision-free routing in sink-centric sensor
networks},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {232--247},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.007},
doi = {10.1016/J.JDA.2011.12.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NavarraPF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NazeenRR12,
author = {Sumaiya Nazeen and
M. Sohel Rahman and
Rezwana Reaz},
title = {Indeterminate string inference algorithms},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {23--34},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.08.002},
doi = {10.1016/J.JDA.2011.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NazeenRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NovakSHL12,
author = {Jir{\'{\i}} Nov{\'{a}}k and
Tom{\'{a}}s Skopal and
David Hoksza and
Jakub Lokoc},
title = {Non-metric similarity search of tandem mass spectra including posttranslational
modifications},
journal = {J. Discrete Algorithms},
volume = {13},
pages = {19--31},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.10.003},
doi = {10.1016/J.JDA.2011.10.003},
timestamp = {Sat, 18 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/NovakSHL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Nutov12,
author = {Zeev Nutov},
title = {Approximating subset k-connectivity problems},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {51--59},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.08.001},
doi = {10.1016/J.JDA.2012.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Nutov12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PatilST12,
author = {Manish Patil and
Rahul Shah and
Sharma V. Thankachan},
title = {Succinct representations of weighted trees supporting path queries},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {103--108},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.08.003},
doi = {10.1016/J.JDA.2012.08.003},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PatilST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Pestov12,
author = {Vladimir Pestov},
title = {Indexability, concentration, and {VC} theory},
journal = {J. Discrete Algorithms},
volume = {13},
pages = {2--18},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.10.002},
doi = {10.1016/J.JDA.2011.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Pestov12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RadoszewskiR12,
author = {Jakub Radoszewski and
Wojciech Rytter},
title = {On the structure of compacted subword graphs of Thue-Morse words and
their applications},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {15--24},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.01.001},
doi = {10.1016/J.JDA.2011.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RadoszewskiR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RadzikT12,
author = {Tomasz Radzik and
German Tischler},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {1--2},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.06.006},
doi = {10.1016/J.JDA.2011.06.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RadzikT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RahmatiZ12,
author = {Zahed Rahmati and
Alireza Zarei},
title = {Kinetic Euclidean minimum spanning tree in the plane},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {2--11},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.009},
doi = {10.1016/J.JDA.2012.04.009},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/RahmatiZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RanjanSZ12,
author = {Desh Ranjan and
John E. Savage and
Mohammad Zubair},
title = {Upper and lower {I/O} bounds for pebbling r-pyramids},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {2--12},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.005},
doi = {10.1016/J.JDA.2011.12.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RanjanSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RawitzS12,
author = {Dror Rawitz and
Shimon Shahar},
title = {Capacitated Arc Stabbing},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {86--94},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.09.001},
doi = {10.1016/J.JDA.2012.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RawitzS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Roy12,
author = {Sasanka Roy},
title = {Near optimal algorithm for the shortest descending path on the surface
of a convex terrain},
journal = {J. Discrete Algorithms},
volume = {15},
pages = {63--70},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.03.001},
doi = {10.1016/J.JDA.2012.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Roy12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RoyDD12,
author = {Senjuti Basu Roy and
Gautam Das and
Sajal K. Das},
title = {Algorithms for computing Best Coverage Path in the presence of obstacles
in a sensor field},
journal = {J. Discrete Algorithms},
volume = {13},
pages = {86--97},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.01.004},
doi = {10.1016/J.JDA.2012.01.004},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RoyDD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RuskeyWY12,
author = {Frank Ruskey and
Jennifer Woodcock and
Yuji Yamauchi},
title = {Counting and computing the Rand and block distances of pairs of set
partitions},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {236--248},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.003},
doi = {10.1016/J.JDA.2012.04.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/RuskeyWY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Rusu12,
author = {Irena Rusu},
title = {New applications of interval generators to genome comparison},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {123--139},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.11.002},
doi = {10.1016/J.JDA.2011.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Rusu12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SaitohOYU12,
author = {Toshiki Saitoh and
Yota Otachi and
Katsuhisa Yamanaka and
Ryuhei Uehara},
title = {Random generation and enumeration of bipartite permutation graphs},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {84--97},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.11.001},
doi = {10.1016/J.JDA.2011.11.001},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SaitohOYU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Schaudt12,
author = {Oliver Schaudt},
title = {On weighted efficient total domination},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {61--69},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.06.001},
doi = {10.1016/J.JDA.2011.06.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Schaudt12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Schaudt12a,
author = {Oliver Schaudt},
title = {Efficient total domination in digraphs},
journal = {J. Discrete Algorithms},
volume = {15},
pages = {32--42},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.02.003},
doi = {10.1016/J.JDA.2012.02.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Schaudt12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SenftD12,
author = {Martin Senft and
Tom{\'{a}}s Dvor{\'{a}}k},
title = {On-line suffix tree construction with reduced branching},
journal = {J. Discrete Algorithms},
volume = {12},
pages = {48--60},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.01.001},
doi = {10.1016/J.JDA.2012.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SenftD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ShachnaiT12,
author = {Hadas Shachnai and
Tami Tamir},
title = {Approximation schemes for generalized two-dimensional vector packing
with application to data placement},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {35--48},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.07.001},
doi = {10.1016/J.JDA.2011.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ShachnaiT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SorgeBNW12,
author = {Manuel Sorge and
Ren{\'{e}} van Bevern and
Rolf Niedermeier and
Mathias Weller},
title = {A new view on Rural Postman based on Eulerian Extension and Matching},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {12--33},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.007},
doi = {10.1016/J.JDA.2012.04.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SorgeBNW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/StewartPJ12,
author = {Iain A. Stewart and
Dani{\"{e}}l Paulusma and
Matthew Johnson},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {12},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.08.007},
doi = {10.1016/J.JDA.2011.08.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/StewartPJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SudholtT12,
author = {Dirk Sudholt and
Christian Thyssen},
title = {Running time analysis of Ant Colony Optimization for shortest path
problems},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {165--180},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.06.002},
doi = {10.1016/J.JDA.2011.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SudholtT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Trahtman12,
author = {A. N. Trahtman},
title = {An algorithm for road coloring},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {213--223},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.05.003},
doi = {10.1016/J.JDA.2012.05.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Trahtman12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/VenkaiahG12,
author = {Vadlamudi Ch. Venkaiah and
T. Aaron Gulliver},
title = {Quasi-cyclic codes over F\({}_{\mbox{13}}\) and enumeration of defining
polynomials},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {249--257},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.006},
doi = {10.1016/J.JDA.2012.04.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/VenkaiahG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/VernitskiP12,
author = {Alexei Vernitski and
Artem V. Pyatkin},
title = {Astral graphs (threshold graphs), scale-free graphs and related algorithmic
questions},
journal = {J. Discrete Algorithms},
volume = {12},
pages = {24--28},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.06.003},
doi = {10.1016/J.JDA.2011.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/VernitskiP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WalickiD12,
author = {Michal Walicki and
Sjur K. Dyrkolbotn},
title = {Finding kernels or solving {SAT}},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {146--164},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.11.004},
doi = {10.1016/J.JDA.2011.11.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WalickiD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Abu-KhzamML11,
author = {Faisal N. Abu{-}Khzam and
Amer E. Mouawad and
Mathieu Liedloff},
title = {An exact algorithm for connected red-blue dominating set},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {252--262},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.006},
doi = {10.1016/J.JDA.2011.03.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Abu-KhzamML11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AhmedMNR11,
author = {Mustaq Ahmed and
Anil Maheshwari and
Subhas C. Nandy and
Sasanka Roy},
title = {On the number of shortest descending paths on the surface of a convex
terrain},
journal = {J. Discrete Algorithms},
volume = {9},
number = {2},
pages = {182--189},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.12.002},
doi = {10.1016/J.JDA.2010.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AhmedMNR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AndresH11,
author = {Stephan Dominique Andres and
Winfried Hochst{\"{a}}ttler},
title = {Some heuristics for the binary paint shop problem and their expected
number of colour changes},
journal = {J. Discrete Algorithms},
volume = {9},
number = {2},
pages = {203--211},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.12.003},
doi = {10.1016/J.JDA.2010.12.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AndresH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AngelovIKM11,
author = {Stanislav Angelov and
Shunsuke Inenaga and
Teemu Kivioja and
Veli M{\"{a}}kinen},
title = {Missing pattern discovery},
journal = {J. Discrete Algorithms},
volume = {9},
number = {2},
pages = {153--165},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.08.005},
doi = {10.1016/J.JDA.2010.08.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AngelovIKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BackofenLMTW11,
author = {Rolf Backofen and
Gad M. Landau and
Mathias M{\"{o}}hl and
Dekel Tsur and
Oren Weimann},
title = {Fast {RNA} structure alignment for crossing input structures},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {2--11},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.07.004},
doi = {10.1016/J.JDA.2010.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BackofenLMTW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BackofenTZZ11,
author = {Rolf Backofen and
Dekel Tsur and
Shay Zakov and
Michal Ziv{-}Ukelson},
title = {Sparse {RNA} folding: Time and space efficient algorithms},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {12--31},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.001},
doi = {10.1016/J.JDA.2010.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BackofenTZZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BerntCCCMWCM11,
author = {Matthias Bernt and
Kuan{-}Yu Chen and
Ming{-}Chiang Chen and
An{-}Chiang Chu and
Daniel Merkle and
Hung{-}Lung Wang and
Kun{-}Mao Chao and
Martin Middendorf},
title = {Finding all sorting tandem duplication random loss operations},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {32--48},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.006},
doi = {10.1016/J.JDA.2010.09.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BerntCCCMWCM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Bille11,
author = {Philip Bille},
title = {Fast searching in packed strings},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {49--56},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.003},
doi = {10.1016/J.JDA.2010.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Bille11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Binkele-RaibleBCFKKLLPRW11,
author = {Daniel Binkele{-}Raible and
Ljiljana Brankovic and
Marek Cygan and
Henning Fernau and
Joachim Kneis and
Dieter Kratsch and
Alexander Langer and
Mathieu Liedloff and
Marcin Pilipczuk and
Peter Rossmanith and
Jakub Onufry Wojtaszczyk},
title = {Breaking the 2\({}^{\mbox{n}}\)-barrier for Irredundance: Two lines
of attack},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {214--230},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.002},
doi = {10.1016/J.JDA.2011.03.002},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Binkele-RaibleBCFKKLLPRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseCC11,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture},
title = {Spanners of additively weighted point sets},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {287--298},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.001},
doi = {10.1016/J.JDA.2011.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoseCC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BourdonR11,
author = {J{\'{e}}r{\'{e}}mie Bourdon and
Irena Rusu},
title = {Statistical properties of factor oracles},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {57--66},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.10.001},
doi = {10.1016/J.JDA.2010.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BourdonR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CaiY11,
author = {Leizhen Cai and
Boting Yang},
title = {Parameterized complexity of even/odd subgraph problems},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {231--240},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.004},
doi = {10.1016/J.JDA.2011.03.004},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CaiY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CalamoneriD11,
author = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {213},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.003},
doi = {10.1016/J.JDA.2011.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CalamoneriD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChanLSTW11,
author = {Ho{-}Leung Chan and
Tak Wah Lam and
Wing{-}Kin Sung and
Siu{-}Lung Tam and
Swee{-}Seong Wong},
title = {A linear size index for approximate pattern matching},
journal = {J. Discrete Algorithms},
volume = {9},
number = {4},
pages = {358--364},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.04.004},
doi = {10.1016/J.JDA.2011.04.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChanLSTW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CheilarisT11,
author = {Panagiotis Cheilaris and
G{\'{e}}za T{\'{o}}th},
title = {Graph unique-maximum and conflict-free colorings},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {241--251},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.005},
doi = {10.1016/J.JDA.2011.03.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CheilarisT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CliffordS11,
author = {Rapha{\"{e}}l Clifford and
Benjamin Sach},
title = {Pattern matching in pseudo real-time},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {67--81},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.005},
doi = {10.1016/J.JDA.2010.09.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CliffordS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DavidN11,
author = {Johnny David and
Zeev Nutov},
title = {Approximating survivable networks with {\(\beta\)}-metric costs},
journal = {J. Discrete Algorithms},
volume = {9},
number = {2},
pages = {170--175},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.11.002},
doi = {10.1016/J.JDA.2010.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DavidN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DondiFV11,
author = {Riccardo Dondi and
Guillaume Fertin and
St{\'{e}}phane Vialette},
title = {Complexity issues in vertex-colored graph pattern matching},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {82--99},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.002},
doi = {10.1016/J.JDA.2010.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DondiFV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EhrenfeuchtMOW11,
author = {Andrzej Ehrenfeucht and
Ross M. McConnell and
Nissa Osheim and
Sung{-}Whan Woo},
title = {Position heaps: {A} simple and dynamic text indexing data structure},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {100--121},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.12.001},
doi = {10.1016/J.JDA.2010.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EhrenfeuchtMOW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Evans11,
author = {Patricia A. Evans},
title = {Finding common {RNA} pseudoknot structures in polynomial time},
journal = {J. Discrete Algorithms},
volume = {9},
number = {4},
pages = {335--343},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.04.002},
doi = {10.1016/J.JDA.2011.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Evans11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ExooMMN11,
author = {Geoffrey Exoo and
Brendan D. McKay and
Wendy J. Myrvold and
Jacqueline Nadon},
title = {Computational determination of (3, 11) and (4, 7) cages},
journal = {J. Discrete Algorithms},
volume = {9},
number = {2},
pages = {166--169},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.11.001},
doi = {10.1016/J.JDA.2010.11.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ExooMMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranceschiniH11,
author = {Gianni Franceschini and
Torben Hagerup},
title = {Finding the maximum suffix with fewer comparisons},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {279--286},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.008},
doi = {10.1016/J.JDA.2011.03.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranceschiniH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GagieN11,
author = {Travis Gagie and
Yakov Nekrich},
title = {Tight bounds for online stable sorting},
journal = {J. Discrete Algorithms},
volume = {9},
number = {2},
pages = {176--181},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.01.003},
doi = {10.1016/J.JDA.2011.01.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GagieN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HundtL11,
author = {Christian Hundt and
Maciej Liskiewicz},
title = {New complexity bounds for image matching under rotation and scaling},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {122--136},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.06.002},
doi = {10.1016/J.JDA.2010.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HundtL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KaminskiPT11,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Contracting planar graphs to contractions of triangulations},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {299--306},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.010},
doi = {10.1016/J.JDA.2011.03.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KaminskiPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KingsfordZS11,
author = {Carl Kingsford and
Elena Zaslavsky and
Mona Singh},
title = {A cost-aggregating integer linear program for motif finding},
journal = {J. Discrete Algorithms},
volume = {9},
number = {4},
pages = {326--334},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.04.001},
doi = {10.1016/J.JDA.2011.04.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/KingsfordZS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KomusiewiczNU11,
author = {Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
title = {Deconstructing intractability - {A} multivariate complexity analysis
of interval constrained coloring},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {137--151},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.07.003},
doi = {10.1016/J.JDA.2010.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KomusiewiczNU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KubicaRVW11,
author = {Marcin Kubica and
Romeo Rizzi and
St{\'{e}}phane Vialette and
Tomasz Walen},
title = {Approximation of {RNA} multiple structural alignment},
journal = {J. Discrete Algorithms},
volume = {9},
number = {4},
pages = {365--376},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.03.002},
doi = {10.1016/J.JDA.2010.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KubicaRVW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KucherovU11,
author = {Gregory Kucherov and
Esko Ukkonen},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {1},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.01.004},
doi = {10.1016/J.JDA.2011.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KucherovU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KutzBKK11,
author = {Martin Kutz and
Gerth St{\o}lting Brodal and
Kanela Kaligosi and
Irit Katriel},
title = {Faster algorithms for computing longest common increasing subsequences},
journal = {J. Discrete Algorithms},
volume = {9},
number = {4},
pages = {314--325},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.013},
doi = {10.1016/J.JDA.2011.03.013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KutzBKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LewensteinV11,
author = {Moshe Lewenstein and
Gabriel Valiente},
title = {{CPM} 2006},
journal = {J. Discrete Algorithms},
volume = {9},
number = {4},
pages = {313},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.012},
doi = {10.1016/J.JDA.2011.03.012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LewensteinV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Ozery-FlatoS11,
author = {Michal Ozery{-}Flato and
Ron Shamir},
title = {An O(n\({}^{\mbox{3/2}}\)sqrt(log(n))) algorithm for sorting by reciprocal
translocations},
journal = {J. Discrete Algorithms},
volume = {9},
number = {4},
pages = {344--357},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.04.003},
doi = {10.1016/J.JDA.2011.04.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Ozery-FlatoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ReviriegoHM11,
author = {Pedro Reviriego and
Lars Holst and
Juan Antonio Maestro},
title = {On the expected longest length probe sequence for hashing with separate
chaining},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {307--312},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.04.005},
doi = {10.1016/J.JDA.2011.04.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ReviriegoHM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SafroT11,
author = {Ilya Safro and
Boris Temkin},
title = {Multiscale approach for the network compression-friendly ordering},
journal = {J. Discrete Algorithms},
volume = {9},
number = {2},
pages = {190--202},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.007},
doi = {10.1016/J.JDA.2010.09.007},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/SafroT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/TripathiVK11,
author = {Rahul Tripathi and
Elena Valkanova and
V. S. Anil Kumar},
title = {On strategy improvement algorithms for simple stochastic games},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {263--278},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.007},
doi = {10.1016/J.JDA.2011.03.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/TripathiVK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AhmedDLLMR10,
author = {Mustaq Ahmed and
Sandip Das and
Sachin Lodha and
Anna Lubiw and
Anil Maheshwari and
Sasanka Roy},
title = {Approximation algorithms for shortest descending paths in terrains},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {214--230},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.05.001},
doi = {10.1016/J.JDA.2009.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AhmedDLLMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AminiMMM10,
author = {Hadis Amini and
Fr{\'{e}}d{\'{e}}ric Meunier and
H{\'{e}}lo{\"{\i}}se Michel and
Atefeh Mohajeri},
title = {Greedy colorings for the binary paintshop problem},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {8--14},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2008.05.002},
doi = {10.1016/J.JDA.2008.05.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AminiMMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AmirGS10,
author = {Amihood Amir and
Zvi Gotthilf and
B. Riva Shalom},
title = {Weighted {LCS}},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {273--281},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.02.001},
doi = {10.1016/J.JDA.2010.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AmirGS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AugustinePR10,
author = {John Augustine and
Brian Putnam and
Sasanka Roy},
title = {Largest empty circle centered on a query line},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {143--153},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.10.002},
doi = {10.1016/J.JDA.2009.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AugustinePR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Binkele-RaibleF10,
author = {Daniel Binkele{-}Raible and
Henning Fernau},
title = {A new upper bound for Max-2-SAT: {A} graph-theoretic approach},
journal = {J. Discrete Algorithms},
volume = {8},
number = {4},
pages = {388--401},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.06.001},
doi = {10.1016/J.JDA.2010.06.001},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Binkele-RaibleF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BockenhauerK10,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Dennis Komm},
title = {Reoptimization of the metric deadline {TSP}},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {87--100},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.04.001},
doi = {10.1016/J.JDA.2009.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BockenhauerK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoriaP10,
author = {Nicolas Boria and
Vangelis Th. Paschos},
title = {Fast reoptimization for the minimum spanning tree problem},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {296--310},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.07.002},
doi = {10.1016/J.JDA.2009.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoriaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseCLMMS10,
author = {Prosenjit Bose and
S{\'{e}}bastien Collette and
Stefan Langerman and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Sigma-local graphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {15--23},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2008.10.002},
doi = {10.1016/J.JDA.2008.10.002},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BoseCLMMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BressanP10,
author = {Marco Bressan and
Enoch Peserico},
title = {Choose the damping, choose the ranking?},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {199--213},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.11.001},
doi = {10.1016/J.JDA.2009.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BressanP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS10,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {101},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.07.003},
doi = {10.1016/J.JDA.2009.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaP10,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma},
title = {Computing sharp 2-factors in claw-free graphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {321--329},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.07.001},
doi = {10.1016/J.JDA.2009.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ByrkaGHK10,
author = {Jaroslaw Byrka and
Pawel Gawrychowski and
Katharina T. Huber and
Steven Kelk},
title = {Worst-case optimal approximation algorithms for maximizing triplet
consistency within phylogenetic networks},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {65--75},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.01.004},
doi = {10.1016/J.JDA.2009.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ByrkaGHK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DezaX10,
author = {Antoine Deza and
Feng Xie},
title = {On the generalized Berge sorting conjecture},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {1--7},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.10.001},
doi = {10.1016/J.JDA.2009.10.001},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/DezaX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DomGHNT10,
author = {Michael Dom and
Jiong Guo and
Falk H{\"{u}}ffner and
Rolf Niedermeier and
Anke Tru{\ss}},
title = {Fixed-parameter tractability results for feedback set problems in
tournaments},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {76--86},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.08.001},
doi = {10.1016/J.JDA.2009.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DomGHNT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EpsteinL10,
author = {Leah Epstein and
Meital Levy},
title = {Dynamic multi-dimensional bin packing},
journal = {J. Discrete Algorithms},
volume = {8},
number = {4},
pages = {356--372},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.07.002},
doi = {10.1016/J.JDA.2010.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EpsteinL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EscoffierGM10,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {Complexity and approximation results for the connected vertex cover
problem in graphs and hypergraphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {36--49},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.01.005},
doi = {10.1016/J.JDA.2009.01.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EscoffierGM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gassner10,
author = {Elisabeth Gassner},
title = {The Steiner Forest Problem revisited},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {154--163},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.05.002},
doi = {10.1016/J.JDA.2009.05.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Gassner10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GiesekeGV10,
author = {Fabian Gieseke and
Joachim Gudmundsson and
Jan Vahrenhold},
title = {Pruning spanners and constructing well-separated pair decompositions
in the presence of memory hierarchies},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {259--272},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.03.001},
doi = {10.1016/J.JDA.2010.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GiesekeGV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HonPSW10,
author = {Wing{-}Kai Hon and
Manish Patil and
Rahul Shah and
Shih{-}Bin Wu},
title = {Efficient index for retrieving top-k most frequent documents},
journal = {J. Discrete Algorithms},
volume = {8},
number = {4},
pages = {402--417},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.08.003},
doi = {10.1016/J.JDA.2010.08.003},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HonPSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HongN10,
author = {Seok{-}Hee Hong and
Hiroshi Nagamochi},
title = {Convex drawings of hierarchical planar graphs and clustered planar
graphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {282--295},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.05.003},
doi = {10.1016/J.JDA.2009.05.003},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/HongN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IlieNT10,
author = {Lucian Ilie and
Gonzalo Navarro and
Liviu Tinta},
title = {The longest common extension problem revisited and applications to
approximate string searching},
journal = {J. Discrete Algorithms},
volume = {8},
number = {4},
pages = {418--428},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.08.004},
doi = {10.1016/J.JDA.2010.08.004},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IlieNT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IliopoulosRVV10,
author = {Costas S. Iliopoulos and
M. Sohel Rahman and
Michal Vor{\'{a}}cek and
Ladislav Vagner},
title = {Finite automata based algorithms on subsequences and supersequences
of degenerate strings},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {117--130},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2008.10.004},
doi = {10.1016/J.JDA.2008.10.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IliopoulosRVV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KaporisMMSTTZ10,
author = {Alexis C. Kaporis and
Christos Makris and
George Mavritsakis and
Spyros Sioutas and
Athanasios K. Tsakalidis and
Kostas Tsichlas and
Christos D. Zaroliagis},
title = {ISB-tree: {A} new indexing scheme with efficient expected behaviour},
journal = {J. Discrete Algorithms},
volume = {8},
number = {4},
pages = {373--387},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.08.001},
doi = {10.1016/J.JDA.2010.08.001},
timestamp = {Sat, 06 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/KaporisMMSTTZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KhandekarP10,
author = {Rohit Khandekar and
Vinayaka Pandit},
title = {Online and offline algorithms for the sorting buffers problem on the
line metric},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {24--35},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2008.08.002},
doi = {10.1016/J.JDA.2008.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KhandekarP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LandoN10,
author = {Yuval Lando and
Zeev Nutov},
title = {On minimum power connectivity problems},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {164--173},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.03.002},
doi = {10.1016/J.JDA.2009.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LandoN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LatschS10,
author = {Martin L{\"{a}}tsch and
Rainer Schrader},
title = {Distance-hereditary digraphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {231--240},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.11.002},
doi = {10.1016/J.JDA.2009.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LatschS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MichaelNU10,
author = {Morris Michael and
Fran{\c{c}}ois Nicolas and
Esko Ukkonen},
title = {On the complexity of finding gapped motifs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {131--142},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.12.001},
doi = {10.1016/J.JDA.2009.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MichaelNU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MorsyN10,
author = {Ehab Morsy and
Hiroshi Nagamochi},
title = {On the approximation of the generalized capacitated tree-routing problem},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {311--320},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.08.002},
doi = {10.1016/J.JDA.2009.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MorsyN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NaorRS10,
author = {Joseph Naor and
Adi Ros{\'{e}}n and
Gabriel Scalosub},
title = {Online time-constrained scheduling in linear and ring networks},
journal = {J. Discrete Algorithms},
volume = {8},
number = {4},
pages = {346--355},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.07.001},
doi = {10.1016/J.JDA.2010.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NaorRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OrlinMSW10,
author = {James B. Orlin and
Kamesh Madduri and
K. Subramani and
Matthew D. Williamson},
title = {A faster algorithm for the single source shortest path problem with
few distinct positive lengths},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {189--198},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.03.001},
doi = {10.1016/J.JDA.2009.03.001},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OrlinMSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SalsonLLM10,
author = {Mika{\"{e}}l Salson and
Thierry Lecroq and
Martine L{\'{e}}onard and
Laurent Mouchard},
title = {Dynamic extended suffix arrays},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {241--257},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.02.007},
doi = {10.1016/J.JDA.2009.02.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SalsonLLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SamerS10,
author = {Marko Samer and
Stefan Szeider},
title = {Algorithms for propositional model counting},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {50--64},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.06.002},
doi = {10.1016/J.JDA.2009.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SamerS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SauT10,
author = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Subexponential parameterized algorithms for degree-constrained subgraph
problems on planar graphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {330--338},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.02.002},
doi = {10.1016/J.JDA.2010.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SauT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ShalomWZ10,
author = {Mordechai Shalom and
Prudence W. H. Wong and
Shmuel Zaks},
title = {Optimal on-line colorings for minimizing the number of ADMs in optical
networks},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {174--188},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.02.006},
doi = {10.1016/J.JDA.2009.02.006},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ShalomWZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SngM10,
author = {Colin T. S. Sng and
David F. Manlove},
title = {Popular matchings in the weighted capacitated house allocation problem},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {102--116},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2008.11.008},
doi = {10.1016/J.JDA.2008.11.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SngM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Tsur10,
author = {Dekel Tsur},
title = {Fast index for approximate string matching},
journal = {J. Discrete Algorithms},
volume = {8},
number = {4},
pages = {339--345},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.08.002},
doi = {10.1016/J.JDA.2010.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Tsur10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Ahmed09,
author = {Mustaq Ahmed},
title = {Ordered interval routing schemes},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {363--376},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.06.001},
doi = {10.1016/J.JDA.2009.06.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Ahmed09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AndoNY09,
author = {Ei Ando and
Toshio Nakata and
Masafumi Yamashita},
title = {Approximating the longest path length of a stochastic {DAG} by a normal
distribution in linear time},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {420--438},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.01.001},
doi = {10.1016/J.JDA.2009.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AndoNY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ApostolicoS09,
author = {Alberto Apostolico and
Giorgio Satta},
title = {Discovering subword associations in strings in time linear in the
output size},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {227--238},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2007.02.003},
doi = {10.1016/J.JDA.2007.02.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ApostolicoS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AtanassovBCMMPSW09,
author = {Rossen Atanassov and
Prosenjit Bose and
Mathieu Couture and
Anil Maheshwari and
Pat Morin and
Michel Paquette and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {Algorithms for optimal outlier removal},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {239--248},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.12.002},
doi = {10.1016/J.JDA.2008.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AtanassovBCMMPSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AusielloEMP09,
author = {Giorgio Ausiello and
Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Reoptimization of minimum and maximum traveling salesman's tours},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {453--463},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.12.001},
doi = {10.1016/J.JDA.2008.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AusielloEMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BalisterGGJRSSY09,
author = {Paul N. Balister and
Stefanie Gerke and
Gregory Z. Gutin and
Adrian Johnstone and
Joseph Reddington and
Elizabeth Scott and
Arezou Soleimanfallah and
Anders Yeo},
title = {Algorithms for generating convex sets in acyclic digraphs},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {509--518},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.07.008},
doi = {10.1016/J.JDA.2008.07.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BalisterGGJRSSY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BattistaDF09,
author = {Giuseppe Di Battista and
Guido Drovandi and
Fabrizio Frati},
title = {How to draw a clustered tree},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {479--499},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.015},
doi = {10.1016/J.JDA.2008.09.015},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BattistaDF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BentzCDR09,
author = {C{\'{e}}dric Bentz and
Marie{-}Christine Costa and
Nicolas Derhy and
Fr{\'{e}}d{\'{e}}ric Roupin},
title = {Cardinality constrained and multicriteria (multi)cut problems},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {102--111},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.04.004},
doi = {10.1016/J.JDA.2008.04.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BentzCDR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BienkowskiBKH09,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Miroslaw Korzeniowski and
Friedhelm Meyer auf der Heide},
title = {Optimal algorithms for page migration in dynamic networks},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {545--569},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.07.006},
doi = {10.1016/J.JDA.2008.07.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BienkowskiBKH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BilleG09,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Matching subsequences in trees},
journal = {J. Discrete Algorithms},
volume = {7},
number = {3},
pages = {306--314},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.005},
doi = {10.1016/J.JDA.2008.11.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BilleG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BleischwitzM09,
author = {Yvonne Bleischwitz and
Burkhard Monien},
title = {Fair cost-sharing methods for scheduling jobs on parallel machines},
journal = {J. Discrete Algorithms},
volume = {7},
number = {3},
pages = {280--290},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.02.001},
doi = {10.1016/J.JDA.2009.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BleischwitzM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BorgeltKLLMSV09,
author = {Magdalene G. Borgelt and
Marc J. van Kreveld and
Maarten L{\"{o}}ffler and
Jun Luo and
Damian Merrick and
Rodrigo I. Silveira and
Mostafa Vahedi},
title = {Planar bichromatic minimum spanning trees},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {469--478},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.08.001},
doi = {10.1016/J.JDA.2008.08.001},
timestamp = {Thu, 21 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BorgeltKLLMSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS09,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {147},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.002},
doi = {10.1016/J.JDA.2008.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CakirogluEKS09,
author = {Olca A. {\c{C}}akiroglu and
Cesim Erten and
{\"{O}}mer Karatas and
Melih S{\"{o}}zdinler},
title = {Crossing minimization in weighted bipartite graphs},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {439--452},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.08.003},
doi = {10.1016/J.JDA.2008.08.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CakirogluEKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChavezN09,
author = {Edgar Ch{\'{a}}vez and
Gonzalo Navarro},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {1--2},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.10.001},
doi = {10.1016/J.JDA.2008.10.001},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChavezN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChlebikC09,
author = {Miroslav Chleb{\'{\i}}k and
Janka Chleb{\'{\i}}kov{\'{a}}},
title = {Hardness of approximation for orthogonal rectangle packing and covering
problems},
journal = {J. Discrete Algorithms},
volume = {7},
number = {3},
pages = {291--305},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.02.002},
doi = {10.1016/J.JDA.2009.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChlebikC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CostaMR09,
author = {Veronica Gil{-}Costa and
Mauricio Mar{\'{\i}}n and
Nora Reyes},
title = {Parallel query processing on distributed clustering indexes},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {3--17},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.010},
doi = {10.1016/J.JDA.2008.09.010},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CostaMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Creed09,
author = {P{\'{a}}id{\'{\i}} J. Creed},
title = {Sampling Eulerian orientations of triangular lattice graphs},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {168--180},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.006},
doi = {10.1016/J.JDA.2008.09.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Creed09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DamaschkeM09,
author = {Peter Damaschke and
Leonid Molokov},
title = {The union of minimal hitting sets: Parameterized combinatorial bounds
and counting},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {391--401},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.01.003},
doi = {10.1016/J.JDA.2009.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DamaschkeM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DumitrescuT09,
author = {Adrian Dumitrescu and
Csaba D. T{\'{o}}th},
title = {Light orthogonal networks with constant geometric dilation},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {112--129},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.07.007},
doi = {10.1016/J.JDA.2008.07.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DumitrescuT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FernauM09,
author = {Henning Fernau and
David F. Manlove},
title = {Vertex and edge covers with clustering properties: Complexity and
algorithms},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {149--167},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.007},
doi = {10.1016/J.JDA.2008.09.007},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FernauM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FertinRV09,
author = {Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {Finding occurrences of protein complexes in protein-protein interaction
graphs},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {90--101},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.003},
doi = {10.1016/J.JDA.2008.11.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FertinRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FredrikssonG09,
author = {Kimmo Fredriksson and
Szymon Grabowski},
title = {Average-optimal string matching},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {579--594},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.001},
doi = {10.1016/J.JDA.2008.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FredrikssonG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gao09,
author = {Yong Gao},
title = {Threshold dominating cliques in random graphs and interval routing},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {519--532},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.002},
doi = {10.1016/J.JDA.2008.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Gao09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HeggernesKM09,
author = {Pinar Heggernes and
Dieter Kratsch and
Daniel Meister},
title = {Bandwidth of bipartite permutation graphs in polynomial time},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {533--544},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.001},
doi = {10.1016/J.JDA.2008.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HeggernesKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HermanS09,
author = {Grzegorz Herman and
Michael Soltys},
title = {On the Ehrenfeucht-Mycielski sequence},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {500--508},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.01.002},
doi = {10.1016/J.JDA.2009.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HermanS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IrvingMO09,
author = {Robert W. Irving and
David F. Manlove and
Gregg O'Malley},
title = {Stable marriage with ties and bounded length preference lists},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {213--219},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.003},
doi = {10.1016/J.JDA.2008.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IrvingMO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Ishii09,
author = {Toshimasa Ishii},
title = {Greedy approximation for the source location problem with vertex-connectivity
requirements in undirected graphs},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {570--578},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.06.003},
doi = {10.1016/J.JDA.2009.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Ishii09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ItalianoP09,
author = {Giuseppe F. Italiano and
Rossella Petreschi},
title = {Preface},
journal = {J. Discrete Algorithms},
volume = {7},
number = {3},
pages = {279},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.02.003},
doi = {10.1016/J.JDA.2009.02.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ItalianoP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JothiR09,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Improved approximation algorithms for the single-sink buy-at-bulk
network design problems},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {249--255},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.12.003},
doi = {10.1016/J.JDA.2008.12.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JothiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KantorP09,
author = {Erez Kantor and
David Peleg},
title = {Approximate hierarchical facility location and applications to the
bounded depth Steiner tree and range assignment problems},
journal = {J. Discrete Algorithms},
volume = {7},
number = {3},
pages = {341--362},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.006},
doi = {10.1016/J.JDA.2008.11.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KantorP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KaoS09,
author = {Ming{-}Yang Kao and
Manan Sanghi},
title = {An approximation algorithm for a bottleneck traveling salesman problem},
journal = {J. Discrete Algorithms},
volume = {7},
number = {3},
pages = {315--326},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.007},
doi = {10.1016/J.JDA.2008.11.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KaoS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Kovacs09,
author = {Annam{\'{a}}ria Kov{\'{a}}cs},
title = {Tighter approximation bounds for {LPT} scheduling in two special cases},
journal = {J. Discrete Algorithms},
volume = {7},
number = {3},
pages = {327--340},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.004},
doi = {10.1016/J.JDA.2008.11.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Kovacs09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LingasW09,
author = {Andrzej Lingas and
Martin Wahlen},
title = {An exact algorithm for subgraph homeomorphism},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {464--468},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.10.003},
doi = {10.1016/J.JDA.2008.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LingasW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MoserT09,
author = {Hannes Moser and
Dimitrios M. Thilikos},
title = {Parameterized complexity of finding regular induced subgraphs},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {181--190},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.005},
doi = {10.1016/J.JDA.2008.09.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MoserT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Nagy-Gyorgy09,
author = {Judit Nagy{-}Gy{\"{o}}rgy},
title = {Randomized algorithm for the k-server problem on decomposable spaces},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {411--419},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.02.005},
doi = {10.1016/J.JDA.2009.02.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Nagy-Gyorgy09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Naumann09,
author = {Uwe Naumann},
title = {{DAG} reversal is NP-complete},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {402--410},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.008},
doi = {10.1016/J.JDA.2008.09.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Naumann09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OuangraouaF09,
author = {A{\"{\i}}da Ouangraoua and
Pascal Ferraro},
title = {A new constrained edit distance between quotiented ordered trees},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {78--89},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.05.001},
doi = {10.1016/J.JDA.2008.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OuangraouaF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ParedesR09,
author = {Rodrigo Paredes and
Nora Reyes},
title = {Solving similarity joins and range queries in metric spaces with the
list of twin clusters},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {18--35},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.012},
doi = {10.1016/J.JDA.2008.09.012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ParedesR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ParkPJH09,
author = {Kunsoo Park and
Heejin Park and
Woo{-}Chul Jeun and
Soonhoi Ha},
title = {Boolean circuit programming: {A} new paradigm to design parallel algorithms},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {267--277},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.08.004},
doi = {10.1016/J.JDA.2008.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ParkPJH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PatellaC09,
author = {Marco Patella and
Paolo Ciaccia},
title = {Approximate similarity search: {A} multi-faceted problem},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {36--48},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.014},
doi = {10.1016/J.JDA.2008.09.014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PatellaC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PeyerRV09,
author = {Sven Peyer and
Dieter Rautenbach and
Jens Vygen},
title = {A generalization of Dijkstra's shortest path algorithm with applications
to {VLSI} routing},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {377--390},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2007.08.003},
doi = {10.1016/J.JDA.2007.08.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PeyerRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Razgon09,
author = {Igor Razgon},
title = {Faster computation of maximum independent set and parameterized vertex
cover for graphs with maximum degree 3},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {191--212},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.004},
doi = {10.1016/J.JDA.2008.09.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Razgon09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Skala09,
author = {Matthew Skala},
title = {Counting distance permutations},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {49--61},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.011},
doi = {10.1016/J.JDA.2008.09.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Skala09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SkopalL09,
author = {Tom{\'{a}}s Skopal and
Jakub Lokoc},
title = {New dynamic construction techniques for M-tree},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {62--77},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.013},
doi = {10.1016/J.JDA.2008.09.013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SkopalL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SpoerhaseW09,
author = {Joachim Spoerhase and
Hans{-}Christoph Wirth},
title = {Optimally computing all solutions of Stackelberg with parametric prices
and of general monotonous gain functions on a tree},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {256--266},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.02.004},
doi = {10.1016/J.JDA.2009.02.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SpoerhaseW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Tsin09,
author = {Yung H. Tsin},
title = {Yet another optimal algorithm for 3-edge-connectivity},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {130--146},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.04.003},
doi = {10.1016/J.JDA.2008.04.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Tsin09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WuCR09,
author = {Taoyang Wu and
Peter J. Cameron and
S{\o}ren Riis},
title = {On the guessing number of shift graphs},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {220--226},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.009},
doi = {10.1016/J.JDA.2008.09.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WuCR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Abu-KhzamFL08,
author = {Faisal N. Abu{-}Khzam and
Henning Fernau and
Michael A. Langston},
title = {A bounded search tree algorithm for parameterized face cover},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {541--552},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.07.004},
doi = {10.1016/J.JDA.2008.07.004},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Abu-KhzamFL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AusielloBL08,
author = {Giorgio Ausiello and
Vincenzo Bonifaci and
Luigi Laura},
title = {The on-line asymmetric traveling salesman problem},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {290--298},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.03.002},
doi = {10.1016/J.JDA.2007.03.002},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AusielloBL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BazganT08,
author = {Cristina Bazgan and
Zsolt Tuza},
title = {Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree
3},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {510--519},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.02.002},
doi = {10.1016/J.JDA.2007.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BazganT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BlinFHV08,
author = {Guillaume Blin and
Guillaume Fertin and
Danny Hermelin and
St{\'{e}}phane Vialette},
title = {Fixed-parameter algorithms for protein similarity search under mRNA
structure constraints},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {618--626},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.03.004},
doi = {10.1016/J.JDA.2008.03.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BlinFHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BockenhauerBHKPSU08,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Dirk Bongartz and
Juraj Hromkovic and
Ralf Klasing and
Guido Proietti and
Sebastian Seibert and
Walter Unger},
title = {On k-connectivity problems with sharpened triangle inequality},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {605--617},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.03.003},
doi = {10.1016/J.JDA.2008.03.003},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BockenhauerBHKPSU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BordewichMS08,
author = {Magnus Bordewich and
Catherine McCartin and
Charles Semple},
title = {A 3-approximation algorithm for the subtree distance between phylogenies},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {458--471},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.10.002},
doi = {10.1016/J.JDA.2007.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BordewichMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS08,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Preface},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {539},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.07.005},
doi = {10.1016/J.JDA.2008.07.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CaramiaS08,
author = {Massimiliano Caramia and
Antonino Sgalambro},
title = {On the approximation of the single source k-splittable flow problem},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {277--289},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.03.001},
doi = {10.1016/J.JDA.2007.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CaramiaS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChanCYZZ08,
author = {Wun{-}Tat Chan and
Francis Y. L. Chin and
Deshi Ye and
Guochuan Zhang and
Yong Zhang},
title = {On-line scheduling of parallel jobs on two machines},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {3--10},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.07.005},
doi = {10.1016/J.JDA.2006.07.005},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChanCYZZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChanderwalS08,
author = {Nitin and
Ashok Subramanian},
title = {Efficient algorithms and methods to solve dynamic MINs stability problem
using stable matching with complete ties},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {353--380},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.01.001},
doi = {10.1016/J.JDA.2008.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChanderwalS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChaouiyaRT08,
author = {Claudine Chaouiya and
Elisabeth Remy and
Denis Thieffry},
title = {Petri net modelling of biological regulatory networks},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {165--177},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.06.003},
doi = {10.1016/J.JDA.2007.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChaouiyaRT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CharnesDP08,
author = {Chris Charnes and
Ulrich Dempwolff and
Josef Pieprzyk},
title = {The eight variable homogeneous degree three bent functions},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {66--72},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.08.004},
doi = {10.1016/J.JDA.2006.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CharnesDP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChenHJ08,
author = {Xujin Chen and
Xiaodong Hu and
Xiaohua Jia},
title = {Inapproximability and approximability of minimal tree routing and
coloring},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {341--351},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.02.001},
doi = {10.1016/J.JDA.2007.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChenHJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChenTW08,
author = {Zhi{-}Zhong Chen and
Ruka Tanahashi and
Lusheng Wang},
title = {An improved approximation algorithm for maximum edge 2-coloring in
simple graphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {205--215},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.08.002},
doi = {10.1016/J.JDA.2007.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChenTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChlebusGKS08,
author = {Bogdan S. Chlebus and
Leszek Gasieniec and
Dariusz R. Kowalski and
Alexander A. Shvartsman},
title = {A robust randomized algorithm to perform independent tasks},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {651--665},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.03.001},
doi = {10.1016/J.JDA.2008.03.001},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ChlebusGKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CzajkaP08,
author = {Tomek Czajka and
Gopal Pandurangan},
title = {Improved random graph isomorphism},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {85--92},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.01.002},
doi = {10.1016/J.JDA.2007.01.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CzajkaP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CzyzowiczFY08,
author = {Jurek Czyzowicz and
Wojciech Fraczak and
Mohammadreza Yazdani},
title = {Computing the throughput of Concatenation State Machines},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {28--36},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.04.002},
doi = {10.1016/J.JDA.2007.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CzyzowiczFY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DemaineEKMMOW08,
author = {Erik D. Demaine and
Jeff Erickson and
Danny Krizanc and
Henk Meijer and
Pat Morin and
Mark H. Overmars and
Sue Whitesides},
title = {Realizing partitions respecting full and partial order information},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {51--58},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.10.004},
doi = {10.1016/J.JDA.2006.10.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DemaineEKMMOW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DomGNW08,
author = {Michael Dom and
Jiong Guo and
Rolf Niedermeier and
Sebastian Wernicke},
title = {Red-blue covering problems and the consecutive ones property},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {393--407},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.11.002},
doi = {10.1016/J.JDA.2007.11.002},
timestamp = {Sun, 20 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DomGNW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DujmovicFK08,
author = {Vida Dujmovic and
Henning Fernau and
Michael Kaufmann},
title = {Fixed parameter algorithms for one-sided crossing minimization revisited},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {313--323},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.12.008},
doi = {10.1016/J.JDA.2006.12.008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DujmovicFK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FagnotLV08,
author = {Isabelle Fagnot and
Ga{\"{e}}lle Lelandais and
St{\'{e}}phane Vialette},
title = {Bounded list injective homomorphism for comparative analysis of protein-protein
interaction graphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {178--191},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.06.002},
doi = {10.1016/J.JDA.2007.06.002},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/FagnotLV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FigueroaGJKLP08,
author = {Andres Figueroa and
Avraham Goldstein and
Tao Jiang and
Maciej Kurowski and
Andrzej Lingas and
Mia Persson},
title = {Approximate clustering of incomplete fingerprints},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {103--108},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.01.004},
doi = {10.1016/J.JDA.2007.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FigueroaGJKLP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FlamminiMSZ08,
author = {Michele Flammini and
Luca Moscardelli and
Mordechai Shalom and
Shmuel Zaks},
title = {Approximating the traffic grooming problem},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {472--479},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.09.001},
doi = {10.1016/J.JDA.2007.09.001},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/FlamminiMSZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GavrilPZ08,
author = {Fanica Gavril and
Ron Y. Pinter and
Shmuel Zaks},
title = {Intersection representations of matrices by subtrees and unicycles
on graphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {216--228},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.08.001},
doi = {10.1016/J.JDA.2007.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GavrilPZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GiacomoDL08,
author = {Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta},
title = {Radial drawings of graphs: Geometric constraints and trade-offs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {109--124},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.12.007},
doi = {10.1016/J.JDA.2006.12.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GiacomoDL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GuimaraesS08,
author = {Katia S. Guimar{\~{a}}es and
Marie{-}France Sagot},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {163},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.06.004},
doi = {10.1016/J.JDA.2007.06.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GuimaraesS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gustedt08,
author = {Jens Gustedt},
title = {Efficient sampling of random permutations},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {125--139},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.11.002},
doi = {10.1016/J.JDA.2006.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Gustedt08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HolubSW08,
author = {Jan Holub and
William F. Smyth and
Shu Wang},
title = {Fast pattern-matching on indeterminate strings},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {37--50},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.10.003},
doi = {10.1016/J.JDA.2006.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HolubSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IliopoulosM08,
author = {Costas S. Iliopoulos and
Mirka Miller},
title = {Special Issue of the Sixteenth Australasian Workshop on Combinatorial
Algorithms {(AWOCA} 2005) September 18-21, 2005, Ballarat, Australia},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {1--2},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.05.002},
doi = {10.1016/J.JDA.2007.05.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IliopoulosM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ItoDZN08,
author = {Takehiro Ito and
Erik D. Demaine and
Xiao Zhou and
Takao Nishizeki},
title = {Approximability of partitioning graphs with supply and demand},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {627--650},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.03.002},
doi = {10.1016/J.JDA.2008.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ItoDZN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KhorsiOZ08,
author = {Ahmed Khorsi and
Faissal Ouardi and
Djelloul Ziadi},
title = {Fast equation automaton computation},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {433--448},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.10.003},
doi = {10.1016/J.JDA.2007.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KhorsiOZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KolpakovR08,
author = {Roman Kolpakov and
Mathieu Raffinot},
title = {New algorithms for text fingerprinting},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {243--255},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.05.001},
doi = {10.1016/J.JDA.2007.05.001},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KolpakovR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KortsarzN08,
author = {Guy Kortsarz and
Zeev Nutov},
title = {A note on two source location problems},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {520--525},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.12.010},
doi = {10.1016/J.JDA.2006.12.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KortsarzN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KreveldL08,
author = {Marc J. van Kreveld and
Maarten L{\"{o}}ffler},
title = {Approximating largest convex hulls for imprecise points},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {583--594},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.04.002},
doi = {10.1016/J.JDA.2008.04.002},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/KreveldL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LaiPS08,
author = {Ying Kit Lai and
Chung Keung Poon and
Benyun Shi},
title = {Approximate colored range and point enclosure queries},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {420--432},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.10.001},
doi = {10.1016/J.JDA.2007.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LaiPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LeMM08,
author = {Van Bang Le and
Raffaele Mosca and
Haiko M{\"{u}}ller},
title = {On stable cutsets in claw-free graphs and planar graphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {256--276},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.04.001},
doi = {10.1016/J.JDA.2007.04.001},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LeMM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LozinM08,
author = {Vadim V. Lozin and
Martin Milanic},
title = {A polynomial algorithm to find an independent set of maximum weight
in a fork-free graph},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {595--604},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.04.001},
doi = {10.1016/J.JDA.2008.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LozinM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ManloveO08,
author = {David F. Manlove and
Gregg O'Malley},
title = {Student-Project Allocation with preferences over Projects},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {553--560},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.07.003},
doi = {10.1016/J.JDA.2008.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ManloveO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ManuelARR08,
author = {Paul D. Manuel and
Mostafa I. Abd{-}El{-}Barr and
Indra Rajasingh and
Bharati Rajan},
title = {An efficient representation of Benes networks and its applications},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {11--19},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.08.003},
doi = {10.1016/J.JDA.2006.08.003},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ManuelARR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ManuelRRM08,
author = {Paul D. Manuel and
Bharati Rajan and
Indra Rajasingh and
Chris Monica M.},
title = {On minimum metric dimension of honeycomb networks},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {20--27},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.09.002},
doi = {10.1016/J.JDA.2006.09.002},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ManuelRRM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MonnotT08,
author = {J{\'{e}}r{\^{o}}me Monnot and
Sophie Toulouse},
title = {Approximation results for the weighted P\({}_{\mbox{4}}\) partition
problem},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {299--312},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.01.006},
doi = {10.1016/J.JDA.2007.01.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MonnotT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OkamotoUU08,
author = {Yoshio Okamoto and
Takeaki Uno and
Ryuhei Uehara},
title = {Counting the number of independent sets in chordal graphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {229--242},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.07.006},
doi = {10.1016/J.JDA.2006.07.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OkamotoUU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Patrignani08,
author = {Maurizio Patrignani},
title = {Complexity results for three-dimensional orthogonal graph drawing},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {140--161},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.06.002},
doi = {10.1016/J.JDA.2006.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Patrignani08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PeterlongoPBLS08,
author = {Pierre Peterlongo and
Nadia Pisanti and
Fr{\'{e}}d{\'{e}}ric Boyer and
Alair Pereira do Lago and
Marie{-}France Sagot},
title = {Lossless filter for multiple repetitions with Hamming distance},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {497--509},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.03.003},
doi = {10.1016/J.JDA.2007.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PeterlongoPBLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PinterRTZ08,
author = {Ron Y. Pinter and
Oleg Rokhlenko and
Dekel Tsur and
Michal Ziv{-}Ukelson},
title = {Approximate labelled subtree homeomorphism},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {480--496},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.07.001},
doi = {10.1016/J.JDA.2007.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PinterRTZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RahmanSH08,
author = {Atif Rahman and
Swakkhar Shatabda and
Masud Hasan},
title = {An approximation algorithm for sorting by reversals and transpositions},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {449--457},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.09.002},
doi = {10.1016/J.JDA.2007.09.002},
timestamp = {Thu, 26 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/RahmanSH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RiviereBCD08,
author = {Romain Rivi{\`{e}}re and
Dominique Barth and
Johanne Cohen and
Alain Denise},
title = {Shuffling biological sequences with motif constraints},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {192--204},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.06.001},
doi = {10.1016/J.JDA.2007.06.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RiviereBCD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Rusu08,
author = {Irena Rusu},
title = {Converting suffix trees into factor/suffix oracles},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {324--340},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.11.005},
doi = {10.1016/J.JDA.2006.11.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Rusu08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SalmelaT08,
author = {Leena Salmela and
Jorma Tarhio},
title = {Fast parameterized matching with q-grams},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {408--419},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.11.001},
doi = {10.1016/J.JDA.2007.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SalmelaT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Sedjelmaci08,
author = {Sidi Mohamed Sedjelmaci},
title = {A parallel extended {GCD} algorithm},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {526--538},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.12.009},
doi = {10.1016/J.JDA.2006.12.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Sedjelmaci08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Spillner08,
author = {Andreas Spillner},
title = {A fixed parameter algorithm for optimal convex partitions},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {561--569},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.07.002},
doi = {10.1016/J.JDA.2008.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Spillner08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/StefanoKLZ08,
author = {Gabriele Di Stefano and
Stefan Krause and
Marco E. L{\"{u}}bbecke and
Uwe T. Zimmermann},
title = {On minimum k-modal partitions of permutations},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {381--392},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.01.002},
doi = {10.1016/J.JDA.2008.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/StefanoKLZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SugengM08,
author = {Kiki A. Sugeng and
Mirka Miller},
title = {On consecutive edge magic total labeling of graphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {59--65},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.05.003},
doi = {10.1016/J.JDA.2006.05.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SugengM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/TangML08,
author = {Jianmin Tang and
Mirka Miller and
Yuqing Lin},
title = {{HSAGA} and its application for the construction of near-Moore digraphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {73--84},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.05.003},
doi = {10.1016/J.JDA.2007.05.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/TangML08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Tiskin08,
author = {Alexander Tiskin},
title = {Semi-local longest common subsequences in subquadratic time},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {570--581},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.07.001},
doi = {10.1016/J.JDA.2008.07.001},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/Tiskin08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Wild08,
author = {Marcel Wild},
title = {Generating all cycles, chordless cycles, and Hamiltonian cycles with
the principle of exclusion},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {93--102},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.01.005},
doi = {10.1016/J.JDA.2007.01.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Wild08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AbrahamIM07,
author = {David J. Abraham and
Robert W. Irving and
David F. Manlove},
title = {Two algorithms for the Student-Project Allocation problem},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {73--90},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.006},
doi = {10.1016/J.JDA.2006.03.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AbrahamIM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AhujaBDPS07,
author = {Nitin Ahuja and
Andreas Baltz and
Benjamin Doerr and
Ales Pr{\'{\i}}vetiv{\'{y}} and
Anand Srivastav},
title = {On the minimum load coloring problem},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {533--545},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.09.001},
doi = {10.1016/J.JDA.2006.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AhujaBDPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AmirBLPT07,
author = {Amihood Amir and
Ayelet Butman and
Moshe Lewenstein and
Ely Porat and
Dekel Tsur},
title = {Efficient one-dimensional real scaled matching},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {205--211},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.017},
doi = {10.1016/J.JDA.2006.03.017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AmirBLPT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AmirN07,
author = {Amihood Amir and
Igor Nor},
title = {Generalized function matching},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {514--523},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.10.001},
doi = {10.1016/J.JDA.2006.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AmirN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ApostolicoBM07,
author = {Alberto Apostolico and
Ricardo A. Baeza{-}Yates and
Massimo Melucci},
title = {2004 Symposium on String Processing and Information Retrieval},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {203},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.016},
doi = {10.1016/J.JDA.2006.03.016},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ApostolicoBM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ApostolicoEL07,
author = {Alberto Apostolico and
P{\'{e}}ter L. Erd{\"{o}}s and
Moshe Lewenstein},
title = {Parameterized matching with mismatches},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {135--140},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.014},
doi = {10.1016/J.JDA.2006.03.014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ApostolicoEL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Arslan07,
author = {Abdullah N. Arslan},
title = {Regular expression constrained sequence alignment},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {647--661},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2007.01.003},
doi = {10.1016/J.JDA.2007.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Arslan07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BackofenS07,
author = {Rolf Backofen and
Sven Siebert},
title = {Fast detection of common sequence structure patterns in RNAs},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {212--228},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.015},
doi = {10.1016/J.JDA.2006.03.015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BackofenS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Bar-YehudaL07,
author = {Reuven Bar{-}Yehuda and
Jonathan Laserson},
title = {Exploiting locality: approximating sorting buffers},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {729--738},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.08.001},
doi = {10.1016/J.JDA.2006.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Bar-YehudaL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BarequetM07,
author = {Gill Barequet and
Micha Moffie},
title = {On the complexity of Jensen's algorithm for counting fixed polyominoes},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {348--355},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2005.08.001},
doi = {10.1016/J.JDA.2005.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BarequetM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BentzCR07,
author = {C{\'{e}}dric Bentz and
Marie{-}Christine Costa and
Fr{\'{e}}d{\'{e}}ric Roupin},
title = {Maximum integer multiflow and minimum multicut problems in two-sided
uniform grid graphs},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {36--54},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.009},
doi = {10.1016/J.JDA.2006.03.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BentzCR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Berkopec07,
author = {Ales Berkopec},
title = {HyperQuick algorithm for discrete hypergeometric distribution},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {341--347},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.01.001},
doi = {10.1016/J.JDA.2006.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Berkopec07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BermanKN07,
author = {Piotr Berman and
Marek Karpinski and
Yakov Nekrich},
title = {Approximating Huffman codes in parallel},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {479--490},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.10.007},
doi = {10.1016/J.JDA.2006.10.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BermanKN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BerryN07,
author = {Vincent Berry and
Fran{\c{c}}ois Nicolas},
title = {Maximum agreement and compatible supertrees},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {564--591},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.08.005},
doi = {10.1016/J.JDA.2006.08.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BerryN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BlasumHOW07,
author = {Ulrich Blasum and
Winfried Hochst{\"{a}}ttler and
Peter Oertel and
Gerhard J. Woeginger},
title = {Steiner diagrams and k-star hubs},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {622--634},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.06.001},
doi = {10.1016/J.JDA.2006.06.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BlasumHOW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BockerK07,
author = {Sebastian B{\"{o}}cker and
Hans{-}Michael Kaltenbach},
title = {Mass spectra alignments and their significance},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {714--728},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.11.003},
doi = {10.1016/J.JDA.2006.11.003},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BockerK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BordewichD07,
author = {Magnus Bordewich and
Martin E. Dyer},
title = {Path coupling without contraction},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {280--292},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.04.001},
doi = {10.1016/J.JDA.2006.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BordewichD07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Brandes07,
author = {Ulrik Brandes},
title = {Optimal leaf ordering of complete binary trees},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {546--552},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.09.003},
doi = {10.1016/J.JDA.2006.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Brandes07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Calinescu07,
author = {Gruia C{\u{a}}linescu},
title = {A note on data structures for maintaining bipartitions},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {129--134},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.002},
doi = {10.1016/J.JDA.2006.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Calinescu07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CornelsenS07,
author = {Sabine Cornelsen and
Gabriele Di Stefano},
title = {Track assignment},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {250--261},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.05.001},
doi = {10.1016/J.JDA.2006.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CornelsenS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrescenziGNPU07,
author = {Pilu Crescenzi and
Giorgio Gambosi and
Gaia Nicosia and
Paolo Penna and
Walter Unger},
title = {On-line load balancing made simple: Greedy strikes back},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {162--175},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.02.001},
doi = {10.1016/J.JDA.2006.02.001},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrescenziGNPU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DessmarkP07,
author = {Anders Dessmark and
Andrzej Pelc},
title = {Broadcasting in geometric radio networks},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {187--201},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.07.001},
doi = {10.1016/J.JDA.2006.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DessmarkP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DidierSST07,
author = {Gilles Didier and
Thomas Schmidt and
Jens Stoye and
Dekel Tsur},
title = {Character sets of strings},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {330--340},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.021},
doi = {10.1016/J.JDA.2006.03.021},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DidierSST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EngelbergKLN07,
author = {Roee Engelberg and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Joseph Naor},
title = {Cut problems in graphs with a budget constraint},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {262--279},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.05.002},
doi = {10.1016/J.JDA.2006.05.002},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EngelbergKLN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Fotakis07,
author = {Dimitris Fotakis},
title = {A primal-dual algorithm for online non-uniform facility location},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {141--148},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.001},
doi = {10.1016/J.JDA.2006.03.001},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Fotakis07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranekJS07,
author = {Frantisek Franek and
Christopher G. Jennings and
William F. Smyth},
title = {A simple fast hybrid pattern-matching algorithm},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {682--695},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.11.004},
doi = {10.1016/J.JDA.2006.11.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranekJS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranekJS07a,
author = {Frantisek Franek and
Jiandong Jiang and
William F. Smyth},
title = {Two-pattern strings {II} - frequency of occurrence and substring complexity},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {739--748},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.04.002},
doi = {10.1016/J.JDA.2006.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranekJS07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GasieniecSWX07,
author = {Leszek Gasieniec and
Chang Su and
Prudence W. H. Wong and
Qin Xin},
title = {Routing of single-source and multiple-source queries in static sensor
networks},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {1--11},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.012},
doi = {10.1016/J.JDA.2006.03.012},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GasieniecSWX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GhoshSBG07,
author = {Subir Kumar Ghosh and
Thomas C. Shermer and
Binay K. Bhattacharya and
Partha P. Goswami},
title = {Computing the maximum clique in the visibility graph of a simple polygon},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {524--532},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.09.004},
doi = {10.1016/J.JDA.2006.09.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GhoshSBG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HortonF07,
author = {Paul Horton and
Wataru Fujibuchi},
title = {An upper bound on the hardness of exact matrix based motif discovery},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {706--713},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.10.006},
doi = {10.1016/J.JDA.2006.10.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HortonF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HuangZ07,
author = {Rui Huang and
Gergely V. Z{\'{a}}ruba},
title = {Location tracking in mobile ad hoc networks using particle filters},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {455--470},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.12.005},
doi = {10.1016/J.JDA.2006.12.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HuangZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IliopoulosPTTT07,
author = {Costas S. Iliopoulos and
Katerina Perdikuri and
Evangelos Theodoridis and
Athanasios K. Tsakalidis and
Kostas Tsichlas},
title = {Algorithms for extracting motifs from biological weighted sequences},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {229--242},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.018},
doi = {10.1016/J.JDA.2006.03.018},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IliopoulosPTTT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ItoKZN07,
author = {Takehiro Ito and
Akira Kato and
Xiao Zhou and
Takao Nishizeki},
title = {Algorithms for finding distance-edge-colorings of graphs},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {304--322},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.020},
doi = {10.1016/J.JDA.2006.03.020},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ItoKZN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JothiR07,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Approximating the k-traveling repairman problem with repairtimes},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {293--303},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.023},
doi = {10.1016/J.JDA.2006.03.023},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JothiR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Kelarev07,
author = {Andrei V. Kelarev},
title = {Algorithms for computing parameters of graph-based extensions of {BCH}
codes},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {553--563},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.08.002},
doi = {10.1016/J.JDA.2006.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Kelarev07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KleinSK07,
author = {Shmuel T. Klein and
B. Riva Shalom and
Yair Kaufman},
title = {Searching for a set of correlated patterns},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {149--161},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.02.002},
doi = {10.1016/J.JDA.2006.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KleinSK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Konorski07,
author = {Jerzy Konorski},
title = {A station strategy to deter backoff attacks in {IEEE} 802.11 LANs},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {436--454},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.12.004},
doi = {10.1016/J.JDA.2006.12.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Konorski07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LeeIP07,
author = {Inbok Lee and
Costas S. Iliopoulos and
Kunsoo Park},
title = {Linear time algorithm for the longest common repeat problem},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {243--249},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.019},
doi = {10.1016/J.JDA.2006.03.019},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LeeIP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LibermanN07,
author = {Gilad Liberman and
Zeev Nutov},
title = {On shredders and vertex connectivity augmentation},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {91--101},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.005},
doi = {10.1016/J.JDA.2006.03.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LibermanN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MaassN07,
author = {Moritz G. Maa{\ss} and
Johannes Nowak},
title = {Text indexing with errors},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {662--681},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.11.001},
doi = {10.1016/J.JDA.2006.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MaassN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MartensM07,
author = {Marco Martens and
Henk Meijer},
title = {On the probabilistic behaviour of a heuristic algorithm for maximal
Hamiltonian tours},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {102--114},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.004},
doi = {10.1016/J.JDA.2006.03.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MartensM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Maze07,
author = {G{\'{e}}rard Maze},
title = {Existence of a limiting distribution for the binary {GCD} algorithm},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {176--186},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.013},
doi = {10.1016/J.JDA.2006.03.013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Maze07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Mihara07,
author = {Takashi Mihara},
title = {Quantum protocols for untrusted computations},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {65--72},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.007},
doi = {10.1016/J.JDA.2006.03.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Mihara07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Niqui07,
author = {Milad Niqui},
title = {Exact arithmetic on the Stern-Brocot tree},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {356--379},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2005.03.007},
doi = {10.1016/J.JDA.2005.03.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Niqui07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OhlebuschAH07,
author = {Enno Ohlebusch and
Mohamed Ibrahim Abouelhoda and
Kathrin Hockel},
title = {A linear time algorithm for the inversion median problem in circular
bacterial genomes},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {637--646},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.12.006},
doi = {10.1016/J.JDA.2006.12.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OhlebuschAH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OkashaR07,
author = {H. M. Okasha and
U. R{\"{o}}sler},
title = {Asymptotic distributions for Random Median Quicksort},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {592--608},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.07.003},
doi = {10.1016/J.JDA.2006.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OkashaR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/OuangraouaFTD07,
author = {A{\"{\i}}da Ouangraoua and
Pascal Ferraro and
Laurent Tichit and
Serge Dulucq},
title = {Local similarity between quotiented ordered trees},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {23--35},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.010},
doi = {10.1016/J.JDA.2006.03.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/OuangraouaFTD07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ParkM07,
author = {Kunsoo Park and
Laurent Mouchard},
title = {Combinatorial Pattern Matching},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {635},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2007.01.001},
doi = {10.1016/J.JDA.2007.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ParkM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Peleg07,
author = {David Peleg},
title = {Approximation algorithms for the Label-Cover\({}_{\mbox{MAX}}\) and
Red-Blue Set Cover problems},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {55--64},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.008},
doi = {10.1016/J.JDA.2006.03.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Peleg07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PerrucciS07,
author = {Daniel Perrucci and
Juan Sabia},
title = {Real roots of univariate polynomials and straight line programs},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {471--478},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.10.002},
doi = {10.1016/J.JDA.2006.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PerrucciS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Rawitz07,
author = {Dror Rawitz},
title = {Admission control with advance reservations in simple networks},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {491--500},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.10.008},
doi = {10.1016/J.JDA.2006.10.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Rawitz07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RussoO07,
author = {Lu{\'{\i}}s M. S. Russo and
Arlindo L. Oliveira},
title = {Efficient generation of super condensed neighborhoods},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {501--513},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.10.005},
doi = {10.1016/J.JDA.2006.10.005},
timestamp = {Mon, 16 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/RussoO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Sadakane07,
author = {Kunihiko Sadakane},
title = {Succinct data structures for flexible text retrieval systems},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {12--22},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.011},
doi = {10.1016/J.JDA.2006.03.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Sadakane07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ShapiraS07,
author = {Dana Shapira and
James A. Storer},
title = {Edit distance with move operations},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {380--392},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2005.01.010},
doi = {10.1016/J.JDA.2005.01.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ShapiraS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SrinivasanC07,
author = {Kaushik Srinivasan and
Charles J. Colbourn},
title = {Failed disk recovery in double erasure {RAID} arrays},
journal = {J. Discrete Algorithms},
volume = {5},
number = {1},
pages = {115--128},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.003},
doi = {10.1016/J.JDA.2006.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SrinivasanC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Subramani07,
author = {K. Subramani},
title = {A Zero-Space algorithm for Negative Cost Cycle Detection in networks},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {408--421},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.12.002},
doi = {10.1016/J.JDA.2006.12.002},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Subramani07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SyrotiukC07,
author = {Violet R. Syrotiuk and
Edgar Ch{\'{a}}vez},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {393--394},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.12.001},
doi = {10.1016/J.JDA.2006.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SyrotiukC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/TangG07,
author = {Bin Tang and
Himanshu Gupta},
title = {Cache placement in sensor networks under an update cost constraint},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {422--435},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.12.003},
doi = {10.1016/J.JDA.2006.12.003},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/TangG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Touzet07,
author = {H{\'{e}}l{\`{e}}ne Touzet},
title = {Comparing similar ordered trees in linear-time},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {696--705},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.07.002},
doi = {10.1016/J.JDA.2006.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Touzet07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/TyrakowskiP07,
author = {Tomasz Tyrakowski and
Zbigniew Palka},
title = {On the communication complexity of Bar-Yehuda, Goldreich and Itai's
randomized broadcasting algorithm},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {323--329},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.022},
doi = {10.1016/J.JDA.2006.03.022},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/TyrakowskiP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Urrutia07,
author = {Jorge Urrutia},
title = {Local solutions for global problems in wireless networks},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {395--407},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.05.004},
doi = {10.1016/J.JDA.2006.05.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Urrutia07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/YuanZZ07,
author = {Jinjiang Yuan and
Jian Ying Zhang and
Sanming Zhou},
title = {Routing permutations and involutions on optical ring networks: complexity
results and solution to an open problem},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {609--621},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.07.004},
doi = {10.1016/J.JDA.2006.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/YuanZZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Bar-NoyGL06,
author = {Amotz Bar{-}Noy and
Justin Goshi and
Richard E. Ladner},
title = {Off-line and on-line guaranteed start-up delay for Media-on-Demand
with stream merging},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {72--105},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.007},
doi = {10.1016/J.JDA.2005.01.007},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Bar-NoyGL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BattistaLW06,
author = {Giuseppe Di Battista and
Giuseppe Liotta and
Sue Whitesides},
title = {The strength of weak proximity},
journal = {J. Discrete Algorithms},
volume = {4},
number = {3},
pages = {384--400},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.12.004},
doi = {10.1016/J.JDA.2005.12.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BattistaLW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BecchettiLMP06,
author = {Luca Becchetti and
Stefano Leonardi and
Alberto Marchetti{-}Spaccamela and
Kirk Pruhs},
title = {Online weighted flow time and deadline scheduling},
journal = {J. Discrete Algorithms},
volume = {4},
number = {3},
pages = {339--352},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.12.001},
doi = {10.1016/J.JDA.2005.12.001},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BecchettiLMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BerenbrinkGGM06,
author = {Petra Berenbrink and
Leslie Ann Goldberg and
Paul W. Goldberg and
Russell A. Martin},
title = {Utilitarian resource assignment},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {567--587},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.009},
doi = {10.1016/J.JDA.2005.06.009},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BerenbrinkGGM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BlaserMS06,
author = {Markus Bl{\"{a}}ser and
Bodo Manthey and
Jir{\'{\i}} Sgall},
title = {An improved approximation algorithm for the asymmetric {TSP} with
strengthened triangle inequality},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {623--632},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.07.004},
doi = {10.1016/J.JDA.2005.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BlaserMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Blieberger06,
author = {Johann Blieberger},
title = {Average case analysis of {DJ} graphs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {649--675},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.07.002},
doi = {10.1016/J.JDA.2005.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Blieberger06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseCCGKS06,
author = {Prosenjit Bose and
Sergio Cabello and
Otfried Cheong and
Joachim Gudmundsson and
Marc J. van Kreveld and
Bettina Speckmann},
title = {Area-preserving approximations of polygonal paths},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {554--566},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.008},
doi = {10.1016/J.JDA.2005.06.008},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BoseCCGKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoyarshinovM06,
author = {Victor Boyarshinov and
Malik Magdon{-}Ismail},
title = {Linear time isotonic and unimodal regression in the \emph{L}\({}_{\mbox{1}}\)
and \emph{L}\({}_{\mbox{infinity}}\) norms},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {676--691},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.07.001},
doi = {10.1016/J.JDA.2005.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoyarshinovM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CaramiaDI06,
author = {Massimiliano Caramia and
Paolo Dell'Olmo and
Giuseppe F. Italiano},
title = {{CHECKCOL:} Improved local search for graph coloring},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {277--298},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.03.006},
doi = {10.1016/J.JDA.2005.03.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CaramiaDI06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChinCFJST06,
author = {Francis Y. L. Chin and
Marek Chrobak and
Stanley P. Y. Fung and
Wojciech Jawor and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}}},
title = {Online competitive algorithms for maximizing weighted throughput of
unit jobs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {255--276},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.03.005},
doi = {10.1016/J.JDA.2005.03.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChinCFJST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CoppersmithHNS06,
author = {Don Coppersmith and
Nick Howgrave{-}Graham and
Phong Q. Nguyen and
Igor E. Shparlinski},
title = {Testing set proportionality and the {\'{A}}d{\'{a}}m isomorphism
of circulant graphs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {324--335},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.003},
doi = {10.1016/J.JDA.2005.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CoppersmithHNS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CornelsenW06,
author = {Sabine Cornelsen and
Dorothea Wagner},
title = {Completely connected clustered graphs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {313--323},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.002},
doi = {10.1016/J.JDA.2005.06.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CornelsenW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CzygrinowH06,
author = {Andrzej Czygrinow and
Michal Hanckowiak},
title = {Distributed algorithms for weighted problems in sparse graphs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {588--607},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.07.006},
doi = {10.1016/J.JDA.2005.07.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CzygrinowH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Dagher06,
author = {Issam Dagher},
title = {Art networks with geometrical distances},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {538--553},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.007},
doi = {10.1016/J.JDA.2005.06.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Dagher06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DemetrescuI06,
author = {Camil Demetrescu and
Giuseppe F. Italiano},
title = {Dynamic shortest paths and transitive closure: Algorithmic techniques
and data structures},
journal = {J. Discrete Algorithms},
volume = {4},
number = {3},
pages = {353--383},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.12.003},
doi = {10.1016/J.JDA.2005.12.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DemetrescuI06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DesreuxR06,
author = {S{\'{e}}bastien Desreux and
Eric R{\'{e}}mila},
title = {An optimal algorithm to generate tilings},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {168--180},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.003},
doi = {10.1016/J.JDA.2005.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DesreuxR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FeuersteinSL06,
author = {Esteban Feuerstein and
Steven S. Seiden and
Alejandro Strejilevich de Loma},
title = {On Multi-threaded Metrical Task Systems},
journal = {J. Discrete Algorithms},
volume = {4},
number = {3},
pages = {401--413},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.12.005},
doi = {10.1016/J.JDA.2005.12.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FeuersteinSL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Finocchi06,
author = {Irene Finocchi},
title = {Crossing-constrained hierarchical drawings},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {299--312},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.001},
doi = {10.1016/J.JDA.2005.06.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Finocchi06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FlamminiNN06,
author = {Michele Flammini and
Alfredo Navarra and
Gaia Nicosia},
title = {Efficient offline algorithms for the bicriteria \emph{k}-server problem
and online applications},
journal = {J. Discrete Algorithms},
volume = {4},
number = {3},
pages = {414--432},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.12.006},
doi = {10.1016/J.JDA.2005.12.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FlamminiNN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FominT06,
author = {Fedor V. Fomin and
Dimitrios M. Thilikos},
title = {A 3-approximation for the pathwidth of Halin graphs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {499--510},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.004},
doi = {10.1016/J.JDA.2005.06.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FominT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FotakisNPS06,
author = {Dimitris Fotakis and
Sotiris E. Nikoletseas and
Vicky G. Papadopoulou and
Paul G. Spirakis},
title = {Radiocolorings in periodic planar graphs: PSPACE-completeness and
efficient approximations for the optimal range of frequencies},
journal = {J. Discrete Algorithms},
volume = {4},
number = {3},
pages = {433--454},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.12.007},
doi = {10.1016/J.JDA.2005.12.007},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FotakisNPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranceschiniLP06,
author = {Gianni Franceschini and
Fabrizio Luccio and
Linda Pagli},
title = {Dense trees: a new look at degenerate graphs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {3},
pages = {455--474},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.12.008},
doi = {10.1016/J.JDA.2005.12.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranceschiniLP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gerbessiotis06,
author = {Alexandros V. Gerbessiotis},
title = {An architecture independent study of parallel segment trees},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {1--24},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.001},
doi = {10.1016/J.JDA.2005.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Gerbessiotis06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Grandoni06,
author = {Fabrizio Grandoni},
title = {A note on the complexity of minimum dominating set},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {209--214},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.03.002},
doi = {10.1016/J.JDA.2005.03.002},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Grandoni06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GuoN06,
author = {Jiong Guo and
Rolf Niedermeier},
title = {Exact algorithms and applications for Tree-like Weighted Set Cover},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {608--622},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.07.005},
doi = {10.1016/J.JDA.2005.07.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GuoN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ItalianoM06,
author = {Giuseppe F. Italiano and
Alberto Marchetti{-}Spaccamela},
title = {Preface},
journal = {J. Discrete Algorithms},
volume = {4},
number = {3},
pages = {337--338},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.12.002},
doi = {10.1016/J.JDA.2005.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ItalianoM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ItoZN06,
author = {Takehiro Ito and
Xiao Zhou and
Takao Nishizeki},
title = {Partitioning a graph of bounded tree-width to connected subgraphs
of almost uniform size},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {142--154},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.005},
doi = {10.1016/J.JDA.2005.01.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ItoZN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JacobsJ06,
author = {David Pokrass Jacobs and
Robert E. Jamison},
title = {Polynomial recognition of equal unions in hypergraphs with few vertices
of large degree},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {201--208},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.03.001},
doi = {10.1016/J.JDA.2005.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JacobsJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JansenW06,
author = {Thomas Jansen and
Ingo Wegener},
title = {On the analysis of a dynamic evolutionary algorithm},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {181--199},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.002},
doi = {10.1016/J.JDA.2005.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JansenW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KennedyLY06,
author = {William S. Kennedy and
Guohui Lin and
Guiying Yan},
title = {Strictly chordal graphs are leaf powers},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {511--525},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.005},
doi = {10.1016/J.JDA.2005.06.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KennedyLY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LagogiannisMT06,
author = {George Lagogiannis and
Christos Makris and
Athanasios K. Tsakalidis},
title = {Reducing structural changes in van Emde Boas' data structure to the
lower bound for the dynamic predecessor problem},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {106--141},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.006},
doi = {10.1016/J.JDA.2005.01.006},
timestamp = {Mon, 01 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/LagogiannisMT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MereghettiP06,
author = {Carlo Mereghetti and
Beatrice Palano},
title = {The complexity of minimum difference cover},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {239--254},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.03.004},
doi = {10.1016/J.JDA.2005.03.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MereghettiP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MonienP06,
author = {Burkhard Monien and
Robert Preis},
title = {Upper bounds on the bisection width of 3- and 4-regular graphs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {3},
pages = {475--498},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.12.009},
doi = {10.1016/J.JDA.2005.12.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MonienP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ParkB06,
author = {E. C. Park and
Ian F. Blake},
title = {On the mean number of encryptions for tree-based broadcast encryption
schemes},
journal = {J. Discrete Algorithms},
volume = {4},
number = {2},
pages = {215--238},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.03.003},
doi = {10.1016/J.JDA.2005.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ParkB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RautenbachSW06,
author = {Dieter Rautenbach and
Christian Szegedy and
J{\"{u}}rgen Werber},
title = {Delay optimization of linear depth boolean circuits with prescribed
input arrival times},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {526--537},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.006},
doi = {10.1016/J.JDA.2005.06.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RautenbachSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SixT06,
author = {Janet M. Six and
Ioannis G. Tollis},
title = {A framework and algorithms for circular drawings of graphs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {25--50},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.009},
doi = {10.1016/J.JDA.2005.01.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SixT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/VajnovszkiW06,
author = {Vincent Vajnovszki and
Timothy Walsh},
title = {A loop-free two-close Gray-code algorithm for listing \emph{k}-ary
Dyck words},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {633--648},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.07.003},
doi = {10.1016/J.JDA.2005.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/VajnovszkiW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Woelfel06,
author = {Philipp Woelfel},
title = {Symbolic topological sorting with OBDDs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {51--71},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.008},
doi = {10.1016/J.JDA.2005.01.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Woelfel06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ZverovichZ06,
author = {Igor E. Zverovich and
Olga I. Zverovich},
title = {Polar {SAT} and related graphs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {155--167},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.004},
doi = {10.1016/J.JDA.2005.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ZverovichZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AbouelhodaO05,
author = {Mohamed Ibrahim Abouelhoda and
Enno Ohlebusch},
title = {Chaining algorithms for multiple genome comparison},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {321--341},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.011},
doi = {10.1016/J.JDA.2004.08.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AbouelhodaO05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AusielloFF05,
author = {Giorgio Ausiello and
Paolo Giulio Franciosa and
Daniele Frigioni},
title = {Partially dynamic maintenance of minimum weight hyperpaths},
journal = {J. Discrete Algorithms},
volume = {3},
number = {1},
pages = {27--46},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2003.12.005},
doi = {10.1016/J.JDA.2003.12.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AusielloFF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Baeza-YatesC05,
author = {Ricardo A. Baeza{-}Yates and
Maxime Crochemore},
title = {Foreword},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {125},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.001},
doi = {10.1016/J.JDA.2004.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Baeza-YatesC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BarequetBDG05,
author = {Gill Barequet and
Prosenjit Bose and
Matthew T. Dickerson and
Michael T. Goodrich},
title = {Optimizing a constrained convex polygonal annulus},
journal = {J. Discrete Algorithms},
volume = {3},
number = {1},
pages = {1--26},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2003.12.004},
doi = {10.1016/J.JDA.2003.12.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BarequetBDG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BehzadiS05,
author = {Behshad Behzadi and
Jean{-}Marc Steyaert},
title = {An improved algorithm for generalized comparison of minisatellites},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {375--389},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.014},
doi = {10.1016/J.JDA.2004.08.014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BehzadiS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BlakeMX05,
author = {Ian F. Blake and
V. Kumar Murty and
Guangwu Xu},
title = {Efficient algorithms for Koblitz curves over fields of characteristic
three},
journal = {J. Discrete Algorithms},
volume = {3},
number = {1},
pages = {113--124},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.04.011},
doi = {10.1016/J.JDA.2004.04.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BlakeMX05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Clifford05,
author = {Rapha{\"{e}}l Clifford},
title = {Distributed suffix trees},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {176--197},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.004},
doi = {10.1016/J.JDA.2004.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Clifford05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreINPS05,
author = {Maxime Crochemore and
Costas S. Iliopoulos and
Gonzalo Navarro and
Yoan J. Pinz{\'{o}}n and
Alejandro Salinger},
title = {Bit-parallel (\emph{delta}, \emph{gamma})-matching and suffix automata},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {198--214},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.005},
doi = {10.1016/J.JDA.2004.08.005},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreINPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DuckworthMZ05,
author = {William Duckworth and
David F. Manlove and
Michele Zito},
title = {On the approximability of the maximum induced matching problem},
journal = {J. Discrete Algorithms},
volume = {3},
number = {1},
pages = {79--91},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.05.001},
doi = {10.1016/J.JDA.2004.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DuckworthMZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DulucqT05,
author = {Serge Dulucq and
H{\'{e}}l{\`{e}}ne Touzet},
title = {Decomposition algorithms for the tree edit distance problem},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {448--471},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.018},
doi = {10.1016/J.JDA.2004.08.018},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DulucqT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ElementoG05,
author = {Olivier Elemento and
Olivier Gascuel},
title = {An exact and polynomial distance-based algorithm to reconstruct single
copy tandem duplication trees},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {362--374},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.013},
doi = {10.1016/J.JDA.2004.08.013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ElementoG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Hyyro05,
author = {Heikki Hyyr{\"{o}}},
title = {Bit-parallel approximate string matching algorithms with transposition},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {215--229},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.006},
doi = {10.1016/J.JDA.2004.08.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Hyyro05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KimSPP05,
author = {Dong Kyue Kim and
Jeong Seop Sim and
Heejin Park and
Kunsoo Park},
title = {Constructing suffix arrays in linear time},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {126--142},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.019},
doi = {10.1016/J.JDA.2004.08.019},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KimSPP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KoA05,
author = {Pang Ko and
Srinivas Aluru},
title = {Space efficient linear time construction of suffix arrays},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {143--156},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.002},
doi = {10.1016/J.JDA.2004.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KoA05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LemstromM05,
author = {Kjell Lemstr{\"{o}}m and
Veli M{\"{a}}kinen},
title = {On minimizing pattern splitting in multi-track string matching},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {248--266},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.008},
doi = {10.1016/J.JDA.2004.08.008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/LemstromM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LemstromNP05,
author = {Kjell Lemstr{\"{o}}m and
Gonzalo Navarro and
Yoan J. Pinz{\'{o}}n},
title = {Practical algorithms for transposition-invariant string-matching},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {267--292},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.009},
doi = {10.1016/J.JDA.2004.08.009},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LemstromNP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LuczakV05,
author = {Tomasz Luczak and
Eric Vigoda},
title = {Torpid mixing of the Wang-Swendsen-Koteck{\'{y}} algorithm for
sampling colorings},
journal = {J. Discrete Algorithms},
volume = {3},
number = {1},
pages = {92--100},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.05.002},
doi = {10.1016/J.JDA.2004.05.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LuczakV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NavarroST05,
author = {Gonzalo Navarro and
Erkki Sutinen and
Jorma Tarhio},
title = {Indexing text with approximate \emph{q}-grams},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {157--175},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.003},
doi = {10.1016/J.JDA.2004.08.003},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NavarroST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NedjahM05,
author = {Nadia Nedjah and
Luiza de Macedo Mourelle},
title = {More efficient left-to-right matching for overlapping pattern},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {230--247},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.007},
doi = {10.1016/J.JDA.2004.08.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NedjahM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NicolasR05,
author = {Fran{\c{c}}ois Nicolas and
Eric Rivals},
title = {Hardness results for the center and median string problems under the
weighted and unweighted edit distances},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {390--415},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.015},
doi = {10.1016/J.JDA.2004.08.015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NicolasR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PelegP05,
author = {David Peleg and
Uri Pincas},
title = {Virtual path layouts optimizing total hop count on {ATM} tree networks},
journal = {J. Discrete Algorithms},
volume = {3},
number = {1},
pages = {101--112},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.05.003},
doi = {10.1016/J.JDA.2004.05.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PelegP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/PelfreneAA05,
author = {Johann Pelfr{\^{e}}ne and
Sa{\"{\i}}d Abdedda{\"{\i}}m and
Jo{\"{e}}l Alexandre},
title = {Extracting approximate patterns},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {293--320},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.010},
doi = {10.1016/J.JDA.2004.08.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/PelfreneAA05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Sakamoto05,
author = {Hiroshi Sakamoto},
title = {A fully linear-time approximation algorithm for grammar-based compression},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {416--430},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.016},
doi = {10.1016/J.JDA.2004.08.016},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Sakamoto05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Valiente05,
author = {Gabriel Valiente},
title = {Constrained tree inclusion},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {431--447},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.017},
doi = {10.1016/J.JDA.2004.08.017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Valiente05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WalterSOSOMF05,
author = {Maria Em{\'{\i}}lia Telles Walter and
Mauro C. Sobrinho and
Eugenia T. G. Oliveira and
Lorena S. Soares and
Adilton G. Oliveira and
Thelmo E. S. Martins and
Tiago M. Fonseca},
title = {Improving the algorithm of Bafna and Pevzner for the problem of sorting
by transpositions: a practical approach},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {342--361},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.012},
doi = {10.1016/J.JDA.2004.08.012},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WalterSOSOMF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WegenerW05,
author = {Ingo Wegener and
Carsten Witt},
title = {On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean
functions},
journal = {J. Discrete Algorithms},
volume = {3},
number = {1},
pages = {61--78},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.02.001},
doi = {10.1016/J.JDA.2004.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WegenerW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ZhouMN05,
author = {Xiao Zhou and
Yuki Matsuo and
Takao Nishizeki},
title = {List total colorings of series-parallel graphs},
journal = {J. Discrete Algorithms},
volume = {3},
number = {1},
pages = {47--60},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2003.12.006},
doi = {10.1016/J.JDA.2003.12.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ZhouMN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AbouelhodaKO04,
author = {Mohamed Ibrahim Abouelhoda and
Stefan Kurtz and
Enno Ohlebusch},
title = {Replacing suffix trees with enhanced suffix arrays},
journal = {J. Discrete Algorithms},
volume = {2},
number = {1},
pages = {53--86},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00065-0},
doi = {10.1016/S1570-8667(03)00065-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AbouelhodaKO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Backofen04,
author = {Rolf Backofen},
title = {A polynomial time upper bound for the number of contacts in the HP-model
on the face-centered-cubic lattice {(FCC)}},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {161--206},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00076-5},
doi = {10.1016/S1570-8667(03)00076-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Backofen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BecchettiIM04,
author = {Luca Becchetti and
Miriam Di Ianni and
Alberto Marchetti{-}Spaccamela},
title = {Approximating call-scheduling makespan in all-optical networks},
journal = {J. Discrete Algorithms},
volume = {2},
number = {4},
pages = {501--515},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.008},
doi = {10.1016/J.JDA.2004.04.008},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BecchettiIM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BespamyatnikhS04,
author = {Sergei Bespamyatnikh and
Michael Segal},
title = {Selecting distances in arrangements of hyperplanes spanned by points},
journal = {J. Discrete Algorithms},
volume = {2},
number = {3},
pages = {333--345},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2003.12.001},
doi = {10.1016/J.JDA.2003.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BespamyatnikhS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseMV04,
author = {Prosenjit Bose and
Pat Morin and
Antoine Vigneron},
title = {Packing two disks into a polygonal environment},
journal = {J. Discrete Algorithms},
volume = {2},
number = {3},
pages = {373--380},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2003.12.003},
doi = {10.1016/J.JDA.2003.12.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BoseMV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BrandesW04,
author = {Ulrik Brandes and
Dorothea Wagner},
title = {Foreword: Special Issue of Journal of Discrete Algorithms on the 26th
International Workshop on Graph-Theoretic Concepts in Computer Science
{(WG} '2000) held June 15-17, 2000 in Konstanz, Germany},
journal = {J. Discrete Algorithms},
volume = {2},
number = {4},
pages = {381},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.001},
doi = {10.1016/J.JDA.2004.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BrandesW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Bryant04,
author = {David Bryant},
title = {A lower bound for the breakpoint phylogeny problem},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {229--255},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00077-7},
doi = {10.1016/S1570-8667(03)00077-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Bryant04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BustosN04,
author = {Benjamin Bustos and
Gonzalo Navarro},
title = {Probabilistic proximity searching algorithms based on compact partitions},
journal = {J. Discrete Algorithms},
volume = {2},
number = {1},
pages = {115--134},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00067-4},
doi = {10.1016/S1570-8667(03)00067-4},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BustosN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CiceroneS04,
author = {Serafino Cicerone and
Gabriele Di Stefano},
title = {Networks with small stretch number},
journal = {J. Discrete Algorithms},
volume = {2},
number = {4},
pages = {383--405},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.002},
doi = {10.1016/J.JDA.2004.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CiceroneS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DemgenskyNW04,
author = {Ingo Demgensky and
Hartmut Noltemeier and
Hans{-}Christoph Wirth},
title = {Optimizing cost flows by edge cost and capacity upgrade},
journal = {J. Discrete Algorithms},
volume = {2},
number = {4},
pages = {407--423},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.003},
doi = {10.1016/J.JDA.2004.04.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DemgenskyNW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Dobrev04,
author = {Stefan Dobrev},
title = {Computing input multiplicity in anonymous synchronous networks with
dynamic faults},
journal = {J. Discrete Algorithms},
volume = {2},
number = {4},
pages = {425--438},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.004},
doi = {10.1016/J.JDA.2004.04.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Dobrev04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Fernandez-BacaSS04,
author = {David Fern{\'{a}}ndez{-}Baca and
Timo Sepp{\"{a}}l{\"{a}}inen and
Giora Slutzki},
title = {Parametric multiple sequence alignment and phylogeny construction},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {271--287},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00078-9},
doi = {10.1016/S1570-8667(03)00078-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Fernandez-BacaSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GasieniecJL04,
author = {Leszek Gasieniec and
Jesper Jansson and
Andrzej Lingas},
title = {Approximation algorithms for Hamming clustering problems},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {289--301},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00079-0},
doi = {10.1016/S1570-8667(03)00079-0},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GasieniecJL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GiancarloS04,
author = {Raffaele Giancarlo and
David Sankoff},
title = {Editorial: Combinatiorial Pattern Matching},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {135--136},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.010},
doi = {10.1016/J.JDA.2004.04.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GiancarloS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gonnet04,
author = {Gaston H. Gonnet},
title = {Some string matching problems from Bioinformatics which still need
better solutions},
journal = {J. Discrete Algorithms},
volume = {2},
number = {1},
pages = {3--15},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00062-5},
doi = {10.1016/S1570-8667(03)00062-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Gonnet04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/InenagaSTA04,
author = {Shunsuke Inenaga and
Ayumi Shinohara and
Masayuki Takeda and
Setsuo Arikawa},
title = {Compact directed acyclic word graphs for a sliding window},
journal = {J. Discrete Algorithms},
volume = {2},
number = {1},
pages = {33--51},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00064-9},
doi = {10.1016/S1570-8667(03)00064-9},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/InenagaSTA04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JakobyLR04,
author = {Andreas Jakoby and
Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {Approximating schedules for dynamic process graphs efficiently},
journal = {J. Discrete Algorithms},
volume = {2},
number = {4},
pages = {471--500},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.007},
doi = {10.1016/J.JDA.2004.04.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JakobyLR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JiangLMZ04,
author = {Tao Jiang and
Guohui Lin and
Bin Ma and
Kaizhong Zhang},
title = {The longest common subsequence problem for arc-annotated sequences},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {257--270},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00080-7},
doi = {10.1016/S1570-8667(03)00080-7},
timestamp = {Mon, 13 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JiangLMZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KimP04,
author = {Sung{-}Ryul Kim and
Kunsoo Park},
title = {A dynamic edit distance table},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {303--312},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00082-0},
doi = {10.1016/S1570-8667(03)00082-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KimP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Kohler04,
author = {Ekkehard K{\"{o}}hler},
title = {Recognizing graphs without asteroidal triples},
journal = {J. Discrete Algorithms},
volume = {2},
number = {4},
pages = {439--452},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.005},
doi = {10.1016/J.JDA.2004.04.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Kohler04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KonjevodKM04,
author = {Goran Konjevod and
Sven Oliver Krumke and
Madhav V. Marathe},
title = {Budget constrained minimum cost connected medians},
journal = {J. Discrete Algorithms},
volume = {2},
number = {4},
pages = {453--469},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.006},
doi = {10.1016/J.JDA.2004.04.006},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/KonjevodKM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LaenderO04,
author = {Alberto H. F. Laender and
Arlindo L. Oliveira},
title = {Special issue on string processing and information retrieval},
journal = {J. Discrete Algorithms},
volume = {2},
number = {1},
pages = {1--2},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00061-3},
doi = {10.1016/S1570-8667(03)00061-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LaenderO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Liben-NowellK04,
author = {David Liben{-}Nowell and
Jon M. Kleinberg},
title = {Structural properties and tractability results for linear synteny},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {207--228},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00081-9},
doi = {10.1016/S1570-8667(03)00081-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Liben-NowellK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Navarro04,
author = {Gonzalo Navarro},
title = {Indexing text using the Ziv-Lempel trie},
journal = {J. Discrete Algorithms},
volume = {2},
number = {1},
pages = {87--114},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00066-2},
doi = {10.1016/S1570-8667(03)00066-2},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Navarro04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NavarroR04,
author = {Gonzalo Navarro and
Mathieu Raffinot},
title = {Practical and flexible pattern matching over Ziv-Lempel compressed
text},
journal = {J. Discrete Algorithms},
volume = {2},
number = {3},
pages = {347--371},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2003.12.002},
doi = {10.1016/J.JDA.2003.12.002},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NavarroR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SkienaS04,
author = {Steven Skiena and
Pavel Sumazin},
title = {Shift error detection in standardized exams},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {313--331},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00083-2},
doi = {10.1016/S1570-8667(03)00083-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SkienaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Suciu04,
author = {Dan Suciu},
title = {From searching text to querying {XML} streams},
journal = {J. Discrete Algorithms},
volume = {2},
number = {1},
pages = {17--32},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00063-7},
doi = {10.1016/S1570-8667(03)00063-7},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Suciu04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WadaC04,
author = {Koichi Wada and
Wei Chen},
title = {Optimal fault-tolerant routings with small routing tables for \emph{k}-connected
graphs},
journal = {J. Discrete Algorithms},
volume = {2},
number = {4},
pages = {517--530},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2004.04.009},
doi = {10.1016/J.JDA.2004.04.009},
timestamp = {Fri, 19 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WadaC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Witten04,
author = {Ian H. Witten},
title = {Adaptive text mining: inferring structure from sequences},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {137--159},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00084-4},
doi = {10.1016/S1570-8667(03)00084-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Witten04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AmirALS03,
author = {Amihood Amir and
Alberto Apostolico and
Gad M. Landau and
Giorgio Satta},
title = {Efficient text fingerprinting via Parikh mapping},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {409--421},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00035-2},
doi = {10.1016/S1570-8667(03)00035-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AmirALS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BaldoniHRT03,
author = {Roberto Baldoni and
Jean{-}Michel H{\'{e}}lary and
Michel Raynal and
L{\'{e}}naick Tanguy},
title = {Consensus in Byzantine asynchronous systems},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {185--210},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00025-X},
doi = {10.1016/S1570-8667(03)00025-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BaldoniHRT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Balint03,
author = {Vojtech B{\'{a}}lint},
title = {The non-approximability of bicriteria network design problems},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {339--355},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00033-9},
doi = {10.1016/S1570-8667(03)00033-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Balint03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BespamyatnikhK03,
author = {Sergei Bespamyatnikh and
Andrei V. Kelarev},
title = {Algorithms for shortest paths and d-cycle problems},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {1--9},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00002-9},
doi = {10.1016/S1570-8667(03)00002-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BespamyatnikhK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoldiV03,
author = {Paolo Boldi and
Sebastiano Vigna},
title = {Lower bounds for weak sense of direction},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {119--128},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00021-2},
doi = {10.1016/S1570-8667(03)00021-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoldiV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroderCM03,
author = {Andrei Z. Broder and
Moses Charikar and
Michael Mitzenmacher},
title = {A derandomization using min-wise independent permutations},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {11--20},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00003-0},
doi = {10.1016/S1570-8667(03)00003-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BroderCM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CiceroneS03,
author = {Serafino Cicerone and
Gabriele Di Stefano},
title = {(k, +)-distance-hereditary graphs},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {281--302},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00030-3},
doi = {10.1016/S1570-8667(03)00030-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CiceroneS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CohenS03,
author = {Graeme L. Cohen and
Ronald M. Sorli},
title = {On the number of distinct prime factors of an odd perfect number},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {21--35},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00004-2},
doi = {10.1016/S1570-8667(03)00004-2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CohenS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreHL03,
author = {Maxime Crochemore and
Christophe Hancart and
Thierry Lecroq},
title = {A unifying look at the Apostolico-Giancarlo string-matching algorithm},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {37--52},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00005-4},
doi = {10.1016/S1570-8667(03)00005-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreHL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreMT03,
author = {Maxime Crochemore and
Borivoj Melichar and
Zdenek Tron{\'{\i}}cek},
title = {Directed acyclic subsequence graph - Overview},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {255--280},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00029-7},
doi = {10.1016/S1570-8667(03)00029-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreMT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DaykinD03,
author = {David E. Daykin and
Jacqueline W. Daykin},
title = {Lyndon-like and V-order factorizations of strings},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {357--365},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00039-X},
doi = {10.1016/S1570-8667(03)00039-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/DaykinD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DinitzMR03,
author = {Yefim Dinitz and
Shlomo Moran and
Sergio Rajsbaum},
title = {Exact communication costs for consensus and leader in a tree},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {167--183},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00024-8},
doi = {10.1016/S1570-8667(03)00024-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DinitzMR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DinneenK03,
author = {Michael J. Dinneen and
Bakhadyr Khoussainov},
title = {Update games and update networks},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {53--65},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00006-6},
doi = {10.1016/S1570-8667(03)00006-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DinneenK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DuckworthWZ03,
author = {William Duckworth and
Nicholas C. Wormald and
Michele Zito},
title = {A {PTAS} for the sparsest 2-spanner of 4-connected planar triangulations},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {67--76},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00007-8},
doi = {10.1016/S1570-8667(03)00007-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DuckworthWZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FlocchiniKRRS03,
author = {Paola Flocchini and
Rastislav Kralovic and
Peter Ruzicka and
Alessandro Roncato and
Nicola Santoro},
title = {On time versus size for monotone dynamic monopolies in regular topologies},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {129--150},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00022-4},
doi = {10.1016/S1570-8667(03)00022-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FlocchiniKRRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranekLS03,
author = {Frantisek Franek and
Weilin Lu and
William F. Smyth},
title = {Two-pattern strings {I} - {A} recognition algorithm},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {445--460},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00037-6},
doi = {10.1016/S1570-8667(03)00037-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranekLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GavoilleZ03,
author = {Cyril Gavoille and
Akka Zemmari},
title = {The compactness of adaptive routing tables},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {237--254},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00027-3},
doi = {10.1016/S1570-8667(03)00027-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GavoilleZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GeorgiouS03,
author = {Chryssis Georgiou and
Alexander A. Shvartsman},
title = {Cooperative computing with fragmentable and mergeable groups},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {211--235},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00026-1},
doi = {10.1016/S1570-8667(03)00026-1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GeorgiouS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HariharanV03,
author = {Ramesh Hariharan and
V. Vinay},
title = {String matching in {\~{O}}(sqrt(n)+sqrt(m)) quantum time},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {103--110},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00010-8},
doi = {10.1016/S1570-8667(03)00010-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HariharanV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IrvingL03,
author = {Robert W. Irving and
Lorna Love},
title = {The suffix binary search tree and suffix {AVL} tree},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {387--408},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00034-0},
doi = {10.1016/S1570-8667(03)00034-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IrvingL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JuurlinkKHR03,
author = {Ben H. H. Juurlink and
Petr Kolman and
Friedhelm Meyer auf der Heide and
Ingo Rieping},
title = {Optimal broadcast on parallel locality models},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {151--166},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00023-6},
doi = {10.1016/S1570-8667(03)00023-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JuurlinkKHR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KarkkainenNU03,
author = {Juha K{\"{a}}rkk{\"{a}}inen and
Gonzalo Navarro and
Esko Ukkonen},
title = {Approximate string matching on Ziv-Lempel compressed text},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {313--338},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00032-7},
doi = {10.1016/S1570-8667(03)00032-7},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KarkkainenNU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KingstonS03,
author = {Jeffrey H. Kingston and
Nicholas Paul Sheppard},
title = {On reductions for the Steiner Problem in Graphs},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {77--88},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00008-X},
doi = {10.1016/S1570-8667(03)00008-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KingstonS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LauZ03,
author = {Francis C. M. Lau and
Shi{-}Heng Zhang},
title = {Optimal gossiping in paths and cycles},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {461--475},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00038-8},
doi = {10.1016/S1570-8667(03)00038-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LauZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Navarro03,
author = {Gonzalo Navarro},
title = {Regular expression searching on compressed text},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {423--443},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00036-4},
doi = {10.1016/S1570-8667(03)00036-4},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Navarro03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NiedermeierR03,
author = {Rolf Niedermeier and
Peter Rossmanith},
title = {An efficient fixed-parameter algorithm for 3-Hitting Set},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {89--102},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00009-1},
doi = {10.1016/S1570-8667(03)00009-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NiedermeierR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SimP03,
author = {Jeong Seop Sim and
Kunsoo Park},
title = {The consensus string problem for a metric is NP-complete},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {111--117},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00011-X},
doi = {10.1016/S1570-8667(03)00011-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SimP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Wenk03,
author = {Carola Wenk},
title = {Applying an edit distance to the matching of tree ring sequences in
dendrochronology},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {367--385},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00028-5},
doi = {10.1016/S1570-8667(03)00028-5},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Wenk03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/dAmoreI03,
author = {Fabrizio d'Amore and
Fabio Iacobini},
title = {On-line algorithms for networks of temporal constraints},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {303--312},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00031-5},
doi = {10.1016/S1570-8667(03)00031-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/dAmoreI03.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-07-16 10:43 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:
