- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j29 |      | Manuel Bodirsky, Víctor Dalmau: Datalog and constraint satisfaction with infinite templates. J. Comput. Syst. Sci. 79(1): 79-100 (2013) |
| 2012 | ||
| j28 | | Manuel Bodirsky, Peter Jonsson, Timo von Oertzen: Essential Convexity and Complexity of Semi-Algebraic Constraints. Logical Methods in Computer Science 8(4) (2012) |
| j27 | | Manuel Bodirsky, Jan Kára, Barnaby Martin: The complexity of surjective homomorphism problems - a survey. Discrete Applied Mathematics 160(12): 1680-1690 (2012) |
| j26 | | Manuel Bodirsky, Martin Hils: Tractable Set Constraints. J. Artif. Intell. Res. (JAIR) 45: 731-759 (2012) |
| j25 | | Manuel Bodirsky, Peter Jonsson, Timo von Oertzen: Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. J. Log. Comput. 22(3): 643-660 (2012) |
| j24 | | Manuel Bodirsky, Hubie Chen, Tomás Feder: On the Complexity of MMSNP. SIAM J. Discrete Math. 26(1): 404-414 (2012) |
| c31 | | |
| i16 | | Manuel Bodirsky: Complexity Classification in Infinite-Domain Constraint Satisfaction. CoRR abs/1201.0856 (2012) |
| i15 | | |
| 2011 | ||
| j23 | | Manuel Bodirsky, Jens K. Mueller: The Complexity of Rooted Phylogeny Problems. Logical Methods in Computer Science 7(4) (2011) |
| j22 | | Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Boltzmann Samplers, Pólya Theory, and Cycle Pointing. SIAM J. Comput. 40(3): 721-769 (2011) |
| j21 | | Manuel Bodirsky, Daniel Král': Limit Behavior of Locally Consistent Constraint Satisfaction Problems. SIAM J. Discrete Math. 25(2): 916-933 (2011) |
| c30 | | |
| c29 | | Manuel Bodirsky, Stefan Wölfl: RCC8 Is Polynomial on Networks of Bounded Treewidth. IJCAI 2011: 756-761 |
| c28 | | |
| c27 | | |
| i14 | | Manuel Bodirsky, Martin Hils, Alex Krimkevitch: Tractable Set Constraints. CoRR abs/1104.1045 (2011) |
| i13 | | Manuel Bodirsky, Jan Kára, Barnaby Martin: The Complexity of Surjective Homomorphism Problems -- a Survey. CoRR abs/1104.5257 (2011) |
| i12 | | |
| i11 | | Manuel Bodirsky, Dugald Macpherson, Johan Thapper: Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets. CoRR abs/1111.6616 (2011) |
| 2010 | ||
| j20 | | |
| j19 | | Manuel Bodirsky, Hubie Chen, Michael Pinsker: The reducts of equality up to primitive positive interdefinability. J. Symb. Log. 75(4): 1249-1292 (2010) |
| j18 | | Manuel Bodirsky, Hubie Chen: Quantified Equality Constraints. SIAM J. Comput. 39(8): 3682-3699 (2010) |
| j17 | | |
| j16 | | Manuel Bodirsky, Jan Kára: A fast algorithm and datalog inexpressibility for temporal reasoning. ACM Trans. Comput. Log. 11(3) (2010) |
| c26 | | |
| c25 | | Manuel Bodirsky, Martin Hils, Barnaby Martin: On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. LICS 2010: 90-99 |
| c24 | | Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker: Distance Constraint Satisfaction Problems. MFCS 2010: 162-173 |
| i10 | | Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Boltzmann Samplers, Pólya Theory, and Cycle Pointing. CoRR abs/1003.4546 (2010) |
| i9 | | Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker: Distance Constraint Satisfaction Problems. CoRR abs/1004.3842 (2010) |
| i8 | | Manuel Bodirsky, Peter Jonsson, Timo von Oertzen: Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction. CoRR abs/1005.1141 (2010) |
| i7 | | |
| i6 | | Manuel Bodirsky, Miki Hermann, Florian Richoux: Complexity of Existential Positive First-Order Logic. CoRR abs/1011.4757 (2010) |
| i5 | | Manuel Bodirsky, Michael Pinsker, Todor Tsankov: Decidability of definability. CoRR abs/1012.2381 (2010) |
| 2009 | ||
| j15 | | Manuel Bodirsky, Hubie Chen: Relatively quantified constraint satisfaction. Constraints 14(1): 3-15 (2009) |
| j14 | | Manuel Bodirsky, Martin Hils, Barnaby Martin: On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. Logical Methods in Computer Science 8(3) (2009) |
| j13 | | 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) |
| j12 | | Manuel Bodirsky, Hubie Chen: Qualitative Temporal and Spatial Reasoning Revisited. J. Log. Comput. 19(6): 1359-1383 (2009) |
| j11 | | Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen: Maximal infinite-valued constraint languages. Theor. Comput. Sci. 410(18): 1684-1693 (2009) |
| c23 | | Manuel Bodirsky, Miki Hermann, Florian Richoux: Complexity of Existential Positive First-Order Logic. CiE 2009: 31-36 |
| c22 | | Manuel Bodirsky, Gustav Nordh, Timo von Oertzen: Integer Programming with 2-Variable Equations and 1-Variable Inequalities. CTW 2009: 261-264 |
| c21 | | Manuel Bodirsky, Peter Jonsson, Timo von Oertzen: Semilinear Program Feasibility. ICALP (2) 2009: 79-90 |
| 2008 | ||
| j10 | | Manuel Bodirsky, Jan Kára: The Complexity of Equality Constraint Languages. Theory Comput. Syst. 43(2): 136-158 (2008) |
| j9 | | Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008) |
| c20 | | Manuel Bodirsky: Constraint Satisfaction Problems with Infinite Templates. Complexity of Constraints 2008: 196-228 |
| c19 | | Manuel Bodirsky, Martin Grohe: Non-dichotomies in Constraint Satisfaction Complexity. ICALP (2) 2008: 184-196 |
| c18 | | |
| i4 | | Manuel Bodirsky, Jan Kára: A Fast Algorithm and Lower Bound for Temporal Reasoning. CoRR abs/0805.1473 (2008) |
| i3 | | |
| i2 | | Manuel Bodirsky, Víctor Dalmau: Datalog and Constraint Satisfaction with Infinite Templates. CoRR abs/0809.2386 (2008) |
| 2007 | ||
| j8 | | Manuel Bodirsky, Martin Kutz: Determining the consistency of partial tree descriptions. Artif. Intell. 171(2-3): 185-196 (2007) |
| j7 | | Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electr. J. Comb. 14(1) (2007) |
| j6 | | 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) |
| j5 | | Manuel Bodirsky: Cores of Countably Categorical Structures. Logical Methods in Computer Science 3(1) (2007) |
| j4 | | Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid: Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007) |
| j3 | | Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007) |
| c17 | | Manuel Bodirsky, Hubie Chen: Qualitative Temporal and Spatial Reasoning Revisited. CSL 2007: 194-207 |
| c16 | | Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen: Maximal Infinite-Valued Constraint Languages. ICALP 2007: 546-557 |
| c15 | | |
| c14 | | 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 |
| 2006 | ||
| j2 | | Manuel Bodirsky, Mihyun Kang: Generating Outerplanar Graphs Uniformly at Random. Combinatorics, Probability & Computing 15(3): 333-343 (2006) |
| j1 | | Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. 16(3): 359-373 (2006) |
| c13 | | Manuel Bodirsky, Hubie Chen: Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. CSL 2006: 197-211 |
| c12 | | |
| c11 | | Manuel Bodirsky, Víctor Dalmau: Datalog and Constraint Satisfaction with Infinite Templates. STACS 2006: 646-659 |
| i1 | | |
| 2005 | ||
| c10 | | Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603 |
| c9 | | |
| c8 | | Manuel Bodirsky, Daniel Král: Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG 2005: 295-306 |
| 2004 | ||
| b1 | | Manuel Bodirsky: Constraint satisfaction with infinite domains. Humboldt University of Berlin 2004, pp. 1-162 |
| c7 | | Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer: Effciently Computing the Density of Regular Languages. LATIN 2004: 262-270 |
| c6 | | Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele: A new algorithm for normal dominance constraints. SODA 2004: 59-67 |
| 2003 | ||
| c5 | | Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. CSL 2003: 44-57 |
| c4 | | Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating Labeled Planar Graphs Uniformly at Random. ICALP 2003: 1095-1107 |
| 2002 | ||
| c3 | | |
| 2001 | ||
| c2 | | Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren: Underspecified Beta Reduction. ACL 2001: 74-81 |
| c1 | | Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren: Beta Reduction Constraints. RTA 2001: 31-46 |
Data released under the ODC-BY 1.0 license — See also our legal information page