Search dblp for Publications

export results for "toc:db/journals/jal/jal48.bht:"

 download as .bib file

@article{DBLP:journals/jal/AlthausDKMNT03,
  author       = {Ernst Althaus and
                  Denys Duchier and
                  Alexander Koller and
                  Kurt Mehlhorn and
                  Joachim Niehren and
                  Sven Thiel},
  title        = {An efficient graph algorithm for dominance constraints},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {194--219},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00050-6},
  doi          = {10.1016/S0196-6774(03)00050-6},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/AlthausDKMNT03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Bar-NoyL03,
  author       = {Amotz Bar{-}Noy and
                  Richard E. Ladner},
  title        = {Competitive on-line stream merging algorithms for media-on-demand},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {59--90},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00045-2},
  doi          = {10.1016/S0196-6774(03)00045-2},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/Bar-NoyL03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/CalinescuFR03,
  author       = {Gruia C{\u{a}}linescu and
                  Cristina G. Fernandes and
                  Bruce A. Reed},
  title        = {Multicuts in unweighted graphs and digraphs with bounded degree and
                  bounded tree-width},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {2},
  pages        = {333--359},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00073-7},
  doi          = {10.1016/S0196-6774(03)00073-7},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/CalinescuFR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/CapraraPR03,
  author       = {Alberto Caprara and
                  Alessandro Panconesi and
                  Romeo Rizzi},
  title        = {Packing cycles in undirected graphs},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {239--256},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00052-X},
  doi          = {10.1016/S0196-6774(03)00052-X},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/CapraraPR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/DemaineL03,
  author       = {Erik D. Demaine and
                  Alejandro L{\'{o}}pez{-}Ortiz},
  title        = {A linear lower bound on index size for text retrieval},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {2--15},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00043-9},
  doi          = {10.1016/S0196-6774(03)00043-9},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/DemaineL03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/DumitrescuM03,
  author       = {Adrian Dumitrescu and
                  Joseph S. B. Mitchell},
  title        = {Approximation algorithms for {TSP} with neighborhoods in the plane},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {135--159},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00047-6},
  doi          = {10.1016/S0196-6774(03)00047-6},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/DumitrescuM03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/EpsteinT03,
  author       = {Leah Epstein and
                  Tamir Tassa},
  title        = {Vector assignment problems: a general framework},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {2},
  pages        = {360--384},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00055-5},
  doi          = {10.1016/S0196-6774(03)00055-5},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/EpsteinT03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/FerraroG03,
  author       = {Pascal Ferraro and
                  Christophe Godin},
  title        = {Optimal mappings with minimum number of connected components in tree-to-tree
                  comparison problems},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {2},
  pages        = {385--406},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00079-8},
  doi          = {10.1016/S0196-6774(03)00079-8},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/FerraroG03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/FiatK03,
  author       = {Amos Fiat and
                  Haim Kaplan},
  title        = {Making data structures confluently persistent},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {16--58},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00044-0},
  doi          = {10.1016/S0196-6774(03)00044-0},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/FiatK03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/FrederiksenLNU03,
  author       = {Jens S. Frederiksen and
                  Kim S. Larsen and
                  John Noga and
                  Patchrawat Uthaisombut},
  title        = {Dynamic {TCP} acknowledgment in the LogP model},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {2},
  pages        = {407--428},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00058-0},
  doi          = {10.1016/S0196-6774(03)00058-0},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/FrederiksenLNU03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/GoelHPT03,
  author       = {Ashish Goel and
                  Monika Rauch Henzinger and
                  Serge A. Plotkin and
                  {\'{E}}va Tardos},
  title        = {Scheduling data transfers in a network and the set scheduling problem},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {2},
  pages        = {314--332},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00054-3},
  doi          = {10.1016/S0196-6774(03)00054-3},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/GoelHPT03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/GuhaHKO03,
  author       = {Sudipto Guha and
                  Refael Hassin and
                  Samir Khuller and
                  Einat Or},
  title        = {Capacitated vertex covering},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {257--270},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00053-1},
  doi          = {10.1016/S0196-6774(03)00053-1},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/GuhaHKO03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/GuhaMM03,
  author       = {Sudipto Guha and
                  Adam Meyerson and
                  Kamesh Munagala},
  title        = {A constant factor approximation algorithm for the fault-tolerant facility
                  location problem},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {2},
  pages        = {429--440},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00056-7},
  doi          = {10.1016/S0196-6774(03)00056-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/GuhaMM03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/HassinL03,
  author       = {Refael Hassin and
                  Asaf Levin},
  title        = {Minimum spanning tree with hop restrictions},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {220--238},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00051-8},
  doi          = {10.1016/S0196-6774(03)00051-8},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/HassinL03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/JohnWMV03,
  author       = {Katherine St. John and
                  Tandy J. Warnow and
                  Bernard M. E. Moret and
                  Lisa Vawter},
  title        = {Performance study of phylogenetic methods: (unweighted) quartet methods
                  and neighbor-joining},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {173--193},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00049-X},
  doi          = {10.1016/S0196-6774(03)00049-X},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/JohnWMV03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/LiaoLY03,
  author       = {Chien{-}Chih Liao and
                  Hsueh{-}I Lu and
                  Hsu{-}Chun Yen},
  title        = {Compact floor-planning via orderly spanning trees},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {2},
  pages        = {441--451},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00057-9},
  doi          = {10.1016/S0196-6774(03)00057-9},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/LiaoLY03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Meyer03,
  author       = {Ulrich Meyer},
  title        = {Average-case complexity of single-source shortest-paths algorithms:
                  lower and upper bounds},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {91--134},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00046-4},
  doi          = {10.1016/S0196-6774(03)00046-4},
  timestamp    = {Mon, 14 Aug 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Meyer03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Pruhs03,
  author       = {Kirk Pruhs},
  title        = {Foreword},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {1},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00042-7},
  doi          = {10.1016/S0196-6774(03)00042-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Pruhs03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/RaghavanS03,
  author       = {Vijay Raghavan and
                  Jeremy P. Spinrad},
  title        = {Robust algorithms for restricted domains},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {1},
  pages        = {160--172},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00048-8},
  doi          = {10.1016/S0196-6774(03)00048-8},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/RaghavanS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Sadakane03,
  author       = {Kunihiko Sadakane},
  title        = {New text indexing functionalities of the compressed suffix arrays},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {2},
  pages        = {294--313},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00087-7},
  doi          = {10.1016/S0196-6774(03)00087-7},
  timestamp    = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/Sadakane03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Vakhania03,
  author       = {Nodari Vakhania},
  title        = {A better algorithm for sequencing with release and delivery times
                  on identical machines},
  journal      = {J. Algorithms},
  volume       = {48},
  number       = {2},
  pages        = {273--293},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0196-6774(03)00072-5},
  doi          = {10.1016/S0196-6774(03)00072-5},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Vakhania03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.