Search dblp for Publications

• > Home > Search

@article{DBLP:journals/ipl/Baba17,
  author       = {Kensuke Baba},
  title        = {An acceleration of FFT-based algorithms for the match-count problem},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {1--4},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.04.013},
  doi          = {10.1016/J.IPL.2017.04.013},
  timestamp    = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Baba17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BjorklundHL17,
  author       = {Andreas Bj{\"{o}}rklund and
                  Thore Husfeldt and
                  Isak Lyckberg},
  title        = {Computing the permanent modulo a prime power},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {20--25},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.04.015},
  doi          = {10.1016/J.IPL.2017.04.015},
  timestamp    = {Fri, 09 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BjorklundHL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Ee17,
  author       = {Martijn van Ee},
  title        = {Some notes on bounded starwidth graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {9--14},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.04.011},
  doi          = {10.1016/J.IPL.2017.04.011},
  timestamp    = {Fri, 09 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Ee17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/FolwarcznyK17,
  author       = {Luk'av{s} Folwarczn'y and
                  Dusan Knop},
  title        = {IV-matching is strongly NP-hard},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {5--8},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.04.014},
  doi          = {10.1016/J.IPL.2017.04.014},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/FolwarcznyK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Kosolobov17,
  author       = {Dmitry Kosolobov},
  title        = {Tight lower bounds for the longest common extension problem},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {26--29},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.05.003},
  doi          = {10.1016/J.IPL.2017.05.003},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Kosolobov17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/PengPNTY17,
  author       = {Weiguang Peng and
                  NingNing Peng and
                  Keng Meng Ng and
                  Kazuyuki Tanaka and
                  Yue Yang},
  title        = {Optimal depth-first algorithms and equilibria of independent distributions
                  on multi-branching trees},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {41--45},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.05.002},
  doi          = {10.1016/J.IPL.2017.05.002},
  timestamp    = {Sat, 27 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/PengPNTY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/SawadaH17,
  author       = {Joe Sawada and
                  Patrick Hartman},
  title        = {Finding the largest fixed-density necklace and Lyndon word},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {15--19},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.04.010},
  doi          = {10.1016/J.IPL.2017.04.010},
  timestamp    = {Fri, 09 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/SawadaH17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/YangZZ17,
  author       = {Weihua Yang and
                  Shuli Zhao and
                  Shurong Zhang},
  title        = {Strong Menger connectivity with conditional faults of folded hypercubes},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {30--34},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.05.001},
  doi          = {10.1016/J.IPL.2017.05.001},
  timestamp    = {Fri, 09 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/YangZZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/YuL17,
  author       = {Ting Yu and
                  Mengchi Liu},
  title        = {A linear time algorithm for maximal clique enumeration in large sparse
                  graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {125},
  pages        = {35--40},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.05.005},
  doi          = {10.1016/J.IPL.2017.05.005},
  timestamp    = {Wed, 10 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/YuL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}