Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dam/AkgulHT93,
  author       = {Mustafa Akg{\"{u}}l and
                  Horst W. Hamacher and
                  S{\"{u}}leyman T{\"{u}}fekci},
  title        = {Preface},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {85},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90084-2},
  doi          = {10.1016/0166-218X(93)90084-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AkgulHT93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/AlbersB93,
  author       = {Susanne Albers and
                  Peter Brucker},
  title        = {The Complexity of One-Machine Batching Problems},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {87--107},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90085-3},
  doi          = {10.1016/0166-218X(93)90085-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AlbersB93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/AnthonyS93,
  author       = {Martin Anthony and
                  John Shawe{-}Taylor},
  title        = {A Result of Vapnik with Applications},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {3},
  pages        = {207--217},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90126-9},
  doi          = {10.1016/0166-218X(93)90126-9},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/AnthonyS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Dahl93,
  author       = {Geir Dahl},
  title        = {Directed Steiner Problems with Connectivity Constraints},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {109--128},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90086-4},
  doi          = {10.1016/0166-218X(93)90086-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Dahl93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/ErdosS93,
  author       = {P{\'{e}}ter L. Erd{\"{o}}s and
                  L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
  title        = {Counting Bichromatic Evolutionary Trees},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {1},
  pages        = {1--8},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90147-G},
  doi          = {10.1016/0166-218X(93)90147-G},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ErdosS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GoldfarbH93,
  author       = {Donald Goldfarb and
                  Jianxiu Hao},
  title        = {On the Maximum Capacity Augmentation Algorithm for the Maximum Flow
                  Problem},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {1},
  pages        = {9--16},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90148-H},
  doi          = {10.1016/0166-218X(93)90148-H},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GoldfarbH93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Hall93,
  author       = {Leslie A. Hall},
  title        = {A Note on Generalizing the Maximum Lateness Criterion for Scheduling},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {129--137},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90087-5},
  doi          = {10.1016/0166-218X(93)90087-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Hall93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HamadaHY93,
  author       = {Noboru Hamada and
                  Tor Helleseth and
                  {\O}yvind Ytrehus},
  title        = {A New Class of Nonbinary Codes Meeting the Griesmer Bound},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {3},
  pages        = {219--226},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90127-A},
  doi          = {10.1016/0166-218X(93)90127-A},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HamadaHY93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Huang93,
  author       = {Nen{-}Fu Huang},
  title        = {On the Complexity of two Circle Connecting Problems},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {1},
  pages        = {17--32},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90149-I},
  doi          = {10.1016/0166-218X(93)90149-I},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Huang93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/IkebeMT93,
  author       = {Yoshiko Ikebe and
                  Tomomi Matsui and
                  Akihisa Tamura},
  title        = {Adjacency of the Best and Second Best Valued Solutions in Combinatorial
                  Optimization Problems},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {3},
  pages        = {227--232},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90128-B},
  doi          = {10.1016/0166-218X(93)90128-B},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/IkebeMT93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Jeavons93,
  author       = {Peter Jeavons},
  title        = {Counting Representable Sets on Simple Graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {1},
  pages        = {33--46},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90150-M},
  doi          = {10.1016/0166-218X(93)90150-M},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Jeavons93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Jungnickel93,
  author       = {Dieter Jungnickel},
  title        = {Trace-Orthogonal Normal Bases},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {3},
  pages        = {233--249},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90129-C},
  doi          = {10.1016/0166-218X(93)90129-C},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Jungnickel93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KahlbacherC93,
  author       = {Helmut G. Kahlbacher and
                  T. C. Edwin Cheng},
  title        = {Parallel Machine Scheduling to Minimize Costs for Earliness and Number
                  of Tardy Jobs},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {139--164},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90088-6},
  doi          = {10.1016/0166-218X(93)90088-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KahlbacherC93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KaufmanT93,
  author       = {Y. Kaufman and
                  Arie Tamir},
  title        = {Locating Service Centers with Precedence Constraints},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {3},
  pages        = {251--261},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90130-G},
  doi          = {10.1016/0166-218X(93)90130-G},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KaufmanT93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KellererW93,
  author       = {Hans Kellerer and
                  Gerhard J. Woeginger},
  title        = {On the Euclidean two Paths Problem},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {165--173},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90089-7},
  doi          = {10.1016/0166-218X(93)90089-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KellererW93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KorachP93,
  author       = {Ephraim Korach and
                  Michal Penn},
  title        = {A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar
                  Graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {1},
  pages        = {77--83},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90153-F},
  doi          = {10.1016/0166-218X(93)90153-F},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KorachP93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/LiuL93,
  author       = {Mulan Liu and
                  Zunquan Li},
  title        = {Coset Correlation of {LR} m-Arrays},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {3},
  pages        = {263--273},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90131-7},
  doi          = {10.1016/0166-218X(93)90131-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/LiuL93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MalucelliOP93,
  author       = {Federico Malucelli and
                  Thomas Ottmann and
                  Daniele Pretolani},
  title        = {Efficient Labelling Algorithms for the Maximum Noncrossing Matching
                  Problem},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {175--179},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90090-B},
  doi          = {10.1016/0166-218X(93)90090-B},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MalucelliOP93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/McMorrisP93,
  author       = {Fred R. McMorris and
                  Robert C. Powers},
  title        = {Consensus Functions on Trees that Satisfy Independence Axiom},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {1},
  pages        = {47--55},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90151-D},
  doi          = {10.1016/0166-218X(93)90151-D},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/McMorrisP93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Murty93,
  author       = {Katta G. Murty},
  title        = {On the Complexity of a Special Basis Problem in {LP}},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {181--185},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90091-2},
  doi          = {10.1016/0166-218X(93)90091-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Murty93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Tamir93,
  author       = {Arie Tamir},
  title        = {A Unifying Location Model on Tree Graphs Based on Submodularity Properties},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {3},
  pages        = {275--283},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90132-8},
  doi          = {10.1016/0166-218X(93)90132-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Tamir93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Veen93,
  author       = {Jack A. A. van der Veen},
  title        = {An O(\emph{n}) Algorithm to Solve the Bottleneck Traveling Salesman
                  Problem Restricted to Ordered Product Matrices},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {1},
  pages        = {57--75},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90152-E},
  doi          = {10.1016/0166-218X(93)90152-E},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Veen93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Winter93,
  author       = {Pawel Winter},
  title        = {Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility
                  Graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {187--206},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90092-3},
  doi          = {10.1016/0166-218X(93)90092-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Winter93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/ZhangLZ93,
  author       = {Fuji Zhang and
                  Xueliang Li and
                  Heping Zhang},
  title        = {Hexagonal Systems with Fixed Bonds},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {3},
  pages        = {285--296},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90133-9},
  doi          = {10.1016/0166-218X(93)90133-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ZhangLZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.