Search dblp for Publications

• > Home > Search

@article{DBLP:journals/ipl/BansalU17,
  author       = {Nikhil Bansal and
                  Seeun William Umboh},
  title        = {Tight approximation bounds for dominating set on graphs of bounded
                  arboricity},
  journal      = {Inf. Process. Lett.},
  volume       = {122},
  pages        = {21--24},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.01.011},
  doi          = {10.1016/J.IPL.2017.01.011},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/BansalU17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BroereS17,
  author       = {Izak Broere and
                  Gabriel Semanisin},
  title        = {Some bounds on the generalised total chromatic number of degenerate
                  graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {122},
  pages        = {30--33},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.02.008},
  doi          = {10.1016/J.IPL.2017.02.008},
  timestamp    = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BroereS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ChatterjeeO17,
  author       = {Krishnendu Chatterjee and
                  Georg Osang},
  title        = {Pushdown reachability with constant treewidth},
  journal      = {Inf. Process. Lett.},
  volume       = {122},
  pages        = {25--29},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.02.003},
  doi          = {10.1016/J.IPL.2017.02.003},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/ChatterjeeO17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/EsinerD17,
  author       = {Ertem Esiner and
                  Anwitaman Datta},
  title        = {On query result integrity over encrypted data},
  journal      = {Inf. Process. Lett.},
  volume       = {122},
  pages        = {34--39},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.02.005},
  doi          = {10.1016/J.IPL.2017.02.005},
  timestamp    = {Sun, 22 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/EsinerD17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Lee17,
  author       = {Euiwoong Lee},
  title        = {APX-hardness of maximizing Nash social welfare with indivisible items},
  journal      = {Inf. Process. Lett.},
  volume       = {122},
  pages        = {17--20},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.01.012},
  doi          = {10.1016/J.IPL.2017.01.012},
  timestamp    = {Thu, 28 Dec 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Lee17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LinC17,
  author       = {Min{-}Sheng Lin and
                  Chien{-}Min Chen},
  title        = {Linear-time algorithms for counting independent sets in bipartite
                  permutation graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {122},
  pages        = {1--7},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.02.002},
  doi          = {10.1016/J.IPL.2017.02.002},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LinC17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ManciniMMMST17,
  author       = {Toni Mancini and
                  Federico Mari and
                  Annalisa Massini and
                  Igor Melatti and
                  Ivano Salvo and
                  Enrico Tronci},
  title        = {On minimising the maximum expected verification time},
  journal      = {Inf. Process. Lett.},
  volume       = {122},
  pages        = {8--16},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.02.001},
  doi          = {10.1016/J.IPL.2017.02.001},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ManciniMMMST17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}