Browse by Keywords

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 7.

Liers, Frauke and Pardella, Gregor (2008) A simple MAX-CUT algorithm for planar graphs.
Technical Report , 16 p.

Heusch, Peter (1999) The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
Published in: Discrete Applied Mathematics Vol. 96-97. pp. 127-138.

Brandenburg, Franz J. and Jünger, Michael and Mutzel, Petra (1997) Algorithmen zum automatischen Zeichnen von Graphen.
Published in: Informatik-Spektrum Vol. 20 (4). pp. 199-207.

Hochstättler, Winfried and Loebl, Martin and Moll, Christoph (1996) Generating Convex Polyominoes at Random.
Published In: Formal power series and algebraic combinatorics ; Conference proceedings ; 21 - 25 june 1993, Discrete mathematics. 153 Elsevier 1996, pp. 165-176.

Franco, John and Gallo, Giorgio and Kleine Büning, Hans and Speckenmeyer, Ewald and Spera, Cosimo (1996) Workshop on the satisfiability problem.
Technical Report , 165 p.

Heusch, Peter (1995) The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
Published In: Mathematical foundations of computer science 1995 : 20th international symposium ; proceedings, Lecture notes in computer science. 969 Springer 1995, pp. 221-226.

Bokowski, Jürgen and Sturmfels, Bernd (1986) On the Coordinatization of Oriented Matroids.
Published in: Discrete & Computational Geometry Vol. 1 (1). pp. 293-306.

This list was generated on Mon Sep 25 04:02:53 2017 CEST.