Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMagnus Wahlström
Person information
- affiliation: Royal Holloway, University of London, UK
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j43]Eun Jung Kim
, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström:
On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. 38(1): 170-189 (2024)- [c50]Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. SODA 2024: 377-423 - [c49]Magnus Wahlström:
Representative set statements for delta-matroids and the Mader delta-matroid. SODA 2024: 780-810 - [i48]Tomohiro Koana, Magnus Wahlström:
Faster algorithms on linear delta-matroids. CoRR abs/2402.11596 (2024) - 2023
- [j42]Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström:
p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133: 23-40 (2023) - [j41]Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo:
Preference swaps for the stable matching problem. Theor. Comput. Sci. 940(Part): 222-230 (2023) - [c48]George Osipov, Magnus Wahlström:
Parameterized Complexity of Equality MinCSP. ESA 2023: 86:1-86:17 - [c47]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Almost Consistent Systems of Linear Equations. SODA 2023: 3179-3217 - [c46]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. SODA 2023: 3218-3228 - [e1]Neeldhara Misra, Magnus Wahlström:
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands. LIPIcs 285, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-305-8 [contents] - [i47]Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. CoRR abs/2304.02091 (2023) - [i46]George Osipov, Magnus Wahlström:
Parameterized Complexity of Equality MinCSP. CoRR abs/2305.11131 (2023) - [i45]Magnus Wahlström:
Representative set statements for delta-matroids and the Mader delta-matroid. CoRR abs/2306.03605 (2023) - 2022
- [j40]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. Algorithmica 84(9): 2767-2784 (2022) - [j39]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many-visits TSP revisited. J. Comput. Syst. Sci. 124: 112-128 (2022) - [j38]Magnus Wahlström:
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems. ACM Trans. Algorithms 18(2): 15:1-15:19 (2022) - [j37]Victor Lagerkvist, Magnus Wahlström:
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. ACM Trans. Comput. Theory 14(1): 2:1-2:54 (2022) - [c45]Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the Parameterized Complexity of Symmetric Directed Multicut. IPEC 2022: 11:1-11:17 - [c44]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Directed flow-augmentation. STOC 2022: 938-947 - [i44]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. CoRR abs/2207.07422 (2022) - [i43]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Almost Consistent Systems of Linear Equations. CoRR abs/2208.02732 (2022) - [i42]Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the parameterized complexity of symmetric directed multicut. CoRR abs/2208.09017 (2022) - [i41]Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström:
On weighted graph separation problems and flow-augmentation. CoRR abs/2208.14841 (2022) - 2021
- [j36]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35(1): 575-596 (2021) - [j35]Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström:
Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms 17(1): 6:1-6:30 (2021) - [j34]Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
r-Simple k-Path and Related Problems Parameterized by k/r. ACM Trans. Algorithms 17(1): 10:1-10:64 (2021) - [c43]Zhiyang He, Jason Li, Magnus Wahlström:
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. ESA 2021: 52:1-52:14 - [c42]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Solving hard cut problems via flow-augmentation. SODA 2021: 149-168 - [i40]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Directed flow-augmentation. CoRR abs/2111.03450 (2021) - [i39]Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo:
Preference Swaps for the Stable Matching Problem. CoRR abs/2112.15361 (2021) - 2020
- [j33]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-budgeted Directed Cuts. Algorithmica 82(8): 2135-2155 (2020) - [j32]Stefan Kratsch, Magnus Wahlström:
Representative Sets and Irrelevant Vertices: New Tools for Kernelization. J. ACM 67(3): 16:1-16:50 (2020) - [j31]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. 806: 133-143 (2020) - [j30]Victor Lagerkvist, Magnus Wahlström:
Sparsification of SAT and CSP Problems via Tractable Extensions. ACM Trans. Comput. Theory 12(2): 13:1-13:29 (2020) - [c41]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many Visits TSP Revisited. ESA 2020: 66:1-66:22 - [c40]Magnus Wahlström:
On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems. ICALP 2020: 101:1-101:14 - [c39]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. IPEC 2020: 2:1-2:16 - [c38]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. STACS 2020: 19:1-19:18 - [i38]Magnus Wahlström:
On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems. CoRR abs/2002.08825 (2020) - [i37]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many visits TSP revisited. CoRR abs/2005.02329 (2020) - [i36]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. CoRR abs/2007.06896 (2020) - [i35]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Solving hard cut problems via flow-augmentation. CoRR abs/2007.09018 (2020) - [i34]Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström:
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. CoRR abs/2009.08158 (2020)
2010 – 2019
- 2019
- [j29]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. 101: 1-20 (2019) - [c37]Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
On r-Simple k-Path and Related Problems Parameterized by k/r. SODA 2019: 1750-1769 - [i33]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-coloring Extension and List Coloring Problems. CoRR abs/1907.12061 (2019) - 2018
- [j28]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi:
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. J. Comput. Syst. Sci. 95: 69-85 (2018) - [j27]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström:
k-distinct in- and out-branchings in digraphs. J. Comput. Syst. Sci. 95: 86-97 (2018) - [j26]Marcin Pilipczuk, Magnus Wahlström:
Directed Multicut is W[1]-hard, Even for Four Terminal Pairs. ACM Trans. Comput. Theory 10(3): 13:1-13:18 (2018) - [c36]Felix Reidl, Magnus Wahlström:
Parameterized Algorithms for Zero Extension and Metric Labelling Problems. ICALP 2018: 94:1-94:14 - [c35]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-Budgeted Directed Cuts. IPEC 2018: 18:1-18:14 - [p2]Magnus Wahlström:
Euler Digraphs. Classes of Directed Graphs 2018: 173-205 - [i32]Victor Lagerkvist, Magnus Wahlström:
Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms? CoRR abs/1801.09488 (2018) - [i31]Felix Reidl, Magnus Wahlström:
Parameterized Algorithms for Zero Extension and Metric Labelling Problems. CoRR abs/1802.06026 (2018) - [i30]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Alternative parameterizations of Metric Dimension. CoRR abs/1804.10670 (2018) - [i29]Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
On r-Simple k-Path and Related Problems Parameterized by k/r. CoRR abs/1806.09108 (2018) - [i28]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-budgeted directed cuts. CoRR abs/1810.06848 (2018) - 2017
- [j25]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. 217: 196-202 (2017) - [j24]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in edge-colored graphs. Discret. Math. 340(2): 1-8 (2017) - [j23]Gregory Z. Gutin, Bin Sheng, Magnus Wahlström:
Odd properly colored cycles in edge-colored graphs. Discret. Math. 340(4): 817-821 (2017) - [j22]Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. 83(1): 121-131 (2017) - [j21]Victor Lagerkvist, Magnus Wahlström:
The power of primitive positive definitions with polynomially many variables. J. Log. Comput. 27(5): 1465-1488 (2017) - [c34]Victor Lagerkvist, Magnus Wahlström:
Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra. CP 2017: 157-171 - [c33]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-Contractions, Edge Deletions and Connectivity Preservation. ESA 2017: 47:1-47:13 - [c32]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström:
k-Distinct In- and Out-Branchings in Digraphs. ICALP 2017: 58:1-58:13 - [c31]Magnus Wahlström:
LP-branching algorithms based on biased graphs. SODA 2017: 1559-1570 - [i27]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-contractions, edge deletions and connectivity preservation. CoRR abs/1704.06622 (2017) - [i26]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi:
Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. CoRR abs/1706.03698 (2017) - [i25]Victor Lagerkvist, Magnus Wahlström:
Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra. CoRR abs/1706.05941 (2017) - [i24]Marek Cygan, Fedor V. Fomin, Danny Hermelin, Magnus Wahlström:
Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). Dagstuhl Reports 7(1): 103-128 (2017) - 2016
- [j20]Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström:
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Algorithmica 75(2): 383-402 (2016) - [j19]Gregory Z. Gutin, Magnus Wahlström:
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis. Inf. Process. Lett. 116(3): 223-226 (2016) - [j18]Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida:
Half-integrality, LP-branching, and FPT Algorithms. SIAM J. Comput. 45(4): 1377-1411 (2016) - [j17]Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth. SIAM J. Discret. Math. 30(4): 2177-2205 (2016) - [j16]Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström:
On Problems as Hard as CNF-SAT. ACM Trans. Algorithms 12(3): 41:1-41:24 (2016) - [j15]Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. ACM Trans. Priv. Secur. 19(3): 8:1-8:29 (2016) - [j14]Stefan Kratsch, Dániel Marx, Magnus Wahlström:
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. ACM Trans. Comput. Theory 8(1): 1:1-1:28 (2016) - [c30]Marcin Pilipczuk, Magnus Wahlström:
Directed multicut is W[1]-hard, even for four terminal pairs. SODA 2016: 1167-1178 - [p1]Benjamin Doerr, Magnus Wahlström:
How to Generate Randomized Roundings with Dependencies and How to Derandomize Them. Algorithm Engineering 2016: 159-184 - [r1]Magnus Wahlström:
Kernelization, Matroid Methods. Encyclopedia of Algorithms 2016: 1017-1021 - [i23]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in Edge-Colored Graphs. CoRR abs/1601.01824 (2016) - [i22]Magnus Wahlström:
LP-branching algorithms based on biased graphs. CoRR abs/1610.06060 (2016) - [i21]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström:
$k$-Distinct In- and Out-Branchings in Digraphs. CoRR abs/1612.03607 (2016) - 2015
- [j13]Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu:
A Completeness Theory for Polynomial (Turing) Kernelization. Algorithmica 71(3): 702-730 (2015) - [j12]Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström:
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. SIAM J. Discret. Math. 29(1): 122-144 (2015) - [c29]Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
Structural Parameterizations of the Mixed Chinese Postman Problem. ESA 2015: 668-679 - [c28]Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini:
Bounded Bases of Strong Partial Clones. ISMVL 2015: 189-194 - [i20]Marcin Pilipczuk, Magnus Wahlström:
Directed multicut is W[1]-hard, even for four terminal pairs. CoRR abs/1507.02178 (2015) - [i19]Gregory Z. Gutin, Magnus Wahlström:
Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis. CoRR abs/1508.06829 (2015) - [i18]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Chinese Postman Problem on Edge-Colored Multigraphs. CoRR abs/1512.06283 (2015) - 2014
- [j11]Benjamin Doerr, Magnus Wahlström:
Randomized Rounding in the Presence of a Cardinality Constraint. ACM J. Exp. Algorithmics 19(1) (2014) - [j10]Stefan Kratsch, Magnus Wahlström:
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal. ACM Trans. Algorithms 10(4): 20:1-20:15 (2014) - [j9]Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström:
Clique Cover and Graph Separation: New Incompressibility Results. ACM Trans. Comput. Theory 6(2): 6:1-6:19 (2014) - [c27]Victor Lagerkvist, Magnus Wahlström:
Polynomially Closed Co-clones. ISMVL 2014: 85-90 - [c26]Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström:
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. IPEC 2014: 208-220 - [c25]Magnus Wahlström:
Half-integrality, LP-branching and FPT Algorithms. SODA 2014: 1762-1781 - [c24]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström:
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. WG 2014: 250-262 - [i17]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström:
Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs. CoRR abs/1402.2137 (2014) - [i16]Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström:
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. CoRR abs/1409.7261 (2014) - [i15]Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
Structural Parameterizations of the Mixed Chinese Postman Problem. CoRR abs/1410.5191 (2014) - 2013
- [j8]Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström:
Parameterized Two-Player Nash Equilibrium. Algorithmica 65(4): 802-816 (2013) - [j7]Stefan Kratsch, Magnus Wahlström:
Two edge modification problems without polynomial kernels. Discret. Optim. 10(3): 193-199 (2013) - [c23]Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu:
A Completeness Theory for Polynomial (Turing) Kernelization. IPEC 2013: 202-215 - [c22]Magnus Wahlström:
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem. STACS 2013: 341-352 - [i14]Magnus Wahlström:
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem. CoRR abs/1301.1517 (2013) - [i13]Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Parameterized Rural Postman and Conjoining Bipartite Matching Problems. CoRR abs/1308.2599 (2013) - [i12]Magnus Wahlström:
Half-integrality, LP-branching and FPT Algorithms. CoRR abs/1310.2841 (2013) - 2012
- [j6]Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner:
Hardness of discrepancy computation and ε-net verification in high dimension. J. Complex. 28(2): 162-176 (2012) - [j5]Michael Gnewuch, Magnus Wahlström, Carola Winzen:
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting. SIAM J. Numer. Anal. 50(2): 781-807 (2012) - [c21]Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström:
On Problems as Hard as CNF-SAT. CCC 2012: 74-84 - [c20]Stefan Kratsch, Magnus Wahlström:
Representative Sets and Irrelevant Vertices: New Tools for Kernelization. FOCS 2012: 450-459 - [c19]Daniel Lokshtanov, Saket Saurabh, Magnus Wahlström:
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. FSTTCS 2012: 424-434 - [c18]Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström:
Clique Cover and Graph Separation: New Incompressibility Results. ICALP (1) 2012: 254-265 - [c17]Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström:
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. ICALP (1) 2012: 581-593 - [c16]Stefan Kratsch, Magnus Wahlström:
Compression via matroids: a randomized polynomial kernel for odd cycle transversal. SODA 2012: 94-103 - [i11]Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström:
Fixed-parameter tractability of multicut in directed acyclic graphs. CoRR abs/1202.5749 (2012) - 2011
- [j4]Magnus Wahlström:
New Plain-Exponential Time Classes for Graph Homomorphism. Theory Comput. Syst. 49(2): 273-282 (2011) - [c15]Benjamin Doerr, Marvin Künnemann, Magnus Wahlström:
Dependent Randomized Rounding: The Bipartite Case. ALENEX 2011: 96-106 - [c14]Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström:
Parameterized Two-Player Nash Equilibrium. WG 2011: 215-226 - [i10]Michael Gnewuch, Magnus Wahlström, Carola Winzen:
A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy. CoRR abs/1103.2102 (2011) - [i9]Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner:
Hardness of discrepancy computation and epsilon-net verification in high dimension. CoRR abs/1103.4503 (2011) - [i8]Stefan Kratsch, Magnus Wahlström:
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal. CoRR abs/1107.3068 (2011) - [i7]Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu:
Hierarchies of Inefficient Kernelizability. CoRR abs/1110.0976 (2011) - [i6]Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström:
Clique cover and graph separation: New incompressibility results. CoRR abs/1111.0570 (2011) - [i5]Stefan Kratsch, Magnus Wahlström:
Representative sets and irrelevant vertices: New tools for kernelization. CoRR abs/1111.2195 (2011) - [i4]Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström:
On Problems as Hard as CNFSAT. CoRR abs/1112.2275 (2011) - 2010
- [j3]Benjamin Doerr, Michael Gnewuch, Magnus Wahlström:
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. J. Complex. 26(5): 490-507 (2010) - [c13]Stefan Kratsch, Magnus Wahlström:
Preprocessing of Min Ones Problems: A Dichotomy. ICALP (1) 2010: 653-665 - [c12]Stefan Kratsch, Dániel Marx, Magnus Wahlström:
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. MFCS 2010: 489-500 - [c11]Benjamin Doerr, Marvin Künnemann, Magnus Wahlström:
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. SEA 2010: 190-201 - [i3]Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström:
Parameterized Two-Player Nash Equilibrium. CoRR abs/1006.2063 (2010) - [i2]Benjamin Doerr, Marvin Künnemann, Magnus Wahlström:
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. CoRR abs/1007.0372 (2010)
2000 – 2009
- 2009
- [c10]Benjamin Doerr, Magnus Wahlström:
Randomized Rounding in the Presence of a Cardinality Constraint. ALENEX 2009: 162-174 - [c9]Magnus Wahlström:
New Plain-Exponential Time Classes for Graph Homomorphism. CSR 2009: 346-355 - [c8]Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, Magnus Wahlström:
BBOB: Nelder-Mead with resize and halfruns. GECCO (Companion) 2009: 2239-2246 - [c7]Sebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström:
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. IWPEC 2009: 38-49 - [c6]Stefan Kratsch, Magnus Wahlström:
Two Edge Modification Problems without Polynomial Kernels. IWPEC 2009: 264-275 - [c5]Daniel Johannsen, Igor Razgon, Magnus Wahlström:
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. SAT 2009: 80-85 - [i1]Stefan Kratsch, Magnus Wahlström:
Preprocessing of Min Ones Problems: A Dichotomy. CoRR abs/0910.4518 (2009) - 2008
- [c4]Magnus Wahlström:
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. IWPEC 2008: 202-213 - 2007
- [b1]Magnus Wahlström:
Algorithms, measures and upper bounds for satisfiability and related problems. Linköping University, Sweden, 2007 - 2005
- [j2]Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström:
Counting models for 2SAT and 3SAT formulae. Theor. Comput. Sci. 332(1-3): 265-291 (2005) - [c3]Magnus Wahlström:
An Algorithm for the SAT Problem for Formulae of Linear Length. ESA 2005: 107-118 - [c2]Magnus Wahlström:
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable. SAT 2005: 309-323 - 2004
- [j1]Magnus Wahlström:
Exact algorithms for finding minimum transversals in rank-3 hypergraphs. J. Algorithms 51(2): 107-121 (2004) - 2002
- [c1]Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström:
Counting Satisfying Assignments in 2-SAT and 3-SAT. COCOON 2002: 535-543
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
