The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2000, volume: 107, number: 1-3

  1. Stephan Foldes, Peter L. Hammer
    Disjunctive and conjunctive normal forms of pseudo-Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:1-26 [Journal]
  2. Richard Génisson, Philippe Jégou
    On the relations between SAT and CSP enumerative algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:27-40 [Journal]
  3. Dorit S. Hochbaum, Anu Pathria
    Approximating a generalization of MAX 2SAT and MIN 2SAT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:41-59 [Journal]
  4. Norbert Klasner, Hans-Ulrich Simon
    General lower bounds on the query complexity within the exact learning model. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:61-81 [Journal]
  5. Hans Kleine Büning
    On subclasses of minimal unsatisfiable formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:83-98 [Journal]
  6. Oliver Kullmann
    Investigations on autark assignments. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:99-137 [Journal]
  7. Jean-Luc Marichal
    The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:139-164 [Journal]
  8. Hiroshi Nagamochi, Toshihide Ibaraki
    Polyhedral structure of submodular and posi-modular systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:165-189 [Journal]
  9. Yasuhiko Takenaga, Shuzo Yajima
    Hardness of identifying the minimum ordered binary decision diagram. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:191-201 [Journal]
  10. Alan D. Taylor, William S. Zwicker
    Trading properties and Alexandrov kernels for Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:203-214 [Journal]
  11. Takao Ueda
    Reflectiveness and compression of threshold transformations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:215-224 [Journal]
  12. Hans van Maaren, Joost P. Warners
    Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:225-239 [Journal]
  13. Joost P. Warners, Hans van Maaren
    Solving satisfiability problems using elliptic approximations - effective branching rules. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:241-259 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002