Discrete Applied Mathematics, Volume 130

Volume 130, Number 1, 8 August 2003

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

Volume 130, Number 2, 15 August 2003

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

Volume 130, Number 3, 23 August 2003

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