Professor Magnus Wahlström

  1. 2022
  2. E-pub ahead of print

    Directed Flow-Augmentation

    Kim, E. J., Kratsch, S., Pilipczuk, M. & Wahlström, M., 11 Apr 2022, (E-pub ahead of print) Proceedings of STOC 2022. Association for Computing Machinery (ACM)

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  3. 2021
  4. E-pub ahead of print

    The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems

    Lagerkvist, V. & Wahlström, M., 15 Dec 2021, (E-pub ahead of print) In: ACM Transactions on Computation Theory (TOCT). 14, 1, p. 1-54 54 p., 2.

    Research output: Contribution to journalArticlepeer-review

  5. Forthcoming

    Quasipolynomial multicut-mimicking networks and kernels for multiway cut problems

    Wahlström, M., 16 Nov 2021, (Accepted/In press) In: ACM Transactions on Algorithms (TALG).

    Research output: Contribution to journalArticlepeer-review

  6. E-pub ahead of print

    Many-visits TSP revisited

    Kowalik, L., Li, S., Nadara, W., Smulewicz, M. & Wahlström, M., 30 Sep 2021, (E-pub ahead of print) In: Journal of Computer and System Sciences.

    Research output: Contribution to journalArticlepeer-review

  7. E-pub ahead of print

    Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs

    He, Z., Li, J. & Wahlström, M., 3 Jul 2021, (E-pub ahead of print) Proceedings of ESA 2021. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, p. 1-14 14 p. 52

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  8. E-pub ahead of print

    Parameterized Pre-coloring Extension and List Coloring Problems

    Gutin, G., Majumdar, D., Ordyniak, S. & Wahlström, M., 29 Mar 2021, (E-pub ahead of print) In: SIAM Journal on Discrete Mathematics. 35, 1, p. 575-596 22 p.

    Research output: Contribution to journalArticlepeer-review

  9. Published

    r-Simple k-Path and Related Problems Parameterized by k/r

    Gutin, G., Wahlström, M. & Zehavi, M., Jan 2021, In: ACM Transactions on Algorithms (TALG). 17, 1, p. 1-64 64 p., 10.

    Research output: Contribution to journalArticlepeer-review

  10. Published

    Solving hard cut problems via flow-augmentation

    Kim, E. J., Kratsch, S., Pilipczuk, M. & Wahlström, M., Jan 2021, Proceedings of SODA 2021. 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  11. 2020
  12. Published

    Component Order Connectivity in Directed Graphs

    Bang-Jensen, J., Eiben, E., Gutin, G., Wahlström, M. & Yeo, A., 4 Dec 2020, Proceedings of IPEC 2020, LIPIcs . Vol. 180. p. 2:1-2:16 16 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  13. Published

    Randomized contractions meet lean decompositions

    Cygan, M., Komosa, P., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S. & Wahlström, M., Dec 2020, In: ACM Transactions on Algorithms (TALG). 17, 1, 30 p., 6.

    Research output: Contribution to journalArticlepeer-review

  14. Published

    Many visits TSP revisited

    Kowalik, L., Li, S., Nadara, W., Smulewicz, M. & Wahlström, M., 26 Aug 2020, ESA 2020. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 173. p. 1-22 22 p. 66

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  15. Published

    On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems

    Wahlström, M., 29 Jun 2020, ICALP 2020. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 168. p. 1-14 14 p. 101

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  16. Published

    Representative sets and irrelevant vertices: New tools for kernelization

    Kratsch, S. & Wahlström, M., Jun 2020, In: Journal of the ACM. p. 1-50 50 p., 16.

    Research output: Contribution to journalArticlepeer-review

  17. Published

    Sparsification of SAT and CSP Problems via Tractable Extensions

    Lagerkvist, V. & Wahlstrom, M., 26 Apr 2020, In: ACM Transactions on Computation Theory (TOCT). 12, 2, p. 1-29 29 p., 13.

    Research output: Contribution to journalArticlepeer-review

  18. Published

    Parameterized Pre-Coloring Extension and List Coloring Problems

    Gutin, G., Majumdar, D., Ordyniak, S. & Wahlström, M., 27 Feb 2020, LIPIcs, Proceedings of STACS 2020. Vol. 154. p. 1-18 18 p. 15

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  19. 2019
  20. E-pub ahead of print

    Multi-budgeted Directed Cuts

    Kratsch, S., Pilipczuk, M., Li, S., Marx, D. & Wahlström, M., 2 Aug 2019, (E-pub ahead of print) In: Algorithmica. p. 1-21 21 p.

    Research output: Contribution to journalArticlepeer-review

  21. Published

    Path-contractions, edge deletions and connectivity preservation

    Gutin, Z., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., May 2019, In: Journal of Computer and System Sciences. 101, p. 1-20 20 p.

    Research output: Contribution to journalArticlepeer-review

  22. E-pub ahead of print

    Alternative parameterizations of Metric Dimension

    Gutin, G., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., 25 Jan 2019, (E-pub ahead of print) In: Theoretical Computer Science. p. 1-11 11 p.

    Research output: Contribution to journalArticlepeer-review

  23. Published

    Multi-Budgeted Directed Cuts

    Kratsch, S., Li, S., Marx, D., Pilipczuk, M. & Wahlstrom, M., 25 Jan 2019, IPEC 2018. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 115. p. 18:1-18:14 14 p. 18. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  24. Published

    On r-Simple k-Path and Related Problems Parameterized by k/r

    Gutin, G., Wahlstrom, M. & Zehavi, M., Jan 2019, Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, p. 1750-1769 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  25. 2018
  26. Published

    Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials

    Gutin, G., Reidl, F., Wahlstrom, M. & Zehavi, M., Aug 2018, In: Journal of Computer and System Sciences. 95, p. 69-85 17 p.

    Research output: Contribution to journalArticlepeer-review

  27. Published

    k-distinct in- and out-branchings in digraphs

    Gutin, G., Reidl, F. & Wahlstrom, M., Aug 2018, In: Journal of Computer and System Sciences. 95, p. 86-97 13 p.

    Research output: Contribution to journalArticlepeer-review

  28. Published

    Directed Multicut is W[1]-hard, Even for Four Terminal Pairs

    Pilipczuk, M. & Wahlstrom, M., 28 Jun 2018, In: ACM Transactions on Computation Theory (TOCT). 10, 3, p. 1-18 18 p., 13.

    Research output: Contribution to journalArticlepeer-review

  29. Published

    Parameterized Algorithms for Zero Extension and Metric Labelling Problems

    Reidl, F. & Wahlstrom, M., 2018, ICALP 2018 Track A. Vol. 107. p. 94:1-94:14 14 p. (Leibniz International Proceedings in Informatics ).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  30. 2017
  31. Published

    Path-Contractions, Edge Deletions and Connectivity Preservation

    Gutin, G., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., 3 Sep 2017, The 25th Annual European Symposium on Algorithms (ESA 2017). p. 1-13 13 p. 47. (LIPICS; vol. 87).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  32. Published

    The power of primitive positive definitions with polynomially many variables

    Lagerkvist, V. & Wahlstrom, M., 1 Jul 2017, In: Journal of Logic and Computation. 27, 5, p. 1465–1488 24 p.

    Research output: Contribution to journalArticlepeer-review

  33. Published

    Odd properly colored cycles in edge-colored graphs

    Gutin, G., Sheng, B. & Wahlstrom, M., Apr 2017, In: Discrete Mathematics. 340, 4, p. 817–821 5 p.

    Research output: Contribution to journalArticlepeer-review

  34. Published

    Acyclicity in edge-colored graphs

    Gutin, G., Jones, M., Sheng, B., Wahlstrom, M. & Yeo, A., 6 Feb 2017, In: Discrete Mathematics. 340, 2, p. 1-8 8 p.

    Research output: Contribution to journalArticlepeer-review

  35. Published

    Rural Postman Parameterized by the Number of Components of Required Edges

    Gutin, G., Wahlström, M. & Yeo, A., Feb 2017, In: Journal of Computer and System Sciences. 83, 1, p. 121-131 11 p.

    Research output: Contribution to journalArticlepeer-review

  36. Published

    Chinese Postman Problem on edge-colored multigraphs

    Gutin, G., Jones, M., Sheng, B., Wahlstrom, M. & Yeo, A., 30 Jan 2017, In: Discrete Applied Mathematics. 217, Part 2, p. 196-202 7 p.

    Research output: Contribution to journalArticlepeer-review

  37. Published

    k-Distinct In- and Out-Branchings in Digraphs

    Gutin, G., Reidl, F. & Wahlstrom, M., 2017, 44th International Colloquium on Automata, Languages, and Programming: ICALP 2017. Dagstuhl, p. 1-13 13 p. (Leibniz International Proceedings in Informatics ; vol. 80).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  38. Published

    Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra

    Lagerkvist, V. & Wahlstrom, M., 2017, Principles and Practice of Constraint Programming: 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings. Springer, p. 157-171 15 p. (Lecture Notes in Computer Science; vol. 10416).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  39. Published

    LP-branching algorithms based on biased graphs

    Wahlström, M., 2017, Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, p. 1559-1570 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  40. Published

    Parameterized Complexity of the Workflow Satisfiability Problem

    Cohen, D., Crampton, J., Gutin, Z. & Wahlstrom, M., 2017, Combinatorial Optimization and Graph Algorithms. Fukunaga, T. & Kawarabayashi, K. (eds.). Springer-Verlag, p. 101-120 20 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  41. 2016
  42. E-pub ahead of print

    The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth

    Gutin, G., Jones, M. & Wahlstrom, M., 29 Nov 2016, (E-pub ahead of print) In: SIAM Journal on Discrete Mathematics. 30, 4, p. 2177-2205 29 p.

    Research output: Contribution to journalArticlepeer-review

  43. Published

    How to Generate Randomized Roundings with Dependencies and How to Derandomize Them

    Doerr, B. & Wahlström, M., 11 Nov 2016, Algorithm Engineering: Selected Results and Surveys. Springer, Vol. 9220. p. 159-184 26 p. (Lecture Notes in Computer Science; vol. 9220).

    Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

  44. Published

    On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations

    Crampton, J., Gagarin, A., Gutin, G., Jones, M. & Wahlstrom, M., Oct 2016, In: ACM Transactions on Privacy and Security. 19, 3, p. 1-29 29 p., 8.

    Research output: Contribution to journalArticlepeer-review

  45. E-pub ahead of print

    Half-integrality, LP-branching, and FPT Algorithms

    Iwata, Y., Wahlstrom, M. & Yoshida, Y., 9 Aug 2016, (E-pub ahead of print) In: SIAM Journal on Computing. 45, 4, p. 1377–1411 35 p.

    Research output: Contribution to journalArticlepeer-review

  46. Published

    On problems as hard as CNF-SAT

    Cygan, M., Dell, H., Lokshtanov, D., Marx, D., Nederlof, J., Okamoto, Y., Paturi, R., Saurabh, S. & Wahlström, M., 1 Jun 2016, In: ACM Transactions on Algorithms (TALG). 12, 3, 41.

    Research output: Contribution to journalArticlepeer-review

  47. Published

    Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis

    Gutin, G. & Wahlstrom, M., Mar 2016, In: Information Processing Letters. 116, 3, p. 223-226 4 p.

    Research output: Contribution to journalArticlepeer-review

  48. Published

    Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

    Kratsch, S., Marx, D. & Wahlstrom, M., 3 Feb 2016, In: ACM Transactions on Computation Theory (TOCT). 8, 1, p. 1-28 28 p.

    Research output: Contribution to journalArticlepeer-review

  49. Published

    Directed multicut is W[1]-hard, even for four terminal pairs

    Pilipczuk, M. & Wahlstrom, M., 2016, Proceedings of SODA 2016. Krauthgamer, R. (ed.). SIAM, p. 1167-1178 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  50. 2015
  51. Published

    A Completeness Theory for Polynomial (Turing) Kernelization

    Hermelin, D., Kratsch, S., Soltys, K., Wahlström, M. & Wu, X., Mar 2015, In: Algorithmica. 71, 3, p. 702-730 29 p.

    Research output: Contribution to journalArticlepeer-review

  52. E-pub ahead of print

    Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs

    Kratsch, S., Pilipczuk, M., Pilipczuk, M. & Wahlström, M., 15 Jan 2015, (E-pub ahead of print) In: SIAM Journal on Discrete Mathematics. 29, 1, p. 122-144 23 p.

    Research output: Contribution to journalArticlepeer-review

  53. Published

    Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

    Gutin, G., Kratsch, S. & Wahlström, M., 2015, In: Algorithmica. p. 1-20 20 p.

    Research output: Contribution to journalArticlepeer-review

  54. Published

    Structural Parameterizations of the Mixed Chinese Postman Problem

    Gutin, G., Jones, M. & Wahlstrom, M., 2015, 23rd Europ. Symp. Algorithms (ESA 2015). Springer-Verlag, Vol. 9294. p. 668-679 (Lect. Notes Comput. Sci.).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  55. 2014
  56. Published

    Randomized Rounding in the Presence of a Cardinality Constraint

    Doerr, B. & Wahlström, M., 1 Sep 2014, In: ACM Journal of Experimental Algorithmics. 19, 2.

    Research output: Contribution to journalArticlepeer-review

  57. Published

    Calculation of Discrepancy Measures and Applications

    Doerr, C., Gnewuch, M. & Wahlström, M., 2014, A Panorama of Discrepancy Theory. Chen, W., Srivastav, A. & Travaglini, G. (eds.). Springer, p. 621-678 58 p. (Lecture Notes in Mathematics; vol. 2107).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  58. Forthcoming

    Clique cover and graph separation: New incompressibility results

    Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M. & Wahlström, M., 2014, (Accepted/In press) In: ACM Transactions on Computation Theory (TOCT). 6, 2

    Research output: Contribution to journalArticlepeer-review

  59. Forthcoming

    Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal

    Kratsch, S. & Wahlström, M., 2014, (Accepted/In press) In: ACM Transactions on Algorithms (TALG). 10, 4, 20 p.

    Research output: Contribution to journalArticlepeer-review

  60. Published

    Half-integrality, LP-branching and FPT Algorithms

    Wahlström, M., 2014, SODA. Chekuri, C. (ed.). SIAM, p. 1762-1781 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  61. Published

    Kernelization, Matroid Methods

    Wahlström, M., 2014, Encyclopedia of Algorithms. Kao, M-Y. (ed.). Springer, p. 1-6 6 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  62. Published

    Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs

    Gutin, G., Jones, M., Sheng, B. & Wahlström, M., 2014, Proceedings of WG 2014.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  63. Published

    Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

    Gutin, G., Kratsch, S. & Wahlström, M., 2014, Proceedings of IPEC 2014.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  64. Published

    Polynomially Closed Co-clones

    Lagerkvist, V. & Wahlström, M., 2014, Proceedings of ISMVL 2014: IEEE 44th International Symposium on Multiple-Valued Logic. IEEE, p. 85-90 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  65. 2013
  66. Published

    A Completeness Theory for Polynomial (Turing) Kernelization

    Hermelin, D., Kratsch, S., Soltys, K., Wahlström, M. & Wu, X., 2013, IPEC. Springer, Vol. LNCS 8246. p. 202 215 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  67. Published

    Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem

    Wahlström, M., 2013, STACS. p. 341-352 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  68. Published

    Parameterized Two-Player Nash Equilibrium

    Hermelin, D., Huang, C-C., Kratsch, S. & Wahlström, M., 2013, In: Algorithmica. 65, 4, p. 802-816 15 p.

    Research output: Contribution to journalArticlepeer-review

  69. Published

    Two Edge Modification Problems Without Polynomial Kernels

    Kratsch, S. & Wahlström, M., 2013, In: Discrete Optimization. 10, p. 193-199

    Research output: Contribution to journalArticlepeer-review

  70. 2012
  71. Published

    A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting

    Gnewuch, M., Wahlström, M. & Winzen, C., 2012, In: SIAM Journal on Numerical Analysis. 50, 2, p. 781-807 27 p.

    Research output: Contribution to journalArticlepeer-review

  72. Published

    Clique Cover and Graph Separation: New Incompressibility Results

    Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M. & Wahlström, M., 2012, ICALP (1). p. 254-265 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  73. Published

    Compression via matroids: a randomized polynomial kernel for odd cycle transversal

    Kratsch, S. & Wahlström, M., 2012, SODA. p. 94-103 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  74. Published

    Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs

    Kratsch, S., Pilipczuk, M., Pilipczuk, M. & Wahlström, M., 2012, ICALP (1). p. 581-593 13 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  75. Published

    Hardness of discrepancy computation and epsilon-net verification in high dimension

    Giannopoulos, P., Knauer, C., Wahlström, M. & Werner, D., 2012, In: Journal of Complexity. 28, 2, p. 162-176 15 p.

    Research output: Contribution to journalArticlepeer-review

  76. Published

    On Problems as Hard as CNF-SAT

    Cygan, M., Dell, H., Lokshtanov, D., Marx, D., Nederlof, J., Okamoto, Y., Paturi, R., Saurabh, S. & Wahlström, M., 2012, IEEE Conference on Computational Complexity. p. 74-84 11 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  77. Published

    Representative sets and irrelevant vertices: New tools for kernelization

    Kratsch, S. & Wahlström, M., 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 450-459 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  78. Published

    Subexponential Parameterized Odd Cycle Transversal on Planar Graphs

    Lokshtanov, D., Saurabh, S. & Wahlström, M., 2012, FSTTCS.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  79. 2011
  80. Published

    Dependent Randomized Rounding: The Bipartite Case

    Doerr, B., Künnemann, M. & Wahlström, M., 2011, 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Müller-Hannemann, M. & Werneck, R. (eds.). San Francisco, California, USA: SIAM, p. 96-106 11 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  81. Unpublished

    Hierarchies of Inefficient Kernelizability

    Hermelin, D., Kratsch, S., Soltys, K., Wahlström, M. & Wu, X., 2011, (Unpublished) In: ArXiv.org. CoRR:abs/1110.0976

    Research output: Contribution to journalArticlepeer-review

  82. Published

    New Plain-Exponential Time Classes for Graph Homomorphism

    Wahlström, M., 2011, In: Theory of Computing Systems. 49, 2, p. 273-282 10 p.

    Research output: Contribution to journalArticlepeer-review

  83. Published

    Parameterized Two-Player Nash Equilibrium

    Hermelin, D., Huang, C-C., Kratsch, S. & Wahlström, M., 2011, Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011. Kolman, P. & Kratochvíl, J. (eds.). Teplá Monastery, Czech Republic: Springer, Vol. 6986. p. 215-226 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  84. 2010
  85. Published

    Algorithmic construction of low-discrepancy point sets via dependent randomized rounding

    Doerr, B., Gnewuch, M. & Wahlström, M., 2010, In: Journal of Complexity. 26, 5, p. 490-507 18 p.

    Research output: Contribution to journalArticlepeer-review

  86. Published

    Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

    Kratsch, S., Marx, D. & Wahlström, M., 2010, Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010. Hlinený, P. & Kucera, A. (eds.). Brno, Czech Republic: Springer, Vol. 6281. p. 489-500 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  87. Published

    Preprocessing of Min Ones Problems: A Dichotomy

    Kratsch, S. & Wahlström, M., 2010, Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F. & Spirakis, P. G. (eds.). Bordeaux, France: Springer, Vol. 6198. p. 653-665 13 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  88. Published

    Randomized Rounding for Routing and Covering Problems: Experiments and Improvements

    Doerr, B., Künnemann, M. & Wahlström, M., 2010, Experimental Algorithms : 9th International Symposium, SEA 2010. Festa, P. (ed.). Naples, Italy: Springer, Vol. 6049. p. 190-201 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  89. 2009
  90. Published

    Two Edge Modification Problems without Polynomial Kernels

    Kratsch, S. & Wahlström, M., 1 Sep 2009, Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009. Chen, J. & Fomin, F. V. (eds.). Denmark, Copenhagen: Springer, Vol. 5917. p. 264-275 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  91. Published

    Implementation of a component-by-component algorithm to generate small low-discrepancy samples

    Doerr, B., Gnewuch, M. & Wahlström, M., 1 Jul 2009, Monte Carlo and Quasi-Monte Carlo Methods 2008. L'Ecuyer, P. & Owen, A. B. (eds.). Montreal, Canada: Springer, p. 323-338 16 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  92. Published

    A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams

    Böcker, S., Hüffner, F., Truss, A. & Wahlström, M., 2009, Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009. Chen, J. & Fomin, F. V. (eds.). Copenhagen, Denmark: Springer, Vol. 5917. p. 38-49 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  93. Published

    BBOB: Nelder-Mead with resize and halfruns

    Doerr, B., Fouz, M., Schmidt, M. & Wahlström, M., 2009, Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009). Rothlauf, F. (ed.). Montreal, Québec, Canada: ACM, p. 2239-2246 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  94. Published

    New Plain-Exponential Time Classes for Graph Homomorphism

    Wahlström, M., 2009, Computer Science - Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009. Frid, A., Morozov, A., Rybalchenko, A. & Wagner, K. W. (eds.). Novosibirsk, Russia: Springer, Vol. 5675. p. 346-355 10 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  95. Published

    Randomized Rounding in the Presence of a Cardinality Constraint

    Doerr, B. & Wahlström, M., 2009, 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX). Finocchi, I. & Hershberger, J. (eds.). New York, USA: SIAM, p. 162-174 13 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  96. Published

    Solving SAT for CNF formulas with a one-sided variable occurrence restriction

    Johannsen, D., Razgon, I. & Wahlström, M., 2009, Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009. Kullmann, O. (ed.). Swansea, Wales, United Kingdom: Springer, Vol. 5584. p. 80-85 6 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  97. 2008
  98. Published

    A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances

    Wahlström, M., 1 May 2008, 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008). Grohe, M. & Niedermeier, R. (eds.). Victoria (BC), Canada: Springer, Vol. 5018. p. 202-213 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  99. 2005
  100. Published

    An Algorithm for the SAT Problem for Formulae of Linear Length

    Wahlström, M., 2005, ESA. p. 107-118 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  101. Published

    Counting models for 2SAT and 3SAT formulae

    Dahllöf, V., Jonsson, P. & Wahlström, M., 2005, In: Theoretical Computer Science. 332, 1-3, p. 265-291 27 p.

    Research output: Contribution to journalArticlepeer-review

  102. Published

    Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable

    Wahlström, M., 2005, SAT. p. 309-323 15 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  103. 2004
  104. Published

    Exact algorithms for finding minimum transversals in rank-3 hypergraphs

    Wahlström, M., 2004, In: Journal of Algorithms. 51, 2, p. 107-121 15 p.

    Research output: Contribution to journalArticlepeer-review

  105. 2002
  106. Published

    Counting Satisfying Assignments in 2-SAT and 3-SAT

    Dahllöf, V., Jonsson, P. & Wahlström, M., 2002, COCOON. p. 535-543 9 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution