Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dam/Ageev01,
  author       = {Alexander A. Ageev},
  title        = {Complexity of finding a join of maximum weight},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {3--7},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00355-3},
  doi          = {10.1016/S0166-218X(00)00355-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Ageev01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Avgustinovich01,
  author       = {Sergey V. Avgustinovich},
  title        = {Perfect binary (n, 3) codes: the structure of graphs of minimum distances},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {9--11},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00356-5},
  doi          = {10.1016/S0166-218X(00)00356-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Avgustinovich01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Beresnev01,
  author       = {Vladimir L. Beresnev},
  title        = {An efficient algorithm for the uncapacitated facility location problem
                  with totally balanced matrix},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {13--22},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00357-7},
  doi          = {10.1016/S0166-218X(00)00357-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Beresnev01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Bojarshinov01,
  author       = {V. A. Bojarshinov},
  title        = {Edge and total coloring of interval graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {23--28},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00358-9},
  doi          = {10.1016/S0166-218X(00)00358-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Bojarshinov01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Borodin01,
  author       = {Oleg V. Borodin},
  title        = {Preface},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {1},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00354-1},
  doi          = {10.1016/S0166-218X(00)00354-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Borodin01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BorodinKRS01,
  author       = {Oleg V. Borodin and
                  Alexandr V. Kostochka and
                  Andr{\'{e}} Raspaud and
                  {\'{E}}ric Sopena},
  title        = {Acyclic colouring of 1-planar graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {29--41},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00359-0},
  doi          = {10.1016/S0166-218X(00)00359-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BorodinKRS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Chashkin01,
  author       = {A. V. Chashkin},
  title        = {Average case complexity for finite Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {43--59},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00360-7},
  doi          = {10.1016/S0166-218X(00)00360-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Chashkin01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Chashkin01a,
  author       = {A. V. Chashkin},
  title        = {Lower bounds for the complexity of restrictions of Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {61--93},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00361-9},
  doi          = {10.1016/S0166-218X(00)00361-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Chashkin01a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Cherukhin01,
  author       = {D. U. Cherukhin},
  title        = {On an infinite sequence of improving Boolean bases},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {95--108},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00362-0},
  doi          = {10.1016/S0166-218X(00)00362-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Cherukhin01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/EvdokimovP01,
  author       = {A. A. Evdokimov and
                  A. L. Perezhogin},
  title        = {Minimal enumerations of subsets of a finite set and the middle level
                  problem},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {109--114},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00363-2},
  doi          = {10.1016/S0166-218X(00)00363-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/EvdokimovP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Frid01,
  author       = {Anna E. Frid},
  title        = {On the subword complexity of iteratively generated infinite words},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {115--120},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00364-4},
  doi          = {10.1016/S0166-218X(00)00364-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Frid01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Frid01a,
  author       = {Anna E. Frid},
  title        = {On factor graphs of {DOL} words},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {121--130},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00365-6},
  doi          = {10.1016/S0166-218X(00)00365-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Frid01a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Ilev01,
  author       = {Victor P. Il'ev},
  title        = {An approximation guarantee of the greedy descent algorithm for minimizing
                  a supermodular set function},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {131--146},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00366-8},
  doi          = {10.1016/S0166-218X(00)00366-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Ilev01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KashyrskikhPS01,
  author       = {K. N. Kashyrskikh and
                  Chris N. Potts and
                  Sergey V. Sevastianov},
  title        = {A 3/2-approximation algorithm for two-machine flow-shop sequencing
                  subject to release dates},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {255--271},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00374-7},
  doi          = {10.1016/S0166-218X(00)00374-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KashyrskikhPS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Kasim-Zade01,
  author       = {Oktay M. Kasim{-}Zade},
  title        = {On minimal coverings of the Boolean cube by centered antichains},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {147--153},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00367-X},
  doi          = {10.1016/S0166-218X(00)00367-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Kasim-Zade01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KlepininS01,
  author       = {Alexander V. Klepinin and
                  E. V. Sukhanov},
  title        = {On combinatorial properties of the Arshon sequence},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {155--169},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00368-1},
  doi          = {10.1016/S0166-218X(00)00368-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KlepininS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Korshunov01,
  author       = {A. D. Korshunov},
  title        = {On the asymptotics of the number of binary words with a given length
                  of a maximal series},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {171--201},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00369-3},
  doi          = {10.1016/S0166-218X(00)00369-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Korshunov01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Marchenkov01,
  author       = {S. S. Marchenkov},
  title        = {A-closed classes of idempotent functions of many-valued logic definable
                  by binary relations},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {203--225},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00370-X},
  doi          = {10.1016/S0166-218X(00)00370-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Marchenkov01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Merekin01,
  author       = {Yuri V. Merekin},
  title        = {Upper bounds for the complexity of sequences generated by symmetric
                  Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {227--231},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00371-1},
  doi          = {10.1016/S0166-218X(00)00371-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Merekin01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Sapozhenko01,
  author       = {Alexander A. Sapozhenko},
  title        = {On the number of connected sets with the neighborhood of a given size
                  in a graph},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {233--247},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00372-3},
  doi          = {10.1016/S0166-218X(00)00372-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Sapozhenko01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Serdjukov01,
  author       = {A. I. Serdjukov},
  title        = {On finding a maximum spanning tree of bounded radius},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {249--253},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00373-5},
  doi          = {10.1016/S0166-218X(00)00373-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Serdjukov01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/SevastianovW01,
  author       = {Sergey V. Sevastianov and
                  Gerhard J. Woeginger},
  title        = {Linear time approximation scheme for the multiprocessor open shop
                  problem},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {273--288},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00375-9},
  doi          = {10.1016/S0166-218X(00)00375-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/SevastianovW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Vizing01,
  author       = {Vadym G. Vizing},
  title        = {On connected list colorings of graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {295--300},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00377-2},
  doi          = {10.1016/S0166-218X(00)00377-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Vizing01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Zanten01,
  author       = {A. J. van Zanten},
  title        = {Cyclic distance-preserving codes on a constant-weight basis},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {289--294},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00376-0},
  doi          = {10.1016/S0166-218X(00)00376-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Zanten01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Zverovich01,
  author       = {Igor E. Zverovich},
  title        = {Locally bounded hereditary subclasses of k-colourable graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {114},
  number       = {1-3},
  pages        = {301--311},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00378-4},
  doi          = {10.1016/S0166-218X(00)00378-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Zverovich01.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.