Items where Subject is "68-XX Computer science > 68Rxx Discrete mathematics in relation to computer science > 68R05 Combinatorics"

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

Srivastav, Anand and Stangier, Peter (1992) On Derandomized Approximation Algorithms.
Technical Report , 32 p.

Srivastav, Anand and Stangier, Peter (1995) Weighted Fractional and Integral k-Matching in Hypergraphs.
Published in: Discrete Applied Mathematics Vol. 57 (2-3). pp. 255-269.

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.

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.

Fekete, Sandor P. and Woeginger, Gerhard J. (1997) Angle-Restricted Tours in the Plane.
Published in: Computational Geometry Vol. 8 (4). pp. 195-218.

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.

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

Räbiger, Dirk (2004) Semi-preemptive routing on a line.
Published in: Electronic Notes in Discrete Mathematics Vol. 17. pp. 241-246.

Räbiger, Dirk (2004) Semi-preemptive routing on a linear and circular track.
Technical Report , 16 p.

Räbiger, Dirk (2005) Semi-Präemptives Transportieren. PhD thesis.

Krumke, Sven and Räbiger, Dirk and Schrader, Rainer (2008) Semi-Preemptive Routing on Trees.
Published in: Discrete Applied Mathematics Vol. 156 (17). pp. 3298-3304.

Räbiger, Dirk and Schrader, Rainer (2009) Semi-preemptive routing on a linear and circular track.
Published in: Discrete Optimization Vol. 6 (3). pp. 223-230.

Neuhaus, Stefan (2009) Eigenschaften kleinster dominierender Mengen und Dominanzzahlen von Damengraphen. PhD thesis.

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.

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.

Faigle, Ulrich and Schrader, Rainer (1988) On the convergence of stationary dirstributions in simulated annealing algorithms.
Published in: Information Processing Letters Vol. 27 (4). pp. 189-194.

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.

Groß, Martin and Kappmeier, Jan-Philipp W. and Schmidt, Daniel R. and Schmidt, Melanie (2012) Approximating Earliest Arrival Flows in Arbitrary Networks.
Published In: Algorithms – ESA 2012, Lecture Notes in Computer Science. 7501 Springer 2012, pp. 551-562.

Dressler, Daniel and Groß, Martin and Kappmeier, Jan-Philipp W. and Kelter, Timon and Kulbatzki, Joscha and Plümpe, Daniel R. and Schlechter, Gordon and Schmidt, Melanie and Skutella, Martin and Temme, Sylvie (2010) On the Use of Network Flow Techniques for Assigning Evacuees to Exits.
Published in: Procedia Engineering Vol. 3. pp. 205-215. ISSN 1877-7058

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

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

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.

Lohmann, Matthias and Ullrich, Oliver and Molina Madrid, Manuel and Lückerath, Daniel and Speckenmeyer, Ewald (2014) The team priority assignment problem.
Technical Report , 12 p.

Kappmeier, Jan-Philipp W. and Schmidt, Daniel R. and Schmidt, Melanie (2015) Solving k-means on High-Dimensional Big Data.
Published In: 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings, Lecture Notes in Computer Science. 9125 Springer 2015, pp. 259-270.

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.

This list was generated on Mon Aug 21 04:02:39 2017 CEST.