Search dblp for Publications

• > Home > Search

@article{DBLP:journals/ipl/BonamyDFJP18,
  author       = {Marthe Bonamy and
                  Konrad K. Dabrowski and
                  Carl Feghali and
                  Matthew Johnson and
                  Dani{\"{e}}l Paulusma},
  title        = {Independent feedback vertex sets for graphs of bounded diameter},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {26--32},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.11.004},
  doi          = {10.1016/J.IPL.2017.11.004},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BonamyDFJP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/CenciarelliGS18,
  author       = {Pietro Cenciarelli and
                  Daniele Gorla and
                  Ivano Salvo},
  title        = {Inefficiencies in network models: {A} graph-theoretic perspective},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {44--50},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.10.008},
  doi          = {10.1016/J.IPL.2017.10.008},
  timestamp    = {Thu, 25 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/CenciarelliGS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ChangPHS18,
  author       = {Ku{-}Young Chang and
                  Sun{-}Mi Park and
                  Dowon Hong and
                  Changho Seo},
  title        = {Efficient multiplier based on hybrid approach for Toeplitz matrix-vector
                  product},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {33--38},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.11.006},
  doi          = {10.1016/J.IPL.2017.11.006},
  timestamp    = {Thu, 04 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/ChangPHS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ChungY18,
  author       = {Byungjin Chung and
                  Changhoon Yim},
  title        = {Fast intra prediction method by adaptive number of candidate modes
                  for {RDO} in {HEVC}},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {20--25},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.11.005},
  doi          = {10.1016/J.IPL.2017.11.005},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/ChungY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/FriezeP18,
  author       = {Alan M. Frieze and
                  Samantha Petti},
  title        = {Balanced allocation through random walk},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {39--43},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.11.010},
  doi          = {10.1016/J.IPL.2017.11.010},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/FriezeP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/GelleI18,
  author       = {Kitti Gelle and
                  Szabolcs Iv{\'{a}}n},
  title        = {Recognizing Union-Find trees is NP-complete},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {7--14},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.11.003},
  doi          = {10.1016/J.IPL.2017.11.003},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/GelleI18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/HrubesP18,
  author       = {Pavel Hrubes and
                  Pavel Pudl{\'{a}}k},
  title        = {A note on monotone real circuits},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {15--19},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.11.002},
  doi          = {10.1016/J.IPL.2017.11.002},
  timestamp    = {Thu, 04 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/HrubesP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/KishoreVS18,
  author       = {Ravi Kishore and
                  Chiranjeevi Vanarasa and
                  Kannan Srinathan},
  title        = {On minimal connectivity requirements for secure message transmission
                  in directed networks},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {1--6},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.11.001},
  doi          = {10.1016/J.IPL.2017.11.001},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/KishoreVS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/PapadopoulosC18,
  author       = {Kleitos Papadopoulos and
                  Demetres Christofides},
  title        = {A fast algorithm for the gas station problem},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {55--59},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.11.009},
  doi          = {10.1016/J.IPL.2017.11.009},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/PapadopoulosC18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/TanJ18,
  author       = {Xuehou Tan and
                  Bo Jiang},
  title        = {An improved algorithm for computing a shortest watchman route for
                  lines},
  journal      = {Inf. Process. Lett.},
  volume       = {131},
  pages        = {51--54},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2017.11.011},
  doi          = {10.1016/J.IPL.2017.11.011},
  timestamp    = {Thu, 07 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/TanJ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}