Search dblp for Publications

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

 download as .bib file

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