External Links

    Journal: Discrete Applied Mathematics

    Volume 130, Issue 3

    367 -- 380Rainer E. Burkard, Peter Butkovic. Finding all essential terms of a characteristic maxpolynomial
    381 -- 393Gregory M. Constantine. Graphs, networks, and linear unbiased estimates
    395 -- 416J. Gómez, Ignacio M. Pelayo, Camino Balbuena. Diameter vulnerability of GC graphs
    417 -- 436Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki. Interior and exterior functions of positive Boolean functions
    437 -- 448Juan A. Mesa, Justo Puerto, Arie Tamir. Improved algorithms for several network location problems with equality measures
    449 -- 467Heng Yang, Yinyu Ye, Jiawei Zhang. An approximation algorithm for scheduling two parallel machines with capacity constraints
    469 -- 485Heping Zhang, Peter Che Bor Lam, Wai Chee Shiu. Cell rotation graphs of strongly connected orientations of plane graphs with an application
    487 -- 493Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier. On the growth of components with non-fixed excesses
    495 -- 501Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. Which matrices are immune against the transportation paradox?
    503 -- 512Charles Delorme, Odile Favaron, Dieter Rautenbach. Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
    513 -- 519Peter C. Fishburn, Fred S. Roberts. No-hole L(2, 1)-colorings
    521 -- 526Vesa Halava, Tero Harju, Juhani Karhumäki. Decidability of the binary infinite Post Correspondence Problem
    527 -- 534Gwang-Yeon Lee, Jin-Soo Kim, Seong-Hoon Cho. Some combinatorial identities via Fibonacci numbers
    535 -- 538Enzo Maria Li Marzi. Perfect 7-cycle systems

    Volume 130, Issue 2

    83 -- 84. Preface
    85 -- 100Renato Bruni. Approximating minimal unsatisfiable subformulae by means of adaptive core search
    101 -- 127Claudia Fiorini, Enrico Martinelli, Fabio Massacci. How to fake an RSA signature by encoding modular root finding as a SAT problem
    129 -- 138John V. Franco, Ramjee P. Swaminathan. On good algorithms for determining unsatisfiability of propositional formulas
    139 -- 155Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
    157 -- 171Jan Friso Groote, Hans Zantema. Resolution and binary decision diagrams cannot simulate each other polynomially
    173 -- 184Edward A. Hirsch. Worst-case study of local search for MAX-k-SAT
    185 -- 207Hans Kleine Büning, Xishun Zhao. On the structure of some classes of minimal unsatisfiable formulas
    209 -- 249Oliver Kullmann. Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
    251 -- 276Chu Min Li. Equivalent literal propagation in the DLL procedure
    277 -- 290Chu Min Li, Sylvain Gérard. On the limit of branching rules for hard random unsatisfiable 3-SAT
    291 -- 328David A. Plaisted, Armin Biere, Yunshan Zhu. A satisfiability procedure for quantified Boolean formulae
    329 -- 350Steven David Prestwich. SAT problems with chains of dependent variables
    351 -- 365Stefan Szeider. Homomorphisms of conjunctive normal forms

    Volume 130, Issue 1

    3 -- 12Iris Anshel, Michael Anshel, Dorian Goldfeld. Non-abelian key agreement protocols
    13 -- 31Seigo Arita. An addition algorithm in Jacobian of C::ab:: curves
    33 -- 36Sang Geun Hahn, Eonkyung Lee, Je Hong Park. Complexity of the generalized conjugacy problem
    37 -- 49Jeffrey Hoffstein, Joseph H. Silverman. Random small Hamming weight products with applications to cryptography
    51 -- 60Takakazu Satoh, Yuichiro Taguchi. Computing zeta functions for ordinary formal groups over finite fields
    61 -- 82Edlyn Teske. Computing discrete logarithms with the parallelized kangaroo method,
    runs on