Manuel Bodirsky

	2012
71		Manuel Bodirsky: Complexity Classification in Infinite-Domain Constraint Satisfaction CoRR abs/1201.0856: (2012)
70		Manuel Bodirsky, Michael Pinsker: Topological Birkhoff CoRR abs/1203.1876: (2012)
69		Manuel Bodirsky, Hubie Chen, Tomás Feder: On the Complexity of MMSNP. SIAM J. Discrete Math. 26(1): 404-414 (2012)
	2011
68		Manuel Bodirsky, Martin Hils, Alex Krimkevitch: Tractable Set Constraints. IJCAI 2011: 510-515
67		Manuel Bodirsky, Stefan Wölfl: RCC8 Is Polynomial on Networks of Bounded Treewidth. IJCAI 2011: 756-761
66		Manuel Bodirsky, Michael Pinsker, Todor Tsankov: Decidability of Definability. LICS 2011: 321-328
65		Manuel Bodirsky, Michael Pinsker: Schaefer's theorem for graphs. STOC 2011: 655-664
64		Manuel Bodirsky, Martin Hils, Alex Krimkevitch: Tractable Set Constraints CoRR abs/1104.1045: (2011)
63		Manuel Bodirsky, Jan Kára, Barnaby Martin: The Complexity of Surjective Homomorphism Problems -- a Survey CoRR abs/1104.5257: (2011)
62		Manuel Bodirsky, Michael Pinsker: Reducts of Ramsey structures CoRR abs/1105.6073: (2011)
61		Manuel Bodirsky, Dugald Macpherson, Johan Thapper: Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets CoRR abs/1111.6616: (2011)
60		Manuel Bodirsky, Jens K. Mueller: The Complexity of Rooted Phylogeny Problems Logical Methods in Computer Science 7(4): (2011)
59		Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Boltzmann Samplers, Pólya Theory, and Cycle Pointing. SIAM J. Comput. 40(3): 721-769 (2011)
58		Manuel Bodirsky, Daniel Král': Limit Behavior of Locally Consistent Constraint Satisfaction Problems. SIAM J. Discrete Math. 25(2): 916-933 (2011)
	2010
57		Manuel Bodirsky, Jens K. Mueller: The complexity of rooted phylogeny problems. ICDT 2010: 165-173
56		Manuel Bodirsky, Martin Hils, Barnaby Martin: On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. LICS 2010: 90-99
55		Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker: Distance Constraint Satisfaction Problems. MFCS 2010: 162-173
54		Manuel Bodirsky, Jan Kára: A fast algorithm and datalog inexpressibility for temporal reasoning. ACM Trans. Comput. Log. 11(3): (2010)
53		Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Boltzmann Samplers, Pólya Theory, and Cycle Pointing CoRR abs/1003.4546: (2010)
52		Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker: Distance Constraint Satisfaction Problems CoRR abs/1004.3842: (2010)
51		Manuel Bodirsky, Peter Jonsson, Timo von Oertzen: Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction CoRR abs/1005.1141: (2010)
50		Manuel Bodirsky, Michael Pinsker: Schaefer's theorem for graphs CoRR abs/1011.2894: (2010)
49		Manuel Bodirsky, Miki Hermann, Florian Richoux: Complexity of Existential Positive First-Order Logic CoRR abs/1011.4757: (2010)
48		Manuel Bodirsky, Michael Pinsker, Todor Tsankov: Decidability of definability CoRR abs/1012.2381: (2010)
47		Manuel Bodirsky, Jan Kára: The complexity of temporal constraint satisfaction problems. J. ACM 57(2): (2010)
46		Manuel Bodirsky, Hubie Chen, Michael Pinsker: The reducts of equality up to primitive positive interdefinability. J. Symb. Log. 75(4): 1249-1292 (2010)
45		Manuel Bodirsky, Hubie Chen: Quantified Equality Constraints. SIAM J. Comput. 39(8): 3682-3699 (2010)
44		Manuel Bodirsky, Hubie Chen: Peek arc consistency. Theor. Comput. Sci. 411(2): 445-453 (2010)
	2009
43		Manuel Bodirsky, Gustav Nordh, Timo von Oertzen: Integer Programming with 2-Variable Equations and 1-Variable Inequalities. CTW 2009: 261-264
42		Manuel Bodirsky, Miki Hermann, Florian Richoux: Complexity of Existential Positive First-Order Logic. CiE 2009: 31-36
41		Manuel Bodirsky, Peter Jonsson, Timo von Oertzen: Semilinear Program Feasibility. ICALP (2) 2009: 79-90
40		Manuel Bodirsky, Martin Hils, Barnaby Martin: On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction CoRR abs/0909.5097: (2009)
39		Manuel Bodirsky, Hubie Chen: Relatively quantified constraint satisfaction. Constraints 14(1): 3-15 (2009)
38		Manuel Bodirsky, Gustav Nordh, Timo von Oertzen: Integer programming with 2-variable equations and 1-variable inequalities. Inf. Process. Lett. 109(11): 572-575 (2009)
37		Manuel Bodirsky, Hubie Chen: Qualitative Temporal and Spatial Reasoning Revisited. J. Log. Comput. 19(6): 1359-1383 (2009)
36		Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen: Maximal infinite-valued constraint languages. Theor. Comput. Sci. 410(18): 1684-1693 (2009)
	2008
