Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jda/jda7.bht:"
download as .bib file
@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}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-25 19:19 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:
