|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner |
Hardness of discrepancy computation and ε-net verification in high dimension.  |
J. Complexity  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gnewuch, Magnus Wahlström, Carola Winzen |
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting. |
SIAM J. Numerical Analysis |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström |
Fixed-parameter tractability of multicut in directed acyclic graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kratsch, Magnus Wahlström |
Compression via matroids: a randomized polynomial kernel for odd cycle transversal. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner |
Hardness of discrepancy computation and epsilon-net verification in high dimension |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström |
Clique cover and graph separation: New incompressibility results |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kratsch, Magnus Wahlström |
Representative sets and irrelevant vertices: New tools for kernelization |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu |
Hierarchies of Inefficient Kernelizability |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael Gnewuch, Magnus Wahlström, Carola Winzen |
A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kratsch, Magnus Wahlström |
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Magnus Wahlström |
New Plain-Exponential Time Classes for Graph Homomorphism. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström |
Parameterized Two-Player Nash Equilibrium. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Marvin Künnemann, Magnus Wahlström |
Dependent Randomized Rounding: The Bipartite Case. |
ALENEX |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Michael Gnewuch, Magnus Wahlström |
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. |
J. Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Marvin Künnemann, Magnus Wahlström |
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström |
Parameterized Two-Player Nash Equilibrium |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kratsch, Magnus Wahlström |
Preprocessing of Min Ones Problems: A Dichotomy. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Dániel Marx, Magnus Wahlström |
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Marvin Künnemann, Magnus Wahlström |
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. |
SEA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Magnus Wahlström |
Preprocessing of Min Ones Problems: A Dichotomy |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Magnus Wahlström |
New Plain-Exponential Time Classes for Graph Homomorphism. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, Magnus Wahlström |
BBOB: Nelder-Mead with resize and halfruns. |
GECCO (Companion) |
2009 |
DBLP DOI BibTeX RDF |
evolutionary computation, benchmarking, black-box optimization |
| 1 | Daniel Johannsen, Igor Razgon, Magnus Wahlström |
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Magnus Wahlström |
Randomized Rounding in the Presence of a Cardinality Constraint. |
ALENEX |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kratsch, Magnus Wahlström |
Two Edge Modification Problems without Polynomial Kernels. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström |
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Wahlström |
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström |
Counting models for 2SAT and 3SAT formulae. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Wahlström |
An Algorithm for the SAT Problem for Formulae of Linear Length. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Wahlström |
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Wahlström |
Exact algorithms for finding minimum transversals in rank-3 hypergraphs. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström |
Counting Satisfying Assignments in 2-SAT and 3-SAT. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")