Year: 2011

  • M. Niemeier, A. Wiese and S. Baruah. "Partitioned real-time scheduling on heterogeneous shared-memory multiprocessors". Proceedings of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011). 2011. [More] [Online version] [Bibtex]
  • S. Sondern. "Konzeption und Realisierung einer Graphenbibliothek zur Evaluierung von Visualisierungsmethoden für Graphen". Technische Universit{\"a}t Dortmund. 2011. [More] [Bibtex]
  • C. Erten et al. "Colored Simultaneous Geometric Embeddings and Universal Pointsets", Algorithmica, Vol. 3. 2011, pp. 569-592. [More] [Bibtex]
  • K. Klein, N. Kriege and P. Mutzel. "CT-Index: Fingerprint-based graph indexing combining cycles and trees". International Conference on Data Engineering (ICDE). 2011. pp. 1115-1126. [More] [Bibtex]
  • M. Chimani, P. Hungerländer, M. Jünger and P. Mutzel. "An SDP Approach to Multi-level Crossing Minimization", Workshop on Algorithm Engineering and Experiments 2011 (ALENEX11). 2011. [More] [Bibtex]
  • K. Klein. "Interactive Graph Drawing with Constraints". TU Dortmund. 2011. [More] [Bibtex]
  • J. Desrosiers and M. E. Lübbecke. "Branch-Price-and-Cut Algorithms". J. J. Cochran ed. Chichester : John Wiley & Sons. 2011. [More] [Bibtex]
  • M. E. Lübbecke. "Column Generation". J. J. Cochran ed. Chichester : John Wiley & Sons. 2011. [More] [Bibtex]
  • C. Puchert. "Primal Heuristics for Branch-and-Price Algorithms". Technische Universität Darmstadt. 2011. [More] [Bibtex]
  • M. Bergner, A. Caprara, F. Furini, M. E. Lübbecke, E. Malaguti and E. Traversi. "Partial convexification of general MIPs by Dantzig-Wolfe reformulation". Integer Programming and Combinatorial Optimization. 2011. pp. 39-51. [More] [Bibtex]
  • D. E. Steffy and K. Wolter. "Valid Linear Programming Bounds for Exact Mixed-Integer Programming". Zuse Institute Berlin. Tech. Rep. 11-08. 2011. [More] [Online version] [Bibtex]
  • N. Megow, R. H. Möhring and J. Schulz. "Decision Support and Optimization in Shutdown and Turnaround Scheduling", INFORMS Journal on Computing, Vol. 23. 2011, pp. 189-204. [More] [Online version] [Bibtex]
  • B. Peis and A. Wiese. "Throughput Maximization for Periodic Packet Routing on Trees and Grids". 8th Workshop on Approximation and Online Algorithms (WAOA 2010). 2011. [More] [Online version] [Bibtex]
  • A. Karrenbauer and T. Rothvoß. "A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks". Proceedings of the 8th International Workshop on Approximation and Online Algorithms (WAOA 2010). 2011. pp. 166-177. [More] [Bibtex]
  • M. Gronemann, M. Jünger, S. Mallach and D. R. Schmidt. "Towards shortest longest edges in orthogonal graph drawing". 2011. [More] [Bibtex]
  • S. Mallach. "On separation pairs and split components of biconnected graphs". 2011. [More] [Bibtex]
  • M. Salehi. "Effiziente Heuristiken zur Extraktion von Kuratowski-Subgraphen". Universität zu Köln. 2011. [More] [Bibtex]
  • M. Schallaböck. "New Optimal Compaction Strategies for Orthogonal Graph Layout". Lehrstuhl für Algorithm Engineering, Fakultät für Informatik, Technische Universität Dortmund. 2011. [More] [Bibtex]
  • M. Chimani, C. Gutwenger, P. Mutzel and H.-M. Wong. "Upward Planarization Layout", Journal of Graph Algorithms and Applications, Vol. 15. 2011, pp. 127-155. [More] [Bibtex]
  • N. T. Doncheva, K. Klein, F. S. Domingues and M. Albrecht. "Analyzing and visualizing residue networks of protein structures", Trends in Biochemical Sciences, Vol. 36. 2011, pp. 179 - 182. [More] [Online version] [Bibtex]
  • B. Doerr, T. Friedrich, M. Künnemann and T. Sauerwald. "Quasirandom Rumor Spreading: An Experimental Analysis", Journal of Experimental Algorithmics. 2011. [More] [Bibtex]
  • B. Doerr and M. Fouz. "Asymptotically Optimal Randomized Rumor Spreading". ICALP. 2011. [More] [Bibtex]
  • B. Doerr, M. Fouz and T. Friedrich. "Social Networks Spread Rumors in Sublogarithmic Time". STOC. 2011. [More] [Bibtex]
  • R. Görke, T. Hartmann and D. Wagner. "Dynamic Graph Clustering Using Minimum-Cut Trees". 2011. [More] [Bibtex]
  • R. Görke, P. Maillard, A. Schumm, C. Staudt and D. Wagner. "Dynamic Graph Clustering Combining Modularity and Smoothness". 2011. [More] [Bibtex]
Results 51 - 75 of 271
<< Start < Prev 1 2 3 4 5 6 7 8 9 10 Next > End >>