Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory > 05C99 None of the above, but in this section"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: C | E | F | G | H | J | M | S
Number of items at this level: 15.

C

Chimani, Markus and Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Klein, Karsten and Mutzel, Petra (2014) The Open Graph Drawing Framework (OGDF). Chapman & Hall , London. ISBN 978-1-584-88412-5

Chimani, Markus and Gutwenger, Carsten and Jünger, Michael and Klein, Karsten and Mutzel, Petra and Schulz, Michael (2007) The Open Graph Drawing Framework, Poster presentation in 15th International Symposium on Graph Drawing. Poster at: Graph Drawing 15th International Symposium, GD 2007,,September 24-26, 2007,Sydney, Australia.

E

Euler, Reinhardt and Mahjoub, Ali R. (1991) On a Composition of Independence Systems by Circuit Identification.
Published in: Journal of combinatorial theory : Series B Vol. 53 (2). pp. 235-259.

F

Faigle, Ulrich and Schrader, Rainer (1986) A combinatorial bijection between linear extensions of equivalent orders.
Published in: Discrete Mathematics Vol. 58 (3). pp. 295-301.

Faigle, Ulrich and Schrader, Rainer (1992) A greedy reduction algorithm for setup optimization.
Published in: Discrete Applied Mathematics Vol. 35 (1). pp. 73-79.

G

Gronemann, Martin and Jünger, Michael (2013) Drawing Clustered Graphs as Topographic Maps.
Published In: Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, Lecture Notes in Computer Science. 7704 Springer 2013, pp. 426-438.

Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Leipert, Sebastian and Mutzel, Petra (2002) Graph Drawing Algorithm Engineering with AGD.
Published In: Software visualization international seminar ; Dagstuhl Castle, Germany, May 20 - 25, 2001 ; revised papers, Lecture notes in computer science 676-679. 2269 Springer 2002, pp. 676-679.

Gutwenger, Carsten and Jünger, Michael and Klein, Karsten and Kupke, Joachim and Leipert, Sebastian and Mutzel, Petra (2004) GoVisual - A Diagramming Software for UML Class Diagrams.
Published in: Graph Drawing Software. Springer 2004, pp. 257-278.

H

Hochstättler, Winfried and Nesetril, Jaroslav (1996) Farkas' Lemma and Morphism Duality.
Technical Report , 12 p.

Hochstättler, Winfried and Nesetril, Jaroslav (1999) Linear Programming Duality and Morphisms.
Published in: Commentationes mathematicae Universitatis Carolinae : CMUC Vol. 40 (3). pp. 577-592.

J

Jungnickel, Dieter and Leclerc, Matthias (1989) The 2-Matching Lattice of a Graph.
Published in: Journal of combinatorial theory : Series B Vol. 46 (2). pp. 246-248.

Jünger, Michael and Mutzel, Petra (2004) Technical Foundation.
Published in: Graph Drawing Software. Springer 2004, pp. 9-53.

M

Middendorf, Matthias and Pfeiffer, Frank (1993) Weakly Transitive Orientations, Hasse Diagrams and String Graphs.
Published in: Discrete mathematics Vol. 111 (1-3). pp. 393-400.

Mutzel, Petra and Gutwenger, Carsten and Brockenauer, Ralf and Fialko, Sergej and Klau, Gunnar W. and Krüger, Michael and Ziegler, Thomas and Näher, Stefan and Alberts, David and Ambras, Dirk and Koch, Gunter and Jünger, Michael and Buchheim, Christoph and Leipert, Sebastian (1998) AGD : A Library of Algorithms for Graph Drawing.
Published In: Graph Drawing : 6th international symposium, GD ’98, Montréal, Canada, August 13 - 15, 1998, Lecture Notes in Computer Science. 1547 Springer 1998, pp. 456-457.

S

Schrader, Rainer (1982) A note on approximation algorithms for graph partitioning problems.
Published in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) Vol. 62 (8). pp. 384-386.

This list was generated on Sun Oct 22 02:27:23 2017 CEST.