Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/ipl/AnantharamanNR05,
  author       = {Siva Anantharaman and
                  Paliath Narendran and
                  Micha{\"{e}}l Rusinowitch},
  title        = {Closure properties and decision problems of dag automata},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {5},
  pages        = {231--240},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.004},
  doi          = {10.1016/J.IPL.2005.02.004},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/AnantharamanNR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AngelBG05,
  author       = {Eric Angel and
                  Evripidis Bampis and
                  Laurent Gourv{\`{e}}s},
  title        = {Approximation results for a bicriteria job scheduling problem on a
                  single machine without preemption},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {1},
  pages        = {19--27},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.007},
  doi          = {10.1016/J.IPL.2004.12.007},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/AngelBG05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AppaMM05,
  author       = {Gautam Appa and
                  Dimitris Magos and
                  Ioannis Mourtos},
  title        = {On the system of two \emph{all{\_}different} predicates},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {3},
  pages        = {99--105},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.009},
  doi          = {10.1016/J.IPL.2005.01.009},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/AppaMM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BergstraB05,
  author       = {Jan A. Bergstra and
                  Inge Bethke},
  title        = {An upper bound for the equational specification of finite state services},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {6},
  pages        = {267--269},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.010},
  doi          = {10.1016/J.IPL.2005.02.010},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BergstraB05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonifatiCP05,
  author       = {Angela Bonifati and
                  Stefano Ceri and
                  Stefano Paraboschi},
  title        = {Event Trace Independence of active behavior},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {2},
  pages        = {71--77},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.014},
  doi          = {10.1016/J.IPL.2004.12.014},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/BonifatiCP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Brodsky05,
  author       = {Alex Brodsky},
  title        = {An impossibility gap between width-4 and width-5 permutation branching
                  programs},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {4},
  pages        = {159--164},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.012},
  doi          = {10.1016/J.IPL.2005.01.012},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Brodsky05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BurmesterD05,
  author       = {Mike Burmester and
                  Yvo Desmedt},
  title        = {A secure and scalable Group Key Exchange system},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {3},
  pages        = {137--143},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.003},
  doi          = {10.1016/J.IPL.2005.01.003},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BurmesterD05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarrabsCGP05,
  author       = {Francesco Carrabs and
                  Raffaele Cerulli and
                  Monica Gentili and
                  Gennaro Parlato},
  title        = {A linear time algorithm for the minimum Weighted Feedback Vertex Set
                  on diamonds},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {1},
  pages        = {29--35},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.008},
  doi          = {10.1016/J.IPL.2004.12.008},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CarrabsCGP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChandranMO05,
  author       = {L. Sunil Chandran and
                  Carlo Mannino and
                  Gianpaolo Oriolo},
  title        = {On the cubicity of certain graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {3},
  pages        = {113--118},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.001},
  doi          = {10.1016/J.IPL.2005.01.001},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ChandranMO05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CheungC05,
  author       = {King Sing Cheung and
                  K. O. Chow},
  title        = {Cycle inclusion property of augmented marked graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {6},
  pages        = {271--276},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.011},
  doi          = {10.1016/J.IPL.2005.02.011},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CheungC05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CodenottiS05,
  author       = {Bruno Codenotti and
                  Daniel Stefankovic},
  title        = {On the computational complexity of Nash equilibria for (0, 1) bimatrix
                  games},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {3},
  pages        = {145--150},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.010},
  doi          = {10.1016/J.IPL.2005.01.010},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CodenottiS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CzumajHLN05,
  author       = {Artur Czumaj and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Andrzej Lingas and
                  Johan Nilsson},
  title        = {Approximation algorithms for optimization problems in graphs with
                  superlogarithmic treewidth},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {2},
  pages        = {49--53},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.017},
  doi          = {10.1016/J.IPL.2004.12.017},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/CzumajHLN05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DanvyN05,
  author       = {Olivier Danvy and
                  Lasse R. Nielsen},
  title        = {{CPS} transformation of beta-redexes},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {5},
  pages        = {217--224},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.002},
  doi          = {10.1016/J.IPL.2005.02.002},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/DanvyN05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Darondeau05,
  author       = {Philippe Darondeau},
  title        = {Equality of languages coincides with isomorphism of reachable state
                  graphs for bounded and persistent Petri nets},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {6},
  pages        = {241--245},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.03.002},
  doi          = {10.1016/J.IPL.2005.03.002},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Darondeau05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasGN05,
  author       = {Sandip Das and
                  Partha P. Goswami and
                  Subhas C. Nandy},
  title        = {Smallest \emph{k}-point enclosing rectangle and square of arbitrary
                  orientation},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {6},
  pages        = {259--266},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.013},
  doi          = {10.1016/J.IPL.2005.02.013},
  timestamp    = {Sun, 24 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/DasGN05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FriedmanMR05,
  author       = {Roy Friedman and
                  Achour Most{\'{e}}faoui and
                  Michel Raynal},
  title        = {Asynchronous bounded lifetime failure detectors},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {2},
  pages        = {85--91},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.011},
  doi          = {10.1016/J.IPL.2004.12.011},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/FriedmanMR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GriffithsO05,
  author       = {Evan J. Griffiths and
                  Pekka Orponen},
  title        = {Optimization, block designs and No Free Lunch theorems},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {2},
  pages        = {55--61},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.015},
  doi          = {10.1016/J.IPL.2004.12.015},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GriffithsO05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoH05,
  author       = {J. Y. Guo and
                  Frank K. Hwang},
  title        = {An almost-linear time and linear space algorithm for the longest common
                  subsequence problem},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {3},
  pages        = {131--135},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.002},
  doi          = {10.1016/J.IPL.2005.01.002},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GuoH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HalavaHL05,
  author       = {Vesa Halava and
                  Tero Harju and
                  Michel Latteux},
  title        = {Equality sets of prefix morphisms and regular star languages},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {4},
  pages        = {151--154},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.014},
  doi          = {10.1016/J.IPL.2005.01.014},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/HalavaHL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HermanJ05,
  author       = {Ted Herman and
                  Colette Johnen},
  title        = {Strategies for peer-to-peer downloading},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {5},
  pages        = {203--209},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.012},
  doi          = {10.1016/J.IPL.2005.02.012},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/HermanJ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Honkala05,
  author       = {Juha Honkala},
  title        = {The class of {HDT0L} sequences is closed with respect to rational
                  functions},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {4},
  pages        = {155--158},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.013},
  doi          = {10.1016/J.IPL.2005.01.013},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Honkala05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JerebicKS05,
  author       = {Janja Jerebic and
                  Sandi Klavzar and
                  Simon Spacapan},
  title        = {Characterizing r-perfect codes in direct products of two and three
                  cycles},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {1},
  pages        = {1--6},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.010},
  doi          = {10.1016/J.IPL.2004.12.010},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/JerebicKS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JourdanUZ05,
  author       = {Guy{-}Vincent Jourdan and
                  Hasan Ural and
                  Nejib Zaguia},
  title        = {Minimizing the number of inputs while applying adaptive test cases},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {4},
  pages        = {165--169},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.011},
  doi          = {10.1016/J.IPL.2005.01.011},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/JourdanUZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KashyapG05,
  author       = {Sujatha Kashyap and
                  Vijay K. Garg},
  title        = {Intractability results in predicate detection},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {6},
  pages        = {277--282},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.008},
  doi          = {10.1016/J.IPL.2005.02.008},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/KashyapG05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kolliopoulos05,
  author       = {Stavros G. Kolliopoulos},
  title        = {Minimum-cost single-source 2-splittable flow},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {1},
  pages        = {15--18},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.009},
  doi          = {10.1016/J.IPL.2004.12.009},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Kolliopoulos05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KorzeV05,
  author       = {Danilo Korze and
                  Aleksander Vesel},
  title        = {\emph{L}(2, 1)-labeling of strong products of cycles},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {4},
  pages        = {183--190},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.007},
  doi          = {10.1016/J.IPL.2005.01.007},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/KorzeV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Koutis05,
  author       = {Ioannis Koutis},
  title        = {A faster parameterized algorithm for set packing},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {1},
  pages        = {7--9},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.005},
  doi          = {10.1016/J.IPL.2004.12.005},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Koutis05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeHCST05,
  author       = {Chuan{-}Min Lee and
                  Ling{-}Ju Hung and
                  Maw{-}Shang Chang and
                  Chia{-}Ben Shen and
                  Chuan Yi Tang},
  title        = {An improved algorithm for the maximum agreement subtree problem},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {5},
  pages        = {211--216},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.005},
  doi          = {10.1016/J.IPL.2005.02.005},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/LeeHCST05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeTH05,
  author       = {Kuo{-}Chu Lee and
                  Chi{-}Hung Tzeng and
                  Shing{-}Tsaan Huang},
  title        = {A space-efficient self-stabilizing algorithm for measuring the size
                  of ring networks},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {3},
  pages        = {125--130},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.004},
  doi          = {10.1016/J.IPL.2005.01.004},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LeeTH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiebchenR05,
  author       = {Christian Liebchen and
                  Romeo Rizzi},
  title        = {A greedy approach to compute a minimum cycle basis of a directed graph},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {3},
  pages        = {107--112},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.006},
  doi          = {10.1016/J.IPL.2005.01.006},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LiebchenR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LorenczH05,
  author       = {R{\'{o}}bert L{\'{o}}rencz and
                  Josef Hlav{\'{a}}c},
  title        = {Subtraction-free Almost Montgomery Inverse algorithm},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {1},
  pages        = {11--14},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.012},
  doi          = {10.1016/J.IPL.2004.12.012},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LorenczH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lozin05,
  author       = {Vadim V. Lozin},
  title        = {Between 2- and 3-colorability},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {4},
  pages        = {179--182},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.008},
  doi          = {10.1016/J.IPL.2005.01.008},
  timestamp    = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Lozin05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Madry05,
  author       = {Aleksander Madry},
  title        = {Data exchange: On the complexity of answering queries with inequalities},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {6},
  pages        = {253--257},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.03.001},
  doi          = {10.1016/J.IPL.2005.03.001},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Madry05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/McIverM05,
  author       = {Annabelle McIver and
                  Carroll Morgan},
  title        = {An elementary proof that Herman's Ring is Theta (N\({}^{\mbox{2}}\))},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {2},
  pages        = {79--84},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.013},
  doi          = {10.1016/J.IPL.2004.12.013},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/McIverM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Minsker05,
  author       = {Steven Minsker},
  title        = {The Little Towers of Antwerpen problem},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {5},
  pages        = {197--201},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.007},
  doi          = {10.1016/J.IPL.2005.02.007},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Minsker05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RahmanK05,
  author       = {Mohammad Sohel Rahman and
                  Mohammad Kaykobad},
  title        = {On Hamiltonian cycles and Hamiltonian paths},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {1},
  pages        = {37--41},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.002},
  doi          = {10.1016/J.IPL.2004.12.002},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/RahmanK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RahmanK05a,
  author       = {Mohammad Sohel Rahman and
                  Mohammad Kaykobad},
  title        = {Complexities of some interesting problems on spanning trees},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {2},
  pages        = {93--97},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.016},
  doi          = {10.1016/J.IPL.2004.12.016},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/RahmanK05a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RajasekaranS05,
  author       = {Sanguthevar Rajasekaran and
                  Sandeep Sen},
  title        = {A generalization of the 0-1 principle for sorting},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {1},
  pages        = {43--47},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.11.013},
  doi          = {10.1016/J.IPL.2004.11.013},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/RajasekaranS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TelelisZ05,
  author       = {Orestis Telelis and
                  Vassilis Zissimopoulos},
  title        = {Absolute o(log m) error in approximating random set covering: an average
                  case analysis},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {4},
  pages        = {171--177},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.009},
  doi          = {10.1016/J.IPL.2005.02.009},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/TelelisZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ThomasianLZ05,
  author       = {Alexander Thomasian and
                  Yue Li and
                  Lijuan Zhang},
  title        = {Exact \emph{k}-NN queries on clustered {SVD} datasets},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {6},
  pages        = {247--252},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.03.003},
  doi          = {10.1016/J.IPL.2005.03.003},
  timestamp    = {Fri, 25 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/ThomasianLZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangX05,
  author       = {Ji{-}Bo Wang and
                  Zun{-}Quan Xia},
  title        = {Scheduling jobs under decreasing linear deterioration},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {2},
  pages        = {63--69},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.12.018},
  doi          = {10.1016/J.IPL.2004.12.018},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/WangX05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuDZ05,
  author       = {Yinfeng Xu and
                  Wenqiang Dai and
                  Binhai Zhu},
  title        = {A lower bound on the edge l\({}_{\mbox{infinitely}}\) radius of Saitou
                  and Nei's method for phylogenetic reconstruction},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {5},
  pages        = {225--230},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.006},
  doi          = {10.1016/J.IPL.2005.02.006},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/XuDZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuLMH05,
  author       = {Jun{-}Ming Xu and
                  Min L{\"{u}} and
                  Meijie Ma and
                  Angelika Hellwig},
  title        = {Super connectivity of line graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {4},
  pages        = {191--195},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.02.001},
  doi          = {10.1016/J.IPL.2005.02.001},
  timestamp    = {Wed, 27 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/XuLMH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuX05,
  author       = {Guang Xu and
                  Jinhui Xu},
  title        = {An {LP} rounding algorithm for approximating uncapacitated facility
                  location problem with penalties},
  journal      = {Inf. Process. Lett.},
  volume       = {94},
  number       = {3},
  pages        = {119--123},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.005},
  doi          = {10.1016/J.IPL.2005.01.005},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/XuX05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics