| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Manuel Bodirsky, Michael Pinsker |
Topological Birkhoff  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky |
Complexity Classification in Infinite-Domain Constraint Satisfaction |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen, Tomás Feder |
On the Complexity of MMSNP. |
SIAM J. Discrete Math. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Martin Hils, Alex Krimkevitch |
Tractable Set Constraints |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Dugald Macpherson, Johan Thapper |
Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jens K. Mueller |
The Complexity of Rooted Phylogeny Problems |
Logical Methods in Computer Science |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Michael Pinsker |
Reducts of Ramsey structures |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jan Kára, Barnaby Martin |
The Complexity of Surjective Homomorphism Problems -- a Survey |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Daniel Král' |
Limit Behavior of Locally Consistent Constraint Satisfaction Problems. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske |
Boltzmann Samplers, Pólya Theory, and Cycle Pointing. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Stefan Wölfl |
RCC8 Is Polynomial on Networks of Bounded Treewidth. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Martin Hils, Alex Krimkevitch |
Tractable Set Constraints. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Michael Pinsker, Todor Tsankov |
Decidability of Definability. |
LICS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Michael Pinsker |
Schaefer's theorem for graphs. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen |
Peek arc consistency. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen, Michael Pinsker |
The reducts of equality up to primitive positive interdefinability. |
J. Symb. Log. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jan Kára |
The complexity of temporal constraint satisfaction problems. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker |
Distance Constraint Satisfaction Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Michael Pinsker, Todor Tsankov |
Decidability of definability |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Peter Jonsson, Timo von Oertzen |
Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske |
Boltzmann Samplers, Pólya Theory, and Cycle Pointing |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Miki Hermann, Florian Richoux |
Complexity of Existential Positive First-Order Logic |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Michael Pinsker |
Schaefer's theorem for graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jan Kára |
A fast algorithm and datalog inexpressibility for temporal reasoning. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen |
Quantified Equality Constraints. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker |
Distance Constraint Satisfaction Problems. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jens K. Mueller |
The complexity of rooted phylogeny problems. |
ICDT |
2010 |
DBLP DOI BibTeX RDF |
?-categorical structures, computational complexity, Datalog, constraint satisfaction problems, phylogenetic reconstruction |
| 1 | Manuel Bodirsky, Martin Hils, Barnaby Martin |
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. |
LICS |
2010 |
DBLP DOI BibTeX RDF |
Constraint Satisfaction, Galois Connection, Model Theory |
| 1 | Manuel Bodirsky, Gustav Nordh, Timo von Oertzen |
Integer programming with 2-variable equations and 1-variable inequalities. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen |
Maximal infinite-valued constraint languages. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen |
Relatively quantified constraint satisfaction. |
Constraints |
2009 |
DBLP DOI BibTeX RDF |
Quantified constraint satisfaction, Computational complexity |
| 1 | Manuel Bodirsky, Hubie Chen |
Qualitative Temporal and Spatial Reasoning Revisited. |
J. Log. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Martin Hils, Barnaby Martin |
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Peter Jonsson, Timo von Oertzen |
Semilinear Program Feasibility. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Gustav Nordh, Timo von Oertzen |
Integer Programming with 2-Variable Equations and 1-Variable Inequalities. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Miki Hermann, Florian Richoux |
Complexity of Existential Positive First-Order Logic. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
Existential Positive First-Order Logic, Computational Complexity, Constraint Satisfaction Problems |
| 1 | Manuel Bodirsky, Clemens Gröpl, Mihyun Kang |
Generating unlabeled connected cubic planar graphs uniformly at random. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen |
Peek Arc Consistency |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Víctor Dalmau |
Datalog and Constraint Satisfaction with Infinite Templates |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jan Kára |
A Fast Algorithm and Lower Bound for Temporal Reasoning |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jan Kára |
The Complexity of Equality Constraint Languages. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Clones on infinite domains, Computational complexity, Constraint satisfaction, Logic in computer science |
| 1 | Manuel Bodirsky, Martin Grohe |
Non-dichotomies in Constraint Satisfaction Complexity. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky |
Constraint Satisfaction Problems with Infinite Templates. |
Complexity of Constraints |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jan Kára |
The complexity of temporal constraint satisfaction problems. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
complexity, constraint satisfaction, temporal reasoning |
| 1 | Manuel Bodirsky, Clemens Gröpl, Mihyun Kang |
Generating labeled planar graphs uniformly at random. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy |
Enumeration and limit laws for series-parallel graphs. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske |
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. |
Electr. J. Comb. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid |
Random cubic planar graphs. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky |
Cores of Countably Categorical Structures. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Martin Kutz |
Determining the consistency of partial tree descriptions. |
Artif. Intell. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske |
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen |
Maximal Infinite-Valued Constraint Languages. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen |
Quantified Equality Constraints. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen |
Qualitative Temporal and Spatial Reasoning Revisited. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Mihyun Kang |
Generating Outerplanar Graphs Uniformly at Random. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jaroslav Nesetril |
Constraint Satisfaction with Countable Homogeneous Templates. |
J. Log. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky |
Cores of Countably Categorical Structures |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jan Kára |
The Complexity of Equality Constraint Languages. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
Clones on Infinite Domains, Computational Complexity, Constraint Satisfaction, Logic in Computer Science |
| 1 | Manuel Bodirsky, Víctor Dalmau |
Datalog and Constraint Satisfaction with Infinite Templates. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen |
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. |
CSL |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Daniel Král |
Locally Consistent Constraint Satisfaction Problems with Binary Constraints. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky |
The Core of a Countably Categorical Structure. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Clemens Gröpl, Mihyun Kang |
Sampling Unlabeled Biconnected Planar Graphs. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky |
Constraint satisfaction with infinite domains. |
|
2004 |
RDF |
|
| 1 | Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele |
A new algorithm for normal dominance constraints. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer |
Effciently Computing the Density of Regular Languages. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Clemens Gröpl, Mihyun Kang |
Generating Labeled Planar Graphs Uniformly at Random. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jaroslav Nesetril |
Constraint Satisfaction with Countable Homogeneous Templates. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Martin Kutz |
Pure Dominance Constraints. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
tree descriptions, constraint satisfaction, Efficient algorithms |
| 1 | Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren |
Underspecified Beta Reduction. |
ACL |
2001 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren |
Beta Reduction Constraints. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")