Search dblp for Publications

export results for "toc:db/journals/jda/jda16.bht:"

 download as .bib file

@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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics