Katalog der Deutschen Nationalbibliothek

A characterization of undirected branching greedoids

A combinatorial bijection between linear extensions of equivalent orders

A conjecture of Kauffman on amphicheiral alternating knots

A covering problem for finite boolean lattices

A cutting plane algorithm for minimum perfect 2-matchings [two matchings]

A decomposition of strongly unimodular matrices into incidence matrices of digraphs

A faster algorithm for finding a maximum weight clique of a circular arc graph

A generalized cut-condition for multiflows inmatroids

A globally convergent simplicial algorithm for stationary point problems on polytopes

A graph theoretic approach to the jump number problem

A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids

A greedy algorithm for minimizing a separable function over a finite jump system

A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory

A greedy pre-processing algorithm for setup optimization

A group testing problem for hypergraphs of bounded rank

A LasVegas-NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues : (draft)

A min max theorem for greedoids

A min-max theorem for bisubmodular polyhedra

A minimax theorem and a Dulmage-Mendelsohn type decomposition for a class of generic partitioned matrices

A network penalty method

A note on clutter partitions

A note on detecting simple redundancies in linear systems

A note on induced matchings

A note on some factor theorems of graphs

A parallel algorithm for minimum weighted colouring of triangulated graphs

A partition theorem for [0,1]

A print server operating system

A resilience strategy for a single source destination pair

A separation algorithm for the matchable set polytope

A short proof of the restrictred Ramsey theorem for finite set systems

A simple linear-time algorithm to recognize interval graphs

A simple proof of the inequality FFD(L) ≤ 11/9 OPT(L) + 1, L for the FFD bin-packing algorithm

A sparse Gallai-Witt theorem

A sparse Graham-Rothschild theorem

A strongly polynomial algorithm to solve combinatorial linear programs

A strongly polynomial minimum cost circulation algorithm

A survey of the known facets of the cut cone

A theorem on the principal structure for independent matchings

A tutorial on network flows and matchings

A very short proof of Seymour's theorem on t-joins

Abstract and generic rigidity in the plane

Algorithmic aspects of some notions in classical mathematics

Algorithmic geometry of numbers

Algorithms for minimum weighted colouring of perfectly ordered, comparability, triangulated, and clique separable graphs

Almost all graphs with 1.44n edges are 3-colourable

Almost bipartite making graphs

An algorithmic theory of numbers graphs and convexity

An almost linear-time algorithm for graph realization

An application of submodular flows

An application of the simultaneous approximation in combinatorial optimization

An approximation algorithm for 3-colourability : (extended abstract)

An efficient cost scaling algorithm for the independent assignment problem

An efficient labeling technique for solving sparse assignment problems

An in-core-out-of-core method for solving large scale assignment problems

An O(log n) parallel algorithm for testing bipartite graphs

An outline of a disjoint path algorithm

An unprovable Ramsey-type theorem

Applications of antilexicogr[a]phic order

2. How to sharpen the LYM inequality

Applications of combinatorics to electrical engineering and rigidity

Applications of submodular functions