max planck institut
informatik
informatik
Ajwani, D. and T. Friedrich: Average-case analysis of incremental topological ordering. Discrete Applied Mathematics 158, 240-250 (2010).
Althaus, E., S. Altmeyer and R. Naujoks: A new combinatorial approach to parametric path analysis. , (Eds.) B. Becker, W. Damm, M. Fränzle, E.-R. Olderog, A. Podelski, R. Wilhelm, SFB/TR 14 AVACS 2010, 33 p.
Ambalath, A.M., R. Balasundaram, C.R. H., V. Koppula, N. Misra, G. Philip and M.S. Ramanujan: On the kernelization complexity of colorful motifs. In: Parameterized and Exact Computation - 5th Int. Symp., IPEC 2010, Chennai, India, December 13-15, 2010. Proc., Lect. Notes Comput. Sci. 6478, (Eds.) V. Raman, S. Saurabh. Springer, Berlin 2010, 14-25.
Angelopoulos, S.: On the competitiveness of the online asymmetric and Euclidean Steiner tree problems. In: Approximation and Online Algorithms : 7th Int. Workshop, WAOA 2009, Lect. Notes Comput. Sci. 5893, (Eds.) E. Bampis, K. Jansen. Springer, Berlin 2010, 1-12.
Angelopoulos, S. and A. Borodin: Randomized priority algorithms. Theoretical Computer Science 411, 2542-2558 (2010).
Bansal, N., A. Gupta, J. Li, J. Mestre, V. Nagarajan and A. Rudra: When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract). In: Algorithms - ESA 2010 : 18th Annual European Symp.. - Pt. II, Lect. Notes Comput. Sci. 6347, (Eds.) M. de Berg, U. Meyer. Springer, Berlin 2010, 218-229.
Bar-Yehuda, R., D. Hermelin and D. Rawitz: Minimum vertex cover in rectangle graphs. In: Algorithms - ESA 2010 : 18th Annual European Symp.. - Pt. I, Lect. Notes Comput. Sci. 6347, (Eds.) M. de Berg, U. Meyer. Springer, Berlin 2010, 255-266.
Baruah, S., V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow and L. Stougie: Scheduling real-time mixed-criticality jobs. In: Mathematical Foundations of Computer Science 2010 : 35th Int. Symp., MFCS 2010, Lect. Notes Comput. Sci. 6281, (Eds.) P. Hlinen{\'y}, A. Kucera. Springer, Berlin 2010, 90-101.
Baruah, S., V. Bonifaci, A. Marchetti-Spaccamela and S. Stiller: Improved multiprocessor global schedulability analysis. Real-Time Systems 46, 3-24 (2010).
Basit, A., N.H. Mustafa, S. Ray and S. Raza: Centerpoints and Tverberg's technique. Computational Geometry 43, 593-600 (2010).
Batra, P. and V. Sharma: Bounds on absolute positiveness of multivariate polynomials. Journal of Symbolic Computation 45, 617-628 (2010).
Berberich, E., E. Fogel, D. Halperin, M. Kerber and O. Setter: Arrangements on parametric surfaces II: Concretizations and applications. Mathematics in Computer Science 4, 67-91 (2010).
Berberich, E., E. Fogel, D. Halperin, K. Mehlhorn and R. Wein: Arrangements on parametric surfaces I: General framework and infrastructure. Mathematics in Computer Science 4, 45-66 (2010).
Berberich, E., M. Hagen, B. Hiller and H. Moser: Experiments. In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, Lect. Notes Comput. Sci. 5971, (Eds.) M. Müller-Hannemann, S. Schirra. Springer, Berlin 2010, 325-388.
Berberich, E., M. Hemmer and M. Kerber: A generic algebraic kernel for non-linear geometric applications. , Sophia Antipolis 2010, 20 p.
Berberich, E., M. Kerber and M. Sagraloff: An efficient algorithm for the stratification and triangulation of an algebraic surface. Computational Geometry: Theory and Applications (CGTA) 43, 257-278 (2010).
Berghammer, R., T. Friedrich and F. Neumann: Set-based multi-objective optimization, indicators, and deteriorative cycles. In: Proc. 12th Annual Conf. on Genetic and Evolutionary Computation (GECCO-2010), (Eds.) M. Pelikan, J. Branke. ACM, New York 2010, 495-502.
Blelloch, G.E. and A. Farzan: Succinct representations of separable graphs. In: Combinatorial Pattern Matching : 21st Annual Symp., CPM 2010, Lect. Notes Comput. Sci. 6129, (Eds.) A. Amir, L. Parida. Springer, Berlin 2010, 138-150.
Bonifaci, V., H.-L. Chan, A. Marchetti-Spaccamela and N. Megow: Algorithms and complexity for periodic real-time scheduling. In: 21st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), (Ed.) M. Charikar. SIAM, Philadelphia 2010, 1350-1359.
Bonifaci, V., T. Harks and G. Schäfer: Stackelberg routing in arbitrary networks. Mathematics of Operations Research 35, 330 - 346 (2010).
Bonifaci, V. and A. Marchetti-Spaccamela: Feasibility analysis of sporadic real-time multiprocessor task systems. In: Algorithms - ESA 2010 : 18th Annual European Symp.. - Pt. II, Lect. Notes Comput. Sci. 6347, (Eds.) M. de Berg, U. Meyer. Springer, Berlin 2010, 230-241.
Boros, E., K. Elbassioni, V. Gurvich and K. Makino: A pumping algorithm for ergodic stochastic mean payoff games with perfect information. In: Integer Programming and Combinatorial Optimization : 14th Int. Conf., IPCO 2010, Lect. Notes Comput. Sci. 6080, (Eds.) F. Eisenbrand, F.B. Shepherd. Springer, Berlin 2010, 341-354.
- On effectivity functions of game forms. Games and Economic Behavior 68, 512-531 (2010).
Boros, E., K. Elbassioni and K. Makino: Left-to-right multiplication for monotone Boolean dualization. SIAM Journal on Computing 39, 3424-3439 (2010).
Böttcher, S., B. Doerr and F. Neumann: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Lect. Notes Comput. Sci. 6238, (Eds.) R. Schaefer, C. Cotta, J. Kolodziej, G. Rudolph. Springer, Berlin 2010, 1-10.
Bradonjić, M., R. Elsässer, T. Friedrich, T. Sauerwald and A. Stauffer: Efficient broadcast on random geometric graphs. In: Proc. Twenty-First Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), (Ed.) M. Charikar. SIAM, Philadelphia 2010, 1412-1421.
Bringmann, K. and T. Friedrich: An efficient algorithm for computing hypervolume contributions. Evolutionary Computation 18, 383-402 (2010).
- Approximating the volume of unions and intersections of high-dimensional geometric objects. Computational Geometry 43, 601-610 (2010).
- The maximum hypervolume set yields near-optimal approximation. In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010). ACM, New York 2010, 511-518.
- Tight bounds for the approximation ratio of the hypervolume indicator. In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Lect. Notes Comput. Sci. 6238, (Eds.) R. Schaefer, C. Cotta, J. Kolodziej, G. Rudolph. Springer, Berlin 2010, 607-616.
Butman, A., D. Hermelin, M. Lewenstein and D. Rawitz: Optimization problems in multiple-interval graphs. ACM Transactions on Algorithms 6, 40,1-40,18 (2010).
Canzar, S., K. Elbassioni, A. Elmasry and R. Raman: On the approximability of the maximum interval constrained coloring problem. In: Algorithms and Computation : 21st Int. Symp., ISAAC 2010. - Pt. II, Lect. Notes Comput. Sci. 6507, (Eds.) O. Cheong, K.-Y. Chwa, K. Park. Springer, Berlin 2010, 168-179.
Canzar, S., K. Elbassioni and J. Mestre: A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem. In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10). SIAM, Philadelphia 2010, 23-33.
Case, J. and T. Kötzing: Solutions to open questions for Non-U-Shaped learning with memory limitations. In: Algorithmic Learning Theory : 21st Int. Conf., ALT 2010, Lect. Notes Artif. Intell. 6331, (Eds.) M. Hutter, F. Stephan, V. Vovk, T. Zeugmann. Springer, Berlin 2010, 285-299.
- Strongly Non-U-Shaped learning results by general techniques. In: COLT 2010 : The 23rd Conf. on Learning Theory, (Eds.) A.T. Kalai, M. Mohri. Omnipress, Madison 2010, 181-193.
Chan, S.-H., T.-W. Lam and L.-K. Lee: Non-clairvoyant speed scaling for weighted flow time. In: Algorithms - ESA 2010 : 18th Annual European Symp.. - Pt. I, Lect. Notes Comput. Sci. 6346, (Eds.) M. de Berg, U. Meyer. Springer, Berlin 2010, 23-35.
Christodoulou, G., C. Chung, K. Ligett, E. Pyrga and R. van Stee: On the price of stability for undirected network design. In: Approximation and Online Algorithms : 7th Int. Workshop, WAOA 2009, Lect. Notes Comput. Sci. 5893, (Eds.) E. Bampis, K. Jansen. Springer, Berlin 2010, 86-97.
Christodoulou, G., K. Elbassioni and M. Fouz: Truthful mechanisms for exhibitions. In: Internet and Network Economics : 6th Int. Workshop, WINE 2010, Lect. Notes Comput. Sci. 6484, (Ed.) A. Saberi. Springer, Berlin 2010, 170-181.
Christodoulou, G., E. Koutsoupias and A. Kovács: Mechanism design for fractional scheduling on unrelated machines. ACM Transactions on Algorithms 6, 38:1-38:18 (2010).
Christodoulou, G. and A. Kovács: A deterministic truthful PTAS for scheduling related machines. In: 21st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), (Ed.) M. Charikar. SIAM, Philadelphia 2010, 1005-1016.
Christodoulou, G., A. Kovacs and R. van Stee: A truthful constant approximation for maximizing the minimum load on related machines. In: Internet and Network Economics : 6th Int. Workshop, WINE 2010, Lect. Notes Comput. Sci. 6484, (Ed.) A. Saberi. Springer, Berlin 2010, 182-193.
Christodoulou, G., K. Ligett and E. Pyrga: Contention resolution under selfishness. In: Automata, Languages and Programming : 37th Int. Colloquium, ICALP 2010. - Pt. II, Lect. Notes Comput. Sci. 6199, (Eds.) S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P. Spirakis. Springer, Berlin 2010, 430-441.
Cooper, J., B. Doerr, T. Friedrich and J. Spencer: Deterministic random walks on regular trees. Random Structures and Algorithms 37, 353-366 (2010).
Doerr, B. and M. Fouz: Hereditary discrepancies in different numbers of colors II. SIAM Journal on Discrete Mathematics 24, 1205-1213 (2010).
Doerr, B., M. Fouz and C. Witt: Quasirandom evolutionary algorithms. In: Proc. 12th Annual Conf. on Genetic and Evolutionary Computation (GECCO-2010), (Eds.) M. Pelikan, J. Branke. ACM, New York 2010, 1457-1464.
Doerr, B., M. Gnewuch and M. Wahlström: Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. Journal of Complexity 26, 490-507 (2010).
Doerr, B. and L.A. Goldberg: Adaptive drift analysis. In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, Lect. Notes Comput. Sci. 6238, (Eds.) R. Schaefer, C. Cotta, J. Kolodziej, G. Rudolph. Springer, Berlin 2010, 32-41.
- Drift analysis with tail bounds. In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, Lect. Notes Comput. Sci. 6238, (Eds.) R. Schaefer, C. Cotta, J. Kolodziej, G. Rudolph. Springer, Berlin 2010, 174-183.
Doerr, B., L.A. Goldberg, L. Minder, T. Sauerwald and C. Scheideler: Brief announcement: stabilizing consensus with the power of two choices. In: Distributed Computing : 24th Int. Symp., DISC 2010, Lect. Notes Comput. Sci. 6343, (Eds.) N.A. Lynch, A.A. Shvartsman. Springer, Berlin 2010, 528-530.
Doerr, B., T. Jansen, D. Sudholt, C. Winzen and C. Zarges: Optimizing monotone functions can be difficult. Lecture Notes in Computer Science 6238, 42-51 (2010).
- Optimizing monotone functions can be difficult. In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Lect. Notes Comput. Sci. 6238, (Eds.) R. Schaefer, C. Cotta, J. Kolodziej, G. Rudolph. Springer, Berlin 2010, 42-51.
Doerr, B. and D. Johannsen: Edge-based representation beats vertex-based representation in shortest path problems. In: Proc. 12th Annual Conf. on Genetic and Evolutionary Computation (GECCO-2010), (Eds.) M. Pelikan, J. Branke. ACM, New York 2010, 759-766.
Doerr, B., D. Johannsen, T. Kötzing, F. Neumann and M. Theile: More effective crossover operators for the all-pairs shortest path problem. In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Lect. Notes Comput. Sci. 6238, (Eds.) R. Schaefer, C. Cotta, J. Kolodziej, G. Rudolph. Springer, Berlin 2010, 184-193.
Doerr, B., D. Johannsen and C. Winzen: Drift analysis and linear functions revisited. In: Proc. IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3. IEEE, Piscataway 2010, 1967-1974.
- Multiplicative drift analysis. In: Proc. 12th Annual Conf. on Genetic and Evolutionary Computation (GECCO-2010), (Eds.) M. Pelikan, J. Branke. ACM, New York 2010, 1449-1456.
Doerr, B., M. Künnemann and M. Wahlström: Randomized rounding for routing and covering problems: experiments and improvements. In: Experimental Algorithms : 9th Int. Symp., SEA 2010, Lect. Notes Comput. Sci. 6049, (Ed.) P. Festa. Springer, Berlin 2010, 190-201.
Elbassioni, K. and H. Chan: A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics. In: Proc. Twenty-First Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), (Ed.) M. Charikar. SIAM, Philadelphia 2010, 256-267.
Elbassioni, K., M. Fouz and C. Swamy: Approximation algorithms for non-single-minded profit-maximization problems with limited supply. In: Internet and Network Economics : 6th Int. Workshop, WINE 2010, Lect. Notes Comput. Sci. 6484, (Ed.) A. Saberi. Springer, Berlin 2010, 462-472.
Elbassioni, K., D. Matijevic and D. Severdija: Guarding 1.5-dimensional with demands. In: 26th European Workshop on Computational Geometry (EuroCG 2010), (Ed.) J. Vahrenhold. Technische Universität Dortmund, Dortmund 2010, 133-136.
Elbassioni, K. and I. Rauf: Polynomial-time dualization of r-exact hypergraphs with applications in geometry. Discrete Mathematics 310, 2356-2363 (2010).
Elmasry, A.: Pairing heaps, scrambled pairing and square-root trees. International Journal of Computer Mathematics 87, 3096-3110 (2010).
- The longest almost-increasing subsequence. Information Processing Letters 110, 655-658 (2010).
Elmasry, A., C. Jensen and J. Katajainen: Strictly-regular number system and data structures. In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symp. and Workshops on Algorithm Theory, Lect. Notes Comput. Sci. 6139, (Ed.) H. Kaplan. Springer, Berlin 2010, 26-37.
- The magic of a number system. In: Fun with Algorithms : 5th Int. Conf., FUN 2010, Lect. Notes Comput. Sci. 6099, (Eds.) P. Boldi, L. Gargano. Springer, Berlin 2010, 156-165.
Emeliyanenko, P.: A complete modular resultant algorithm targeted for realization on graphics hardware. In: PASCO '10 : Proc. 4th Int. Workshop on Parallel and Symbolic Computation, (Eds.) M. Moreno Maza, J.-L. Roch. ACM, New York 2010, 35-43.
- Modular resultant algorithm for graphics processors. In: Algorithms and Architectures for Parallel Processing : 10th Int. Conf., ICA3PP 2010. - Pt. 1, Lect. Notes Comput. Sci. 6081, (Eds.) C.-H. Hsu, L.T. Yang, J.H. Park, S.-S. Yeo. Springer, Berlin 2010, 427-440.
Epstein, L., A. Levin, A. Marchetti-Spaccamela, N. Megow, J. Mestre, M. Skutella and L. Stougie: Universal sequencing on a single machine. In: Integer Programming and Combinatorial Optimization : 14th Int. Conf., IPCO 2010, Lect. Notes Comput. Sci. 6080, (Eds.) F. Eisenbrand, F.B. Shepherd. Springer, Berlin 2010, 230-243.
Epstein, L., A. Levin and R. van Stee: Max-min online allocations with a reordering buffer. In: Automata, Languages and Programming : 37th Int. Colloquium, ICALP 2010, Lect. Notes Comput. Sci. 6198, (Eds.) S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis. Springer, Berlin 2010, 336-347.
Epstein, L. and R. van Stee: Maximizing the minimum load for selfish agents. Theoretical Computer Science 411, 44-57 (2010).
- On the online unit clustering problem. ACM Transactions on Algorithms 7, 1-18 (2010).
Farzan, A., T. Gagie and G. Navarro: Entropy-Bounded representation of point grids. In: Algorithms and Computation : 21st Int. Symp., ISAAC 2010. - Pt. II, Lect. Notes Comput. Sci. 6507, (Eds.) O. Cheong, K.-Y. Chwa, K. Park. Springer, Berlin 2010, 327-338.
Fernau, H., F.V. Fomin, G. Philip and S. Saurabh: The curse of connectivity: $t$-total vertex (edge) cover. In: Computing and Combinatorics, 16th Annual Int. Conf., COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proc., Lect. Notes Comput. Sci. 6196, (Eds.) M.T. Thai, S. Sahni. Springer, Berlin 2010, 34-43.
Fountoulakis, N., A. Huber and K. Panagiotou: Reliable broadcasting in random networks and the effect of density. In: 2010 Proc. IEEE INFOCOM. IEEE, San Diego 2010, 2552-2560.
Fountoulakis, N. and K. Panagiotou: Orientability of random hypergraphs and the power of multiple choices. In: Automata, Languages and Programming : 37th Int. Colloquium, ICALP 2010. - Pt. 1, Lect. Notes Comput. Sci. 6198, (Eds.) S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis. Springer, Berlin 2010, 348-359.
- Rumor spreading on random regular graphs and expanders. In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th Int. Workshop, RANDOM 2010, Lect. Notes Comput. Sci. 6302, (Eds.) M. Serna, R. Shaltiel, K. Jansen, J. Rolim. Springer, Berlin 2010, 560-573.
Friedrich, T., M. Gairing and T. Sauerwald: Quasirandom load balancing. In: 21st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), (Ed.) M. Charikar. SIAM, Philadelphia 2010, 1620-1629.
Friedrich, T., N. Hebbinhaus and F. Neumann: Plateaus can be harder in multi-objective optimization. Theoretical Computer Science 411, 854-864 (2010).
Friedrich, T., J. He, N. Hebbinghaus, F. Neumann and C. Witt: Approximating covering problems by randomized search heuristics using multi-objective models. Evolutionary Computation 18, 617 - 633 (2010).
Friedrich, T. and F. Neumann: When to use bit-wise neutrality. Natural Computing 9, 283 - 294 (2010).
Friedrich, T. and T. Sauerwald: The cover time of deterministic random walks. In: Computing and Combinatorics : 16th Annual Int. Conf., COCOON 2010, Lect. Notes Comput. Sci. 6196, (Eds.) M.T. Thai, S. Sahni. Springer, Berlin 2010, 130-139.
Garg, N., T. Kavitha, A. Kumar, K. Mehlhorn and J. Mestre: Assigning papers to referees. Algorithmica 58, 119-136 (2010).
Giannopoulos, P., R. Klein, M. Kutz and D. Marx: Computing geometric minimum-dilation graphs is NP-hard. International Journal of Computational Geometry & Applications 20, 147-173 (2010).
Gidenstam, A., M. Papatriantafilou and P. Tsigas: NBmalloc: Allocating memory in a lock-free manner. Algorithmica 58, 304-338 (2010).
Guibas, L., N. Milosavljevic and A. Motskin: Connected dominating sets on dynamic geometric graphs. In: Proc. 22nd Canadian Conf. on Computational Geometry (CCCG2010). CCCG Library, Winnipeg 2010, 27-30.
Günther, E., F. König and N. Megow: Scheduling and packing malleable tasks with precedence constraints of bounded width. In: Approximation and Online Algorithms : 7th Int. Workshop, WAOA 2009, Lect. Notes Comput. Sci. 5893, (Eds.) E. Bampis, K. Jansen. Springer, Berlin 2010, 170-181.
Hajiaghayi, M., R. Khandekar, G. Kortsarz and J. Mestre: The checkpoint problem. In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Int. Workshop, APPROX 2010 and 14th Int. Workshop, RANDOM 2010, Lect. Notes Comput. Sci. 6302, (Eds.) M. Serna, R. Shaltiel, K. Jansen, J. Rolim. Springer, Berlin 2010, 219-231.
Han, X., T.-W. Lam, L.-K. Lee, I.K.K. To and P.W.H. Wong: Deadline scheduling and power management for speed bounded processors. Theoretical Computer Science 411, 3587-3600 (2010).
Huang, C.-C.: Circular stable matching and 3-way kidney transplant. Algorithmica 58, 137-150 (2010).
- Classified stable matching. In: 21st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), (Ed.) M. Charikar. SIAM, Philadelphia 2010, 1235-1253.
Iacono, G., F. Ramezani, N. Soranzo and C. Altafani: Determining the distance to monotonicity of a biological network: a graph-theoretical approach. IET Systems Biology 4, 223-235 (2010).
Jansen, K., S. Kratsch, D. Marx and I. Schlotter: Bin packing with fixed number of bins revisited. In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symp. and Workshops on Algorithm Theory, Lect. Notes Comput. Sci. 6139, (Ed.) H. Kaplan. Springer, Berlin 2010, 260-272.
Johannsen, D. and K. Panagiotou: Vertices of degree k in random maps. In: 21st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), (Ed.) M. Charikar. SIAM, Philadelphia 2010, 1436-1447.
Kao, M.-Y., H.C.M. Leung, H. Sun and Y. Zhang: Deterministic polynomial-time algorithms for designing short DNA words. In: Theory and Applications of Models of Computation : 7th Annual Conf., TAMC 2010, Lect. Notes Comput. Sci. 6108, (Eds.) J. Kratchovil, A. Li, J. Fiala, P. Kolman. Springer, Berlin 2010, 308-319.
Kasprzik, A. and T. Kötzing: String extension learning using lattices. In: Language and Automata Theory and Applications : 4th Int. Conf., LATA 2010, Lect. Notes Comput. Sci. 6031, (Eds.) C. Martin-Vide, H. Fernau, A.H. Dediu. Springer, Berlin 2010, 380-391.
Kötzing, T., P.K. Lehre, F. Neumann and P.S. Oliveto: Ant colony optimization and the minimum cut problem. In: Proc. 12th Annual Conf. on Genetic and Evolutionary Computation (GECCO-2010), (Eds.) M. Pelikan, J. Branke. ACM, New York 2010, 1393-1400.
Kötzing, T., F. Neumann, H. Röglin and C. Witt: Theoretical properties of two aco approaches for the traveling salesman problem. In: Swarm Intelligence : 7th Int. Conf., ANTS 2010, Lect. Notes Comput. Sci. 6234, (Eds.) M. Dorigo, M. Birattari, G.A. Di Caro, R. Doursat, A.P. Engelbrecht, D. Floreano, L.M. Gambardella, R. Groß, E. Sahin, H. Sayama, T. Stützle. Springer, Berlin 2010, 324-335.
Kratsch, S., P.K. Lehre, F. Neumann and P.S. Oliveto: Fixed parameter evolutionary algorithms and maximum leaf spanning trees: A matter of mutation. In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Lect. Notes Comput. Sci. 6238, (Eds.) R. Schaefer, C. Cotta, J. Kolodziej, G. Rudolph. Springer, Berlin 2010, 204-213.
Kratsch, S., D. Marx and M. Wahlström: Parameterized complexity and kernelizability of {max ones} and {exact ones} problems. In: Mathematical Foundations of Computer Science 2010 : 35th Int. Symp., MFCS 2010, Lect. Notes Comput. Sci. 6281, (Eds.) P. Hlinený, A. Kucera. Springer, Berlin 2010, 489-500.
Kratsch, S. and P. Schweitzer: Isomorphism for graphs of bounded feedback vertex set number. In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symp. and Workshops on Algorithm Theory, Lect. Notes Comput. Sci. 6139, (Ed.) H. Kaplan. Springer, Berlin 2010, 81-92.
Kratsch, S. and M. Wahlström: Preprocessing of min ones problems: A dichotomy. In: Automata, Languages and Programming : 37th Int. Colloquium, ICALP 2010, Lect. Notes Comput. Sci. 6198, (Eds.) S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis. Springer, Berlin 2010, 653-665.
Kuhn, F., K. Panagiotou, J. Spencer and A. Steger: Synchrony and asynchrony in neural networks. In: Proc. Twenty-First Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), (Ed.) M. Charikar. SIAM, Philadelphia 2010, 949-964.
Megow, N.: Keller oder Dach zuerst. In: Besser als Mathe, (Eds.) K. Biermann, M. Götschel, B. Lutz-Westphal. Vieweg Teubner, Wiesbaden 2010, 111-116.
Mehlhorn, K.: Reliable and efficient geometric computing. In: Mathematical Software, ICMS 2010 : Third Int. Congress on Mathematical Software, Lect. Notes Comput. Sci. 6327, (Eds.) K. Fukuda, J. Van der Hoeven, M. Joswig, N. Takayama. Springer, Berlin 2010, 10-11.
Mehlhorn, K. and S. Ray: Faster algorithms for computing Hong's bound on absolute positiveness. Journal of Symbolic Computation 45, 677-683 (2010).
Mehlhorn, K. and P. Schweitzer: Progress on certifying algorithms. In: Frontiers in Algorithmics : 4th Int. Workshop, FAW 2010, Lect. Notes Comput. Sci. 6213, (Eds.) D.-T. Lee, D.Z. Chen, S. Ying. Springer, Berlin 2010, 1-5.
Mestre, J.: Adaptive local ratio. SIAM Journal on Computing 39, 3038-3057 (2010).
Misra, N., G. Philip, V. Raman and S. Saurabh: The effect of girth on the kernelization complexity of connected dominating set. In: {IARCS} Annual Conf. on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, Leibniz International Proceedings in Informatics 8, (Eds.) K. Lodaya, M. Mahajan. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl 2010, 96-107.
Misra, N., G. Philip, V. Raman, S. Saurabh and S. Sikdar: FPT algorithms for connected feedback vertex set. In: WALCOM: Algorithms and Computation, 4th Int. Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proc., Lect. Notes Comput. Sci. 5942, (Eds.) M.S. Rahman, S. Fujita. Springer, Berlin 2010, 269-280.
Mörig, M., S. Scholz, T. Tscheuschner and E. Berberich: Implementation aspects. In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, Lect. Notes Comput. Sci. 5971, (Eds.) M. Müller-Hannemann, S. Schirra. Springer, Berlin 2010, 237-289.
Mustafa, N.H. and S. Ray: Improved results on geometric hitting set problems. Discrete & Computational Geometry 44, 883-895 (2010).
Neumann, F. and C. Witt: Ant colony optimization and the minimum spanning tree problem. Theoretical Computer Science 411, 2406-2413 (2010).
- Bioinspired computation in combinatorial optimization : algorithms and their computational complexity. . Springer, New York 2010, 216 p.
Nor, I., D. Hermelin, S. Charlat, J. Engelstadter, M. Reuter and O.S.M.-F. Duron: Mod/Resc parsimony inference. In: Combinatorial Pattern Matching : 21st Annual Symp., CPM 2010, Lect. Notes Comput. Sci. 6129, (Eds.) A. Amir, L. Parida. Springer, Berlin 2010, 202-213.
Panagiotou, K. and A. Steger: Maximal biconnected subgraphs of random planar graphs. ACM Transactions on Algorithms 6, 31,1-31,21 (2010).
Philip, G., V. Raman and Y. Villanger: A quartic kernel for pathwidth-one vertex deletion. In: Graph Theoretic Concepts in Computer Science - 36th Int. Workshop, WG 2010, Zar{\'o}s, Crete, Greece, June 28-30, 2010 Revised Papers, Lect. Notes Comput. Sci. 6410, (Ed.) D.M. Thilikos. Springer, Berlin 2010, 196-207.
Pountourakis, E. and A. Vidali: A complete characterization of group-strategyproof mechanisms of cost-sharing.. In: Algorithms - ESA 2010 : 18th Annual European Symp.. - Pt. I, Lect. Notes Comput. Sci. 6346, (Eds.) M. de Berg, U. Meyer. Springer, Berlin 2010, 146-157.
Rusinov, M. and P. Schweitzer: Homomorphism -- homogeneous graphs. Journal of Graph Theory 65, 253-262 (2010).
Sagraloff, M.: A general approach to isolating roots of a bitstream polynomial. Mathematics in Computer Science 4, 481-506 (2010).
Schweitzer, P. and P. Schweitzer: Connecting face hitting sets in planar graphs. Information Processing Letters 111, 11-15 (2010).
Amini, O. and M. Manjunath: Riemann-Roch for sublattices of the root lattice $a\_n$. Electronic Journal of Combinatorics 17, R124,1-R124,50 (2010). Internet: <http://www.combinatorics.org/Volume_17/PDF/v17i1r124.pdf>
Berberich, E., P. Emeliyanenko and M. Sagraloff: An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks. CoRR abs/1010.1386, 1-16 (2010). Internet: <http://arxiv.org/abs/1010.1386>
Berberich, E., D. Halperin, M. Kerber and R. Pogalnikova: Polygonal reconstruction from approximate offsets. In: 26th European Workshop on Computational Geometry : Workshop Proc., (Ed.) J. Vahrenhold. TU Dortmund, Dortmund 2010, 65-68 Internet: <http://2010.eurocg.org/proceedings.pdf>.
Chan, H.-L., T.-W. Lam, L.-K. Lee and H.-F. Ting: Continuous monitoring of distributed data streams over a time-based sliding window. In: 27th Int. Symp. on Theoretical Aspects of Computer Science STACS 2010, (Eds.) J.-Y. Marion, T. Schwentick, LIPICS 5. Schloß Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl 2010, 179-190 Internet: <http://drops.dagstuhl.de/opus/volltexte/2010/2453>.
Elmasry, A., K. Mehlhorn and J.M. Schmidt: {An $o(m+n)$ certifying triconnectivity algorithm for hamiltonian graphs}. Algorithmica Online First, 1-13 (2010). Internet: <http://dx.doi.org/10.1007/s00453-010-9481-2>
Epstein, L., A. Levin, J. Mestre and D. Segev: Improved approximation guarantees for weighted matching in the semi-streaming model. In: 27th Int. Symp. on Theoretical Aspects of Computer Science (STACS 2010), (Eds.) J.-Y. Marion, T. Schwentick, LIPICS 5. Schloß Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl 2010, 347-358 Internet: <http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2476>.
Fountoulakis, N., R. Kang and C. McDiarmid: The t-stability number of a random graph. The Electronic Journal of Combinatorics 17, R59,1-R59,29 (2010). Internet: <http://www.combinatorics.org/Volume_17/PDF/v17i1r59.pdf>
Friedrich, T. and T. Sauerwald: The cover time of deterministic random walks. The Electronic Journal of Combinatorics 17, R167,1-R167,30 (2010). Internet: <http://www.combinatorics.org/Volume_17/PDF/v17i1r167.pdf>
Friedrich, T., T. Sauerwald and D. Vilenchik: Smoothed analysis of balancing networks. Random Structures and Algorithms Early View, 1-24 (2010). Internet: <http://dx.doi.org/10.1002/rsa.20341>
Kavitha, T. and J. Mestre: Max-coloring paths: tight bounds and extensions. Journal of Combinatorial Optimization Online First, 1 - 14 (2010). Internet: <http://dx.doi.org/10.1007/s10878-010-9290-1>
McConnella, R.M., K. Mehlhorn, S. Näher and P. Schweitzer: Certifying algorithms. Computer Science Review Article in Press, 1-43 (2010). Internet: <http://dx.doi.org/10.1016/j.cosrev.2010.09.009>
Sagraloff, M.: On the complexity of real root isolation. CoRR abs/1011.0344, 1-33 (2010). Internet: <http://arxiv.org/abs/1011.0344>
Harren, R.: Two-dimensional packing problems. Universität des Saarlandes 2010.
Huber, A.: Randomized rounding and rumor spreading with stochastic dependencies. Universität des Saarlandes 2010.
Johannsen, D.: Random combinatorial structures and randomized search heuristics. Universität des Saarlandes 2010.
Kratsch, S.: Kernelization of generic problems : upper and lower bounds. Universität des Saarlandes 2010.
Pyrga, E.: Algorithmic game theory and networks. Universität des Saarlandes 2010.