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
[1]
Hilfe
Suche: Author="Martin, Barnaby"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
QCSP on semicomplete digraphs
Petar Dapić
,
Petar Marković
,
Barnaby Martin
Lecture Notes in Computer Science
8572
, 2014, pp. 847-858
Cutting planes and the parameter cutwidth
Stefan Dantchev
,
Barnaby Martin
Theory of Computing Systems
51
(1), 2012, pp. 50-64
Finding vertex-surjective graph homomorphisms
Petr A. Golovach
,
Bernard Lidický
,
Barnaby Martin
,
Daniël Paulusma
Acta Informatica
49
(6), 2012, pp. 381-394
Finding vertex-surjective graph homomorphisms
Petr A. Golovach
,
Bernard Lidický
,
Barnaby Martin
,
Daniël Paulusma
Lecture Notes in Computer Science
7353
, 2012, pp. 160-171
Constraint satisfaction with counting quantifiers
Florent Madelaine
,
Barnaby Martin
,
Juraj Stacho
Lecture Notes in Computer Science
7353
, 2012, pp. 253-265
Distance constraint satisfaction problems
Manuel Bodirsky
,
Victor Dalmau
,
Barnaby Martin
,
Michael Pinsker
Lecture Notes in Computer Science
6281
, 2010, pp. 162-173
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