Search dblp for Publications

export results for "toc:db/journals/ipl/ipl74.bht:"

 download as .bib file

@article{DBLP:journals/ipl/BavejaS00,
  author       = {Alok Baveja and
                  Aravind Srinivasan},
  title        = {Approximating low-congestion routing and column-restricted packing
                  problems},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {19--25},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00033-8},
  doi          = {10.1016/S0020-0190(00)00033-8},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BavejaS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BeinL00,
  author       = {Wolfgang W. Bein and
                  Lawrence L. Larmore},
  title        = {Trackless online algorithms for the server problem},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {73--79},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00034-X},
  doi          = {10.1016/S0020-0190(00)00034-X},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BeinL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Bertault00,
  author       = {Fran{\c{c}}ois Bertault},
  title        = {A force-directed algorithm that preserves edge-crossing properties},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {7--13},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00042-9},
  doi          = {10.1016/S0020-0190(00)00042-9},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Bertault00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BouajjaniEFMRWW00,
  author       = {Ahmed Bouajjani and
                  Javier Esparza and
                  Alain Finkel and
                  Oded Maler and
                  Peter Rossmanith and
                  Bernard Willems and
                  Pierre Wolper},
  title        = {An efficient automata approach to some problems on context-free grammars},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {221--227},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00055-7},
  doi          = {10.1016/S0020-0190(00)00055-7},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/BouajjaniEFMRWW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Chen00a,
  author       = {Weimin Chen},
  title        = {Multi-subsequence searching},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {229--233},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00057-0},
  doi          = {10.1016/S0020-0190(00)00057-0},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Chen00a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Chung00,
  author       = {Kuo{-}Liang Chung},
  title        = {On finding medians of weighted discrete points},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {103--106},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00049-1},
  doi          = {10.1016/S0020-0190(00)00049-1},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Chung00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/DasS00,
  author       = {Gautam Das and
                  Michiel H. M. Smid},
  title        = {A lower bound for approximating the geometric minimum weight matching},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {253--255},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00062-4},
  doi          = {10.1016/S0020-0190(00)00062-4},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/DasS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/DimitrakosM00,
  author       = {Theodosis Dimitrakos and
                  T. S. E. Maibaum},
  title        = {On a generalized modularization theorem},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {65--71},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00037-5},
  doi          = {10.1016/S0020-0190(00)00037-5},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/DimitrakosM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/DovierPR00,
  author       = {Agostino Dovier and
                  Enrico Pontelli and
                  Gianfranco Rossi},
  title        = {A necessary condition for Constructive Negation in Constraint Logic
                  Programming},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {147--156},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00046-6},
  doi          = {10.1016/S0020-0190(00)00046-6},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/DovierPR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/DuarteM00,
  author       = {Carlos H. C. Duarte and
                  T. S. E. Maibaum},
  title        = {A rely-guarantee discipline for open distributed systems design},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {55--63},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00038-7},
  doi          = {10.1016/S0020-0190(00)00038-7},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/DuarteM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Durand-Lose00,
  author       = {J{\'{e}}r{\^{o}}me Olivier Durand{-}Lose},
  title        = {Randomized uniform self-stabilizing mutual exclusion},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {203--207},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00056-9},
  doi          = {10.1016/S0020-0190(00)00056-9},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Durand-Lose00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Gabow00,
  author       = {Harold N. Gabow},
  title        = {Path-based depth-first search for strong and biconnected components},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {107--114},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00051-X},
  doi          = {10.1016/S0020-0190(00)00051-X},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Gabow00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Gobel00,
  author       = {Manfred G{\"{o}}bel},
  title        = {Rings of polynomial invariants of the alternating group have no finite
                  {SAGBI} bases with respect to any admissible order},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {15--18},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00031-4},
  doi          = {10.1016/S0020-0190(00)00031-4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Gobel00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/GranvilliersH00,
  author       = {Laurent Granvilliers and
                  Ga{\'{e}}tan Hains},
  title        = {A conservative scheme for parallel interval narrowing},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {141--146},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00048-X},
  doi          = {10.1016/S0020-0190(00)00048-X},
  timestamp    = {Sun, 06 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GranvilliersH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Hastad00,
  author       = {Johan H{\aa}stad},
  title        = {On bounded occurrence constraint satisfaction},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {1--6},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00032-6},
  doi          = {10.1016/S0020-0190(00)00032-6},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Hastad00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ImKKY00,
  author       = {Byoung Mo Im and
                  Myoung{-}Ho Kim and
                  Hyung{-}Il Kang and
                  Jae Soo Yoo},
  title        = {Declustering signature files based on a dynamic measure},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {235--241},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00059-4},
  doi          = {10.1016/S0020-0190(00)00059-4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ImKKY00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/IwataMS00,
  author       = {Satoru Iwata and
                  S. Thomas McCormick and
                  Maiko Shigeno},
  title        = {A fast cost scaling algorithm for submodular flow},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {123--128},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00052-1},
  doi          = {10.1016/S0020-0190(00)00052-1},
  timestamp    = {Wed, 16 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/IwataMS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/KavvadiasSS00,
  author       = {Dimitris J. Kavvadias and
                  Martha Sideri and
                  Elias C. Stavropoulos},
  title        = {Generating all maximal models of a Boolean expression},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {157--162},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00023-5},
  doi          = {10.1016/S0020-0190(00)00023-5},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/KavvadiasSS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Khuller00,
  author       = {Samir Khuller},
  title        = {Addendum to "An O({\(\vert\)}V{\(\vert\)}\({}^{\mbox{2}}\)) algorithm
                  for single connectedness"},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {263},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00054-5},
  doi          = {10.1016/S0020-0190(00)00054-5},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Khuller00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/KloksKM00,
  author       = {Ton Kloks and
                  Dieter Kratsch and
                  Haiko M{\"{u}}ller},
  title        = {Finding and counting small induced subgraphs efficiently},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {115--121},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00047-8},
  doi          = {10.1016/S0020-0190(00)00047-8},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/KloksKM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Kundu00,
  author       = {Sukhamay Kundu},
  title        = {An optimal O(N\({}^{\mbox{2}}\)) algorithm for computing the min-transitive
                  closure of a weighted graph},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {215--220},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00064-8},
  doi          = {10.1016/S0020-0190(00)00064-8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Kundu00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LinK00,
  author       = {Jenn{-}Wei Lin and
                  Sy{-}Yen Kuo},
  title        = {Resolving error propagation in distributed systems},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {257--262},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00060-0},
  doi          = {10.1016/S0020-0190(00)00060-0},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LinK00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/NgSZ00,
  author       = {Joseph Kee{-}Yin Ng and
                  Shibin Song and
                  Wei Zhao},
  title        = {Statistical delay analysis on an {ATM} switch with self-similar input
                  traffic},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {163--173},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00043-0},
  doi          = {10.1016/S0020-0190(00)00043-0},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/NgSZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/NiehrenTT00,
  author       = {Joachim Niehren and
                  Sophie Tison and
                  Ralf Treinen},
  title        = {On rewrite constraints and context unification},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {35--40},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00036-3},
  doi          = {10.1016/S0020-0190(00)00036-3},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/NiehrenTT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Nikolopoulos00,
  author       = {Stavros D. Nikolopoulos},
  title        = {Recognizing cographs and threshold graphs through a classification
                  of their edges},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {129--139},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00041-7},
  doi          = {10.1016/S0020-0190(00)00041-7},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Nikolopoulos00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Pudlak00,
  author       = {Pavel Pudl{\'{a}}k},
  title        = {A note on the use of determinant for proving lower bounds on the size
                  of linear circuits},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {197--201},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00058-2},
  doi          = {10.1016/S0020-0190(00)00058-2},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Pudlak00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/RamnathZ00,
  author       = {Sarnath Ramnath and
                  Peiyi Zhao},
  title        = {On the isomorphism of expressions},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {97--102},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00050-8},
  doi          = {10.1016/S0020-0190(00)00050-8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/RamnathZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/RaoRW00,
  author       = {Rajesh P. N. Rao and
                  J{\"{o}}rg Rothe and
                  Osamu Watanabe},
  title        = {Corrigendum to "Upward separation for FewP and related classes"},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {89},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00035-1},
  doi          = {10.1016/S0020-0190(00)00035-1},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/RaoRW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/SantisM00,
  author       = {Alfredo De Santis and
                  Barbara Masucci},
  title        = {On secret set schemes},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {243--251},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00061-2},
  doi          = {10.1016/S0020-0190(00)00061-2},
  timestamp    = {Sun, 06 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/SantisM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Sarkar00,
  author       = {Palash Sarkar},
  title        = {A note on the spectral characterization of correlation immune Boolean
                  functions},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {191--195},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00063-6},
  doi          = {10.1016/S0020-0190(00)00063-6},
  timestamp    = {Tue, 04 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Sarkar00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Schneider00,
  author       = {Markus Schneider},
  title        = {On distribution properties of sequences with perfect linear complexity
                  profile},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {175--182},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00045-4},
  doi          = {10.1016/S0020-0190(00)00045-4},
  timestamp    = {Wed, 03 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Schneider00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Schonhage00,
  author       = {Arnold Sch{\"{o}}nhage},
  title        = {Variations on computing reciprocals of power series},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {41--46},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00044-2},
  doi          = {10.1016/S0020-0190(00)00044-2},
  timestamp    = {Wed, 16 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Schonhage00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Talbot00,
  author       = {Jean{-}Marc Talbot},
  title        = {The forall-exists\({}^{\mbox{2}}\) fragment of the first-order theory
                  of atomic set constraints is Pi\({}^{\mbox{0}}\)\({}_{\mbox{1}}\)-hard},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {27--33},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00030-2},
  doi          = {10.1016/S0020-0190(00)00030-2},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Talbot00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Veanes00,
  author       = {Margus Veanes},
  title        = {Farmer's Theorem revisited},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {47--53},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00029-6},
  doi          = {10.1016/S0020-0190(00)00029-6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Veanes00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/VigneronGGIL00,
  author       = {Antoine Vigneron and
                  Lixin Gao and
                  Mordecai J. Golin and
                  Giuseppe F. Italiano and
                  Bo Li},
  title        = {An algorithm for finding a k-median in a directed tree},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {1-2},
  pages        = {81--88},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00026-0},
  doi          = {10.1016/S0020-0190(00)00026-0},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/VigneronGGIL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/WangCY00,
  author       = {Cao An Wang and
                  Francis Y. L. Chin and
                  Boting Yang},
  title        = {Triangulations without minimum-weight drawing},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {183--189},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00067-3},
  doi          = {10.1016/S0020-0190(00)00067-3},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/WangCY00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Wegener00,
  author       = {Ingo Wegener},
  title        = {Worst case examples for operations on OBDDs},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {3-4},
  pages        = {91--96},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00053-3},
  doi          = {10.1016/S0020-0190(00)00053-3},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Wegener00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Yang00,
  author       = {Jae Dong Yang},
  title        = {A concept-based query evaluation with indefinite fuzzy triples},
  journal      = {Inf. Process. Lett.},
  volume       = {74},
  number       = {5-6},
  pages        = {209--214},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00066-1},
  doi          = {10.1016/S0020-0190(00)00066-1},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Yang00.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.