default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan S. Dantchev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Olaf Beyersdorff, Judith Clymo, Stefan S. Dantchev, Barnaby Martin:
The Riis Complexity Gap for QBF Resolution. J. Satisf. Boolean Model. Comput. 15(1): 9-25 (2024)- [j18]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth lower bounds in Stabbing Planes for combinatorial principles. Log. Methods Comput. Sci. 20(1) (2024) - [j17]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Proof Complexity and the Binary Encoding of Combinatorial Principles. SIAM J. Comput. 53(3): 764-802 (2024) - 2022
- [c21]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. STACS 2022: 24:1-24:18 - 2021
- [i13]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth lower bounds in Stabbing Planes for combinatorial principles. CoRR abs/2102.07622 (2021) - [i12]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth lower bounds in Stabbing Planes for combinatorial principles. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c20]Stefan S. Dantchev, Abdul Ghani, Barnaby Martin:
Sherali-Adams and the Binary Encoding of Combinatorial Principles. LATIN 2020: 336-347 - [i11]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Proof complexity and the binary encoding of combinatorial principles. CoRR abs/2008.02138 (2020)
2010 – 2019
- 2019
- [c19]Stefan S. Dantchev
, Nicola Galesi, Barnaby Martin:
Resolution and the Binary Encoding of Combinatorial Principles. CCC 2019: 6:1-6:25 - [i10]Stefan S. Dantchev, Abdul Ghani, Barnaby Martin:
Sherali-Adams and the binary encoding of combinatorial principles. CoRR abs/1911.00403 (2019) - 2018
- [i9]Stefan S. Dantchev, Nicola Galesi, Barnaby Martin:
Resolution and the binary encoding of combinatorial principles. CoRR abs/1809.02843 (2018) - [i8]Olaf Beyersdorff, Judith Clymo, Stefan S. Dantchev, Barnaby Martin:
The Riis Complexity Gap for QBF Resolution. Electron. Colloquium Comput. Complex. TR18 (2018) - [i7]Stefan S. Dantchev, Nicola Galesi, Barnaby Martin:
Resolution and the binary encoding of combinatorial principles. Electron. Colloquium Comput. Complex. TR18 (2018) - 2016
- [c18]Stefan S. Dantchev, Ioannis P. Ivrissimtzis:
Simplicial Complex Entropy. MMCS 2016: 96-107 - [i6]Stefan S. Dantchev, Ioannis P. Ivrissimtzis:
Simplicial Complex Entropy. CoRR abs/1603.07135 (2016) - 2014
- [j16]Stefan S. Dantchev, Barnaby Martin:
Relativization makes contradictions harder for Resolution. Ann. Pure Appl. Log. 165(3): 837-857 (2014) - 2013
- [j15]Stefan S. Dantchev, Barnaby Martin:
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Comput. Complex. 22(1): 191-213 (2013) - [c17]Stefan S. Dantchev, Barnaby Martin:
Parameterized Resolution with Bounded Conjunction. CSR 2013: 139-149 - [i5]Stefan S. Dantchev, Barnaby Martin:
Relativisation makes contradictions harder for Resolution. CoRR abs/1304.4287 (2013) - 2012
- [j14]Stefan S. Dantchev, Barnaby Martin:
The limits of tractability in Resolution-based propositional proof systems. Ann. Pure Appl. Log. 163(6): 656-668 (2012) - [j13]Stefan S. Dantchev, Ioannis P. Ivrissimtzis:
Efficient construction of the Čech complex. Comput. Graph. 36(6): 708-713 (2012) - [j12]Stefan S. Dantchev, Barnaby Martin:
Cutting Planes and the Parameter Cutwidth. Theory Comput. Syst. 51(1): 50-64 (2012) - [i4]Stefan S. Dantchev, Barnaby Martin:
Parameterized Resolution with bounded conjunction. CoRR abs/1204.2983 (2012) - 2011
- [j11]Stefan S. Dantchev, Barnaby Martin, Stefan Szeider:
Parameterized Proof Complexity. Comput. Complex. 20(1): 51-85 (2011) - [j10]Stefan S. Dantchev:
Dynamic Neighbourhood Cellular Automata. Comput. J. 54(1): 26-30 (2011) - [j9]Stefan S. Dantchev, Tom Friedetzky, Lars Nagel:
Sublinear-time algorithms for tournament graphs. J. Comb. Optim. 22(3): 469-481 (2011) - 2010
- [j8]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 8(2): 101 (2010) - [c16]Stefan S. Dantchev, Barnaby Martin:
The Limits of Tractability in Resolution-Based Propositional Proof Systems. CiE 2010: 98-107
2000 – 2009
- 2009
- [j7]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 7(2): 147 (2009) - [j6]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) - [c15]Stefan S. Dantchev, Barnaby Martin:
Cutting Planes and the Parameter Cutwidth. CiE 2009: 134-143 - [c14]Stefan S. Dantchev, Tom Friedetzky, Lars Nagel:
Sublinear-Time Algorithms for Tournament Graphs. COCOON 2009: 459-471 - 2008
- [j5]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Preface. J. Discrete Algorithms 6(4): 539 (2008) - [c13]Stefan S. Dantchev:
Dynamic Neighbourhood Cellular Automata. BCS Int. Acad. Conf. 2008: 60-68 - 2007
- [j4]Valentin E. Brimkov, Stefan S. Dantchev:
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. Image Vis. Comput. 25(10): 1631-1643 (2007) - [c12]Stefan S. Dantchev, Barnaby Martin, Stefan Szeider:
Parameterized Proof Complexity. FOCS 2007: 150-160 - [c11]Stefan S. Dantchev:
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. STOC 2007: 311-317 - [i3]Stefan S. Dantchev, Barnaby Martin, Stefan Szeider:
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c10]Stefan S. Dantchev:
On the Complexity of the Sperner Lemma. CiE 2006: 115-124 - [c9]Stefan S. Dantchev:
Relativisation Provides Natural Separations for Resolution-Based Proof Systems. CSR 2006: 147-158 - [c8]Stefan S. Dantchev, Florent R. Madelaine:
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. CSR 2006: 159-170 - [e1]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. Texts in Algorithmics 7, King's College, London 2006, ISBN 1-904987-38-9 [contents] - 2005
- [c7]Valentin E. Brimkov, Stefan S. Dantchev:
Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. DGCI 2005: 287-298 - [c6]Stefan S. Dantchev, Frank D. Valencia:
On the computational limits of infinite satisfaction. SAC 2005: 393-397 - 2003
- [c5]Stefan S. Dantchev, Søren Riis:
On Relativisation and Complexity Gap. CSL 2003: 142-154 - 2002
- [j3]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) - [j2]Stefan S. Dantchev:
Improved sorting-based procedure for integer programming. Math. Program. 92(2): 297-300 (2002) - [c4]Stefan S. Dantchev:
Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. CCC 2002: 39-43 - 2001
- [c3]Stefan S. Dantchev, Søren Riis:
Tree Resolution Proofs of the Weak Pigeon-Hole Principle. CCC 2001: 69-75 - [c2]Stefan S. Dantchev, Søren Riis:
"Planar" Tautologies Hard for Resolution. FOCS 2001: 220-229 - 2000
- [c1]Valentin E. Brimkov, Stefan S. Dantchev:
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. IFIP TCS 2000: 286-300 - [i2]Valentin E. Brimkov, Stefan S. Dantchev:
On the Algebraic Complexity of Integer Programming. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1998
- [i1]Valentin E. Brimkov, Stefan S. Dantchev:
Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j1]Valentin E. Brimkov, Stefan S. Dantchev:
Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. J. Complex. 13(2): 279-300 (1997)
Coauthor Index
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-11-27 20:23 CET 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:
