Stefan S. Dantchev

54 papers A* 3A 4B 2C 3Misc 5Journal 32Unranked 4

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Depth lower bounds in Stabbing Planes for combinatorial principles. Log. Methods Comput. Sci. Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
2024	J	`jnl`	Proof Complexity and the Binary Encoding of Combinatorial Principles. SIAM J. Comput. Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
2024	J	`jnl`	The Riis Complexity Gap for QBF Resolution. J. Satisf. Boolean Model. Comput. Olaf Beyersdorff, Judith Clymo, Stefan S. Dantchev, Barnaby Martin
2022	A	`conf`	Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. STACS Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
2021	J	`jnl`	Depth lower bounds in Stabbing Planes for combinatorial principles. CoRR Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
2021	J	`jnl`	Depth lower bounds in Stabbing Planes for combinatorial principles. Electron. Colloquium Comput. Complex. Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
2020	J	`jnl`	Proof complexity and the binary encoding of combinatorial principles. CoRR Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
2020	B	`conf`	Sherali-Adams and the Binary Encoding of Combinatorial Principles. LATIN Stefan S. Dantchev, Abdul Ghani, Barnaby Martin
2019	A	`conf`	Resolution and the Binary Encoding of Combinatorial Principles. CCC Stefan S. Dantchev, Nicola Galesi, Barnaby Martin
2019	J	`jnl`	Sherali-Adams and the binary encoding of combinatorial principles. CoRR Stefan S. Dantchev, Abdul Ghani, Barnaby Martin
2018	J	`jnl`	Resolution and the binary encoding of combinatorial principles. CoRR Stefan S. Dantchev, Nicola Galesi, Barnaby Martin
2018	J	`jnl`	Resolution and the binary encoding of combinatorial principles. Electron. Colloquium Comput. Complex. Stefan S. Dantchev, Nicola Galesi, Barnaby Martin
2018	J	`jnl`	The Riis Complexity Gap for QBF Resolution. Electron. Colloquium Comput. Complex. Olaf Beyersdorff, Judith Clymo, Stefan S. Dantchev, Barnaby Martin
2016	—	`conf`	Simplicial Complex Entropy. MMCS Stefan S. Dantchev, Ioannis P. Ivrissimtzis
2016	J	`jnl`	Simplicial Complex Entropy. CoRR Stefan S. Dantchev, Ioannis P. Ivrissimtzis
2014	J	`jnl`	Relativization makes contradictions harder for Resolution. Ann. Pure Appl. Log. Stefan S. Dantchev, Barnaby Martin
2013	Misc	`conf`	Parameterized Resolution with Bounded Conjunction. CSR Stefan S. Dantchev, Barnaby Martin
2013	J	`jnl`	Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Comput. Complex. Stefan S. Dantchev, Barnaby Martin
2013	J	`jnl`	Relativisation makes contradictions harder for Resolution CoRR Stefan S. Dantchev, Barnaby Martin
2012	J	`jnl`	Cutting Planes and the Parameter Cutwidth. Theory Comput. Syst. Stefan S. Dantchev, Barnaby Martin
2012	J	`jnl`	Efficient construction of the Čech complex. Comput. Graph. Stefan S. Dantchev, Ioannis P. Ivrissimtzis
2012	J	`jnl`	Parameterized Resolution with bounded conjunction CoRR Stefan S. Dantchev, Barnaby Martin
2012	J	`jnl`	The limits of tractability in Resolution-based propositional proof systems. Ann. Pure Appl. Log. Stefan S. Dantchev, Barnaby Martin
2011	J	`jnl`	Dynamic Neighbourhood Cellular Automata. Comput. J. Stefan S. Dantchev
2011	J	`jnl`	Parameterized Proof Complexity. Comput. Complex. Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
2011	J	`jnl`	Sublinear-time algorithms for tournament graphs. J. Comb. Optim. Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
2010	J	`jnl`	Editorial. J. Discrete Algorithms Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2010	C	`conf`	The Limits of Tractability in Resolution-Based Propositional Proof Systems. CiE Stefan S. Dantchev, Barnaby Martin
2009	C	`conf`	Cutting Planes and the Parameter Cutwidth. CiE Stefan S. Dantchev, Barnaby Martin
2009	J	`jnl`	Editorial. J. Discrete Algorithms Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2009	Misc	`conf`	Sublinear-Time Algorithms for Tournament Graphs. COCOON Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
2009	J	`jnl`	Tight rank lower bounds for the Sherali-Adams proof system. Theor. Comput. Sci. Stefan S. Dantchev, Barnaby Martin, Mark Nicholas Charles Rhodes
2008	—	`conf`	Dynamic Neighbourhood Cellular Automata. BCS Int. Acad. Conf. Stefan S. Dantchev
2008	J	`jnl`	Preface. J. Discrete Algorithms Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2007	J	`jnl`	Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. Image Vis. Comput. Valentin E. Brimkov, Stefan S. Dantchev
2007	A*	`conf`	Parameterized Proof Complexity. FOCS Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
2007	J	`jnl`	Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. Electron. Colloquium Comput. Complex. Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
2007	A*	`conf`	Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. STOC Stefan S. Dantchev
2006	—	`ed.`	Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK ACiD Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2006	Misc	`conf`	Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. CSR Stefan S. Dantchev, Florent R. Madelaine
2006	C	`conf`	On the Complexity of the Sperner Lemma. CiE Stefan S. Dantchev
2006	Misc	`conf`	Relativisation Provides Natural Separations for Resolution-Based Proof Systems. CSR Stefan S. Dantchev
2005	—	`conf`	Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. DGCI Valentin E. Brimkov, Stefan S. Dantchev
2005	Misc	`conf`	On the computational limits of infinite satisfaction. SAC Stefan S. Dantchev, Frank D. Valencia
2003	B	`conf`	On Relativisation and Complexity Gap. CSL Stefan S. Dantchev, Søren Riis
2002	J	`jnl`	An alternative to Ben-Or's lower bound for the knapsack problem complexity. Appl. Math. Lett. Valentin E. Brimkov, Stefan S. Dantchev
2002	J	`jnl`	Improved sorting-based procedure for integer programming. Math. Program. Stefan S. Dantchev
2002	A	`conf`	Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. CCC Stefan S. Dantchev
2001	A*	`conf`	"Planar" Tautologies Hard for Resolution. FOCS Stefan S. Dantchev, Søren Riis
2001	A	`conf`	Tree Resolution Proofs of the Weak Pigeon-Hole Principle. CCC Stefan S. Dantchev, Søren Riis
2000	J	`jnl`	On the Algebraic Complexity of Integer Programming Electron. Colloquium Comput. Complex. Valentin E. Brimkov, Stefan S. Dantchev
2000	—	`conf`	On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. IFIP TCS Valentin E. Brimkov, Stefan S. Dantchev
1998	J	`jnl`	Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients Electron. Colloquium Comput. Complex. Valentin E. Brimkov, Stefan S. Dantchev
1997	J	`jnl`	Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. J. Complex. Valentin E. Brimkov, Stefan S. Dantchev