A. Becker, A. Joux, A. May and A. Meurer. "Decoding Random Binary Linear Codes in 2^(n/20): How 1+1=0 Improves Information Set Decoding", Advances in Cryptology -- EUROCRYPT 2012, LNCS. 2012.[More][Bibtex]
Year: 2011
A. Dau and J. Krugel. "tt-analyze and tt-generate: Tools to Analyze and Generate Sequences with Trained Statistical Properties". German Conference on Bioinformatics 2011, Weihenstephan, Germany (GCB 2011). 2011.[More][Bibtex]
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]
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. 2011.[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]
W. Höhn and T. Jacobs. "Single Machine Scheduling with Weighted Nonlinear Cost". Technische Universität Berlin. Tech. Rep. 008-2011. 2011.[More][Online version][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]
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. 2011.[More][Bibtex]
M. Chimani, P. Hliněný and P. Mutzel. "Vertex insertion approximates the crossing number for apex graphs". 2011.[More][Bibtex]
K. Klein, N. Kriege and P. Mutzel. "CT-Index: Fingerprint-based graph indexing combining cycles and trees". ICDE. 2011.[More][Bibtex]
M. Chimani and P. Hliněný. "A Tighter Insertion-based Approximation of the Crossing Number". 2011.[More][Bibtex]
