MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 25 documents:

  1. Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
    Magnus Wahlström
    In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13), Kiel, Germany, 2013
  2. Calculation of Discrepancy Measures and Applications
    Carola Doerr, Michael Gnewuch, and Magnus Wahlström
    In: A Panorama of Discrepancy Theory, 2013, 1-55. Note: To appear
  3. A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
    Michael Gnewuch, Magnus Wahlström, and Carola Winzen
    SIAM Journal on Numerical Analysis 50 (2): 781-807, 2012. Note: Also available from arxiv.
  4. Clique Cover and Graph Separation: New Incompressibility Results
    Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Magnus Wahlström
    In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 254-265
  5. Compression via matroids: a randomized polynomial kernel for odd cycle transversal
    Stefan Kratsch and Magnus Wahlström
    In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 94-103
  6. Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
    Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Magnus Wahlström
    In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 581-593
  7. Hardness of discrepancy computation and ε-net verification in high dimension
    Panos Giannopoulos, Christian Knauer, Magnus Wahlström, and Daniel Werner
    Journal of Complexity 28 (2): 162-176, 2012
  8. On Problems as Hard as CNF-SAT
    Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström
    In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), Porto, Portugal, 2012, 74-84
  9. Representative Sets and Irrelevant Vertices: New Tools for Kernelization
    Stefan Kratsch and Magnus Wahlström
    In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), New Brunswick, NJ, 2012, 450-459
  10. Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
    Daniel Lokshtanov, Saket Saurabh, and Magnus Wahlström
    In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), Hyderabad, India, 2012, 424-434
  11. Dependent Randomized Rounding: The Bipartite Case
    Benjamin Doerr, Marvin Künnemann, and Magnus Wahlström
    In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), San Francisco, California, USA, 2011, 96-106
  12. New Plain-Exponential Time Classes for Graph Homomorphism
    Magnus Wahlström
    Theory of Computing Systems 49 (2): 273-282, 2011
  13. Parameterized Two-Player Nash Equilibrium
    Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, and Magnus Wahlström
    In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, 2011, 215-226
  14. Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
    Benjamin Doerr, Michael Gnewuch, and Magnus Wahlström
    Journal of Complexity 26 (5): 490-507, 2010
  15. Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
    Stefan Kratsch, Dániel Marx, and Magnus Wahlström
    In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, Brno, Czech Republic, 2010, 489-500
  16. Preprocessing of Min Ones Problems: A Dichotomy
    Stefan Kratsch and Magnus Wahlström
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, 2010, 653-665
  17. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
    Benjamin Doerr, Marvin Künnemann, and Magnus Wahlström
    In: Experimental Algorithms : 9th International Symposium, SEA 2010, Naples, Italy, 2010, 190-201
  18. A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
    Magnus Wahlström
    In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), Victoria (BC), Canada, 2008, 202-213
  19. A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
    Sebastian Böcker, Falk Hüffner, Anke Truss, and Magnus Wahlström
    In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, 2009, 38-49
  20. Implementation of a component-by-component algorithm to generate small low-discrepancy samples
    Benjamin Doerr, Michael Gnewuch, and Magnus Wahlström
    In: Monte Carlo and Quasi-Monte Carlo Methods 2008, Montreal, Canada, 2009, 323-338
  21. New Plain-Exponential Time Classes for Graph Homomorphism
    Magnus Wahlström
    In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, 2009, 346-355
  22. Randomized Rounding in the Presence of a Cardinality Constraint
    Benjamin Doerr and Magnus Wahlström
    In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), New York, USA, 2009, 162-174
  23. Solving SAT for CNF formulas with a one-sided variable occurrence restriction
    Daniel Johannsen, Igor Razgon, and Magnus Wahlström
    In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, Swansea, Wales, United Kingdom, 2009, 80-85
    [PDF: Download: JohannsenRazgonWahlstroem_2008_SolvingSATForCNFFormulasWithAOnesidedRestrictionOnVariableOccurrences.pdf]
  24. Two Edge Modification Problems without Polynomial Kernels
    Stefan Kratsch and Magnus Wahlström
    In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, Denmark, Copenhagen, 2009, 264-275
  25. BBOB: Nelder-Mead with resize and halfruns
    Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, and Magnus Wahlström
    In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), Montreal, Québec, Canada, 2009, 2239-2246