Abstract is missing.
- Chipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds?Eric Allender. 3 [doi]
- The Inhabitation Problem for Intersection TypesMartin W. Bunder. 7-14 [doi]
- Weak Parametric Failure Equivalences and Their Congruence FormatsXiaowei Huang, Li Jiao, Weiming Lu. 15-26 [doi]
- Modelling for Lazy Clause GenerationOlga Ohrimenko, Peter J. Stuckey. 27-37 [doi]
- The Core Concept for 0/1 Integer ProgrammingSamuel Huston, Jakob Puchinger, Peter J. Stuckey. 39-47 [doi]
- An ILP for the metro-line crossing problemMatthew Asquith, Joachim Gudmundsson, Damian Merrick. 49-56 [doi]
- A Multidimensional Bisection Method for Unconstrained Minimization ProblemElena Morozova. 57-62 [doi]
- Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage ValueNita H. Shah, Ajay S. Gor, Hui Wee. 63-66 [doi]
- Tractable Cases of the Extended Global Cardinality ConstraintMarko Samer, Stefan Szeider. 67-74 [doi]
- Parameterized Complexity of the Clique Partition ProblemEgbert Mujuni, Frances A. Rosamond. 75-78 [doi]
- The Parameterized Complexity of Regular Subgraph Problems and GeneralizationsLuke Mathieson, Stefan Szeider. 79-86 [doi]
- Well-covered Graphs and GreedoidsVadim E. Levit, Eugen Mandrescu. 87-91 [doi]
- On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2Mirka Miller, Minh Hoang Nguyen, Guillermo Pineda-Villavicencio. 93-95 [doi]
- Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted OutdegreeYuichi Asahiro, Eiji Miyano, Hirotaka Ono. 97-106 [doi]
- Generating Balanced Parentheses and Binary Trees by Prefix ShiftsFrank Ruskey, Aaron Williams. 107-115 [doi]
- Testing Embeddability Between Metric SpacesChing-Lueh Chang, Yen-Wu Ti, Yuh-Dauh Lyuu. 117-124 [doi]
- On the Efficiency of Pollard s Rho Method for Discrete LogarithmsShi Bai, Richard P. Brent. 125-131 [doi]
- Verifying Michael and Scott s Lock-Free Queue Algorithm using Trace ReductionLindsay Groves. 133-142 [doi]