Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory > 05C35 Extremal problems"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: B | E | F | G | K | R
Number of items at this level: 7.


Bold, Christoph (1989) Order-Degree Sequences.
Published in: Ars Combinatoria : a Canadian journal of combinatorics Vol. 27. pp. 113-116.


Euler, Reinhardt and Jünger, Michael and Reinelt, Gerhard (1987) Generalizations of Cliques, Odd Cycles and Anticycles and their relation to Independence System Polyhedra.
Published in: Mathematics of Operations Research Vol. 12 (3). pp. 451-462. ISSN 0364-765X


Faigle, Ulrich and Kern, Walter and Turán, Gyorgy (1989) On the performance of on-line algorithms for partition problems.
Published in: Acta Cybernetica : forum centrale publicationum cyberneticarum Hungaricum Vol. 9 (2). pp. 107-119.

Faßbender, Bert (1989) Kriterien vom Ore-Typ für längste Kreise in 2-zusammenhängenden Graphen.
Published in: Mathematische Nachrichten Vol. 142 (1). pp. 287-296.


Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1984) A Cutting Plane Algorithm for the Linear Ordering Problem.
Published in: Operations Research Vol. 32 (6). pp. 1195-1220.


Korte, Bernhard and Schrader, Rainer (1981) A survey on oracle techniques.
Published In: Mathematical Foundations of Computer Science ; Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 – September 4, 1981, Lecture Notes in Computer Science. 118 Springer 1981, pp. 61-77.


Reinelt, Gerhard and Jünger, Michael and Grötschel, Martin (1989) Via Minimization with Pin Preassignments and Layer Preferal.
Published in: ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik Vol. 69 (11). pp. 393-399.

This list was generated on Sat Nov 26 21:24:20 2022 CET.