Manuel Bodirsky

	2009
41		Manuel Bodirsky, Gustav Nordh, Timo von Oertzen: Integer Programming with 2-Variable Equations and 1-Variable Inequalities. CTW 2009: 261-264
40		Manuel Bodirsky, Miki Hermann, Florian Richoux: Complexity of Existential Positive First-Order Logic. CiE 2009: 31-36
39		Manuel Bodirsky, Peter Jonsson, Timo von Oertzen: Semilinear Program Feasibility. ICALP (2) 2009: 79-90
38		Manuel Bodirsky, Martin Hils, Barnaby Martin: On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction CoRR abs/0909.5097: (2009)
37		Manuel Bodirsky, Hubie Chen: Relatively quantified constraint satisfaction. Constraints 14(1): 3-15 (2009)
36		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)
35		Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen: Maximal infinite-valued constraint languages. Theor. Comput. Sci. 410(18): 1684-1693 (2009)
	2008
34		Manuel Bodirsky: Constraint Satisfaction Problems with Infinite Templates. Complexity of Constraints 2008: 196-228
33		Manuel Bodirsky, Martin Grohe: Non-dichotomies in Constraint Satisfaction Complexity. ICALP (2) 2008: 184-196
32		Manuel Bodirsky, Jan Kára: The complexity of temporal constraint satisfaction problems. STOC 2008: 29-38
31		Manuel Bodirsky, Jan Kára: A Fast Algorithm and Lower Bound for Temporal Reasoning CoRR abs/0805.1473: (2008)
30		Manuel Bodirsky, Hubie Chen: Peek Arc Consistency CoRR abs/0809.0788: (2008)
29		Manuel Bodirsky, Víctor Dalmau: Datalog and Constraint Satisfaction with Infinite Templates CoRR abs/0809.2386: (2008)
28		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008)
27		Manuel Bodirsky, Jan Kára: The Complexity of Equality Constraint Languages. Theory Comput. Syst. 43(2): 136-158 (2008)
	2007
26		Manuel Bodirsky, Hubie Chen: Qualitative Temporal and Spatial Reasoning Revisited. CSL 2007: 194-207
25		Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen: Maximal Infinite-Valued Constraint Languages. ICALP 2007: 546-557
24		Manuel Bodirsky, Hubie Chen: Quantified Equality Constraints. LICS 2007: 203-212
23		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
22		Manuel Bodirsky, Martin Kutz: Determining the consistency of partial tree descriptions. Artif. Intell. 171(2-3): 185-196 (2007)
21		Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electr. J. Comb. 14(1): (2007)
20		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)
19		Manuel Bodirsky: Cores of Countably Categorical Structures. Logical Methods in Computer Science 3(1): (2007)
18		Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid: Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007)
17		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007)
	2006
16		Manuel Bodirsky, Hubie Chen: Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. CSL 2006: 197-211
15		Manuel Bodirsky, Jan Kára: The Complexity of Equality Constraint Languages. CSR 2006: 114-126
14		Manuel Bodirsky, Víctor Dalmau: Datalog and Constraint Satisfaction with Infinite Templates. STACS 2006: 646-659
13		Manuel Bodirsky: Cores of Countably Categorical Structures CoRR abs/cs/0612069: (2006)
12		Manuel Bodirsky, Mihyun Kang: Generating Outerplanar Graphs Uniformly at Random. Combinatorics, Probability & Computing 15(3): 333-343 (2006)
11		Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. 16(3): 359-373 (2006)
	2005
10		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603
9		Manuel Bodirsky: The Core of a Countably Categorical Structure. STACS 2005: 110-120
8		Manuel Bodirsky, Daniel Král: Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG 2005: 295-306
	2004
7		Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer: Effciently Computing the Density of Regular Languages. LATIN 2004: 262-270
6		Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele: A new algorithm for normal dominance constraints. SODA 2004: 59-67
	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	[16] [24] [25] [26] [30] [35] [37]
2	Víctor Dalmau	[14] [29]
3	Denys Duchier	[6]
4	Katrin Erk	[1] [2]
5	Éric Fusy	[21] [23]
6	Tobias Gärtner	[7]
7	Omer Giménez	[20]
8	Martin Grohe	[33]
9	Clemens Gröpl	[4] [10] [17] [28]
10	Miki Hermann	[40]
11	Martin Hils	[38]
12	Peter Jonsson	[39]
13	Mihyun Kang	[4] [10] [12] [17] [18] [20] [21] [23] [28]
14	Jan Kára	[15] [25] [27] [31] [32] [35]
15	Alexander Koller	[1] [2]
16	Daniel Král	[8]
17	Martin Kutz	[3] [22]
18	Mike Löffler	[18]
19	Barnaby Martin	[38]
20	Colin McDiarmid (Colin J. H. McDiarmid)	[18]
21	Sebastian Miele	[6]
22	Jaroslav Nesetril (Jarik Nesetril)	[5] [11]
23	Joachim Niehren	[1] [2] [6]
24	Gustav Nordh	[36] [41]
25	Marc Noy	[20]
26	Timo von Oertzen	[7] [25] [35] [36] [39] [41]
27	Florian Richoux	[40]
28	Jan Schwinghammer	[7]
29	Stefan Vigerske	[21] [23]

Colors in the list of coauthors