max planck institut
informatik
informatik
Ailon, N., N. Avigdor-Elgrabli, N. Liberty and A. van Zuylen: Improved approximation algorithms for bipartite correlation clustering. In: Algorithms - ESA 2011 : 19th Annual European Symp., Lect. Notes Comput. Sci. 6942, (Eds.) C. Demetrescu, M.M. Halldórsson. Springer, Berlin 2011, 25-36.
Alkassar, E., S. Böhme, K. Mehlhorn and C. Rizkallah: Verification of certifying computations. In: Computer Aided Verification : 23rd Int. Conf., CAV 2011, Lect. Notes Comput. Sci. 6806, (Eds.) G. Gopalakrishnan, S. Qadeer. Springer, Heidelberg 2011, 67-82.
Althaus, E., S. Canzar, K. Elbassioni, A. Karrenbauer and J. Mestre: Approximation algorithms for the interval constrained coloring problem. Algorithmica 61, 342-361 (2011).
Althaus, E., J. Kupilas and R. Naujoks: On the low-dimensional Steiner minimum tree problem in Hamming metric. In: Theory and Applications of Models of Computation : 8th Annual Conf., TAMC 2011, Lect. Notes Comput. Sci. 6648, (Eds.) M. Ogihara, J. Tarui. Springer, Heidelberg 2011, 308-319.
Anand, S., N. Garg and N. Megow: Meeting deadlines: how much speed suffices?. In: Automata, Languages and Programming : 38th Int. Colloquium, ICALP 2011. - Pt. I, Lect. Notes Comput. Sci. 6755, (Eds.) L. Aceto, M. Henzinger, J. Sgall. Springer, Heidelberg 2011, 232-243.
Arumugam, S., K.R. Chandrasekar, N. Misra, G. Philip and S. Saurabh: Algorithmic aspects of dominator colorings in graphs. In: Combinatorial Algorithms - 22nd Int. Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, Lect. Notes Comput. Sci. 7056, (Eds.) C.S. Iliopoulos, W.F. Smyth. Springer, Berlin 2011, 19-30.
Asano, T. and B. Doerr: Memory-constrained algorithms for shortest path problem. In: 23rd Annual Canadian Conf. on Computational Geometry (CCCG 2011). [***Warning: Publishers name missing!], - 2011, 315-319.
Auger, A. and B. Doerr: (Eds.): Theory of randomized search heuristics.. World Scientific Publishing, Singapore 2011, 382 p.
Bansal, N., H.-L. Chan and K. Pruhs: Competitive algorithms for due date schedulin. Algorithmica 59, 569-582 (2011).
Bar-Yehuda, R., D. Hermelin and D. Rawitz: Minimum vertex cover in rectangle graphs. Computational Geometry 44, 356-364 (2011).
Baruah, S., V. Bonifaci, G. D'Angelo, A. Marchetti-Spaccamela, S. van der Ster and L. Stougie: Mixed-criticality scheduling of sporadic task systems. In: Algorithms - ESA 2011 : 19th Annual European Symp., Lect. Notes Comput. Sci. 6942, (Eds.) C. Demetrescu, M.M. Halldórsson. Springer, Berlin 2011, 555-566.
Baswana, S., T. Kavitha, K. Mehlhorn and S. Pettie: Additive spanners and (α, β)-spanners. ACM Transactions on Algorithms 7, 5:1-5:26 (2011).
Beier, R., S. Funke, D. Matijevic and P. Sanders: Energy-Efficient paths in radio networks. Algorithmica 61, 298-319 (2011).
Ben-Zwi, O., D. Hermelin, D. Lokshtanov and I. Newman: Treewidth governs the complexity of target set selection. Discrete Optimization 8, 87-96 (2011).
Berberich, E., P. Emeliyanenko, A. Kobel and M. Sagraloff: Arrangement computation for planar algebraic curves. In: Proc. 4th Internal Workshop on Symbolic-Numeric Computation, (Ed.) M. Moreno Maza. ACM, New York 2011, 88-98.
Berberich, E., P. Emeliyanenko and M. Sagraloff: An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks. In: 2011 Proc. Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), (Eds.) M. Müller-Hannemann, R. Werneck. SIAM, Philadelphia 2011, 35-47.
Berberich, E., D. Halperin, M. Kerber and R. Pogalnikova: Deconstructing approximate offsets. In: Proc. 27th Annual Symp. on Computational Geometry (SCG'11), (Eds.) F. Hurtado, M. van Krefeld. ACM, New York 2011, 187-196.
Berberich, E., M. Hemmer and M. Kerber: A generic algebraic kernel for non-linear geometric applications. In: Proc. 27th Annual Symp. on Computational Geometry (SCG'11), (Eds.) F. Hurtado, M. van Krefeld. ACM, New York 2011, 179-186.
Berenbrink, P., C. Cooper, T. Friedetzky, T. Friedrich and T. Sauerwald: Randomized diffusion for indivisible loads. In: 22nd ACM-SIAM Symp. on Discrete Algorithms (SODA-11), (Ed.) D. Randall. SIAM, Philadelphia 2011, 429-439.
Berenbrink, P., T. Friedetzky, R. Elsaesser, L. Nagel and T. Sauerwald: Faster coupon collecting via replication with applications in gossiping. In: 36th Int. Symp. on Mathematical Foundations of Computer Science (MFCS-11), Lect. Notes Comput. Sci. 6907, (Eds.) F. Murlak, P. Sankowski. Springer, Berlin 2011, 72-83.
Berenbrink, P., M. Hoefer and T. Sauerwald: Distributed selfish load balancing on networks. In: 22nd ACM-SIAM Symp. on Discrete Algorithms (SODA-11), (Ed.) D. Randall. SIAM, Philadelphia 2011, 1487-1497.
Bonifaci, V., P. Korteweg, A. Marchetti-Spaccamela and L. Stougie: Minimizing flow time in the wireless gathering problem. ACM Transactions on Algorithms 7, 33:1-33:20 (2011).
- The distributed wireless gathering problem. Theoretical Computer Science 412, 633-641 (2011).
Boros, E., K. Elbassioni, M. Fouz, V. Gurvich, K. Makino and B. Manthey: Stochastic mean payoff games: smoothed analysis and approximation schemes. In: Automata, Languages and Programming : 38th Int. Colloquium, ICALP 2011, Lect. Notes Comput. Sci. 6755, (Eds.) L. Aceto, M. Henzinger, J. Sgall. Springer, Berlin 2011, 147-158.
Boros, E., K. Elbassioni, V. Gurvich and H.R. Tiwary: The negative cycles polyhedron and hardness of checking some polyhedral properties. Annals of Operations Research 188, 63-76 (2011).
Bredereck, R., A. Nichterlein, R. Niedermeier and G. Philip: Pattern-Guided data anonymization and clustering. In: Mathematical Foundations of Computer Science 2011 - 36th Int. Symp., MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proc., Lect. Notes Comput. Sci. 6907, (Eds.) F. Murlak, P. Sankowski. Springer, Berlin 2011, 182-193.
- The effect of homogeneity on the complexity of $k$-anonymity. In: Fundamentals of Computation Theory - 18th Int. Symp., FCT 2011, Oslo, Norway, August 22-25, 2011. Proc., Lect. Notes Comput. Sci. 6914, (Eds.) O. Owe, M. Steffen, J.A. Telle. Springer, Berlin 2011, 53-64.
Bringmann, K. and T. Friedrich: Convergence of hypervolume-based archiving algorithms I: Effectiveness. In: GECCO 2011 : Genetic and Evolutionary Computation Conf., (Eds.) N. Krasnogor, P.L. Lanzim. ACM, New York 2011, 745-752.
Bringmann, K., T. Friedrich, F. Neumann and M. Wagner: Approximation-guided evolutionary multi-objective optimization. In: Proc. Twenty-Second Int. Joint Conf. on Artificial Intelligence (IJCAI 2011), (Ed.) T. Walsh. AAAI Press, Menlo Park 2011, 1198-1203.
Canzar, S., K. Elbassioni, G.W. Klau and J. Mestre: On tree-constrained matchings and generalizations. In: Automata, Languages and Programming : 38th Int. Colloquium, ICALP 2011, Lect. Notes Comput. Sci. 6755, (Eds.) L. Aceto, M. Henzinger, J. Sgall. Springer, Berlin 2011, 98-109.
Chan, H.-L., J. Edmonds, T.-W. Lam, L.-K. Lee, A. Marchetti-Spaccamela and K. Pruhs: Nonclairvoyant speed scaling for flow and energy. Algorithmica 61, 507-517 (2011).
Chan, T.-.H.H. and K. Elbassioni: A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics. Discrete & Computational Geometry 46, 704-723 (2011).
Chin, F.Y.L., Z. Guo and H. Sun: Minimum Manhattan network is NP-Complete. Discrete & Computational Geometry 45, 701-722 (2011).
Christodoulou, G., K. Mehlhorn and E. Pyrga: Improving the price of anarchy for selfish routing via coordination mechanisms. In: Algorithms - ESA 2011 : 19th Annual European Symp., Lect. Notes Comput. Sci. 6942, (Eds.) C. Demetrescu, M.M. Halldórsson. Springer, Berlin 2011, 119-130.
Cygan, M., G. Philip, M. Pilipczuk, M. Pilipczuk and J.O. Wojtaszczyk: Dominating set is fixed parameter tractable in claw-free graphs. Theoretical Computer Science 412, 6982-7000 (2011).
De Sterck, H., K. Miller, G. Sanders and M. Winlaw: Recursively accelerated multilevel aggregation for Markov chains. SIAM Journal on Scientific Computing 32, 1652-1671 (2011).
Doerr, B.: Drift analysis. In: GECCO 2011 : Genetic and Evolutionary Computation Conf., (Eds.) N. Krasnogor, P.L. Lanzi. ACM, New York 2011, 1311-1320.
Doerr, B., A. Eremeev, F. Neumann, M. Theile and C. Thyssen: Evolutionary algorithms and dynamic programming. Theoretical Computer Science 412, 6020-6035 (2011).
Doerr, B. and M. Fouz: Asymptotically optimal randomized rumor spreading. In: Automata, Languages and Programming : 38th Int. Colloquium, ICALP 2011, Lect. Notes Comput. Sci. 6756, (Eds.) L. Aceto, M. Henzinger, J. Sgall. Springer, Berlin 2011, 502-513.
- Quasi-random rumor spreading: Reducing randomness can be costly. Information Processing Letters 111, 227-230 (2011).
Doerr, B., M. Fouz and T. Friedrich: Social networks spread rumors in sublogarithmic time. In: STOC'11 : Proc. 43rd ACM Symp. on Theory of Computing. ACM, New York 2011, 21-30.
Doerr, B., M. Fouz and C. Witt: Sharp bounds by probability-generating functions and variable drift. In: GECCO 2011 : Genetic and Evolutionary Computation Conf., (Eds.) N. Krasnogor, P.L. Lanzi. ACM, New York 2011, 2083-2090.
Doerr, B., T. Friedrich, M. Künnemann and T. Sauerwald: Quasirandom rumor spreading: an experimental analysis. ACM Journal of Experimental Algorithmics 16, Article No. 3.3 (2011).
Doerr, B., L.A. Goldberg, L. Minder, T. Sauerwald and C. Scheideler: Stabilizing consensus with the power of two choices. In: 23rd ACM Symp. on Parallelism in Algorithms and Architectures (SPAA-11) [***Warning: Editor(s) might be missing!]. ACM, New York 2011, 149-158.
Doerr, B., E. Happ and C. Klein: Tight analysis of the (1+1)-EA for the single source shortest path problem. Evolutionary Computation 19, 673-691 (2011).
Doerr, B. and T. Jansen: Theory of evolutionary computation. Algorithmica 59, 299-300 (2011).
Doerr, B., D. Johannsen, T. Kötzing, P.C. Lehre, M. Wagner and C. Winzen: Faster black-box algorithms through higher arity operators. In: Proc. 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), (Eds.) H.-G. Beyer, W. Langdon. ACM, New York 2011, 163-172.
Doerr, B., D. Johannsen and M. Schmidt: Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. In: FOGA'11 : Proc. 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, (Eds.) H.-G. Beyer, W. Langdon. ACM, New York 2011, 119-126.
Doerr, B., T. Kötzing and C. Winzen: Too fast unbiased black-box algorithms. In: GECCO 2011 : Genetic and Evolutionary Computation Conf., (Eds.) N. Krasnogor, P.L. Lanzi. ACM, New York 2011, 2043-2050.
Doerr, B., M. Künnemann and M. Wahlström: Dependent randomized rounding: The bipartite case. In: 2011 Proc. Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), (Eds.) M. Müller-Hannemann, R. Werneck. SIAM, Philadelphia 2011, 96-106.
Doerr, B., J. Lengler, T. Kötzing and C. Winzen: Black-box complexities of combinatorial problems. In: GECCO 2011 : Genetic and Evolutionary Computation Conf., (Eds.) N. Krasnogor, P.L. Lanzi. ACM, New York 2011, 981-988.
Doerr, B., F. Neumann, D. Sudholt and C. Witt: Runtime analysis of the 1-ANT ant colony optimizer. Theoretical Computer Science 412, 1629-1644 (2011).
Doerr, B. and C. Winzen: Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity. In: Computer Science - Theory and Applications : 6th Int. Computer Science Symp. in Russia (CSR 2011), Lect. Notes Comput. Sci. 6651, (Eds.) A. Kulikov, N. Vereshchagin. Springer, Berlin 2011, 15-28.
Elbassioni, K., A. Elmasry and K. Makino: Finding simplices containing the origin in two and three dimensions. International Journal of Computational Geometry & Applications 21, 495-506 (2011).
Elbassioni, K., E. Krohn, D. Matijevic, J. Mestre and D. Severdija: Improved approximations for guarding 1.5-dimensional terrains. Algorithmica 60, 451-463 (2011).
Elbassioni, K., K. Makino and I. Rauf: On the readability of monotone Boolean formulae. Journal of Combinatorial Optimization 22, 293-304 (2011).
Elbassioni, K. and H.R. Tiwary: On a cone covering problem. Computational Geometry 44, 129-134 (2011).
Elsaesser, R. and T. Sauerwald: Tight bounds for the cover time of multiple random walks. Theoretical Computer Science 412, 2623-2641 (2011).
Emeliyanenko, P.: High-performance polynomial GCD computations on graphics processors. In: Proc. 2011 Int. Conf. on High Performance Computing & Simulation (HPCS 2011), (Eds.) W.W. Smari, J.P. McIntire. IEEE, Piscataway 2011, 215-224.
Epstein, L., A. Levin and R. van Stee: Max-min online allocations with a reordering buffer. SIAM Journal on Discrete Mathematics 25, 1230-1250 (2011).
Epstein, L. and R. van Stee: Improved results for a memory allocation problem. Theory of Computing Systems 48, 79-92 (2011).
- On the online unit clustering problem. ACM Transactions on Algorithms 7, 7:1-7:1 (2011).
Farzan, A. and J.I. Munro: Succinct representation of dynamic trees. Theoretical Computer Science 412, 2668-2678 (2011).
Fellows, M.R., G. Fertin, D. Hermelin and S. Vialette: Upper and lower bounds for finding connected motifs in vertex-colored graphs. Journal of Computer and System Sciences 77, 799-811 (2011).
Fellows, M.R., T. Friedrich, D. Hermelin, N. Narodytska and F.A. Rosamond: Constraint satisfaction problems: Convexity makes all different constraints tractable. In: Proc. Twenty-Second Int. Joint Conf. on Artificial Intelligence (IJCAI 2011), (Ed.) T. Walsh. AAAI Press, Menlo Park 2011, 522-527.
Fellows, M.R., T. Hartman, D. Hermelin, G.M. Landau, F.A. Rosamond and L. Rozenberg: Haplotype inference constrained by plausible haplotype data. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8, 1692-1699 (2011).
Fernau, H., F.V. Fomin, D. Lokshtanov, M. Mnich, G. Philip and S. Saurabh: Ranking and drawing in subexponential time. In: Combinatorial Algorithms - 21st Int. Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, Lect. Notes Comput. Sci. 6460, (Eds.) C.S. Iliopoulos, W. F. Smyth. Springer, Berlin 2011, [***Warning: Pages missing!].
Fomin, F.V., D. Lokshtanov, N. Misra, G. Philip and S. Saurabh: Hitting forbidden minors: approximation and kernelization. In: 28th Int. Symp. on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, Leibniz International Proceedings in Informatics 9, (Eds.) T. Schwentick, C. D{\"u}rr. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl 2011, 189-200.
Fomin, F.V., G. Philip and Y. Villanger: Minimum fill-in of sparse graphs: kernelization and approximation. In: IARCS Annual Conf. on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, Leibniz International Proceedings in Informatics 13, (Eds.) S. Chakraborty, A. Kumar. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl 2011, 164-175.
Fountoulakis, N., M. Khosla and K. Panagiotou: The multiple-orientability thresholds for random hypergraphs. In: Proc. Twenty-Second Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2011), (Ed.) D. Randall. SIAM, Philadelphia 2011, 1222-1236.
Fountoulakis, N. and K. Panagiotou: 3-Connected cores in random planar graphs. Combinatorics, Probability & Computing 20, 381-412 (2011).
Friedrich, T., K. Bringmann, T. Voss and C. Igel: The logarithmic hypervolume indicator. In: FOGA'11 : Proc. 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, (Eds.) H.-G. Beyer, W. Langdon. ACM, New York 2011, 81-92.
Friedrich, T. and N. Hebbinghaus: Average update times for fully-dynamic all-pairs shortest paths. Discrete Applied Mathematics 159, 1751-1758 (2011).
Friedrich, T., C. Horoba and F. Neumann: Illustration of fairness in evolutionary multi-objective optimization. Theoretical Computer Science 412, 1546-1556 (2011).
Friedrich, T., T. Sauerwald and A. Stauffer: Diameter and broadcast time of random geometric graphs in arbitrary dimensions. In: 22nd Int. Symp. on Algorithms and Computation (ISAAC-11), Lect. Notes Comput. Sci. 7074, (Eds.) T. Asano, S.-I. Nakano, Y. Okamoto, O. Watanabe. Springer, Berlin 2011, 190-199.
Friedrich, T., T. Sauerwald and D. Vilenchik: Smoothed analysis of balancing networks. Random Structures & Algorithms 39, 115-138 (2011).
Funke, S., S. Laue, Z. Lotker and R. Naujoks: Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours. Ad Hoc Networks 9, 1028-1035 (2011).
Guo, Z., H. Sun and H. Zhu: Greedy construction of 2-approximate minimum Manhattan networks. International Journal of Computational Geometry and Applications 21, 331-350 (2011).
Harren, R., K. Jansen, L. Prädel and R. van Stee: A (5/3 + ε)-approximation for strip packing. In: Algorithms and Data Structures : 12th Int. Symp., WADS 2011, Lect. Notes Comput. Sci. 6844, (Eds.) F. Dehne, J. Iacono, J.-R. Sack. Springer, New York 2011, 475-487.
Hemmer, M., L. Dupon, S. Petitjean and E. Schomer: A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics. Journal of Symbolic Computation 46, 467-494 (2011).
Hermelin, D., C.-C. Huang, S. Kratsch and M. Wahlström: Parameterized two-player Nash equilibrium. In: Graph-Theoretic Concepts in Computer Science : 37th Int. Workshop, WG 2011, Lect. Notes Comput. Sci. 6986, (Eds.) P. Kolman, J. Kratochvíl. Springer, Berlin 2011, 215-226.
Hermelin, D., A. Levy, O. Weimann and R. Yuster: Distance oracles for vertex-labeled graphs. In: Automata, Languages and Programming : 38th Int. Colloquium, ICALP 2011, Lect. Notes Comput. Sci. 6756, (Eds.) L. Aceto, M. Henzinger, J. Sgall. Springer, Berlin 2011, 490-501.
Hermelin, D., M. Mnich, E.J. van Leeuwen and G.J. Woeginger: Domination when the stars are out. In: Automata, Languages and Programming : 38th Int. Colloquium, ICALP 2011, Lect. Notes Comput. Sci. 6746, (Eds.) L. Aceto, M. Henzinger, J. Sgall. Springer, Berlin 2011, 462-473.
Hermelin, D. and D. Rawitz: Optimization problems in multiple subtree graphs. Discrete Applied Mathematics 159, 588-594 (2011).
Huang, C.-C. and T. Kavitha: Near-popular matchings in the roommates problem. In: 19th European Symp. on Algorithms (ESA) [***Warning: Editor(s) might be missing!]. Springer, Springer-Verlag GmbH Heidelberger Platz 3 14197 Berlin 2011, [***Warning: Pages missing!].
- Popular matchings in the stable marriage problem. In: 38th Int. Colloquium on Automata, Languages and Programming (ICALP) [***Warning: Editor(s) might be missing!]. Springer, Springer-Verlag GmbH Heidelberger Platz 3 14197 Berlin 2011, [***Warning: Pages missing!].
Huang, C.-C., T. Kavitha, D. Michael and M. Nasr: Bounded unpopularity matchings. Algorithmica 61, 738-757 (2011).
Kavitha, T., K. Mehlhorn and D. Michail: New approximation algorithms for minimum cycle bases of graphs. Algorithmica 59, 471-488 (2011).
Kavitha, T., J. Mestre and M. Nasre: Popular mixed matchings. Theoretical Computer Science 412, 2679-2690 (2011).
Kayal, N. and C. Saha: On the sum of square roots of polynomials and related problems. In: 26th IEEE Conf. on Computational Complexity (CCC) [***Warning: Editor(s) might be missing!]. IEEE Computer Society, Washington 2011, 292-299.
Kerber, M. and M. Sagraloff: A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics 27, 419-430 (2011).
- Efficient real root approximation. In: ISSAC 2011 : Proc. 36th Int. Symp. on Symbolic and Algebraic Computation, (Ed.) A. Leykin. ACM, New York 2011, 209-216.
Kötzing, T.: Iterative learning from positive data and counters. In: Algorithmic Learning Theory : 22nd Int. Conf., ALT 2011, Lect. Notes Artif. Intell. 6925, (Eds.) J. Kivinen, C. Szepesvári, E. Ukkonen, T. Zeugmann. Springer, Berlin 2011, 40-54.
Kötzing, T., F. Neumann and R. Spöhel: PAC learning and genetic programming. In: GECCO 2011 : Genetic and Evolutionary Computation Conf., (Eds.) N. Krasnogor, P.L. Lanzi. ACM, New York 2011, 2091-2096.
Kötzing, T., F. Neumann, D. Sudholt and M. Wagner: Simple max-min ant systems and the optimization of linear pseudo-Boolean functions. In: FOGA'11 : Proc. 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, (Eds.) H.-G. Beyer, W. Langdon. ACM, New York 2011, 209-218.
Kötzing, T., D. Sudholt and M. Theile: How crossover helps in pseudo-Boolean optimization. In: GECCO 2011 : Genetic and Evolutionary Computation Conf., (Eds.) N. Krasnogor, P.L. Lanzi. ACM, New York 2011, 989-996.
Mainberger, M., S. Hoffmann, J. Weickert, C.H. Tang, D. Johannsen, F. Neumann and B. Doerr: Optimising spatial and tonal data for homogeneous diffusion inpainting. In: Scale Space and Variational Methods in Computer Vision : Third Int. Conf., SSVM 2011, Lect. Notes Comput. Sci. 6667, (Eds.) A.M. Bruckstein, B.M. ter Haar Romeny, A.M. Bronstein, M.M. Bronstein. Springer, Berlin 2011, 26-37.
Manjunath, M., K. Mehlhorn, K. Panagiotou and H. Sun: Approximate counting of cycles in streams. In: 19th Annual European Symp. on Algorithms (ESA-11), Lect. Notes Comput. Sci. 6942, (Eds.) C. Demetrescu, M. M. Halldórsson. Springer, Berlin 2011, 677-688.
Manjunath, M. and V. Sharma: Applications of dimensionality reduction and exponential sums to graph automorphism. Theoretical Computer Science 412, 3639-3649 (2011).
Megow, N., K. Mehlhorn and P. Schweitzer: Online graph exploration: New results on old and new algorithms. In: Automata, Languages and Programming : 38th Int. Colloquium, ICALP 2011, Lect. Notes Comput. Sci. 6756, (Eds.) L. Aceto, M. Henzinger, J. Sgall. Springer, Berlin 2011, 478-489.
Megow, N., R.H. Möhring and J. Schulz: Decision support and optimization in shutdown and turnaround scheduling. INFORMS Journal on Computing 23, 189 - 204 (2011).
Mehlhorn, K., S. Näher and P. Schweitzer: Certifying algorithms. Computer Science Review 5, 119-161 (2011).
Mehlhorn, K., R. Osbild and M. Sagraloff: A general approach to the analysis of controlled perturbation algorithms. Computational Geometry 44, 507-528 (2011).
Mehlhorn, K. and M. Sagraloff: A deterministic algorithm for isolating real roots of a real polynomial. Journal of Symbolic Computation 46, 70-90 (2011).
Milosavljevic, N., D. Morozov and P. Skraba: Zigzag persistent homology in matrix multiplication time. In: Proc. 27th Annual Symp. on Computational Geometry (SCG'11). ACM, New York 2011, 216-225.
Misra, N., G. Philip, V. Raman and S. Saurabh: On parameterized independent feedback vertex set. In: Computing and Combinatorics - 17th Annual Int. Conf., COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proc., Lect. Notes Comput. Sci. 6842, (Eds.) B. Fu, D.-Z. Du. Springer, Berlin 2011, 98-109.
Müller, T., X. Perez-Gimenez and N. Wormald: Disjoint Hamilton cycles in the random geometric graph. Journal of Graph Theory 68, 299-322 (2011).
Mütze, T., T. Rast and R. Spöhel: Coloring random graphs online without creating monochromatic subgraphs. In: Proc. Twenty-Second Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2011), (Ed.) D. Randall. SIAM, Philadelphia 2011, 145-158.
Neumann, F., J. Reichel and M. Skutella: Computing minimum cuts by randomized search heuristics. Algorithmica 59, 323-342 (2011).
Panagiotou, K. and A. Steger: On the degree sequence of random planar graphs. In: Proc. Twenty-Second Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2011), (Ed.) D. Randall. SIAM, Philadelphia 2011, 1198-1210.
Pemmaraju, S.V., R. Raman and K. Varadarajan: Max-coloring and online coloring with bandwidths on interval graphs. ACM Transactions on Algorithms 7, 35:1-35:21 (2011).
Sagraloff, M. and C. Yap: A simple but exact and efficient algorithm for complex root isolation. In: ISSAC 2011 : Proc. 36th Int. Symp. on Symbolic and Algebraic Computation, (Ed.) A. Leykin. ACM, New York 2011, 353-360.
Sauerwald, T. and A. Stauffer: Rumor spreading and vertex expansion on regular graphs. In: 22nd ACM-SIAM Symp. on Discrete Algorithms (SODA-11), (Ed.) D. Randall. SIAM, Philadelphia 2011, 462-475.
Shervashidze, N., P. Schweitzer, E.J. van Leeuwen, K. Mehlhorn and K.M. Borgwardt: Weisfeiler-Lehman graph kernels. Journal of Machine Learning Research 12, 2539-2561 (2011).
van Stee, R.: An improved algorithm for online rectangle filling. In: Approximation and Online Algorithms : 8th Int. Workshop, WAOA 2010, Lect. Notes Comput. Sci. 6534, (Eds.) K. Jansen, R. Solis-Oba. Springer, Berlin 2011, 249-260.
van Zuylen, A.: An improved monotone algorithm for scheduling related machines with precedence constraints. Operations Research Letters 39, 423-427 (2011).
- Deterministic sampling algorithms for network design. Algorithmica 60, 110-151 (2011).
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.. Theoretical Computer Science 412, 2556-2561 (2011).
Wagner, M., K. Veeramachaneni, F. Neumann and U.-M. O'Reilly: Optimizing the layout of 1000 wind turbines. In: European Wind Energy Association Annual Event. [***Warning: Publishers name missing!], Brussels 2011, 1-10.
Wahlström, M.: New plain-exponential time classes for graph homomorphism. Theory of Computing Systems 49, 273-282 (2011).
Berberich, E., P. Emeliyanenko, A. Kobel and M. Sagraloff: Arrangement computation for planar algebraic curves. arXiv abs/1103.4697, [***Warning: Pages missing!] (2011). Internet: <http://arxiv.org/abs/1103.4697>
Berberich, E., D. Halperin, M. Kerber and R. Pogalnikova: Deconstructing approximate offsets. arXiv abs/1109.2158, [***Warning: Pages missing!] (2011). Internet: <http://arxiv.org/abs/1109.2158>
Case, J. and T. Kötzing: Measuring learning complexity with criteria epitomizers. In: 28th Int. Symp. on Theoretical Aspects of Computer Science (STACS 2011), (Eds.) T. Schwentick, C. Dürr, Leibniz International Proceedings in Informatics (LIPIcs) 9. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl 2011, 320-331 Internet: <http://drops.dagstuhl.de/opus/volltexte/2011/3023/>.
Chan, S.-H., T.-W. Lam and L.-K. Lee: Scheduling for weighted flow time and energy with rejection penalty. In: 28th Int. Symp. on Theoretical Aspects of Computer Science (STACS 2011), (Eds.) T. Schwentick, C. Dürr, Leibniz International Proceedings in Informatics (LIPIcs) 9. Schloss Dagstuhl - Leibniz Center for Informatics, Dagstuhl 2011, 392-403 Internet: <http://drops.dagstuhl.de/opus/volltexte/2011/3029/>.
Doerr, B. and M. Fouz: Asymptotically optimal randomized rumor spreading. Electronic Notes in Discrete Mathematics 38, 297-302 (2011). Internet: <http://dx.doi.org/10.1016/j.endm.2011.09.049>
Doerr, B., M. Fouz and T. Friedrich: Social networks spread rumors in sublogarithmic time. In: The Sixth European Conf. on Combinatorics, Graph Theory and Applications, EuroComb 2011, (Eds.) J. Nešetřil, E. Győri, A. Sali, Electronic Notes in Discrete Mathematics 38. Elsevier, Amsterdam 2011, 303-308 Internet: <http://dx.doi.org/10.1016/j.endm.2011.09.050>.
Doerr, B. and C. Winzen: Memory-Restricted black-box complexity. Electronic Colloquium on Computational Complexity 18, 7 (2011).
Elbassioni, K., I. Rauf and S. Ray: Enumerating minimal transversals of geometric hypergraphs. In: 23rd Canadian Conf. on Computational Geometry (CCCG 2011), (Ed.) S. Collette. CCCG, Toronto 2011, 437-442 Internet: <http://2011.cccg.ca/PDFschedule/papers/paper65.pdf>.
Gugelmann, L. and R. Spöhel: On balanced coloring games in random graphs. In: The Sixth European Conf. on Combinatorics, Graph Theory and Applications, EuroComb 2011, (Eds.) J. Nešetřil, E. Győri, A. Sali, Electronic Notes in Discrete Mathematics 38. Elsevier, Amsterdam 2011, 425-430 Internet: <http://dx.doi.org/10.1016/j.endm.2011.09.069>.
Mütze, T. and R. Spöhel: On the path-avoidance vertex-coloring game. The Electronic Journal of Combinatorics 18, 1-33 (2011). Internet: <http://www.combinatorics.org/Volume_18/PDF/v18i1p163.pdf>
- On the path-avoidance vertex-coloring game. In: The Sixth European Conf. on Combinatorics, Graph Theory and Applications, EuroComb 2011, (Eds.) J. Nešetřil, E. Győri, A. Sali, Electronic Notes in Discrete Mathematics 38. Elsevier, Amsterdam 2011, 657-662 Internet: <http://dx.doi.org/10.1016/j.endm.2011.10.010>.
Panagiotou, K., R. Spöhel, A. Steger and H. Thomas: Explosive percolation in Erdős-Rényi-like random graph processes. In: The Sixth European Conf. on Combinatorics, Graph Theory and Applications, EuroComb 2011, (Eds.) J. Nešetřil, E. Győri, A. Sali, Electronic Notes in Discrete Mathematics 38. Elsevier, Amsterdam 2011, 699-704 Internet: <http://dx.doi.org/10.1016/j.endm.2011.10.017>.
Rizkallah, C.: Maximum cardinality matching. Archive of Formal Proofs [***Warning: Volume missing!], [***Warning: Pages missing!] (2011).
Sagraloff, M.: When Newton meets Descartes: A simple and fast algorithm to isolate the real roots of a polynomial. arXiv abs/1109.6279v1, 1-21 (2011). Internet: <http://arxiv.org/abs/1109.6279v1>
van Zuylen, A., F. Schalekamp and D.P. Williamson: Popular ranking. In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, (Eds.) L. Adacher, M. Flamini, G. Leo, G. Nicosia, A. Pacifici, V. Piccialli. CTW, Frascati 2011, 267-270 Internet: <http://ctw2011.dia.uniroma3.it/ctw_proceedings.pdf#page=279>.
Busch, P.J.: Analysis of the kit email graph, with an application of randomized rumour spreading protocols. Universität des Saarlandes 2011.
Ingalalli, V.: Evolutionary algorithms to compute lower bounds for the star discrepancy. Universität des Saarlandes 2011.
Kobel, A.: Certified numerical root finding. Universität des Saarlandes 2011.
Neumann, A.: Implementation of Schmidt's algorithm for certifying triconnectivity testing. Universität des Saarlandes 2011.
Philip, G.: The kernelization complexity of some domination and covering problems. Homi Bhabha National Institute 2011.
Winzen, C.: Toward a complexity theory for randomized search heuristics : black box models. Universität des Saarlandes 2011.