Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dam/Alekseev04,
  author       = {Vladimir E. Alekseev},
  title        = {Polynomial algorithm for finding the largest independent sets in graphs
                  without forks},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {3--16},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00290-1},
  doi          = {10.1016/S0166-218X(02)00290-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Alekseev04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/AlekseevL04,
  author       = {Vladimir E. Alekseev and
                  Vadim V. Lozin},
  title        = {Local transformations of graphs preserving independence number},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {17--30},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00291-3},
  doi          = {10.1016/S0166-218X(02)00291-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AlekseevL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Borodin04,
  author       = {Oleg V. Borodin},
  title        = {Preface: Russian Translations {II}},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {1},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.dam.2003.10.001},
  doi          = {10.1016/J.DAM.2003.10.001},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Borodin04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BorodinL04,
  author       = {Oleg V. Borodin and
                  D. V. Loparev},
  title        = {Height of minor faces in plane normal maps},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {31--39},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00292-5},
  doi          = {10.1016/S0166-218X(02)00292-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BorodinL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Chashkin04,
  author       = {A. V. Chashkin},
  title        = {Local complexity of Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {55--64},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00294-9},
  doi          = {10.1016/S0166-218X(02)00294-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Chashkin04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Chashkin04a,
  author       = {A. V. Chashkin},
  title        = {Computation of Boolean functions by randomized programs},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {65--82},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00295-0},
  doi          = {10.1016/S0166-218X(02)00295-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Chashkin04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Chashkin04b,
  author       = {A. V. Chashkin},
  title        = {Average time of computing Boolean operators},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {41--54},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00293-7},
  doi          = {10.1016/S0166-218X(02)00293-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Chashkin04b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Chernyak04,
  author       = {Arkady A. Chernyak},
  title        = {Residual reliability of P-threshold graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {83--95},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00296-2},
  doi          = {10.1016/S0166-218X(02)00296-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Chernyak04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Fomin04,
  author       = {Fedor V. Fomin},
  title        = {Searching expenditure and interval graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {97--104},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00297-4},
  doi          = {10.1016/S0166-218X(02)00297-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Fomin04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GimadiGS04,
  author       = {Eduard Kh. Gimadi and
                  N. I. Glebov and
                  A. I. Serdyukov},
  title        = {On finding a cyclic tour and a vehicle loading plan yielding maximum
                  profit},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {105--111},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00298-6},
  doi          = {10.1016/S0166-218X(02)00298-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GimadiGS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GrinchukK04,
  author       = {M. I. Grinchuk and
                  Vadim V. Kochergin},
  title        = {On the search of optimal order of variables in the synthesis of switching
                  circuits by cascade technique},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {113--123},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00299-8},
  doi          = {10.1016/S0166-218X(02)00299-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GrinchukK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Kolpakov04,
  author       = {Roman M. Kolpakov},
  title        = {Criterion of generativeness of sets of rational probabilities by a
                  class of Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {125--142},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00300-1},
  doi          = {10.1016/S0166-218X(02)00300-1},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Kolpakov04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MakhnevP04,
  author       = {Alexander A. Makhnev and
                  D. V. Paduchikh},
  title        = {On the structure of connected locally GQ(3, 9)-graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {143--156},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00301-3},
  doi          = {10.1016/S0166-218X(02)00301-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MakhnevP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Malyugin04,
  author       = {S. A. Malyugin},
  title        = {On a lower bound on the number of perfect binary codes},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {157--160},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00302-5},
  doi          = {10.1016/S0166-218X(02)00302-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Malyugin04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Malyugin04a,
  author       = {S. A. Malyugin},
  title        = {On enumeration of the perfect binary codes of length 15},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {161--181},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00303-7},
  doi          = {10.1016/S0166-218X(02)00303-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Malyugin04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Marchenkov04,
  author       = {S. S. Marchenkov},
  title        = {A-classification of idempotent functions of many-valued logic},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {183--203},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00304-9},
  doi          = {10.1016/S0166-218X(02)00304-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Marchenkov04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Okolnishnikova04,
  author       = {Elizaveta A. Okol'nishnikova},
  title        = {Comparing the sizes of nondeterministic branching read-k-times programs},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {205--222},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00305-0},
  doi          = {10.1016/S0166-218X(02)00305-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Okolnishnikova04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Orlov04,
  author       = {V. A. Orlov},
  title        = {Complexity of implementing functions of k-valued logic by circuits
                  and formulas in functionally complete bases},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {223--233},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00306-2},
  doi          = {10.1016/S0166-218X(02)00306-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Orlov04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Perezhogin04,
  author       = {A. L. Perezhogin},
  title        = {On cyclic {\textless}m,n{\textgreater}-enumerations},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {235--243},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00307-4},
  doi          = {10.1016/S0166-218X(02)00307-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Perezhogin04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Potapov04,
  author       = {Vladimir N. Potapov},
  title        = {Redundancy estimates for the Lempel-Ziv algorithm of data compression},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {245--254},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00308-6},
  doi          = {10.1016/S0166-218X(02)00308-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Potapov04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Romanov04,
  author       = {A. M. Romanov},
  title        = {On nonsystematic perfect binary codes of length 15},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {255--258},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00309-8},
  doi          = {10.1016/S0166-218X(02)00309-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Romanov04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Salimov04,
  author       = {F. I. Salimov},
  title        = {Finitely generated distribution algebras},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {259--265},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00310-4},
  doi          = {10.1016/S0166-218X(02)00310-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Salimov04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Shenmaier04,
  author       = {V. V. Shenmaier},
  title        = {A greedy algorithm for maximizing a linear objective function},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {267--279},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00311-6},
  doi          = {10.1016/S0166-218X(02)00311-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Shenmaier04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Sholomov04,
  author       = {Lev A. Sholomov},
  title        = {On complexity of minimization and compression problems for models
                  of sequential choice},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {281--300},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00312-8},
  doi          = {10.1016/S0166-218X(02)00312-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Sholomov04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Vasileva04,
  author       = {Anastasia Yu. Vasil'eva},
  title        = {Local spectra of perfect binary codes},
  journal      = {Discret. Appl. Math.},
  volume       = {135},
  number       = {1-3},
  pages        = {301--307},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(02)00313-X},
  doi          = {10.1016/S0166-218X(02)00313-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Vasileva04.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.