Items where Subject is "68-XX Computer science > 68Wxx Algorithms > 68W01 General"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: B | D | E | F | G | H | J | L | M | P | R
Number of items at this level: 17.


Bomze, Immanuel and Chimani, Markus and Jünger, Michael and Ljubic, Ivana and Mutzel, Petra and Zey, Bernd (2010) Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.
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.


Engels, Birgit and Krumke, Sven and Schrader, Rainer and Zeck, Christiane (2009) Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2.
Published In: Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization 2009, pp. 239-243.

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


Fekete, Sandor P. (1992) Finding all anchored squares in a convex polygon in subquadratic time.
Published In: Proceedings of the Fourth Canadian Conference on Computational Geometry : St. John’s, Newfoundland, August 10 - 14, 1992 Memorial Univ. of Newfoundland, Dep. of Computer Science 1992, pp. 71-76.


Groß, Martin and Plümpe, Daniel R. and Schmidt, Melanie (2009) Kreuzzahlrätsel: Sudokus waren gestern.
Published in: Informatik Spektrum Vol. 32 (6). pp. 538-545. ISSN 0170-6012


Hachul, Stefan and Jünger, Michael (2004) Drawing Large Graphs with a Potential -Field-Based Multilevel Algorithm.
Published In: Graph drawing: 12th international symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004; revised selected papers, Lecture Notes in Computer Science. 3383 Springer 2004, pp. 285-295.

Hachul, Stefan and Jünger, Michael (2006) An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs.
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.

Hachul, Stefan and Jünger, Michael (2007) Large-Graph Layout Algorithms at Work: An Experimental Study.
Published in: Journal of Graph Algorithms and Applications Vol. 11 (21). pp. 345-369.

Hachul, Stefan and Jünger, Michael (2005) Large-Graph Layout with the Fast Multipole Multilevel Method.
Technical Report , 27 p.


Jabrayilov, Adalat and Mallach, Sven and Mutzel, Petra and Rüegg, Ulf and von Hanxleden, Reinhard (2016) Compact Layered Drawings of General Directed Graphs.
To appear In: Proceedings of the 24th International Symposium on Graph Drawing & Network Visualization, Lecture Notes in Computer Science. 9801 Springer 2016.


Liers, Frauke and Nieberg, Tim and Pardella, Gregor (2011) Via Minimization in VLSI Chip Design - Application of a Planar Max-Cut Algorithm.
Technical Report , 15 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 (2016) Improved Mixed-Integer Programming Models for Multiprocessor Scheduling with Communication Delays.
Technical Report , 30 p.

Mallach, Sven (2015) More General Optimal Offset Assignment.
Published in: Leibniz Transactions on Embedded Systems Vol. 2 (1). 02--1-02--18. ISSN 2199-2002


Pfenning, Jörg-Thomas and Moll, Christoph (1995) Optimized communication patterns on workstation clusters.
Published in: Parallel Computing Vol. 21 (3). pp. 373-388.


Randerath, Bert and Schiermeyer, Ingo (2004) Exact algorithms for MINIMUM DOMINATING SET.
Technical Report , 8 p.

This list was generated on Mon Oct 23 10:25:35 2017 CEST.