Stefan S. Dantchev

	2012
34		Stefan S. Dantchev, Barnaby Martin: The limits of tractability in Resolution-based propositional proof systems. Ann. Pure Appl. Logic 163(6): 656-668 (2012)
33		Stefan S. Dantchev, Barnaby Martin: Parameterized Resolution with bounded conjunction CoRR abs/1204.2983: (2012)
32		Stefan S. Dantchev, Barnaby Martin: Cutting Planes and the Parameter Cutwidth. Theory Comput. Syst. 51(1): 50-64 (2012)
	2011
31		Stefan S. Dantchev: Dynamic Neighbourhood Cellular Automata. Comput. J. 54(1): 26-30 (2011)
30		Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. Computational Complexity 20(1): 51-85 (2011)
29		Stefan S. Dantchev, Tom Friedetzky, Lars Nagel: Sublinear-time algorithms for tournament graphs. J. Comb. Optim. 22(3): 469-481 (2011)
	2010
28		Stefan S. Dantchev, Barnaby Martin: The Limits of Tractability in Resolution-Based Propositional Proof Systems. CiE 2010: 98-107
27		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 8(2): 101 (2010)
	2009
26		Stefan S. Dantchev, Tom Friedetzky, Lars Nagel: Sublinear-Time Algorithms for Tournament Graphs. COCOON 2009: 459-471
25		Stefan S. Dantchev, Barnaby Martin: Cutting Planes and the Parameter Cutwidth. CiE 2009: 134-143
24		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 7(2): 147 (2009)
23		Stefan S. Dantchev, Barnaby Martin, Mark Nicholas Charles Rhodes: Tight rank lower bounds for the Sherali-Adams proof system. Theor. Comput. Sci. 410(21-23): 2054-2063 (2009)
	2008
22		Stefan S. Dantchev: Dynamic Neighbourhood Cellular Automata. BCS Int. Acad. Conf. 2008: 60-68
21		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Preface. J. Discrete Algorithms 6(4): 539 (2008)
	2007
20		Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. FOCS 2007: 150-160
19		Stefan S. Dantchev: Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. STOC 2007: 311-317
18		Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. Electronic Colloquium on Computational Complexity (ECCC) 14(001): (2007)
17		Valentin E. Brimkov, Stefan S. Dantchev: Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. Image Vision Comput. 25(10): 1631-1643 (2007)
	2006
16		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK King's College, London 2006
15		Stefan S. Dantchev: Relativisation Provides Natural Separations for Resolution-Based Proof Systems. CSR 2006: 147-158
14		Stefan S. Dantchev, Florent R. Madelaine: Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. CSR 2006: 159-170
13		Stefan S. Dantchev: On the Complexity of the Sperner Lemma. CiE 2006: 115-124
	2005
12		Valentin E. Brimkov, Stefan S. Dantchev: Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. DGCI 2005: 287-298
11		Stefan S. Dantchev, Frank D. Valencia: On the computational limits of infinite satisfaction. SAC 2005: 393-397
	2003
10		Stefan S. Dantchev, Søren Riis: On Relativisation and Complexity Gap. CSL 2003: 142-154
	2002
9		Stefan S. Dantchev: Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. IEEE Conference on Computational Complexity 2002: 39-43
8		Valentin E. Brimkov, Stefan S. Dantchev: An alternative to Ben-Or's lower bound for the knapsack problem complexity. Appl. Math. Lett. 15(2): 187-191 (2002)
7		Stefan S. Dantchev: Improved sorting-based procedure for integer programming. Math. Program. 92(2): 297-300 (2002)
	2001
6		Stefan S. Dantchev, Søren Riis: "Planar" Tautologies Hard for Resolution. FOCS 2001: 220-229
5		Stefan S. Dantchev, Søren Riis: Tree Resolution Proofs of the Weak Pigeon-Hole Principle. IEEE Conference on Computational Complexity 2001: 69-75
	2000
4		Valentin E. Brimkov, Stefan S. Dantchev: On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. IFIP TCS 2000: 286-300
3		Valentin E. Brimkov, Stefan S. Dantchev: On the Algebraic Complexity of Integer Programming Electronic Colloquium on Computational Complexity (ECCC) 7(17): (2000)
	1998
2		Valentin E. Brimkov, Stefan S. Dantchev: Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients Electronic Colloquium on Computational Complexity (ECCC) 5(15): (1998)
	1997
1		Valentin E. Brimkov, Stefan S. Dantchev: Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. J. Complexity 13(2): 279-300 (1997)

Coauthor Index

1	Valentin E. Brimkov	[1] [2] [3] [4] [8] [12] [17]
2	Hajo Broersma (H. J. Broersma)	[16] [21] [24] [27]
3	Tom Friedetzky	[26] [29]
4	Matthew Johnson	[16] [21] [24] [27]
5	Florent R. Madelaine	[14]
6	Barnaby Martin	[18] [20] [23] [25] [28] [30] [32] [33] [34]
7	Lars Nagel	[26] [29]
8	Mark Nicholas Charles Rhodes	[23]
9	Søren Riis	[5] [6] [10]
10	Stefan Szeider	[16] [18] [20] [21] [24] [27] [30]
11	Frank D. Valencia (Frank Valencia)	[11]

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