default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Stefan S. Dantchev

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Stefan S. Dantchev

download as .bib file

@article{DBLP:journals/jsat/BeyersdorffCDM24,
  author       = {Olaf Beyersdorff and
                  Judith Clymo and
                  Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {The Riis Complexity Gap for {QBF} Resolution},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {15},
  number       = {1},
  pages        = {9--25},
  year         = {2024}
}

@article{DBLP:journals/lmcs/DantchevGGM24,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Abdul Ghani and
                  Barnaby Martin},
  title        = {Depth lower bounds in Stabbing Planes for combinatorial principles},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {20},
  number       = {1},
  year         = {2024}
}

@article{DBLP:journals/siamcomp/DantchevGGM24,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Abdul Ghani and
                  Barnaby Martin},
  title        = {Proof Complexity and the Binary Encoding of Combinatorial Principles},
  journal      = {{SIAM} J. Comput.},
  volume       = {53},
  number       = {3},
  pages        = {764--802},
  year         = {2024}
}

@inproceedings{DBLP:conf/stacs/DantchevGGM22,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Abdul Ghani and
                  Barnaby Martin},
  title        = {Depth Lower Bounds in Stabbing Planes for Combinatorial Principles},
  booktitle    = {{STACS}},
  series       = {LIPIcs},
  volume       = {219},
  pages        = {24:1--24:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022}
}

@article{DBLP:journals/corr/abs-2102-07622,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Abdul Ghani and
                  Barnaby Martin},
  title        = {Depth lower bounds in Stabbing Planes for combinatorial principles},
  journal      = {CoRR},
  volume       = {abs/2102.07622},
  year         = {2021}
}

@article{DBLP:journals/eccc/DantchevGGM21,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Abdul Ghani and
                  Barnaby Martin},
  title        = {Depth lower bounds in Stabbing Planes for combinatorial principles},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR21-022}},
  year         = {2021}
}

@inproceedings{DBLP:conf/latin/DantchevGM20,
  author       = {Stefan S. Dantchev and
                  Abdul Ghani and
                  Barnaby Martin},
  title        = {Sherali-Adams and the Binary Encoding of Combinatorial Principles},
  booktitle    = {{LATIN}},
  series       = {Lecture Notes in Computer Science},
  volume       = {12118},
  pages        = {336--347},
  publisher    = {Springer},
  year         = {2020}
}

@article{DBLP:journals/corr/abs-2008-02138,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Abdul Ghani and
                  Barnaby Martin},
  title        = {Proof complexity and the binary encoding of combinatorial principles},
  journal      = {CoRR},
  volume       = {abs/2008.02138},
  year         = {2020}
}

@inproceedings{DBLP:conf/coco/DantchevGM19,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Barnaby Martin},
  title        = {Resolution and the Binary Encoding of Combinatorial Principles},
  booktitle    = {{CCC}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {6:1--6:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019}
}

@article{DBLP:journals/corr/abs-1911-00403,
  author       = {Stefan S. Dantchev and
                  Abdul Ghani and
                  Barnaby Martin},
  title        = {Sherali-Adams and the binary encoding of combinatorial principles},
  journal      = {CoRR},
  volume       = {abs/1911.00403},
  year         = {2019}
}

@article{DBLP:journals/corr/abs-1809-02843,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Barnaby Martin},
  title        = {Resolution and the binary encoding of combinatorial principles},
  journal      = {CoRR},
  volume       = {abs/1809.02843},
  year         = {2018}
}

@article{DBLP:journals/eccc/BeyersdorffCDM18,
  author       = {Olaf Beyersdorff and
                  Judith Clymo and
                  Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {The Riis Complexity Gap for {QBF} Resolution},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR18-024}},
  year         = {2018}
}

@article{DBLP:journals/eccc/DantchevGM18,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Barnaby Martin},
  title        = {Resolution and the binary encoding of combinatorial principles},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR18-165}},
  year         = {2018}
}

@inproceedings{DBLP:conf/mmcs/DantchevI16,
  author       = {Stefan S. Dantchev and
                  Ioannis P. Ivrissimtzis},
  title        = {Simplicial Complex Entropy},
  booktitle    = {{MMCS}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10521},
  pages        = {96--107},
  publisher    = {Springer},
  year         = {2016}
}

