Items where Subject is "68-XX Computer science > 68Rxx Discrete mathematics in relation to computer science > 68R10 Graph theory"

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

Kern, Walter (1993) On the Depth of Combinatorial Optimization Problems.
Published in: Discrete applied mathematics Vol. 43 (2). pp. 115-129.

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.

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.

Middendorf, Matthias and Pfeiffer, Frank (1993) On the Complexity of the Disjoint Path Problem.
Published in: Combinatorica Vol. 13 (1). pp. 97-107.

Fellows, Michael and Kratochvil, Jan and Middendorf, Matthias and Pfeiffer, Frank (1995) The Complexity of Induced Minors and Related Problems.
Published in: Algorithmica Vol. 13 (3). pp. 266-282.

Middendorf, Matthias and Pfeiffer, Frank (1990) The Paths-Selection-Problem.
Published In: Polyhedral combinatorics : proceedings of a DIMACS Workshop ; June 12 - 16, 1989, DIMACS series in discrete mathematics and theoretical computer science. 1 1990, pp. 179-187.

Mutzel, Petra (1992) A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test.
Technical Report , 26 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.

Mutzel, Petra (1994) s-Chorded Cycle Graphs and their Relation to the Planar Subgraph Polytope.
Technical Report , 13 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.

Jünger, Michael and Mutzel, Petra and Odenthal, Thomas and Scharbrodt, Mark (1994) The Thickness of Graphs without K5-Minors.
Technical Report , 10 p.

Moll, Christoph (1995) Das inverse Kürzeste-Wege-Problem. PhD thesis.

Bose, Prosenjit K. and Everett, Hazel and Fekete, Sandor P. and Lubiw, Anna and Meijer, Henk and Romanik, Kathleen A. and Shermer, Thomas C. and Whitesides, Sue (1993) On a visibility representation for graphs in three dimensions.
Published In: Graph drawing : 9th international symposium ; ALCOM International Workshop Paris 1993 on Graph Drawing and Topological Graph Algorithms Alcom 1993, pp. 38-39.

Fekete, Sandor P. and Houle, Michael and Whitesides, Sue (1996) New results on a visibility representation of graphs in 3D.
Published In: Graph drawing : Symposium on Graph Drawing, GD '95, Passau, Germany, September 20 - 22, 1995 ; proceedings, Lecture notes in computer science. 1027 Springer 1996, pp. 234-241.

Hochstättler, Winfried (1996) Semidefinite Programmierung.
Technical Report , 95 p.

Fekete, Sandor P. and Meijer, Henk (1999) Rectangle and Box Visibility Graphs in 3D.
Published in: International Journal of Computational Geometry and Applications : : IJCGA Vol. 9 (1). pp. 1-27.

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1996) On Computing a Maximal Planar Subgraph using PQ-Trees.
Technical Report , 12 p.

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.

Bose, Prosenjit K. and Everett, Hazel and Fekete, Sandor P. and Houle, Michael and Lubiw, Anna and Meijer, Henk and Romanik, Kathleen A. and Rote, Günter and Shermer, Thomas C. and Whitesides, Sue and Zelle, Christian (1998) On a visibility representation for graphs in 3D.
Published in: Journal of Graph Algorithms and Applications Vol. 2 (3). pp. 1-16.

Fekete, Sandor P. and Houle, Michael and Whitesides, Sue (1997) The wobbly logic engine: proving hardness of non-rigid geometric graph representations.
Published In: Graph drawing : 5th international symposium, GD '97, Rome, Italy, September 18 - 20, 1997 ; proceedings, Lecture notes in computer science. 1353 Springer 1997, pp. 272-283.

Heinrichs, Udo and Moll, Christoph (1997) On the scheduling of one-dimensional transport systems.
Technical Report , 18 p.

Fekete, Sandor P. (1997) Geometric Ideas for Graph Representation and for Cooperative Game Theory.
Technical Report , 54 p.

Dahlhaus, Elias (2000) Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition.
Published in: Journal of Algorithms Vol. 36 (2). pp. 205-240.

Dahlhaus, Elias (1998) A Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization.
Technical Report , 18 p.

