Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ipl/ipl89.bht:"
download as .bib file
@article{DBLP:journals/ipl/AlonsoCRS04,
author = {Laurent Alonso and
Philippe Chassaing and
Edward M. Reingold and
Ren{\'{e}} Schott},
title = {The worst-case chip problem},
journal = {Inf. Process. Lett.},
volume = {89},
number = {6},
pages = {303--308},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.013},
doi = {10.1016/J.IPL.2003.11.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlonsoCRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaierHK04,
author = {Christel Baier and
Holger Hermanns and
Joost{-}Pieter Katoen},
title = {Probabilistic weak simulation is decidable in polynomial time},
journal = {Inf. Process. Lett.},
volume = {89},
number = {3},
pages = {123--130},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.001},
doi = {10.1016/J.IPL.2003.10.001},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaierHK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ben-MosheCK04,
author = {Boaz Ben{-}Moshe and
Paz Carmi and
Matthew J. Katz},
title = {Computing all large sums-of-pairs in \({}_{\mbox{R\({}^{\mbox{n}}\)}}\)
and the discrete planar two-watchtower problem},
journal = {Inf. Process. Lett.},
volume = {89},
number = {3},
pages = {137--139},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.07.008},
doi = {10.1016/J.IPL.2003.07.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ben-MosheCK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtLR04,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
H. N. de Ridder},
title = {Efficient robust algorithms for the Maximum Weight Stable Set Problem
in chair-free graph classes},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {165--173},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.002},
doi = {10.1016/J.IPL.2003.11.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtLR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CampeloCF04,
author = {Manoel B. Camp{\^{e}}lo and
Ricardo C. Corr{\^{e}}a and
Yuri Frota},
title = {Cliques, holes and the vertex coloring polytope},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {159--164},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.005},
doi = {10.1016/J.IPL.2003.11.005},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CampeloCF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chan04,
author = {Timothy M. Chan},
title = {A note on maximum independent sets in rectangle intersection graphs},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {19--23},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.019},
doi = {10.1016/J.IPL.2003.09.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chan04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chandran04,
author = {L. Sunil Chandran},
title = {Minimum cuts, girth and a spectral threshold},
journal = {Inf. Process. Lett.},
volume = {89},
number = {3},
pages = {105--110},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.009},
doi = {10.1016/J.IPL.2003.10.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chandran04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CodenottiMLMS04,
author = {Bruno Codenotti and
Gianluca De Marco and
Mauro Leoncini and
Manuela Montangero and
Massimo Santini},
title = {Approximation algorithms for a hierarchically structured bin packing
problem},
journal = {Inf. Process. Lett.},
volume = {89},
number = {5},
pages = {215--221},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.12.001},
doi = {10.1016/J.IPL.2003.12.001},
timestamp = {Tue, 02 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CodenottiMLMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrescenziG04,
author = {Pierluigi Crescenzi and
Federico Greco},
title = {The minimum likely column cover problem},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {175--179},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.003},
doi = {10.1016/J.IPL.2003.11.003},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CrescenziG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DahlhausDR04,
author = {Elias Dahlhaus and
Peter Dankelmann and
R. Ravi},
title = {A linear-time algorithm to compute a {MAD} tree of an interval graph},
journal = {Inf. Process. Lett.},
volume = {89},
number = {5},
pages = {255--259},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.009},
doi = {10.1016/J.IPL.2003.11.009},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DahlhausDR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DinurS04,
author = {Irit Dinur and
Shmuel Safra},
title = {On the hardness of approximating label-cover},
journal = {Inf. Process. Lett.},
volume = {89},
number = {5},
pages = {247--254},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.007},
doi = {10.1016/J.IPL.2003.11.007},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DinurS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DrakeH04,
author = {Doratha E. Drake and
Stefan Hougardy},
title = {On approximation algorithms for the terminal Steiner tree problem},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {15--18},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.014},
doi = {10.1016/J.IPL.2003.09.014},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DrakeH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Durand-Lose04,
author = {J{\'{e}}r{\^{o}}me Durand{-}Lose},
title = {A Kleene theorem for splitable signals},
journal = {Inf. Process. Lett.},
volume = {89},
number = {5},
pages = {237--245},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.010},
doi = {10.1016/J.IPL.2003.11.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Durand-Lose04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Durgan04,
author = {Bruce K. Durgan},
title = {Compact searchable static binary trees},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {49--52},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.013},
doi = {10.1016/J.IPL.2003.09.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Durgan04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fecher04,
author = {Harald Fecher},
title = {A completed hierarchy of true concurrent equivalences},
journal = {Inf. Process. Lett.},
volume = {89},
number = {5},
pages = {261--265},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.008},
doi = {10.1016/J.IPL.2003.11.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fecher04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FleischerGLW04,
author = {Rudolf Fleischer and
Mordecai J. Golin and
Chin{-}Tau A. Lea and
Steven Wong},
title = {Finding optimal paths in {MREP} routing},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {57--63},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.005},
doi = {10.1016/J.IPL.2003.10.005},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FleischerGLW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FonsecaFC04,
author = {Guilherme Dias da Fonseca and
Celina M. H. de Figueiredo and
Paulo Cezar Pinto Carvalho},
title = {Kinetic hanger},
journal = {Inf. Process. Lett.},
volume = {89},
number = {3},
pages = {151--157},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.010},
doi = {10.1016/J.IPL.2003.10.010},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FonsecaFC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FraczakP04,
author = {Wojciech Fraczak and
Anna Podolak},
title = {A characterization of s-languages},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {65--70},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.006},
doi = {10.1016/J.IPL.2003.10.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FraczakP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GeertsK04,
author = {Floris Geerts and
Bart Kuijpers},
title = {Topological formulation of termination properties of iterates of functions},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {31--35},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.012},
doi = {10.1016/J.IPL.2003.09.012},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GeertsK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Giurcaneanu04,
author = {Ciprian Doru Giurcaneanu},
title = {On some properties of the {NML} estimator for Bernoulli strings},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {209--213},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.011},
doi = {10.1016/J.IPL.2003.10.011},
timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Giurcaneanu04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Goldberg04,
author = {Mayer Goldberg},
title = {A construction of one-point bases in extended lambda calculi},
journal = {Inf. Process. Lett.},
volume = {89},
number = {6},
pages = {281--286},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.12.005},
doi = {10.1016/J.IPL.2003.12.005},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Goldberg04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrieserL04,
author = {Gunter Grieser and
Steffen Lange},
title = {Incremental learning of approximations from positive data},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {37--42},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.010},
doi = {10.1016/J.IPL.2003.09.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrieserL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hess04,
author = {Florian Hess},
title = {On the security of the verifiably-encrypted signature scheme of Boneh,
Gentry, Lynn and Shacham},
journal = {Inf. Process. Lett.},
volume = {89},
number = {3},
pages = {111--114},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.008},
doi = {10.1016/J.IPL.2003.10.008},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hess04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HonkalaL04,
author = {Iiro S. Honkala and
Tero Laihonen},
title = {On identifying codes in the hexagonal mesh},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {9--14},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.009},
doi = {10.1016/J.IPL.2003.09.009},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HonkalaL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoogeboomK04,
author = {Hendrik Jan Hoogeboom and
Walter A. Kosters},
title = {Tetris and decidability},
journal = {Inf. Process. Lett.},
volume = {89},
number = {6},
pages = {267--272},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.12.006},
doi = {10.1016/J.IPL.2003.12.006},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoogeboomK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Johnson04,
author = {Leroy Johnson},
title = {Tumble, a fast simple iteration algorithm for Fibonacci},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {187--189},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.012},
doi = {10.1016/J.IPL.2003.10.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Johnson04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jukna04,
author = {Stasys Jukna},
title = {On the minimum number of negations leading to super-polynomial savings},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {71--74},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.003},
doi = {10.1016/J.IPL.2003.10.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jukna04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JungC04,
author = {Joo{-}Won Jung and
Kyung{-}Yong Chwa},
title = {Labeling points with given rectangles},
journal = {Inf. Process. Lett.},
volume = {89},
number = {3},
pages = {115--121},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.017},
doi = {10.1016/J.IPL.2003.09.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JungC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KapoorJ04,
author = {Hemangee K. Kapoor and
Mark B. Josephs},
title = {Modelling and verification of delay-insensitive circuits using {CCS}
and the Concurrency Workbench},
journal = {Inf. Process. Lett.},
volume = {89},
number = {6},
pages = {293--296},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.12.007},
doi = {10.1016/J.IPL.2003.12.007},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KapoorJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KerenidisN04,
author = {Iordanis Kerenidis and
Ashwin Nayak},
title = {Weak coin flipping with small bias},
journal = {Inf. Process. Lett.},
volume = {89},
number = {3},
pages = {131--135},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.07.007},
doi = {10.1016/J.IPL.2003.07.007},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KerenidisN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KlasingL04,
author = {Ralf Klasing and
Christian Laforest},
title = {Hardness results and approximation algorithms of k-tuple domination
in graphs},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {75--83},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.004},
doi = {10.1016/J.IPL.2003.10.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KlasingL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Koltun04,
author = {Vladlen Koltun},
title = {Ready, Set, Go! The Voronoi diagram of moving points that start from
a line},
journal = {Inf. Process. Lett.},
volume = {89},
number = {5},
pages = {233--235},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.012},
doi = {10.1016/J.IPL.2003.11.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Koltun04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KovacsK04,
author = {Andr{\'{a}}s Kov{\'{a}}cs and
Tam{\'{a}}s Kis},
title = {Partitioning of trees for minimizing height and cardinality},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {181--185},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.004},
doi = {10.1016/J.IPL.2003.11.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KovacsK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaiC04,
author = {Yung{-}Ling Lai and
Gerard J. Chang},
title = {On the profile of the corona of two graphs},
journal = {Inf. Process. Lett.},
volume = {89},
number = {6},
pages = {287--292},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.12.004},
doi = {10.1016/J.IPL.2003.12.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LaiC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LanotteMT04,
author = {Ruggero Lanotte and
Andrea Maggiolo{-}Schettini and
Simone Tini},
title = {Epsilon-transitions in Concurrent Timed Automata},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {1--7},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.018},
doi = {10.1016/J.IPL.2003.09.018},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LanotteMT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaoutarisZS04,
author = {Nikolaos Laoutaris and
Vassilis Zissimopoulos and
Ioannis Stavrakakis},
title = {Joint object placement and node dimensioning for Internet content
distribution},
journal = {Inf. Process. Lett.},
volume = {89},
number = {6},
pages = {273--279},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.12.002},
doi = {10.1016/J.IPL.2003.12.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LaoutarisZS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Li04,
author = {Maciej Liskiewicz and
Bodo Manthey},
title = {New lower and upper bounds for the competitive ratio of transmission
protocols},
journal = {Inf. Process. Lett.},
volume = {89},
number = {6},
pages = {297--301},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.12.003},
doi = {10.1016/J.IPL.2003.12.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Li04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lucas04,
author = {Salvador Lucas},
title = {Strong and NV-sequentiality of constructor systems},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {191--201},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.006},
doi = {10.1016/J.IPL.2003.11.006},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lucas04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Marx04,
author = {D{\'{a}}niel Marx},
title = {List edge multicoloring in graphs with few cycles},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {85--90},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.016},
doi = {10.1016/J.IPL.2003.09.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Marx04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NagamochiSI04,
author = {Hiroshi Nagamochi and
Takahisa Suzuki and
Toshimasa Ishii},
title = {A simple recognition of maximal planar graphs},
journal = {Inf. Process. Lett.},
volume = {89},
number = {5},
pages = {223--226},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.011},
doi = {10.1016/J.IPL.2003.11.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NagamochiSI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PerstS04,
author = {Thomas Perst and
Helmut Seidl},
title = {Macro forest transducers},
journal = {Inf. Process. Lett.},
volume = {89},
number = {3},
pages = {141--149},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.05.001},
doi = {10.1016/J.IPL.2003.05.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PerstS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RoyGDN04,
author = {Sasanka Roy and
Partha P. Goswami and
Sandip Das and
Subhas C. Nandy},
title = {Optimal algorithm for a special point-labeling problem},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {91--98},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.002},
doi = {10.1016/J.IPL.2003.10.002},
timestamp = {Sun, 24 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RoyGDN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Seager04,
author = {Suzanne M. Seager},
title = {The greedy algorithm for domination in graphs of maximum degree 3},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {53--56},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.007},
doi = {10.1016/J.IPL.2003.10.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Seager04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Valiant04,
author = {Paul Valiant},
title = {The Log-Rank Conjecture and low degree polynomials},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {99--103},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.020},
doi = {10.1016/J.IPL.2003.09.020},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Valiant04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VincentL04,
author = {Millist W. Vincent and
Jixue Liu},
title = {Irrelevant updates and self-maintainability in transitive closure
database views},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {25--29},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.008},
doi = {10.1016/J.IPL.2003.09.008},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VincentL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vinodchandran04,
author = {N. V. Vinodchandran},
title = {AM\({}_{\mbox{exp}}\)[nsube](NP[cap]coNP)/poly},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {43--47},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.011},
doi = {10.1016/J.IPL.2003.09.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vinodchandran04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wang04,
author = {Guilin Wang},
title = {Universal forgery on a group signature scheme using self-certified
public keys},
journal = {Inf. Process. Lett.},
volume = {89},
number = {5},
pages = {227--231},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.014},
doi = {10.1016/J.IPL.2003.11.014},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wang04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangWC04,
author = {Fu{-}Hsing Wang and
Yue{-}Li Wang and
Jou{-}Ming Chang},
title = {Feedback vertex sets in star graphs},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {203--208},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.001},
doi = {10.1016/J.IPL.2003.11.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WangWC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YokoyamaHT04,
author = {Tetsuo Yokoyama and
Zhenjiang Hu and
Masato Takeichi},
title = {Deterministic second-order patterns},
journal = {Inf. Process. Lett.},
volume = {89},
number = {6},
pages = {309--314},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.12.008},
doi = {10.1016/J.IPL.2003.12.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YokoyamaHT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-05-10 06:27 CEST 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:
