default search action

combined dblp search
author search
venue search
publication search

ask others

Search dblp for Publications

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

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

> Home > Search

download as .bib file

@article{DBLP:journals/ipl/AiderA05,
  author       = {M{\'{e}}ziane A{\"{\i}}der and
                  Mustapha Aouchiche},
  title        = {Distance monotonicity and a new characterization of Hamming graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {6},
  pages        = {207--213},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.08.009},
  doi          = {10.1016/J.IPL.2005.08.009},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/AiderA05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Alagarsamy05,
  author       = {K. Alagarsamy},
  title        = {A mutual exclusion algorithm with optimally bounded bypasses},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {1},
  pages        = {36--40},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.05.015},
  doi          = {10.1016/J.IPL.2005.05.015},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Alagarsamy05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/AloupisM05,
  author       = {Greg Aloupis and
                  Erin McLeish},
  title        = {A lower bound for computing Oja depth},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {4},
  pages        = {151--153},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.05.014},
  doi          = {10.1016/J.IPL.2005.05.014},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/AloupisM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BiernackiDS05,
  author       = {Dariusz Biernacki and
                  Olivier Danvy and
                  Chung{-}chieh Shan},
  title        = {On the dynamic extent of delimited continuations},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {1},
  pages        = {7--17},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.04.003},
  doi          = {10.1016/J.IPL.2005.04.003},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BiernackiDS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BohlerRSV05,
  author       = {Elmar B{\"{o}}hler and
                  Steffen Reith and
                  Henning Schnoor and
                  Heribert Vollmer},
  title        = {Bases for Boolean co-clones},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {2},
  pages        = {59--66},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.003},
  doi          = {10.1016/J.IPL.2005.06.003},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BohlerRSV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Burkhard05,
  author       = {Walter A. Burkhard},
  title        = {Double hashing with passbits},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {5},
  pages        = {162--166},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.08.005},
  doi          = {10.1016/J.IPL.2005.08.005},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Burkhard05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/CapponiP05,
  author       = {Agostino Capponi and
                  Concetta Pilotto},
  title        = {Bounded families for the on-line \emph{t}-relaxed coloring},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {4},
  pages        = {141--145},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.07.001},
  doi          = {10.1016/J.IPL.2005.07.001},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CapponiP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/CapraraP05,
  author       = {Alberto Caprara and
                  Ulrich Pferschy},
  title        = {Modified subset sum heuristics for bin packing},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {1},
  pages        = {18--23},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.04.005},
  doi          = {10.1016/J.IPL.2005.04.005},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CapraraP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ChenC05,
  author       = {Kuan{-}Yu Chen and
                  Kun{-}Mao Chao},
  title        = {Optimal algorithms for locating the longest and shortest segments
                  satisfying a sum or an average constraint},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {6},
  pages        = {197--201},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.08.006},
  doi          = {10.1016/J.IPL.2005.08.006},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ChenC05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/DimakopoulosPP05,
  author       = {Vassilios V. Dimakopoulos and
                  Leonidas Palios and
                  Athanasios S. Poulakidas},
  title        = {On the hamiltonicity of the cartesian product},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {2},
  pages        = {49--53},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.05.016},
  doi          = {10.1016/J.IPL.2005.05.016},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/DimakopoulosPP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/FangL05,
  author       = {Jywe{-}Fei Fang and
                  Kuan{-}Chou Lai},
  title        = {Embedding the incomplete hypercube in books},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {1},
  pages        = {1--6},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.05.026},
  doi          = {10.1016/J.IPL.2005.05.026},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/FangL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/FinkelL05,
  author       = {Alain Finkel and
                  J{\'{e}}r{\^{o}}me Leroux},
  title        = {The convex hull of a regular set of integer vectors is polyhedral
                  and effectively computable},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {1},
  pages        = {30--35},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.04.004},
  doi          = {10.1016/J.IPL.2005.04.004},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/FinkelL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/GennaroR05,
  author       = {Rosario Gennaro and
                  Mario Di Raimondo},
  title        = {Secure multiplication of shared secrets in the exponent},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {2},
  pages        = {71--79},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.01.015},
  doi          = {10.1016/J.IPL.2005.01.015},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GennaroR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Jukna05,
  author       = {Stasys Jukna},
  title        = {On the {P} versus {NP} intersected with co-NP question in communication
                  complexity},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {6},
  pages        = {202--206},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.08.003},
  doi          = {10.1016/J.IPL.2005.08.003},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Jukna05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/KoppartyR05,
  author       = {Swastik Kopparty and
                  Chinya V. Ravishankar},
  title        = {A framework for pursuit evasion games in R\({}^{\mbox{n}}\)},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {3},
  pages        = {114--122},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.04.012},
  doi          = {10.1016/J.IPL.2005.04.012},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/KoppartyR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Liu05,
  author       = {Pangfeng Liu},
  title        = {Minimum degree triangulation for rectangular domains},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {4},
  pages        = {128--135},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.07.002},
  doi          = {10.1016/J.IPL.2005.07.002},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Liu05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/MaassN05,
  author       = {Moritz G. Maa{\ss} and
                  Johannes Nowak},
  title        = {A new method for approximate indexing and dictionary lookup with one
                  error},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {5},
  pages        = {185--191},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.08.001},
  doi          = {10.1016/J.IPL.2005.08.001},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/MaassN05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Monnot05,
  author       = {J{\'{e}}r{\^{o}}me Monnot},
  title        = {The labeled perfect matching in bipartite graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {3},
  pages        = {81--88},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.009},
  doi          = {10.1016/J.IPL.2005.06.009},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Monnot05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Moreno05,
  author       = {Eduardo Moreno},
  title        = {De Bruijn sequences and De Bruijn graphs for a general language},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {6},
  pages        = {214--219},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.05.028},
  doi          = {10.1016/J.IPL.2005.05.028},
  timestamp    = {Wed, 04 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Moreno05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/NavarroB05,
  author       = {Gonzalo Navarro and
                  Nieves R. Brisaboa},
  title        = {New bounds on \emph{D}-ary optimal codes},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {5},
  pages        = {178--184},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.07.004},
  doi          = {10.1016/J.IPL.2005.07.004},
  timestamp    = {Wed, 28 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/NavarroB05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Padhye05,
  author       = {Sahadeo Padhye},
  title        = {Partial known plaintext attack on Koyama scheme},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {3},
  pages        = {96--100},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.005},
  doi          = {10.1016/J.IPL.2005.06.005},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Padhye05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/PietracaprinaP05,
  author       = {Andrea Pietracaprina and
                  Geppino Pucci},
  title        = {Optimal many-to-one routing on the mesh with constant queues},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {1},
  pages        = {24--29},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.04.006},
  doi          = {10.1016/J.IPL.2005.04.006},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/PietracaprinaP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Rautenbach05,
  author       = {Dieter Rautenbach},
  title        = {Lower bounds on treespan},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {2},
  pages        = {67--70},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.001},
  doi          = {10.1016/J.IPL.2005.06.001},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Rautenbach05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Reznik05,
  author       = {Yuriy A. Reznik},
  title        = {On the average depth of asymmetric LC-tries},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {3},
  pages        = {106--113},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.008},
  doi          = {10.1016/J.IPL.2005.06.008},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Reznik05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ServedioW05,
  author       = {Rocco A. Servedio and
                  Andrew Wan},
  title        = {Computing sparse permanents faster},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {3},
  pages        = {89--92},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.007},
  doi          = {10.1016/J.IPL.2005.06.007},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ServedioW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/SezginG05,
  author       = {Ali Sezgin and
                  Ganesh Gopalakrishnan},
  title        = {On the definition of sequential consistency},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {6},
  pages        = {193--196},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.09.002},
  doi          = {10.1016/J.IPL.2005.09.002},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/SezginG05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ShparlinskiW05,
  author       = {Igor E. Shparlinski and
                  Arne Winterhof},
  title        = {On the linear complexity of bounded integer sequences over different
                  moduli},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {5},
  pages        = {175--177},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.08.004},
  doi          = {10.1016/J.IPL.2005.08.004},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/ShparlinskiW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/SlivnikV05,
  author       = {Bostjan Slivnik and
                  Bostjan Vilfan},
  title        = {Producing the left parse \emph{during} bottom-up parsing},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {6},
  pages        = {220--224},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.08.007},
  doi          = {10.1016/J.IPL.2005.08.007},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/SlivnikV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/SrivastavaT05,
  author       = {Nikhil Srivastava and
                  Alan D. Taylor},
  title        = {Tight bounds on plurality},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {3},
  pages        = {93--95},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.004},
  doi          = {10.1016/J.IPL.2005.06.004},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/SrivastavaT05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Takaoka05,
  author       = {Tadao Takaoka},
  title        = {An O(\emph{n}\({}^{\mbox{3}}\)loglog\emph{n}/log\emph{n}) time algorithm
                  for the all-pairs shortest path problem},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {5},
  pages        = {155--161},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.08.008},
  doi          = {10.1016/J.IPL.2005.08.008},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Takaoka05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/TipleaM05,
  author       = {Ferucio Laurentiu Tiplea and
                  Dan C. Marinescu},
  title        = {Structural soundness of workflow nets is decidable},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {2},
  pages        = {54--58},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.002},
  doi          = {10.1016/J.IPL.2005.06.002},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/TipleaM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Vu05,
  author       = {Thuy Duong Vu},
  title        = {The compression structure of a process},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {6},
  pages        = {225--229},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.03.015},
  doi          = {10.1016/J.IPL.2005.03.015},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Vu05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/WangTC05,
  author       = {Xianbing Wang and
                  Yong Meng Teo and
                  Jiannong Cao},
  title        = {A bivalency proof of the lower bound for uniform consensus},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {5},
  pages        = {167--174},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.08.002},
  doi          = {10.1016/J.IPL.2005.08.002},
  timestamp    = {Tue, 14 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/WangTC05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/XuDX05,
  author       = {Jun{-}Ming Xu and
                  Zheng{-}Zhong Du and
                  Min Xu},
  title        = {Edge-fault-tolerant edge-bipancyclicity of hypercubes},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {4},
  pages        = {146--150},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.006},
  doi          = {10.1016/J.IPL.2005.06.006},
  timestamp    = {Thu, 15 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/XuDX05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/XuX05a,
  author       = {Min Xu and
                  Jun{-}Ming Xu},
  title        = {Edge-pancyclicity of M{\"{o}}bius cubes},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {4},
  pages        = {136--140},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.07.003},
  doi          = {10.1016/J.IPL.2005.07.003},
  timestamp    = {Fri, 02 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/XuX05a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/XuXZ05,
  author       = {Jun{-}Ming Xu and
                  Min Xu and
                  Qiang Zhu},
  title        = {The super connectivity of shuffle-cubes},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {4},
  pages        = {123--127},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.07.005},
  doi          = {10.1016/J.IPL.2005.07.005},
  timestamp    = {Wed, 27 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/XuXZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ZhangH05,
  author       = {Huaming Zhang and
                  Xin He},
  title        = {Visibility representation of plane graphs via canonical ordering tree\({}^{\mbox{,
                  }}\)},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {2},
  pages        = {41--48},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.05.024},
  doi          = {10.1016/J.IPL.2005.05.024},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ZhangH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ZhaoLZ05,
  author       = {Jianhua Zhao and
                  Xuandong Li and
                  Guoliang Zheng},
  title        = {A quadratic-time DBM-based successor algorithm for checking timed
                  automata},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {3},
  pages        = {101--105},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.05.027},
  doi          = {10.1016/J.IPL.2005.05.027},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ZhaoLZ05.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.