Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dam/Buning00,
  author       = {Hans Kleine{ }B{\"{u}}ning},
  title        = {On subclasses of minimal unsatisfiable formulas},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {83--98},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00245-6},
  doi          = {10.1016/S0166-218X(00)00245-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Buning00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/FoldesH00,
  author       = {Stephan Foldes and
                  Peter L. Hammer},
  title        = {Disjunctive and conjunctive normal forms of pseudo-Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {1--26},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00276-6},
  doi          = {10.1016/S0166-218X(00)00276-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FoldesH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GenissonJ00,
  author       = {Richard G{\'{e}}nisson and
                  Philippe J{\'{e}}gou},
  title        = {On the relations between {SAT} and {CSP} enumerative algorithms},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {27--40},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00205-X},
  doi          = {10.1016/S0166-218X(99)00205-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GenissonJ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HochbaumP00,
  author       = {Dorit S. Hochbaum and
                  Anu Pathria},
  title        = {Approximating a generalization of {MAX} 2SAT and {MIN} 2SAT},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {41--59},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00244-4},
  doi          = {10.1016/S0166-218X(00)00244-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HochbaumP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KlasnerS00,
  author       = {Norbert Klasner and
                  Hans Ulrich Simon},
  title        = {General lower bounds on the query complexity within the exact learning
                  model},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {61--81},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00223-1},
  doi          = {10.1016/S0166-218X(99)00223-1},
  timestamp    = {Fri, 08 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/KlasnerS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Kullmann00,
  author       = {Oliver Kullmann},
  title        = {Investigations on autark assignments},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {99--137},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00262-6},
  doi          = {10.1016/S0166-218X(00)00262-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Kullmann00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MaarenW00,
  author       = {Hans van Maaren and
                  Joost P. Warners},
  title        = {Bounds and fast approximation algorithms for binary quadratic optimization
                  problems with application to {MAX} 2SAT},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {225--239},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00263-8},
  doi          = {10.1016/S0166-218X(00)00263-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MaarenW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Marichal00,
  author       = {Jean{-}Luc Marichal},
  title        = {The influence of variables on pseudo-Boolean functions with applications
                  to game theory and multicriteria decision making},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {139--164},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00264-X},
  doi          = {10.1016/S0166-218X(00)00264-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Marichal00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/NagamochiI00,
  author       = {Hiroshi Nagamochi and
                  Toshihide Ibaraki},
  title        = {Polyhedral structure of submodular and posi-modular systems},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {165--189},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00246-8},
  doi          = {10.1016/S0166-218X(00)00246-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/NagamochiI00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/TakenagaY00,
  author       = {Yasuhiko Takenaga and
                  Shuzo Yajima},
  title        = {Hardness of identifying the minimum ordered binary decision diagram},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {191--201},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00226-7},
  doi          = {10.1016/S0166-218X(99)00226-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/TakenagaY00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/TaylorZ00,
  author       = {Alan D. Taylor and
                  William S. Zwicker},
  title        = {Trading properties and Alexandrov kernels for Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {203--214},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00247-X},
  doi          = {10.1016/S0166-218X(00)00247-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/TaylorZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Ueda00,
  author       = {Takao Ueda},
  title        = {Reflectiveness and compression of threshold transformations},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {215--224},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00248-1},
  doi          = {10.1016/S0166-218X(00)00248-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Ueda00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/WarnersM00,
  author       = {Joost P. Warners and
                  Hans van Maaren},
  title        = {Solving satisfiability problems using elliptic approximations - effective
                  branching rules},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {241--259},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00249-3},
  doi          = {10.1016/S0166-218X(00)00249-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/WarnersM00.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.