Holger Dell

	2012
10		Holger Dell, Dániel Marx: Kernelization of packing problems. SODA 2012: 68-81
	2011
9		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)
8		Holger Dell: Sparse instances of hard problems. Humboldt University of Berlin 2011
	2010
7		Holger Dell, Thore Husfeldt, Martin Wahlen: Exponential Time Complexity of the Permanent and the Tutte Polynomial. ICALP (1) 2010: 426-437
6		Holger Dell, Dieter van Melkebeek: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. STOC 2010: 251-260
5		Dieter van Melkebeek, Holger Dell: Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Electronic Colloquium on Computational Complexity (ECCC) 17: 38 (2010)
4		Holger Dell, Thore Husfeldt, Martin Wahlen: Exponential Time Complexity of the Permanent and the Tutte Polynomial. Electronic Colloquium on Computational Complexity (ECCC) 17: 78 (2010)
3		Markus Bläser, Holger Dell, Johann A. Makowsky: Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions. Theory Comput. Syst. 46(4): 690-706 (2010)
	2008
2		Markus Bläser, Holger Dell, Johann A. Makowsky: Complexity of the Bollobás-Riordan Polynomial. CSR 2008: 86-98
	2007
1		Markus Bläser, Holger Dell: Complexity of the Cover Polynomial. ICALP 2007: 801-812

Coauthor Index

1	Markus Bläser	[1] [2] [3]
2	Marek Cygan	[9]
3	Thore Husfeldt	[4] [7]
4	Daniel Lokshtanov	[9]
5	Johann A. Makowsky (Janos Makowsky)	[2] [3]
6	Dániel Marx	[9] [10]
7	Dieter van Melkebeek	[5] [6]
8	Jesper Nederlof	[9]
9	Yoshio Okamoto	[9]
10	Ramamohan Paturi	[9]
11	Saket Saurabh	[9]
12	Martin Wahlen	[4] [7]
13	Magnus Wahlström	[9]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page