Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Bodirsky, Manuel - Laboratoire d’Informatique, École Polytechnique
Quantified Equality Constraints Manuel Bodirsky
The Complexity of Equality Constraint Languages
Constraint Satisfaction Problems with Infinite Templates
Contemporary Mathematics Reducts of Ramsey structures
LIMIT BEHAVIOR OF LOCALLY CONSISTENT CONSTRAINT SATISFACTION PROBLEMS
The Complexity of Temporal Constraint Satisfaction Problems
INTEGER PROGRAMMING WITH 2-VARIABLE EQUATIONS AND 1-VARIABLE INEQUALITIES
The Complexity of Equality Constraint Languages
Essential Convexity and Complexity of Semi-Algebraic Constraints
A Notation System for Tango Manuel Bodirsky manuel@bodirsky.de
Qualitative Temporal and Spatial Reasoning Revisited Manuel Bodirsky and Hubie Chen
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
A Notation System for Tango Manuel Bodirsky --manuel@bodirsky.de
Determining the Consistency of Partial Tree Descriptions
17. + 18. September Ricardo ,,El holands" & Rotraut Rumbaum Workshops fr Mittelstufe und Fortgeschrittene
Complexity of Existential Positive First-Order Logic Manuel Bodirsky, Miki Hermann, and Florian Richoux
Constraint Satisfaction with Infinite Domains Dissertation
Non-dichotomies in Constraint Satisfaction Complexity
The Complexity of Temporal Constraint Satisfaction Problems
On the Complexity of MMSNP Manuel Bodirsky
Oligomorphic Clones Manuel Bodirsky and Hubie Chen
THE COMPLEXITY OF ROOTED PHYLOGENY PROBLEMS MANUEL BODIRSKY AND JENS K. MUELLER
Maximal Infinite-Valued Constraint Languages
A New Algorithm for Normal Dominance Constraints Manuel Bodirsky
Schaefer's theorem for graphs Manuel Bodirsky