35		Manuel Bodirsky: Constraint Satisfaction Problems with Infinite Templates. Complexity of Constraints 2008: 196-228
34		Manuel Bodirsky, Martin Grohe: Non-dichotomies in Constraint Satisfaction Complexity. ICALP (2) 2008: 184-196
33		Manuel Bodirsky, Jan Kára: The complexity of temporal constraint satisfaction problems. STOC 2008: 29-38
32		Manuel Bodirsky, Jan Kára: A Fast Algorithm and Lower Bound for Temporal Reasoning CoRR abs/0805.1473: (2008)
31		Manuel Bodirsky, Hubie Chen: Peek Arc Consistency CoRR abs/0809.0788: (2008)
30		Manuel Bodirsky, Víctor Dalmau: Datalog and Constraint Satisfaction with Infinite Templates CoRR abs/0809.2386: (2008)
29		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008)
28		Manuel Bodirsky, Jan Kára: The Complexity of Equality Constraint Languages. Theory Comput. Syst. 43(2): 136-158 (2008)
	2007
27		Manuel Bodirsky, Hubie Chen: Qualitative Temporal and Spatial Reasoning Revisited. CSL 2007: 194-207
26		Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen: Maximal Infinite-Valued Constraint Languages. ICALP 2007: 546-557
25		Manuel Bodirsky, Hubie Chen: Quantified Equality Constraints. LICS 2007: 203-212
24		Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. SODA 2007: 356-365
23		Manuel Bodirsky, Martin Kutz: Determining the consistency of partial tree descriptions. Artif. Intell. 171(2-3): 185-196 (2007)
22		Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electr. J. Comb. 14(1): (2007)
21		Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy: Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28(8): 2091-2105 (2007)
20		Manuel Bodirsky: Cores of Countably Categorical Structures. Logical Methods in Computer Science 3(1): (2007)
19		Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid: Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007)
18		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007)
	2006
17		Manuel Bodirsky, Hubie Chen: Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. CSL 2006: 197-211
16		Manuel Bodirsky, Jan Kára: The Complexity of Equality Constraint Languages. CSR 2006: 114-126
15		Manuel Bodirsky, Víctor Dalmau: Datalog and Constraint Satisfaction with Infinite Templates. STACS 2006: 646-659
14		Manuel Bodirsky: Cores of Countably Categorical Structures CoRR abs/cs/0612069: (2006)
13		Manuel Bodirsky, Mihyun Kang: Generating Outerplanar Graphs Uniformly at Random. Combinatorics, Probability & Computing 15(3): 333-343 (2006)
12		Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. 16(3): 359-373 (2006)
	2005
11		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603
10		Manuel Bodirsky: The Core of a Countably Categorical Structure. STACS 2005: 110-120
9		Manuel Bodirsky, Daniel Král: Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG 2005: 295-306
	2004
8		Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer: Effciently Computing the Density of Regular Languages. LATIN 2004: 262-270
7		Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele: A new algorithm for normal dominance constraints. SODA 2004: 59-67
6		Manuel Bodirsky: Constraint satisfaction with infinite domains. Humboldt University of Berlin 2004: 1-162
	2003
5		Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. CSL 2003: 44-57
4		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating Labeled Planar Graphs Uniformly at Random. ICALP 2003: 1095-1107
	2002
3		Manuel Bodirsky, Martin Kutz: Pure Dominance Constraints. STACS 2002: 287-298
	2001
2		Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren: Underspecified Beta Reduction. ACL 2001: 74-81
1		Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren: Beta Reduction Constraints. RTA 2001: 31-46

Coauthor Index

1	Hubie Chen	[17] [25] [26] [27] [31] [36] [37] [39] [44] [45] [46] [69]
2	Víctor Dalmau	[15] [30] [52] [55]
3	Denys Duchier	[7]
4	Katrin Erk	[1] [2]
5	Tomás Feder	[69]
6	Éric Fusy	[22] [24] [53] [59]
7	Tobias Gärtner	[8]
8	Omer Giménez	[21]
9	Martin Grohe	[34]
10	Clemens Gröpl	[4] [11] [18] [29]
11	Miki Hermann	[42] [49]
12	Martin Hils	[40] [56] [64] [68]
13	Peter Jonsson	[41] [51]
14	Mihyun Kang	[4] [11] [13] [18] [19] [21] [22] [24] [29] [53] [59]
15	Jan Kára	[16] [26] [28] [32] [33] [36] [47] [54] [63]
16	Alexander Koller	[1] [2]
17	Daniel Král (Daniel Král')	[9] [58]
18	Alex Krimkevitch	[64] [68]
19	Martin Kutz	[3] [23]
20	Mike Löffler	[19]
21	Dugald Macpherson	[61]
22	Barnaby Martin	[40] [52] [55] [56] [63]
23	Colin McDiarmid (Colin J. H. McDiarmid)	[19]
24	Sebastian Miele	[7]
25	Jens K. Mueller	[57] [60]
26	Jaroslav Nesetril (Jarik Nesetril)	[5] [12]
27	Joachim Niehren	[1] [2] [7]
28	Gustav Nordh	[38] [43]
29	Marc Noy	[21]
30	Timo von Oertzen	[8] [26] [36] [38] [41] [43] [51]
31	Michael Pinsker	[46] [48] [50] [52] [55] [62] [65] [66] [70]
32	Florian Richoux	[42] [49]
33	Jan Schwinghammer	[8]
34	Johan Thapper	[61]
35	Todor Tsankov	[48] [66]
36	Stefan Vigerske	[22] [24] [53] [59]
37	Stefan Wölfl	[67]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page