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="Bodirsky, Manuel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of constraint satisfaction problems
Manuel Bodirsky
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 2-9
Datalog and constraint satisfaction with infinite templates
Manuel Bodirsky
,
Víctor Dalmau
Journal of Computer and System Sciences
79
(1), 2013, pp. 79-100
On the complexity of MMSNP
Manuel Bodirsky
,
Hubie Chen
,
Tomás Feder
SIAM Journal on Discrete Mathematics
26
(1), 2012, pp. 404-414
Boltzmann samplers, Pólya theory, and cycle pointing
Manuel Bodirsky
,
Éric Fusy
,
Mihyun Kang
,
Stefan Vigerske
SIAM Journal on Computing
40
(3), 2011, pp. 721-769
Limit behavior of locally consistent constraint satisfaction problems
Manuel Bodirsky
,
Daniel Král'
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 916-933
Schaefer's theorem for graphs
Manuel Bodirsky
,
Michael Pinsker
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 655-664
Quantified equality constraints
Manuel Bodirsky
,
Hubie Chen
SIAM Journal on Computing
39
(8), 2010, pp. 3682-3699
Peek arc consistency
Manuel Bodirsky
,
Hubie Chen
Theoretical Computer Science
411
(2), 2010, pp. 445-453
Distance constraint satisfaction problems
Manuel Bodirsky
,
Victor Dalmau
,
Barnaby Martin
,
Michael Pinsker
Lecture Notes in Computer Science
6281
, 2010, pp. 162-173
The complexity of temporal constraint satisfaction problems
Manuel Bodirsky
,
Jan Kára
Journal of the ACM
57
(2), 2010, pp. 9: 1-41
Maximal infinite-valued constraint languages
Manuel Bodirsky
,
Hubie Chen
,
Jan Kára
,
Timo von Oertzen
Theoretical Computer Science
410
(18), 2009, pp. 1684-1693
Semilinear program feasibility
Manuel Bodirsky
,
Peter Jonsson
,
Timo von Oertzen
Lecture Notes in Computer Science
5556
, 2009, pp. 79-90
Integer programming with 2-variable equations and 1-variable inequalities
Manuel Bodirsky
,
Gustav Nordh
,
Timo von Oertzen
Information Processing Letters
109
(11), 2009, pp. 572-575
Non-dichotomies in constraint satisfaction complexity
Manuel Bodirsky
,
Martin Grohe
Lecture Notes in Computer Science
5126
, 2008, pp. 184-196
The complexity of temporal constraint satisfaction problems
Manuel Bodirsky
,
Jan Kára
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 29-38
The complexity of equality constraint languages
Manuel Bodirsky
,
Jan Kára
Theory of Computing Systems
43
(2), 2008, pp. 136-158
Maximal infinite-valued constraint languages
Manuel Bodirsky
,
Hubie Chen
,
Jan Kára
,
Timo von Oertzen
Lecture Notes in Computer Science
4596
, 2007, pp. 546-557
Generating labeled planar graphs uniformly at random
Manuel Bodirsky
,
Clemens Gröpl
,
Mihyun Kang
Theoretical Computer Science
379
(3), 2007, pp. 377-386
Datalog and constraint satisfaction with infinite templates
Manuel Bodirsky
,
Víctor Dalmau
Lecture Notes in Computer Science
3884
, 2006, pp. 646-659
Sampling unlabeled biconnected planar graphs
Manuel Bodirsky
,
Clemens Gröpl
,
Mihyun Kang
Lecture Notes in Computer Science
3827
, 2005, pp. 593-603
Locally consistent constraint satisfaction problems with binary constraints
Manuel Bodirsky
,
Daniel Král'
Lecture Notes in Computer Science
3787
, 2005, pp. 295-306
The core of a countably categorical structure
Manuel Bodirsky
Lecture Notes in Computer Science
3404
, 2005, pp. 110-120
Generating labeled planar graphs uniformly at random
Manuel Bodirsky
,
Clemens Gröpl
,
Mihyun Kang
Lecture Notes in Computer Science
2719
, 2003, pp. 1095-1107
Pure dominance constraints
Manuel Bodirsky
,
Martin Kutz
Lecture Notes in Computer Science
2285
, 2002, pp. 287-298