Algorithms and Combinatorics – serie

Optimal Interconnection Trees in the Plane

Theory, Algorithms and Applications

Optimal Interconnection Trees in the Plane

Theory, Algorithms and Applications

Combinatorics and Complexity of Partition Functions

Combinatorics and Complexity of Partition Functions

Simplex Method

A Probabilistic Analysis

Systems Analysis by Graphs and Matroids

Structural Solvability and Controllability

Greedoids

Topics in Discrete Mathematics

Dedicated to Jarik Nešetril on the Occasion of his 60th birthday

Strange Logic of Random Graphs

Graph Colouring and the Probabilistic Method

Irregularities of Partitions

Geometry of Cuts and Metrics

Probabilistic Methods for Algorithmic Discrete Mathematics

Modern Cryptography, Probabilistic Proofs and Pseudorandomness

Geometric Discrepancy

An Illustrated Guide

Linear Optimization and Extensions

Applied Finite Group Actions

Matrices and Matroids for Systems Analysis

Geometric Discrepancy

An Illustrated Guide

Matrices and Matroids for Systems Analysis

Geometry of Cuts and Metrics

Topics in Discrete Mathematics

Dedicated to Jarik Nešetril on the Occasion of his 60th birthday

Strange Logic of Random Graphs

Probabilistic Methods for Algorithmic Discrete Mathematics

Modern Cryptography, Probabilistic Proofs and Pseudorandomness

Linear Optimization and Extensions

Applied Finite Group Actions

Combinatorial Optimization

Theory and Algorithms

Boolean Function Complexity

Advances and Frontiers