@article{DBLP:journals/corr/DantchevI16,
  author       = {Stefan S. Dantchev and
                  Ioannis P. Ivrissimtzis},
  title        = {Simplicial Complex Entropy},
  journal      = {CoRR},
  volume       = {abs/1603.07135},
  year         = {2016}
}

@article{DBLP:journals/apal/DantchevM14,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {Relativization makes contradictions harder for Resolution},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {165},
  number       = {3},
  pages        = {837--857},
  year         = {2014}
}

@article{DBLP:journals/cc/DantchevM13,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {Rank complexity gap for Lov{\'{a}}sz-Schrijver and Sherali-Adams
                  proof systems},
  journal      = {Comput. Complex.},
  volume       = {22},
  number       = {1},
  pages        = {191--213},
  year         = {2013}
}

@inproceedings{DBLP:conf/csr/DantchevM13,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {Parameterized Resolution with Bounded Conjunction},
  booktitle    = {{CSR}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7913},
  pages        = {139--149},
  publisher    = {Springer},
  year         = {2013}
}

@article{DBLP:journals/corr/abs-1304-4287,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {Relativisation makes contradictions harder for Resolution},
  journal      = {CoRR},
  volume       = {abs/1304.4287},
  year         = {2013}
}

@article{DBLP:journals/apal/DantchevM12,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {The limits of tractability in Resolution-based propositional proof
                  systems},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {163},
  number       = {6},
  pages        = {656--668},
  year         = {2012}
}

@article{DBLP:journals/cg/DantchevI12,
  author       = {Stefan S. Dantchev and
                  Ioannis P. Ivrissimtzis},
  title        = {Efficient construction of the {\v{C}}ech complex},
  journal      = {Comput. Graph.},
  volume       = {36},
  number       = {6},
  pages        = {708--713},
  year         = {2012}
}

@article{DBLP:journals/mst/DantchevM12,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {Cutting Planes and the Parameter Cutwidth},
  journal      = {Theory Comput. Syst.},
  volume       = {51},
  number       = {1},
  pages        = {50--64},
  year         = {2012}
}

@article{DBLP:journals/corr/abs-1204-2983,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {Parameterized Resolution with bounded conjunction},
  journal      = {CoRR},
  volume       = {abs/1204.2983},
  year         = {2012}
}

@article{DBLP:journals/cc/DantchevMS11,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin and
                  Stefan Szeider},
  title        = {Parameterized Proof Complexity},
  journal      = {Comput. Complex.},
  volume       = {20},
  number       = {1},
  pages        = {51--85},
  year         = {2011}
}

@article{DBLP:journals/cj/Dantchev11,
  author       = {Stefan S. Dantchev},
  title        = {Dynamic Neighbourhood Cellular Automata},
  journal      = {Comput. J.},
  volume       = {54},
  number       = {1},
  pages        = {26--30},
  year         = {2011}
}

@article{DBLP:journals/jco/DantchevFN11,
  author       = {Stefan S. Dantchev and
                  Tom Friedetzky and
                  Lars Nagel},
  title        = {Sublinear-time algorithms for tournament graphs},
  journal      = {J. Comb. Optim.},
  volume       = {22},
  number       = {3},
  pages        = {469--481},
  year         = {2011}
}

@article{DBLP:journals/jda/BroersmaDJS10,
  author       = {Hajo Broersma and
                  Stefan S. Dantchev and
                  Matthew Johnson and
                  Stefan Szeider},
  title        = {Editorial},
  journal      = {J. Discrete Algorithms},
  volume       = {8},
  number       = {2},
  pages        = {101},
  year         = {2010}
}

@inproceedings{DBLP:conf/cie/DantchevM10,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {The Limits of Tractability in Resolution-Based Propositional Proof
                  Systems},
  booktitle    = {CiE},
  series       = {Lecture Notes in Computer Science},
  volume       = {6158},
  pages        = {98--107},
  publisher    = {Springer},
  year         = {2010}
}

@article{DBLP:journals/jda/BroersmaDJS09,
  author       = {Hajo Broersma and
                  Stefan S. Dantchev and
                  Matthew Johnson and
                  Stefan Szeider},
  title        = {Editorial},
  journal      = {J. Discrete Algorithms},
  volume       = {7},
  number       = {2},
  pages        = {147},
  year         = {2009}
}

@article{DBLP:journals/tcs/DantchevMR09,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin and
                  Mark Nicholas Charles Rhodes},
  title        = {Tight rank lower bounds for the Sherali-Adams proof system},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {21-23},
  pages        = {2054--2063},
  year         = {2009}
}

@inproceedings{DBLP:conf/cie/DantchevM09,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin},
  title        = {Cutting Planes and the Parameter Cutwidth},
  booktitle    = {CiE},
  series       = {Lecture Notes in Computer Science},
  volume       = {5635},
  pages        = {134--143},
  publisher    = {Springer},
  year         = {2009}
}

@inproceedings{DBLP:conf/cocoon/DantchevFN09,
  author       = {Stefan S. Dantchev and
                  Tom Friedetzky and
                  Lars Nagel},
  title        = {Sublinear-Time Algorithms for Tournament Graphs},
  booktitle    = {{COCOON}},
  series       = {Lecture Notes in Computer Science},
  volume       = {5609},
  pages        = {459--471},
  publisher    = {Springer},
  year         = {2009}
}

@article{DBLP:journals/jda/BroersmaDJS08,
  author       = {Hajo Broersma and
                  Stefan S. Dantchev and
                  Matthew Johnson and
                  Stefan Szeider},
  title        = {Preface},
  journal      = {J. Discrete Algorithms},
  volume       = {6},
  number       = {4},
  pages        = {539},
  year         = {2008}
}

@inproceedings{DBLP:conf/bcs/Dantchev08,
  author       = {Stefan S. Dantchev},
  title        = {Dynamic Neighbourhood Cellular Automata},
  booktitle    = {{BCS} Int. Acad. Conf},
  pages        = {60--68},
  publisher    = {British Computer Society},
  year         = {2008}
}

@article{DBLP:journals/ivc/BrimkovD07,
  author       = {Valentin E. Brimkov and
                  Stefan S. Dantchev},
  title        = {Digital hyperplane recognition in arbitrary fixed dimension within
                  an algebraic computation model},
  journal      = {Image Vis. Comput.},
  volume       = {25},
  number       = {10},
  pages        = {1631--1643},
  year         = {2007}
}

@inproceedings{DBLP:conf/focs/DantchevMS07,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin and
                  Stefan Szeider},
  title        = {Parameterized Proof Complexity},
  booktitle    = {{FOCS}},
  pages        = {150--160},
  publisher    = {{IEEE} Computer Society},
  year         = {2007}
}

@inproceedings{DBLP:conf/stoc/Dantchev07,
  author       = {Stefan S. Dantchev},
  title        = {Rank complexity gap for Lov{\'{a}}sz-Schrijver and Sherali-Adams
                  proof systems},
  booktitle    = {{STOC}},
  pages        = {311--317},
  publisher    = {{ACM}},
  year         = {2007}
}

@article{DBLP:journals/eccc/DantchevMS07,
  author       = {Stefan S. Dantchev and
                  Barnaby Martin and
                  Stefan Szeider},
  title        = {Parameterized Proof Complexity: a Complexity Gap for Parameterized
                  Tree-like Resolution},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR07-001}},
  year         = {2007}
}

@inproceedings{DBLP:conf/cie/Dantchev06,
  author       = {Stefan S. Dantchev},
  title        = {On the Complexity of the Sperner Lemma},
  booktitle    = {CiE},
  series       = {Lecture Notes in Computer Science},
  volume       = {3988},
  pages        = {115--124},
  publisher    = {Springer},
  year         = {2006}
}

@inproceedings{DBLP:conf/csr/Dantchev06,
  author       = {Stefan S. Dantchev},
  title        = {Relativisation Provides Natural Separations for Resolution-Based Proof
                  Systems},
  booktitle    = {{CSR}},
  series       = {Lecture Notes in Computer Science},
  volume       = {3967},
  pages        = {147--158},
  publisher    = {Springer},
  year         = {2006}
}

@inproceedings{DBLP:conf/csr/DantchevM06,
  author       = {Stefan S. Dantchev and
                  Florent R. Madelaine},
  title        = {Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction
                  Problems},
  booktitle    = {{CSR}},
  series       = {Lecture Notes in Computer Science},
  volume       = {3967},
  pages        = {159--170},
  publisher    = {Springer},
  year         = {2006}
}

@proceedings{DBLP:conf/acid/2006,
  editor       = {Hajo Broersma and
                  Stefan S. Dantchev and
                  Matthew Johnson and
                  Stefan Szeider},
  title        = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
                  ACiD Workshop, 18-20 September 2006, Durham, {UK}},
  series       = {Texts in Algorithmics},
  volume       = {7},
  publisher    = {King's College, London},
  year         = {2006}
}

