Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Dantchev, Stefan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cutting planes and the parameter cutwidth
Stefan Dantchev
,
Barnaby Martin
Theory of Computing Systems
51
(1), 2012, pp. 50-64
Sublinear-time algorithms for tournament graphs
Stefan Dantchev
,
Tom Friedetzky
,
Lars Nagel
Lecture Notes in Computer Science
5609
, 2009, pp. 459-471
Tight rank lower bounds for the Sherali-Adams proof system
Stefan Dantchev
,
Barnaby Martin
,
Mark Rhodes
Theoretical Computer Science
410
(21-23), 2009, pp. 2054-2063
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
Stefan Dantchev
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 311-317
On the complexity of integer programming in the Blum-Shub-Smale computational model
Valentin E. Brimkov
,
Stefan S. Dantchev
Lecture Notes in Computer Science
1872
, 2000, pp. 286-300
On the algebraic complexity of integer programming
Valentin Brimkov
,
Stefan Dantchev
Technical Report (TR00-017), 2000
Tree resolution proofs of the weak pigeon-hole principle
Stefan Dantchev
,
Sren Riis
Proceedings of the 16th Annual IEEE Conference on Computational Complexity (Chicago, Illinois, June 18-21, 2001)
, 2000, pp. 69-75