Manuel Bodirsky

2008
27	EE	Manuel Bodirsky, Jan Kára: The complexity of temporal constraint satisfaction problems. STOC 2008: 29-38
26	EE	Manuel Bodirsky, Jan Kára: A Fast Algorithm and Lower Bound for Temporal Reasoning CoRR abs/0805.1473: (2008)
2007
25	EE	Manuel Bodirsky, Hubie Chen: Qualitative Temporal and Spatial Reasoning Revisited. CSL 2007: 194-207
24	EE	Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen: Maximal Infinite-Valued Constraint Languages. ICALP 2007: 546-557
23	EE	Manuel Bodirsky, Hubie Chen: Quantified Equality Constraints. LICS 2007: 203-212
22	EE	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
21	EE	Manuel Bodirsky, Martin Kutz: Determining the consistency of partial tree descriptions. Artif. Intell. 171(2-3): 185-196 (2007)
20	EE	Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electr. J. Comb. 14(1): (2007)
19	EE	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)
18	EE	Manuel Bodirsky: Cores of Countably Categorical Structures. Logical Methods in Computer Science 3(1): (2007)
17	EE	Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid: Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007)
16	EE	Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007)
2006
15	EE	Manuel Bodirsky, Hubie Chen: Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. CSL 2006: 197-211
14	EE	Manuel Bodirsky, Jan Kára: The Complexity of Equality Constraint Languages. CSR 2006: 114-126
13	EE	Manuel Bodirsky, Víctor Dalmau: Datalog and Constraint Satisfaction with Infinite Templates. STACS 2006: 646-659
12	EE	Manuel Bodirsky: Cores of Countably Categorical Structures CoRR abs/cs/0612069: (2006)
11	EE	Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. 16(3): 359-373 (2006)
2005
10	EE	Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603
9	EE	Manuel Bodirsky: The Core of a Countably Categorical Structure. STACS 2005: 110-120
8	EE	Manuel Bodirsky, Daniel Král: Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG 2005: 295-306
2004
7	EE	Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer: Effciently Computing the Density of Regular Languages. LATIN 2004: 262-270
6	EE	Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele: A new algorithm for normal dominance constraints. SODA 2004: 59-67
2003
5	EE	Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. CSL 2003: 44-57
4	EE	Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating Labeled Planar Graphs Uniformly at Random. ICALP 2003: 1095-1107
2002
3	EE	Manuel Bodirsky, Martin Kutz: Pure Dominance Constraints. STACS 2002: 287-298
2001
2	EE	Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren: Underspecified Beta Reduction. ACL 2001: 74-81
1	EE	Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren: Beta Reduction Constraints. RTA 2001: 31-46

Coauthor Index

1	Hubie Chen	[15] [23] [24] [25]
2	Víctor Dalmau	[13]
3	Denys Duchier	[6]
4	Katrin Erk	[1] [2]
5	Éric Fusy	[20] [22]
6	Tobias Gärtner	[7]
7	Omer Giménez	[19]
8	Clemens Gröpl	[4] [10] [16]
9	Mihyun Kang	[4] [10] [16] [17] [19] [20] [22]
10	Jan Kára	[14] [24] [26] [27]
11	Alexander Koller	[1] [2]
12	Daniel Král	[8]
13	Martin Kutz	[3] [21]
14	Mike Löffler	[17]
15	Colin McDiarmid (Colin J. H. McDiarmid)	[17]
16	Sebastian Miele	[6]
17	Jaroslav Nesetril	[5] [11]
18	Joachim Niehren	[1] [2] [6]
19	Marc Noy	[19]
20	Timo von Oertzen	[7] [24]
21	Jan Schwinghammer	[7]
22	Stefan Vigerske	[20] [22]

Colors in the list of coauthors