@inproceedings{DBLP:conf/dgci/BrimkovD05,
  author       = {Valentin E. Brimkov and
                  Stefan S. Dantchev},
  title        = {Complexity Analysis for Digital Hyperplane Recognition in Arbitrary
                  Fixed Dimension},
  booktitle    = {{DGCI}},
  series       = {Lecture Notes in Computer Science},
  volume       = {3429},
  pages        = {287--298},
  publisher    = {Springer},
  year         = {2005}
}

@inproceedings{DBLP:conf/sac/DantchevV05,
  author       = {Stefan S. Dantchev and
                  Frank D. Valencia},
  title        = {On the computational limits of infinite satisfaction},
  booktitle    = {{SAC}},
  pages        = {393--397},
  publisher    = {{ACM}},
  year         = {2005}
}

@inproceedings{DBLP:conf/csl/DantchevR03,
  author       = {Stefan S. Dantchev and
                  S{\o}ren Riis},
  title        = {On Relativisation and Complexity Gap},
  booktitle    = {{CSL}},
  series       = {Lecture Notes in Computer Science},
  volume       = {2803},
  pages        = {142--154},
  publisher    = {Springer},
  year         = {2003}
}

@article{DBLP:journals/appml/BrimkovD02,
  author       = {Valentin E. Brimkov and
                  Stefan S. Dantchev},
  title        = {An alternative to Ben-Or's lower bound for the knapsack problem complexity},
  journal      = {Appl. Math. Lett.},
  volume       = {15},
  number       = {2},
  pages        = {187--191},
  year         = {2002}
}

@article{DBLP:journals/mp/Dantchev02,
  author       = {Stefan S. Dantchev},
  title        = {Improved sorting-based procedure for integer programming},
  journal      = {Math. Program.},
  volume       = {92},
  number       = {2},
  pages        = {297--300},
  year         = {2002}
}

@inproceedings{DBLP:conf/coco/Dantchev02,
  author       = {Stefan S. Dantchev},
  title        = {Resolution Width-Size Trade-offs for the Pigeon-Hole Principle},
  booktitle    = {{CCC}},
  pages        = {39--43},
  publisher    = {{IEEE} Computer Society},
  year         = {2002}
}

@inproceedings{DBLP:conf/coco/DantchevR01,
  author       = {Stefan S. Dantchev and
                  S{\o}ren Riis},
  title        = {Tree Resolution Proofs of the Weak Pigeon-Hole Principle},
  booktitle    = {{CCC}},
  pages        = {69--75},
  publisher    = {{IEEE} Computer Society},
  year         = {2001}
}

@inproceedings{DBLP:conf/focs/DantchevR01,
  author       = {Stefan S. Dantchev and
                  S{\o}ren Riis},
  title        = {"Planar" Tautologies Hard for Resolution},
  booktitle    = {{FOCS}},
  pages        = {220--229},
  publisher    = {{IEEE} Computer Society},
  year         = {2001}
}

@inproceedings{DBLP:conf/ifipTCS/BrimkovD00,
  author       = {Valentin E. Brimkov and
                  Stefan S. Dantchev},
  title        = {On the Complexity of Integer Programming in the Blum-Shub-Smale Computational
                  Model},
  booktitle    = {{IFIP} {TCS}},
  series       = {Lecture Notes in Computer Science},
  volume       = {1872},
  pages        = {286--300},
  publisher    = {Springer},
  year         = {2000}
}

@article{DBLP:journals/eccc/ECCC-TR00-017,
  author       = {Valentin E. Brimkov and
                  Stefan S. Dantchev},
  title        = {On the Algebraic Complexity of Integer Programming},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR00-017}},
  year         = {2000}
}

@article{DBLP:journals/eccc/ECCC-TR98-015,
  author       = {Valentin E. Brimkov and
                  Stefan S. Dantchev},
  title        = {Lower Bounds, "Pseudopolynomial" and Approximation Algorithms
                  for the Knapsack Problem with Real Coefficients},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR98-015}},
  year         = {1998}
}

@article{DBLP:journals/jc/BrimkovD97,
  author       = {Valentin E. Brimkov and
                  Stefan S. Dantchev},
  title        = {Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational
                  Model},
  journal      = {J. Complex.},
  volume       = {13},
  number       = {2},
  pages        = {279--300},
  year         = {1997}
}

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.