Search dblp for Publications

export results for "toc:db/journals/dam/dam85.bht:"

 download as .bib file

@article{DBLP:journals/dam/AggarwalT98,
  author       = {Alok Aggarwal and
                  Takeshi Tokuyama},
  title        = {Consecutive Interval Query and Dynamic Programming on Intervals},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {1},
  pages        = {1--24},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00021-3},
  doi          = {10.1016/S0166-218X(98)00021-3},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/AggarwalT98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AndersenFR98,
  author       = {Lars D{\o}vling Andersen and
                  Herbert Fleischner and
                  Susanne Regner},
  title        = {Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian
                  Graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {2},
  pages        = {99--112},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(97)00141-8},
  doi          = {10.1016/S0166-218X(97)00141-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AndersenFR98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BallHP98,
  author       = {Michael O. Ball and
                  Jane N. Hagstrom and
                  J. Scott Provan},
  title        = {Two-path Subsets: Efficient Counting and Applications to Performability
                  Analysis},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {1},
  pages        = {25--45},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00027-4},
  doi          = {10.1016/S0166-218X(98)00027-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BallHP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChopraGS98,
  author       = {Sunil Chopra and
                  Itzhak Gilboa and
                  S. Trilochan Sastry},
  title        = {Source Sink Flows with Capacity Installation in Batches},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {3},
  pages        = {165--192},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00024-9},
  doi          = {10.1016/S0166-218X(98)00024-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ChopraGS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Chuan98,
  author       = {Wai{-}Fong Chuan},
  title        = {A Representation Theorem of the Suffixes of Characteristic Sequences},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {1},
  pages        = {47--57},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(97)00142-X},
  doi          = {10.1016/S0166-218X(97)00142-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Chuan98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Eilam-Tzoreff98,
  author       = {Tali Eilam{-}Tzoreff},
  title        = {The Disjoint Shortest Paths Problem},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {2},
  pages        = {113--138},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(97)00121-2},
  doi          = {10.1016/S0166-218X(97)00121-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Eilam-Tzoreff98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FinizioL98,
  author       = {Norman J. Finizio and
                  Philip A. Leonard},
  title        = {More ZCPS-Wh(v) and Several New Infinite Classes of Z-cyclic Whist
                  Tournaments},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {3},
  pages        = {193--202},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00034-1},
  doi          = {10.1016/S0166-218X(98)00034-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FinizioL98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Fomin98,
  author       = {Fedor V. Fomin},
  title        = {Helicopter Search Problems, Bandwidth and Pathwidth},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {1},
  pages        = {59--70},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(97)00131-5},
  doi          = {10.1016/S0166-218X(97)00131-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Fomin98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GyarfasS98,
  author       = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
                  Richard H. Schelp},
  title        = {A Communication Problem and Directed Triple Systems},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {2},
  pages        = {139--147},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00028-6},
  doi          = {10.1016/S0166-218X(98)00028-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GyarfasS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hartvigsen98,
  author       = {David Hartvigsen},
  title        = {The Planar Multiterminal Cut Problem},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {3},
  pages        = {203--222},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00036-5},
  doi          = {10.1016/S0166-218X(98)00036-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Hartvigsen98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JuknaR98,
  author       = {Stasys Jukna and
                  Alexander A. Razborov},
  title        = {Neither Reading Few Bits Twice Nor Reading Illegally Helps Much},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {3},
  pages        = {223--238},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00042-0},
  doi          = {10.1016/S0166-218X(98)00042-0},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/JuknaR98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LamY98,
  author       = {Tak Wah Lam and
                  Fung Ling Yue},
  title        = {Edge Ranking of Graphs Is Hard},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {1},
  pages        = {71--86},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00029-8},
  doi          = {10.1016/S0166-218X(98)00029-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/LamY98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lamb98,
  author       = {John D. Lamb},
  title        = {Efficient Optimal Equation Formulation in Lumped Power-conserving
                  Systems},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {3},
  pages        = {239--249},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00037-7},
  doi          = {10.1016/S0166-218X(98)00037-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Lamb98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lin98,
  author       = {Guo{-}Hui Lin},
  title        = {The Exact Bound of Lee's {MLPT}},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {3},
  pages        = {251--254},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(97)00139-X},
  doi          = {10.1016/S0166-218X(97)00139-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Lin98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RolimTTV98,
  author       = {Jos{\'{e}} D. P. Rolim and
                  Pavel Tvrd{\'{\i}}k and
                  Jan Trdlicka and
                  Imrich Vrto},
  title        = {Bisecting De Bruijn and Kautz Graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {1},
  pages        = {87--97},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00031-6},
  doi          = {10.1016/S0166-218X(98)00031-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/RolimTTV98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Timkovsky98,
  author       = {Vadim G. Timkovsky},
  title        = {Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?},
  journal      = {Discret. Appl. Math.},
  volume       = {85},
  number       = {2},
  pages        = {149--162},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)00032-8},
  doi          = {10.1016/S0166-218X(98)00032-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Timkovsky98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics