COMPUTATIONAL DISCRETE MATHEMATICS

By C. KIVAI

THE NEAREST NEIGHBOR EXPLICIT AND IMPLICIT ENFORCING – RANDOMIZED OPTIMIZATION DEGREE BOUNDS FOR LONG PATHS AND CYCLES IN K-CONNECTED GRAPHS DATA STRUCTURES FOR BOOLEAN FUNCTIONS SCHEDULING UNDER UNCERTAINTY: BOUNDING THE MAKESPAN DISTRIBUTION RANDOM GRAPHS, RANDOM TRIANGLE-FREE GRAPHS, AND RANDOM PARTIAL ORDERS DIVISION-FREE ALGORITHMS FOR THE DETERMINANT AND THE PFA?AN: ALGEBRAIC AND COMBINATORIAL APPROACHES CHECK CHARACTER SYSTEMS AND ANTI–SYMMETRIC MAPPINGS ALGORITHMS IN PURE MATHEMATICS COLORING HAMMING GRAPHS, OPTIMAL BINARY CODES, AND THE 0/1-BORSUK PROBLEM IN LOW DIMENSIONS