Dahlhaus, Elias (1998) Minimal Elimination Orderings for Planar Graphs.
Published In: Algorithm theory : proceedings / SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 8 - 10, 1998, Lecture notes in computer science. 1432 Springer 1998, pp. 210-221.

Dahlhaus, Elias (1999) An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable.
Technical Report , 10 p.

Dahlhaus, Elias (1999) Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.
Technical Report , 13 p.

Dahlhaus, Elias (1997) Minimal Elimination Ordering Inside a Given Chordal Graph.
Published In: Graph-theoretic concepts in computer science : 23th international workshop, WG '97, Berlin, Germany, June 18 - 20, 1997 ; proceedings, Lecture notes in computer science. 1335 Springer 1997, pp. 132-143.

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.

Schliep, Alexander and Hochstättler, Winfried and Pattberg, Torsten (2001) Rule-based Animation of Algorithms using Animated Data Structures in Gato.
Technical Report p.

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.

Randerath, Bert and Schiermeyer, Ingo (2004) Vertex colouring and forbidden subgraphs - a survey.
Published in: Graphs and Combinatorics Vol. 20 (1). pp. 1-40.

Giesselbach, Christian (2005) Ein Färbungsproblem in partitionierten Graphen. Masters thesis.

Fuchs, Bernhard and Kern, Walter and Wang, Xinhui (2007) The number of tree stars is O^*(1.357^k).
Published in: Algorithmica Vol. 49 (3). pp. 232-244.

Zheng, Lanbo and Buchheim, Christoph (2007) A New Exact Algorithm for the Two-Sided Crossing Minimization Problem.
Published In: Combinatorial optimization and applications first international conference, COCOA 2007, Xi'an, China, August 14-16, 2007 ; proceedings, Lecture Notes in Computer Science. 4616 Springer 2007, pp. 301-310.

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

Engels, Birgit and Pardella, Gregor (2009) A Note on the Complexity of Sliding Shortest Paths.
Technical Report , 4 p.

Lemaic, Mile and Speckenmeyer, Ewald (2009) Markov-Chain-Based Heuristics for the Minimum Feedback Vertex Set Problem.
Technical Report , 21 p.

Liers, Frauke and Pardella, Gregor (2012) Partitioning planar graphs: a fast combinatorial approach for max-cut.
Published in: Computational Optimization and Applications. pp. 323-344.

Mallach, Sven (2011) On separation pairs and split components of biconnected graphs.
Technical Report , 16 p.

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.

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

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.

Lückerath, Daniel and Ullrich, Oliver and Kupicha, Aleksander and Speckenmeyer, Ewald (2014) Multi-depot multi-vehicle-type vehicle scheduling for Cologne’s tram network.
Published In: Proceedings of ASIM-Workshop STS/GMMS 2014, ASIM Mitteilungen. AM 149 ARGESIM/ASIM Pub., TU Vienna/Austria, Scheible, J.; Bausch-Gall, I.; Deatcu, C. (Ed.) February 2014, pp. 191-197.

Engels, Birgit and Schrader, Rainer (2015) Freight car dispatching with generalized flows.
Published in: Networks Vol. 66 (1). pp. 33-39. ISSN 1097-0037

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.

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.

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

Mallach, Sven (2015) A practical mixed-integer programming model for the vertex separation number problem.
Working Paper , 8 p.

Mallach, Sven (2017) Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.
To appear In: Proceedings 28th International Workshop On Combinatorial Algorithms (IWOCA), Lecture Notes in Computer Science. Springer 2017.

Bose, Prosenjit K. and Everett, Hazel and Fekete, Sandor P. and Lubiw, Anna and Meijer, Henk and Romanik, Kathleen A. and Shermer, Thomas C. and Whitesides, Sue (1994) On a visibility representation for graphs in three dimensions.
Technical Report , 24 p.

Dahlhaus, Elias (1998) Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization (Extended Abstract).
Published In: Theoretical informatics : proceedings / LATIN '98, Third Latin American Symposium, Campinas, Brazil, April 20 - 24, 1998, Lecture notes in computer science. 1380 Springer 1998, pp. 239-248.

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.

This list was generated on Thu Aug 17 04:02:41 2017 CEST.