The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Manuel Bodirsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
    Underspecified Beta Reduction. [Citation Graph (0, 0)][DBLP]
    ACL, 2001, pp:74-81 [Conf]
  2. Manuel Bodirsky, Hubie Chen
    Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:197-211 [Conf]
  3. Manuel Bodirsky, Jaroslav Nesetril
    Constraint Satisfaction with Countable Homogeneous Templates. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:44-57 [Conf]
  4. Manuel Bodirsky, Jan Kára
    The Complexity of Equality Constraint Languages. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:114-126 [Conf]
  5. Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
    Generating Labeled Planar Graphs Uniformly at Random. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1095-1107 [Conf]
  6. Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
    Sampling Unlabeled Biconnected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:593-603 [Conf]
  7. Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer
    Effciently Computing the Density of Regular Languages. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:262-270 [Conf]
  8. Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
    Beta Reduction Constraints. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:31-46 [Conf]
  9. Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele
    A new algorithm for normal dominance constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:59-67 [Conf]
  10. Manuel Bodirsky
    The Core of a Countably Categorical Structure. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:110-120 [Conf]
  11. Manuel Bodirsky, Víctor Dalmau
    Datalog and Constraint Satisfaction with Infinite Templates. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:646-659 [Conf]
  12. Manuel Bodirsky, Martin Kutz
    Pure Dominance Constraints. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:287-298 [Conf]
  13. Manuel Bodirsky, Daniel Král
    Locally Consistent Constraint Satisfaction Problems with Binary Constraints. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:295-306 [Conf]
  14. Manuel Bodirsky, Martin Kutz
    Determining the consistency of partial tree descriptions. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:2-3, pp:185-196 [Journal]
  15. Manuel Bodirsky, Jaroslav Nesetril
    Constraint Satisfaction with Countable Homogeneous Templates. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2006, v:16, n:3, pp:359-373 [Journal]
  16. Manuel Bodirsky, Hubie Chen
    Qualitative Temporal and Spatial Reasoning Revisited. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:194-207 [Conf]
  17. Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
    Maximal Infinite-Valued Constraint Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:546-557 [Conf]
  18. Manuel Bodirsky, Hubie Chen
    Quantified Equality Constraints. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:203-212 [Conf]
  19. Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
    An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:356-365 [Conf]
  20. Manuel Bodirsky
    Cores of Countably Categorical Structures [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  21. Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
    Generating labeled planar graphs uniformly at random. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:377-386 [Journal]

  22. Complexity of Existential Positive First-Order Logic. [Citation Graph (, )][DBLP]


  23. Constraint Satisfaction Problems with Infinite Templates. [Citation Graph (, )][DBLP]


  24. Non-dichotomies in Constraint Satisfaction Complexity. [Citation Graph (, )][DBLP]


  25. Semilinear Program Feasibility. [Citation Graph (, )][DBLP]


  26. The complexity of rooted phylogeny problems. [Citation Graph (, )][DBLP]


  27. On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. [Citation Graph (, )][DBLP]


  28. Distance Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  29. The complexity of temporal constraint satisfaction problems. [Citation Graph (, )][DBLP]


  30. Integer Programming with 2-Variable Equations and 1-Variable Inequalities. [Citation Graph (, )][DBLP]


  31. Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. [Citation Graph (, )][DBLP]


  32. Relatively quantified constraint satisfaction. [Citation Graph (, )][DBLP]


  33. A Fast Algorithm and Lower Bound for Temporal Reasoning [Citation Graph (, )][DBLP]


  34. Peek Arc Consistency [Citation Graph (, )][DBLP]


  35. Datalog and Constraint Satisfaction with Infinite Templates [Citation Graph (, )][DBLP]


  36. On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction [Citation Graph (, )][DBLP]


  37. Boltzmann Samplers, Pólya Theory, and Cycle Pointing [Citation Graph (, )][DBLP]


  38. Distance Constraint Satisfaction Problems [Citation Graph (, )][DBLP]


  39. Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction [Citation Graph (, )][DBLP]


  40. Generating Outerplanar Graphs Uniformly at Random. [Citation Graph (, )][DBLP]


  41. Enumeration and limit laws for series-parallel graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002