default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ipl/ipl108.bht:"
download as .bib file
@article{DBLP:journals/ipl/AcetoCIL08,
author = {Luca Aceto and
Silvio Capobianco and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Bas Luttik},
title = {The equational theory of prebisimilarity over basic {CCS} with divergence},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {284--289},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.019},
doi = {10.1016/J.IPL.2008.05.019},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AcetoCIL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnnYTH08,
author = {Hsing{-}Yen Ann and
Chang{-}Biau Yang and
Chiou{-}Ting Tseng and
Chiou{-}Yi Hor},
title = {A fast and simple algorithm for computing the longest common subsequence
of run-length encoded strings},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {360--364},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.005},
doi = {10.1016/J.IPL.2008.07.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AnnYTH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BhattacharyyaD08,
author = {Bishnu Bhattacharyya and
Frank K. H. A. Dehne},
title = {Using spine decompositions to efficiently solve the length-constrained
heaviest path problem for trees},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {293--297},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.023},
doi = {10.1016/J.IPL.2008.05.023},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BhattacharyyaD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoichutH08,
author = {Yohan Boichut and
Pierre{-}Cyrille H{\'{e}}am},
title = {A theoretical limit for safety verification techniques with regular
fix-point computations},
journal = {Inf. Process. Lett.},
volume = {108},
number = {1},
pages = {1--2},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.012},
doi = {10.1016/J.IPL.2008.03.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BoichutH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BordawekarS08,
author = {Rajesh Bordawekar and
Oded Shmueli},
title = {An algorithm for partitioning trees augmented with sibling edges},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {136--142},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.010},
doi = {10.1016/J.IPL.2008.04.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BordawekarS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BordihnH08,
author = {Henning Bordihn and
Markus Holzer},
title = {A note on cooperating distributed grammar systems working in combined
modes},
journal = {Inf. Process. Lett.},
volume = {108},
number = {1},
pages = {10--14},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.023},
doi = {10.1016/J.IPL.2008.03.023},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BordihnH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoseGKMMMST08,
author = {Prosenjit Bose and
Hua Guo and
Evangelos Kranakis and
Anil Maheshwari and
Pat Morin and
Jason Morrison and
Michiel H. M. Smid and
Yihui Tang},
title = {On the false-positive rate of Bloom filters},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {210--213},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.018},
doi = {10.1016/J.IPL.2008.05.018},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BoseGKMMMST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BottcherV08,
author = {Julia B{\"{o}}ttcher and
Dan Vilenchik},
title = {On the tractability of coloring semirandom graphs},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {143--149},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.011},
doi = {10.1016/J.IPL.2008.04.011},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BottcherV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoulinierDLP08,
author = {Christian Boulinier and
Ajoy Kumar Datta and
Lawrence L. Larmore and
Franck Petit},
title = {Space efficient and time optimal distributed {BFS} tree construction},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {273--278},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.016},
doi = {10.1016/J.IPL.2008.05.016},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BoulinierDLP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BultW08,
author = {Fokko J. van de Bult and
Gerhard J. Woeginger},
title = {The problem of the moody chess players},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {336--337},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.001},
doi = {10.1016/J.IPL.2008.07.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BultW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarvalhoLP08,
author = {Ricardo dos Santos Carvalho and
Carlile Lavor and
F{\'{a}}bio Protti},
title = {Extending the geometric build-up algorithm for the molecular distance
geometry problem},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {234--237},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.009},
doi = {10.1016/J.IPL.2008.05.009},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarvalhoLP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CharbitHLMRR08,
author = {Pierre Charbit and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier and
Mathieu Raffinot and
Micha{\"{e}}l Rao},
title = {A note on computing set overlap classes},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {186--191},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.005},
doi = {10.1016/J.IPL.2008.05.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CharbitHLMRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CohenK08,
author = {Reuven Cohen and
Liran Katzir},
title = {The Generalized Maximum Coverage Problem},
journal = {Inf. Process. Lett.},
volume = {108},
number = {1},
pages = {15--22},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.017},
doi = {10.1016/J.IPL.2008.03.017},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CohenK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrochemoreIR08,
author = {Maxime Crochemore and
Costas S. Iliopoulos and
Mohammad Sohel Rahman},
title = {Optimal prefix and suffix queries on texts},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {320--325},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.027},
doi = {10.1016/J.IPL.2008.05.027},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CrochemoreIR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CzerwinskiG08,
author = {Sebastian Czerwinski and
Jaroslaw Grytczuk},
title = {Invisible runners in finite fields},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {64--67},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.019},
doi = {10.1016/J.IPL.2008.03.019},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CzerwinskiG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DengD08,
author = {Xiaotie Deng and
Ye Du},
title = {The computation of approximate competitive equilibrium is PPAD-hard},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {369--373},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.011},
doi = {10.1016/J.IPL.2008.07.011},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DengD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Diaconescu08,
author = {Razvan Diaconescu},
title = {A categorical study on the finiteness of specifications},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {75--80},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.001},
doi = {10.1016/J.IPL.2008.04.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Diaconescu08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongYZ08,
author = {Qiang Dong and
Xiaofan Yang and
Juan Zhao},
title = {Embedding a family of disjoint multi-dimensional meshes into a crossed
cube},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {394--397},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.013},
doi = {10.1016/J.IPL.2008.07.013},
timestamp = {Thu, 19 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongYZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DouradoLPS08,
author = {Mitre Costa Dourado and
Min Chih Lin and
F{\'{a}}bio Protti and
Jayme Luiz Szwarcfiter},
title = {Improved algorithms for recognizing p},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {247--250},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.013},
doi = {10.1016/J.IPL.2008.05.013},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DouradoLPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DowneyG08,
author = {Rod Downey and
Noam Greenberg},
title = {Turing degrees of reals of positive effective packing dimension},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {298--303},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.028},
doi = {10.1016/J.IPL.2008.05.028},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DowneyG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DrosteSV08,
author = {Manfred Droste and
Jacques Sakarovitch and
Heiko Vogler},
title = {Weighted automata with discounting},
journal = {Inf. Process. Lett.},
volume = {108},
number = {1},
pages = {23--28},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.014},
doi = {10.1016/J.IPL.2008.03.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DrosteSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EsperetLO08,
author = {Louis Esperet and
Arnaud Labourel and
Pascal Ochem},
title = {On induced-universal graphs for the class of bounded-degree graphs},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {255--260},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.020},
doi = {10.1016/J.IPL.2008.04.020},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EsperetLO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FiedorowiczHN08,
author = {Anna Fiedorowicz and
Mariusz Haluszczak and
Narayanan Narayanan},
title = {About acyclic edge colourings of planar graphs},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {412--417},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.016},
doi = {10.1016/J.IPL.2008.07.016},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FiedorowiczHN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fu08a,
author = {Jung{-}Sheng Fu},
title = {Fault-free cycles in folded hypercubes with more faulty elements},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {261--263},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.024},
doi = {10.1016/J.IPL.2008.05.024},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fu08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FujiwaraIY08,
author = {Hiroshi Fujiwara and
Kazuo Iwama and
Kouki Yonezawa},
title = {Online chasing problems for regular polygons},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {155--159},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.025},
doi = {10.1016/J.IPL.2008.03.025},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FujiwaraIY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fung08,
author = {Stanley P. Y. Fung},
title = {Lower bounds on online deadline scheduling with preemption penalties},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {214--218},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.020},
doi = {10.1016/J.IPL.2008.05.020},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fung08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gagie08,
author = {Travis Gagie},
title = {Dynamic asymmetric communication},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {352--355},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.004},
doi = {10.1016/J.IPL.2008.07.004},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gagie08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gagie08a,
author = {Travis Gagie},
title = {Sorting streamed multisets},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {418--421},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.06.006},
doi = {10.1016/J.IPL.2008.06.006},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gagie08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalindoH08,
author = {David Galindo and
Javier Herranz},
title = {On the security of public key cryptosystems with a double decryption
mechanism},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {279--283},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.017},
doi = {10.1016/J.IPL.2008.05.017},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalindoH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Goller08,
author = {Stefan G{\"{o}}ller},
title = {Reachability on prefix-recognizable graphs},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {71--74},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.008},
doi = {10.1016/J.IPL.2008.04.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Goller08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GraumanHJKWWWW08,
author = {Tracy Grauman and
Stephen G. Hartke and
Adam S. Jobson and
William B. Kinnersley and
Douglas B. West and
Lesley Wiglesworth and
Pratik Worah and
Hehui Wu},
title = {The hub number of a graph},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {226--228},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.022},
doi = {10.1016/J.IPL.2008.05.022},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GraumanHJKWWWW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GregorD08,
author = {Petr Gregor and
Tom{\'{a}}s Dvor{\'{a}}k},
title = {Path partitions of hypercubes},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {402--406},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.015},
doi = {10.1016/J.IPL.2008.07.015},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GregorD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HaddadiL08,
author = {Salim Haddadi and
Layouni Zoubir},
title = {Consecutive block minimization is 1.5-approximable},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {132--135},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.009},
doi = {10.1016/J.IPL.2008.04.009},
timestamp = {Thu, 14 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HaddadiL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HalavaHHK08,
author = {Vesa Halava and
Tero Harju and
Mika Hirvensalo and
Juhani Karhum{\"{a}}ki},
title = {Post Correspondence Problem for short words},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {115--118},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.013},
doi = {10.1016/J.IPL.2008.04.013},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HalavaHHK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HalavaHK08,
author = {Vesa Halava and
Tero Harju and
Tomi K{\"{a}}rki},
title = {Square-free partial words},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {290--292},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.06.001},
doi = {10.1016/J.IPL.2008.06.001},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HalavaHK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Heam08,
author = {Pierre{-}Cyrille H{\'{e}}am},
title = {A note on partially ordered tree automata},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {242--246},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.012},
doi = {10.1016/J.IPL.2008.05.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Heam08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HerickoZR08,
author = {Marjan Hericko and
Ales Zivkovic and
Ivan Rozman},
title = {An approach to optimizing software development team size},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {101--106},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.014},
doi = {10.1016/J.IPL.2008.04.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HerickoZR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Heun08,
author = {Volker Heun},
title = {Analysis of a modification of Gusfield's recursive algorithm for reconstructing
ultrametric trees},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {222--225},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.008},
doi = {10.1016/J.IPL.2008.05.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Heun08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hsieh08,
author = {Sun{-}Yuan Hsieh},
title = {A note on cycle embedding in folded hypercubes with faulty elements},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {81},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.003},
doi = {10.1016/J.IPL.2008.04.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hsieh08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hyyro08,
author = {Heikki Hyyr{\"{o}}},
title = {Improving the bit-parallel {NFA} of Baeza-Yates and Navarro for approximate
string matching},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {313--319},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.026},
doi = {10.1016/J.IPL.2008.05.026},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hyyro08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IsraeliS08,
author = {Amos Israeli and
Oran Sharon},
title = {An approximation algorithm for sequential rectangle placement},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {407--411},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.08.001},
doi = {10.1016/J.IPL.2008.08.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IsraeliS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JarrayCP08,
author = {Fethi Jarray and
Marie{-}Christine Costa and
Christophe Picouleau},
title = {Complexity results for the horizontal bar packing problem},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {356--359},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.007},
doi = {10.1016/J.IPL.2008.07.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JarrayCP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JiC08,
author = {Min Ji and
T. C. Edwin Cheng},
title = {An {FPTAS} for parallel-machine scheduling under a grade of service
provision to minimize makespan},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {171--174},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.021},
doi = {10.1016/J.IPL.2008.04.021},
timestamp = {Fri, 26 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JiC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jiao08,
author = {Li Jiao},
title = {A note on regular Petri nets},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {110--114},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.012},
doi = {10.1016/J.IPL.2008.04.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jiao08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarmakarRD08,
author = {Arindam Karmakar and
Sasanka Roy and
Sandip Das},
title = {Fast computation of smallest enclosing circle with center on a query
line segment},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {343--346},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.002},
doi = {10.1016/J.IPL.2008.07.002},
timestamp = {Mon, 25 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KarmakarRD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KocholKSS08,
author = {Martin Kochol and
Nad'a Krivon{\'{a}}kov{\'{a}} and
Silvia Smejov{\'{a}} and
Katar{\'{\i}}na Srankov{\'{a}}},
title = {Complexity of approximation of 3-edge-coloring of graphs},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {238--241},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.015},
doi = {10.1016/J.IPL.2008.05.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KocholKSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaiT08,
author = {Chia{-}Jui Lai and
Chang{-}Hsiung Tsai},
title = {Embedding a family of meshes into twisted cubes},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {326--330},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.06.005},
doi = {10.1016/J.IPL.2008.06.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LaiT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lange08,
author = {Martin Lange},
title = {A purely model-theoretic proof of the exponential succinctness gap
between CTL\({}^{\mbox{+}}\) and {CTL}},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {308--312},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.06.003},
doi = {10.1016/J.IPL.2008.06.003},
timestamp = {Tue, 09 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Lange08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lavallee08,
author = {Sylvain Lavall{\'{e}}e},
title = {\emph{I}-rationality of a certain class of formal series},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {124--126},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.016},
doi = {10.1016/J.IPL.2008.04.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lavallee08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiaziMZ08,
author = {Maria Liazi and
Ioannis Milis and
Vassilis Zissimopoulos},
title = {A constant approximation algorithm for the densest k},
journal = {Inf. Process. Lett.},
volume = {108},
number = {1},
pages = {29--32},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.016},
doi = {10.1016/J.IPL.2008.03.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiaziMZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LimLK08,
author = {Sung{-}Hwa Lim and
Byoung{-}Hoon Lee and
Jai{-}Hoon Kim},
title = {Diversity and fault avoidance for dependable replication systems},
journal = {Inf. Process. Lett.},
volume = {108},
number = {1},
pages = {33--37},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.022},
doi = {10.1016/J.IPL.2008.03.022},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LimLK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lin08,
author = {Jyhjong Lin},
title = {A conceptual model for negotiating in service-oriented environments},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {192--203},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.006},
doi = {10.1016/J.IPL.2008.05.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lin08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuHL08,
author = {Bin Liu and
Jianfeng Hou and
Guizhen Liu},
title = {List edge and list total colorings of planar graphs without short
cycles},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {347--351},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.003},
doi = {10.1016/J.IPL.2008.07.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuHL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuM08,
author = {Juan Liu and
Jixiang Meng},
title = {Super-connected and super-arc-connected Cartesian product of digraphs},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {90--93},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.006},
doi = {10.1016/J.IPL.2008.04.006},
timestamp = {Mon, 29 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiuM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Long08,
author = {Brad Long},
title = {Managing module dependencies to facilitate continuous testing},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {127--131},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.015},
doi = {10.1016/J.IPL.2008.04.015},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Long08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LotkerPR08,
author = {Zvi Lotker and
Boaz Patt{-}Shamir and
Dror Rawitz},
title = {Ski rental with two general options},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {365--368},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.009},
doi = {10.1016/J.IPL.2008.07.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LotkerPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Martin08,
author = {{\'{A}}lvar Ibeas Mart{\'{\i}}n},
title = {On the period of the Naor-Reingold sequence},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {304--307},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.025},
doi = {10.1016/J.IPL.2008.05.025},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Martin08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Masopust08,
author = {Tom{\'{a}}s Masopust},
title = {Descriptional complexity of multi-parallel grammars},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {68--70},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.002},
doi = {10.1016/J.IPL.2008.04.002},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Masopust08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MassutheSSW08,
author = {Peter Massuthe and
Alexander Serebrenik and
Natalia Sidorova and
Karsten Wolf},
title = {Can {I} find a partner? Undecidability of partner existence for open
nets},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {374--378},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.006},
doi = {10.1016/J.IPL.2008.07.006},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MassutheSSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MathieuP08,
author = {Claire Mathieu and
Charalampos Papamanthou},
title = {Distortion lower bounds for line embeddings},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {175--178},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.003},
doi = {10.1016/J.IPL.2008.05.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MathieuP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Miettinen08,
author = {Pauli Miettinen},
title = {On the Positive-Negative Partial Set Cover problem},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {219--221},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.007},
doi = {10.1016/J.IPL.2008.05.007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Miettinen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MinettiAL08,
author = {Gabriela F. Minetti and
Enrique Alba and
Gabriel Luque},
title = {Seeding strategies and recombination operators for solving the {DNA}
fragment assembly problem},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {94--100},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.005},
doi = {10.1016/J.IPL.2008.04.005},
timestamp = {Wed, 13 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MinettiAL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OchemP08,
author = {Pascal Ochem and
Alexandre Pinlou},
title = {Oriented colorings of partial 2-trees},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {82--86},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.007},
doi = {10.1016/J.IPL.2008.04.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OchemP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaiCW08,
author = {Kung{-}Jui Pai and
Jou{-}Ming Chang and
Yue{-}Li Wang},
title = {A Note on "An improved upper bound on the queuenumber of the hypercube"},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {107--109},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.019},
doi = {10.1016/J.IPL.2008.04.019},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PaiCW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Procaccia08,
author = {Ariel D. Procaccia},
title = {A note on the query complexity of the Condorcet winner problem},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {390--393},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.012},
doi = {10.1016/J.IPL.2008.07.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Procaccia08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PuolamakiHG08,
author = {Kai Puolam{\"{a}}ki and
Sami Hanhij{\"{a}}rvi and
Gemma C. Garriga},
title = {An approximation ratio for biclustering},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {45--49},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.013},
doi = {10.1016/J.IPL.2008.03.013},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PuolamakiHG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RajsbaumRT08,
author = {Sergio Rajsbaum and
Michel Raynal and
Corentin Travers},
title = {An impossibility about failure detectors in the iterated immediate
snapshot model},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {160--164},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.001},
doi = {10.1016/J.IPL.2008.05.001},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RajsbaumRT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schwarz08,
author = {Ulrich M. Schwarz},
title = {Online scheduling on semi-related machines},
journal = {Inf. Process. Lett.},
volume = {108},
number = {1},
pages = {38--40},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.018},
doi = {10.1016/J.IPL.2008.03.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schwarz08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Skowronek-Kaziow08a,
author = {Joanna Skowronek{-}Kazi{\'{o}}w},
title = {Some digraphs arising from number theory and remarks on the zero-divisor
graph of the ring {Z}},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {165--169},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.002},
doi = {10.1016/J.IPL.2008.05.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Skowronek-Kaziow08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SteinwandtV08,
author = {Rainer Steinwandt and
Vikt{\'{o}}ria I. Vill{\'{a}}nyi},
title = {A one-time signature using run-length encoding},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {179--185},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.004},
doi = {10.1016/J.IPL.2008.05.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SteinwandtV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TakenagaA08,
author = {Yasuhiko Takenaga and
Shigeru Arai},
title = {PSPACE-completeness of an escape problem},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {229--233},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.011},
doi = {10.1016/J.IPL.2008.05.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TakenagaA08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tan08,
author = {Jinsong Tan},
title = {A note on the inapproximability of correlation clustering},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {331--335},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.06.004},
doi = {10.1016/J.IPL.2008.06.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tan08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanYP08,
author = {Xuegong Tan and
Shun{-}Zheng Yu and
Jin Han Park},
title = {A note about some properties of {BC} graphs},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {398--401},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.014},
doi = {10.1016/J.IPL.2008.07.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TanYP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TavaresMSO08,
author = {Eduardo Tavares and
Paulo Romero Martins Maciel and
Bruno Silva and
Meuse N. Oliveira Jr.},
title = {Hard real-time tasks' scheduling considering voltage scaling, precedence
and exclusion relations},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {50--59},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.020},
doi = {10.1016/J.IPL.2008.03.020},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TavaresMSO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur08,
author = {Dekel Tsur},
title = {Faster algorithms for guided tree edit distance},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {251--254},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.014},
doi = {10.1016/J.IPL.2008.05.014},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vagvolgyi08,
author = {S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
title = {Murg term rewrite systems},
journal = {Inf. Process. Lett.},
volume = {108},
number = {5},
pages = {264--272},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.021},
doi = {10.1016/J.IPL.2008.05.021},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vagvolgyi08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Viana08,
author = {Raquel Via{\~{n}}a},
title = {Quick encoding of plane graphs in log\({}_{\mbox{2}}\)14 bits per
edge},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {150--154},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.017},
doi = {10.1016/J.IPL.2008.04.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Viana08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wang08,
author = {Yusu Wang},
title = {Approximating nearest neighbor among triangles in convex position},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {379--385},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.010},
doi = {10.1016/J.IPL.2008.07.010},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Wang08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangL08,
author = {Shiying Wang and
Shangwei Lin},
title = {lambda},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {386--389},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.07.008},
doi = {10.1016/J.IPL.2008.07.008},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangWW08,
author = {Deqiang Wang and
Yu{-}Peng Wen and
Kelun Wang},
title = {A smaller planar graph without 4-, 5-cycles and intersecting triangles
that is not 3-choosable},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {87--89},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.004},
doi = {10.1016/J.IPL.2008.04.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangWW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yanovsky08,
author = {Vladimir Yanovski},
title = {Approximation algorithm for coloring of dotted interval graphs},
journal = {Inf. Process. Lett.},
volume = {108},
number = {1},
pages = {41--44},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.021},
doi = {10.1016/J.IPL.2008.03.021},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yanovsky08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YounPKL08,
author = {Taek{-}Young Youn and
Young{-}Ho Park and
Chang Han Kim and
Jongin Lim},
title = {Weakness in a RSA-based password authenticated key exchange protocol},
journal = {Inf. Process. Lett.},
volume = {108},
number = {6},
pages = {339--342},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.06.002},
doi = {10.1016/J.IPL.2008.06.002},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YounPKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zemmari08,
author = {Akka Zemmari},
title = {On handshakes in random graphs},
journal = {Inf. Process. Lett.},
volume = {108},
number = {3},
pages = {119--123},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.04.018},
doi = {10.1016/J.IPL.2008.04.018},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Zemmari08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangSZY08,
author = {Changsheng Zhang and
Jigui Sun and
Xingjun Zhu and
Qingyun Yang},
title = {An improved particle swarm optimization algorithm for flowshop scheduling
problem},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {204--209},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.010},
doi = {10.1016/J.IPL.2008.05.010},
timestamp = {Mon, 02 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangSZY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zhou08,
author = {Xiang Zhou},
title = {Ehrenfeucht-Fra{\"{\i}}ss{\'{e}} games in finite set theory},
journal = {Inf. Process. Lett.},
volume = {108},
number = {1},
pages = {3--9},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.011},
doi = {10.1016/J.IPL.2008.03.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zhou08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ziegler08,
author = {Valentin Ziegler},
title = {Approximation algorithms for restricted Bayesian network structures},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {60--63},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.015},
doi = {10.1016/J.IPL.2008.03.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ziegler08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-11-04 05:26 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
