Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory > 05C85 Graph algorithms"
![]() | Up a level |
- MSC Classification Numbers (58)
- 05-XX Combinatorics (58)
- 05Cxx Graph theory (58)
- 05C85 Graph algorithms (58)
- 05Cxx Graph theory (58)
- 05-XX Combinatorics (58)
B
Barth, Wilhelm and Jünger, Michael and Mutzel, Petra
(2002)
Simple and Efficient Bilayer Cross Counting.
Published In:
Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, Lecture notes in computer science. 2528 Springer 2002, pp. 331-360.
Barth, Wilhelm and Mutzel, Petra and Jünger, Michael
(2004)
Simple and Efficient Bilayer Cross Counting (Journal Version).
Published in:
Journal of Graph Algorithms and Applications Vol. 8 (21).
pp. 179-194.
Brandenburg, Franz J. and Jünger, Michael and Mutzel, Petra
(1997)
Algorithmen zum automatischen Zeichnen von Graphen ( Kurzversion).
Published in:
Informatik ´97 : Informatik als Innovationsmotor ; Aachen, 24. - 26. September 1997., Informatik aktuell. Springer 1997, pp. 58-67.
Buchheim, Christoph and Ebner, Dietmar and Jünger, Michael and Klau, Gunnar W. and Mutzel, Petra and Weiskircher, René
(2006)
Exact Crossing Minimization.
Published In:
Graph drawing : 13th international symposium, GD 2005, Limerick, Ireland, September 12 - 14, 2005 ; revised papers, Lecture Notes in Computer Science. 3843 Springer 2006, pp. 37-48.
Buchheim, Christoph and Hong, Seok-Hee
(2002)
Crossing Minimization for Symmetries (Extended Abstract).
Published In:
Algorithms and Computation : 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002 ; proceedings, Lecture notes in computer science. 2518 Springer 2002, pp. 137-152.
Buchheim, Christoph and Hong, Seok-Hee
(2005)
Crossing Minimization for Symmetries (Journal Version).
Published in:
Theory of Computing Systems Vol. 38 (3).
pp. 293-311.
Buchheim, Christoph and Hong, Seok-Hee
(2008)
Testing Planarity of Geometric Automorphisms in Linear Time.
Published in:
Algorithmica Vol. 52 (4).
pp. 448-465.
Buchheim, Christoph and Jünger, Michael
(2002)
Detecting Symmetries by Branch & Cut (Extended Abstract).
Published In:
Graph drawing : 9th international symposium, GD 2001, Vienna, Austria, September 23 - 26, 2001 ; revised papers, Lecture Notes in Computer Science. 2265 Springer 2002, pp. 496-498.
Buchheim, Christoph and Jünger, Michael
(2004)
An Integer Programming Approach to Fuzzy Symmetry Detection.
Published In:
Graph drawing 11th International Symposium, GD 2003, Perugia, Italy, September 21 - 24, 2003 ; revised papers, Lecture Notes in Computer Science. 2912 Springer 2004, pp. 166-177.
Buchheim, Christoph and Jünger, Michael and Kandyba, Maria and Percan, Merijam and Schulz, Michael
(2007)
Planarization With Fixed Subgraph Embedding.
Technical Report
, 10 p.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian
(2006)
Drawing Rooted Trees in Linear Time.
Published in:
Software; Practice and Experience Vol. 36 (6).
pp. 651-665.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian
(2001)
A Fast Layout Algorithm for k-Level Graphs.
Published In:
Graph drawing : 8th international symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20 - 23, 2000 ; proceedings, Lecture Notes in Computer Science. 1984 Springer 2001, pp. 86-89.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian
(2002)
Improving Walker's Algorithm to Run in Linear Time.
Published In:
Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, Lecture notes in computer science. 2528 Springer 2002, pp. 347-364.
Buchheim, Christoph and Jünger, Michael and Menze, Annette and Percan, Merijam
(2006)
Bimodal Crossing Minimization.
Published In:
Computing and combinatorics : 12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15 - 18, 2006 ; proceedings, Lecture Notes in Computer Science. 4112 Springer 2006, pp. 497-506.
Buchheim, Christoph and Jünger, Michael and Percan, Merijam and Schulz, Michael and Thelen, Christina
(2007)
Drawing cycles in networks.
Technical Report
, 8 p.
Buchheim, Christoph and Zheng, Lanbo
(2006)
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem.
Published In:
Computing and combinatorics : 12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15 - 18, 2006 ; proceedings, Lecture Notes in Computer Science. 4112 Springer 2006, pp. 507-516.
D
Dahlhaus, Elias
(1998)
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.
Published In:
Graph-theoretic concepts in computer science : 24th international workshop, WG '98, Smolenice Castle, Slovak Republic, June 18 - 20, 1998 ; proceedings, Lecture notes in computer science. 1517 Springer 1998, pp. 713-724.
Dahlhaus, Elias
(1999)
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.
Technical Report
, 13 p.
Derigs, Ulrich and Goecke, Oskar and Schrader, Rainer
(1985)
Bisimplical edges, Gaussian elimination and matchings.
Published In:
Graphtheoretic Concepts in Computer Science Trauner Verlag 1985, 79-87.
F
Faigle, Ulrich and Peis, Britta
(2005)
Note on Pseudolattices, Lattices and Submodular Linear Programs.
Technical Report
, 17 p.
Submitted
Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal
(1996)
A network-flow technique for finding low-weight bounded-degree spanning trees.
Published In:
Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3 - 5, 1996 ; proceedings, Lecture notes in computer science. 1084 Springer 1996, pp. 105-117.
Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal
(1997)
A network-flow technique for finding low-weight bounded-degree spanning trees.
Published in:
Journal of Algorithms Vol. 24 (2).
pp. 310-324.
Fekete, Sandor P. and Klemmstein, Monika
(1995)
Worst-case ratios for degree-constrained trees.
Published In:
Proceedings of the 4th Biannual Twente Workshop on Graph Theory and Discrete Optimization 1995, pp. 103-106.
G
Gassner, Elisabeth and Percan, Merijam
(2006)
On the Weighted Minimal Deletion of Rooted Bipartite Minors.
Technical Report
, 35 p.
Gronemann, Martin (2015) Algorithms for Incremental Planar Graph Drawing and Two-page Book Embeddings. PhD thesis.
Gronemann, Martin
(2016)
Bitonic st-orderings for Upward Planar Graphs.
Published In:
Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016), Lecture Notes in Computer Science. 9801 Springer 2016, pp. 222-235.
Gronemann, Martin (2009) Engineering the Fast-Multipole-Multilevel Method for multicore and SIMD architectures. Masters thesis.
Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Leipert, Sebastian and Mutzel, Petra and Weiskircher, René (2002) AGD - A library of Algorithms for Graph Drawing. Lecture Notes in Computer Science (2265), pp. 473-474. Springer, Berlin. ISBN 3-540-43309-0
H
Hamacher, Anja and Moll, Christoph
(1997)
A New Heuristic for Vehicle Routing with Narrow Time Windows.
Published In:
Selected papers of the Symposium on Operations Research (SOR) : Braunschweig, September 3 - 6, 1996 Springer 1997, pp. 301-306.
Heinrichs, Udo and Moll, Christoph
(1997)
On the scheduling of one-dimensional transport systems.
Technical Report
, 18 p.
J
Jabrayilov, Adalat and Mallach, Sven and Mutzel, Petra and Rüegg, Ulf and von Hanxleden, Reinhard
(2016)
Compact Layered Drawings of General Directed Graphs.
Published In:
Graph Drawing and Network Visualization: 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, Lecture Notes in Computer Science. 9801 Springer 2016, pp. 209-221.
Jünger, Michael and Grötschel, Martin and Reinelt, Gerhard
(1984)
Optimal Triangulation of Large Real World input- output Matrices.
Published in:
Statistische Hefte (25).
pp. 261-295.
Jünger, Michael and Leipert, Sebastian and Mutzel, Petra
(1996)
On Computing a Maximal Planar Subgraph using PQ-Trees.
Technical Report
, 12 p.
Jünger, Michael and Mutzel, Petra
(2001)
Automatisches Layout von Diagrammen.
Published in:
OR news : das Magazin der GOR Vol. 5 (12).
pp. 5-12.
Jünger, Michael and Mutzel, Petra and Odenthal, Thomas and Scharbrodt, Mark
(1994)
The Thickness of Graphs without K5-Minors.
Technical Report
, 10 p.
Jünger, Michael and Schulz, Michael and Zychowicz, Wojciech
(2009)
GEODUAL: Fun with Geometric Duality.
Technical Report
, 20 p.
K
Korach, Ephraim and Nguyen, Thành and Peis, Britta
(2006)
Subgraph characterization of Red/Blue-split graphs and König-Egerváry graphs.
Published In:
SODA : Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Miami, FL., January 22 - 24, 2006 ACM 2006, pp. 842-850.
L
Liers, Frauke and Pardella, Gregor
(2010)
Preprocessing Maximum Flow Algorithms.
Technical Report
, 14 p.
M
Mallach, Sven
(2019)
A Natural Quadratic Approach to the Generalized Graph Layering Problem.
Published In:
Graph Drawing and Network Visualization: 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings, Lecture Notes in Computer Science. 11904 Springer 12 August 2019, pp. 532-544.
Mallach, Sven
(2011)
On separation pairs and split components of biconnected graphs.
Technical Report
, 16 p.
Mehlhorn, Kurt and Mutzel, Petra
(1996)
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm.
Published in:
Algorithmica Vol. 16 (2).
pp. 233-242.
Mehlhorn, Kurt and Mutzel, Petra and Näher, Stefan
(1994)
An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm.
Technical Report
, 46 p.
Moll, Christoph (1995) Das inverse Kürzeste-Wege-Problem. PhD thesis.
Mutzel, Petra
(1992)
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test.
Technical Report
, 26 p.
P
Peter, Markus and Wambach, Georg
(2000)
N-extendible posets, and how to minimize total weighted completion time.
Published in:
Discrete Applied Mathematics Vol. 99 (1-3).
pp. 157-167.
Porschen, Stefan
(2002)
On Generalizations of the Shadow Independent Set Problem.
Technical Report
, 18 p.
Porschen, Stefan
(2007)
On variable-weighted exact satisfiability problems.
Published in:
Annals of mathematics and artificial intelligence Vol. 51 (1).
pp. 27-54.
Porschen, Stefan and Speckenmeyer, Ewald
(2007)
Algorithms for Variable-Weighted 2-SAT and Dual Problems.
Technical Report
, 14 p.
Porschen, Stefan and Speckenmeyer, Ewald
(2007)
Clause Set Structures and Polynomial-Time SAT-Decidable Classes.
Technical Report
, 12 p.
Porschen, Stefan and Speckenmeyer, Ewald
(2007)
Clause set structures and satisfiability.
Technical Report
, 23 p.
Porschen, Stefan and Speckenmeyer, Ewald and Zhao, Xishun
(2006)
Linear CNF formulas and satisfiability.
Technical Report
, 37 p.
R
Rahman , Syed Asad and Bashton, Matthew and Holliday, Gemma L. and Schrader, Rainer and Thornton, Janet M.
(2009)
Small Molecule Subgraph Detector (SMSD) toolkit.
Published in:
Journal of Cheminformatics Vol. 1 (12).
Randerath, Bert and Schiermeyer, Ingo
(2004)
Vertex colouring and forbidden subgraphs - a survey.
Published in:
Graphs and Combinatorics Vol. 20 (1).
pp. 1-40.
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.
S
Schwikowski, B. and Speckenmeyer, Ewald
(1997)
On computing all minimal solutions for feedback problems.
Technical Report
, 10 p.
Srivastav, Anand and Stangier, Peter
(1993)
Integer Multicommodity Flows with Reduced Demands.
Published In:
AlgorithmsESA '93 : First Annual European Symposium Bad Honnef, Germany September 30 - October 2, 1993 Proceedings, Lecture notes in computer science. 726 Springer 1993, pp. 360-371.
Srivastav, Anand and Wolf, Katja
(1998)
Finding Dense Subgraphs with Semidefinite Programming.
Published In:
Approximation algorithms for combinatorial optimization : proceedings / International Workshop APPROX '98, Aalborg, Denmark, July 18 - 19, 1998, Lecture notes in computer science. 1444 Springer 1998, pp. 181-191.
W
Weil, Vera and Schaudt, Oliver
(2015)
On bounding the difference of the maximum degree and clique number.
Published in:
Graphs and Combinatorics Vol. 31 (5).
pp. 1689-1702.
ISSN 0911-0119