Multiprocessor scheduling under precedence constraints: Polyhedral results Fulltext Access 32 Pages 2006
Relating State-Based and Process-Based Concurrency through Linear Logic Fulltext Access 32 Pages 2006
An exact and efficient approach for computing a cell in an arrangement of quadrics Fulltext Access 33 Pages 2006
Asymptotic enumeration of sparse 0–1 matrices with irregular row and column sums Fulltext Access 34 Pages 2006
On non-symmetric commutative association schemes with exactly one pair of non-symmetric relations Fulltext Access 34 Pages 2006
Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging Fulltext Access 34 Pages 2006
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof 1 Fulltext Access 35 Pages 2006
Isomorphism classes of hyperelliptic curves of genus 3 over finite fields Fulltext Access 35 Pages 2006
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem Fulltext Access 36 Pages 2006
Enumeration of m-tuples of permutations and a new class of power bases for the space of symmetric functions Fulltext Access 37 Pages 2006
Exact, efficient, and complete arrangement computation for cubic curves Fulltext Access 38 Pages 2006
The predicates of the Apollonius diagram: Algorithmic analysis and implementation Fulltext Access 40 Pages 2006
Determination of all possible orders of weight 16 circulant weighing matrices Fulltext Access 41 Pages 2006
Asymptotics of characters of symmetric groups, genus expansion and free probability Fulltext Access 42 Pages 2006
Applications of minor summation formula III, Plücker relations, lattice paths and Pfaffian identities Fulltext Access 43 Pages 2006
Polynomial equations with one catalytic variable, algebraic series and map enumeration Fulltext Access 50 Pages 2006
Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency Fulltext Access 4 Pages 2005
A fast algorithm for minimum weight odd circuits and cuts in planar graphs Fulltext Access 4 Pages 2005
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem Fulltext Access 4 Pages 2005
The m-machine flowshop problem with unit-time operations and intree precedence constraints Fulltext Access 4 Pages 2005
Erratum to “On removable even circuits in graphs” [Discrete Math. 286 (2004) 177-184] Fulltext Access 4 Pages 2005