Publications

Filter:
 

Year: 2011

  • M. Holtgrewe, A.-K. Emde, D. Weese and K. Reinert. "A Novel And Well-Defined Benchmarking Method For Second Generation Read Mapping", BMC Bioinformatics, Vol. 12, May, 2011. [More] [Online version] [Bibtex]
  • C. Doll. "Hierarchical Cut Clustering in Dynamic Scenarios". 2011. [More] [Online version] [Bibtex]
  • W. Höhn, F. G. König, M. E. Lübbecke and R. H. Möhring. "Integrated sequencing and scheduling in coil coating", Management Science, Vol. 57. 2011, pp. 647-666. [More] [Bibtex]
  • M. Bastubbe. "Algorithms for Detecting Block Structures in Matrices". Diplomarbeit. Technische Universität Berlin. 2011. [More] [Bibtex]
  • S. D. Kuhnke. "Kompaktierung einer orthogonalen Zeichnung". Universität zu Köln. 2011. [More] [Bibtex]
  • M. Chimani and P. Hliněný. "A Tighter Insertion-based Approximation of the Crossing Number". International Colloquium on Automata, Languages and Programming (ICALP11). 2011. pp. 122-134. [More] [Bibtex]
  • C. Demetrescu, M. Kaufmann, S. G. Kobourov and P. Mutzel. "Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191)", Dagstuhl Reports, Vol. 1. 2011, pp. 47-60. [More] [Bibtex]
  • J. J. Fowler, M. Jünger, S. G. Kobourov and M. Schulz. "Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges", Comput. Geom., Vol. 44. 2011, pp. 385-398. [More] [Bibtex]
  • H.-M. Wong. "Upward Planarization and Layout". TU Dortmund. 2011. [More] [Bibtex]
  • T. Koch et al. "MIPLIB 2010", Mathematical Programming Computation, Vol. 3. 2011, pp. 103-163. [More] [Online version] [Bibtex]
  • W. Cook, T. Koch, D. E. Steffy and K. Wolter. "An Exact Rational Mixed-Integer Programming Solver". IPCO 2011: Proceedings of the 15th International Conference on Integer Programming and Combinatoral Optimization. O. Günlük and G. J. Woeginger eds. 2011. pp. 104-116. [More] [Online version] [Bibtex]
  • A. May, A. Meurer and E. Thomae. "Decoding Random Linear Codes in O(2^{0.054n})", Advances in Cryptology -- ASIACRYPT 2011, Springer LNCS, Vol. 7073. 2011, pp. 107-124. [More] [Online version] [Bibtex]
  • S. Eggert, L. Kliemann, P. Munstermann and A. Srivastav. "Bipartite Matching in the Semi-Streaming Model", Algorithmica, Vol. 63. 2011, pp. 490-508. [More] [Bibtex]
  • T. Stadler. "Konstruktion von komprimierten Indizes für riesige Texte". Technische Universität München. 2011. [More] [Online version] [Bibtex]
  • S. Kottler and M. Kaufmann. "SArTagnan - A parallel portfolio SAT solver with lockless physical clause sharing". Pragmatics of SAT. 2011. [More] [Bibtex]
  • M. Kaufmann and S. Kottler. "Beyond Unit Propagation in SAT Solving". Symposium on Experimental Algorithms. 2011. [More] [Online version] [Bibtex]
  • M. El Ouali, A. Fretwurst and A. Srivastav. "Inapproximability of $b$-Matching in $k$-uniform Hypergraphs". Proceedings of the 5th International Workshop on Algorithms and Computation, New Delhi, India, February 2011 (WALCOM 2011). 2011. pp. 57-69. [More] [Bibtex]
  • L. Kliemann. "Matching in Bipartite Graph Streams in a Small Number of Passes (Extended Abstract)". Proceedings of the 10th International Symposium on Experimental and Efficient Algorithms, Kolimpari, Chania, Crete, Greece, May 2011 (SEA 2011). 2011. pp. 254-266. [More] [Bibtex]
  • T. Gellert, W. Höhn and R. H. Möhring. "Sequencing and Scheduling for Filling Lines in Dairy Production", Optimization Letters, Vol. 5. 2011, pp. 491-504. [More] [Online version] [Bibtex]
  • W. Höhn, F. G. König, M. E. Lübbecke and R. H. Möhring. "Integrated Sequencing and Scheduling in Coil Coating", Management Science, Vol. 57. 2011, pp. 647-666. [More] [Online version] [Bibtex]
  • B. Doerr, M. Künnemann and M. Wahlström. "Dependent Randomized Rounding: The Bipartite Case". ALENEX. 2011. pp. 96-106. [More] [Bibtex]
  • M. Goerigk and A. Schöbel. "Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem". Proc. of the 10th International Symposium on Experimental Algorithms (SEA 11). P. M. Pardalos and S. Rebennack eds. 2011. pp. 181-192. [More] [Bibtex]
  • M. R. Ackermann, J. Blömer and C. Scholz. "Hardness and Non-Approximability of Bregman Clustering Problems", Electronic Colloquium on Computational Complexity, ECCC, Vol. 18. 2011, pp. 1-20. [More] [Online version] [Bibtex]
  • A. Beckmann, U. Meyer, P. Sanders and J. Singler. "Energy-efficient sorting using solid state disks", Sustainable Computing: Informatics and Systems, Vol. 1. 2011, pp. 151-163. [More] [Bibtex]
  • B. Peis and A. Wiese. "Universal packet routing with arbitrary bandwidths and transit times". Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO 2011). 2011. [More] [Online version] [Bibtex]
Results 26 - 50 of 271
<< Start < Prev 1 2 3 4 5 6 7 8 9 10 Next > End >>