The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Roman Barták: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Petr Vilím, Roman Barták
    Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times. [Citation Graph (0, 0)][DBLP]
    AIPS, 2002, pp:312-321 [Conf]
  2. Roman Barták
    Visopt ShopFloor: Going Beyond Traditional Scheduling. [Citation Graph (0, 0)][DBLP]
    International Workshop on Constraint Solving and Constraint Logic Programming, 2002, pp:185-199 [Conf]
  3. Roman Barták
    Dynamic Constraint Models for Planning and Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    New Trends in Constraints, 1999, pp:237-255 [Conf]
  4. Roman Barták
    Visopt ShopFloor: On the Edge of Planning and Scheduling. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:587-602 [Conf]
  5. Pavel Cejnar, Roman Barták
    Automated Search for Heuristic Functions. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:843- [Conf]
  6. Pavel Surynek, Roman Barták
    A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:767-771 [Conf]
  7. Pavel Surynek, Roman Barták
    Encoding HTN Planning as a Dynamic CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:868- [Conf]
  8. Petr Vilím, Roman Barták, Ondrej Cepek
    Unary Resource Constraint with Optional Activities. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:62-76 [Conf]
  9. Josef Zlomek, Roman Barták
    Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:876- [Conf]
  10. Roman Barták
    On Generators of Random Quasigroup Problems. [Citation Graph (0, 0)][DBLP]
    CSCLP, 2005, pp:164-178 [Conf]
  11. Roman Barták, Roman Mecl
    Implementing Propagators for Tabular Constraints. [Citation Graph (0, 0)][DBLP]
    CSCLP, 2003, pp:44-65 [Conf]
  12. Roman Barták, Tomás Müller, Hana Rudová
    A New Approach to Modeling and Solving Minimal Perturbation Problems. [Citation Graph (0, 0)][DBLP]
    CSCLP, 2003, pp:233-249 [Conf]
  13. Roman Barták
    A Theoretical Framework for Constraint Hierarchy Solvers. [Citation Graph (0, 0)][DBLP]
    ECAI, 2002, pp:146-150 [Conf]
  14. Roman Barták, Radek Erben
    A New Algorithm for Singleton Arc Consistency. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2004, pp:- [Conf]
  15. Roman Barták, Pavel Surynek
    An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2005, pp:161-166 [Conf]
  16. Marius-Calin Silaghi, Amit Abhyankar, Markus Zanker, Roman Barták
    Desk-Mates (Stable Matching) with Privacy of Preferences, and a New Distributed CSP Framework. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2005, pp:671-677 [Conf]
  17. Roman Barták
    Incremental Propagation of Time Windows on Disjunctive Resources. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2006, pp:25-30 [Conf]
  18. Roman Barták, Ondrej Cepek
    Incremental Filtering Algorithms for Precedence and Dependency Constraints. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2006, pp:416-426 [Conf]
  19. Tomás Müller, Hana Rudová, Roman Barták
    Minimal Perturbation Problem in Course Timetabling. [Citation Graph (0, 0)][DBLP]
    PATAT, 2004, pp:126-146 [Conf]
  20. Roman Barták, Hana Rudová
    Limited assignments: a new cutoff strategy for incomplete depth-first search. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:388-392 [Conf]
  21. Roman Barták
    Modelling Resource Transitions in Constraint-Based Scheduling. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2002, pp:186-194 [Conf]
  22. Roman Barták
    Effective Modeling with Constraints. [Citation Graph (0, 0)][DBLP]
    INAP/WLP, 2004, pp:149-165 [Conf]
  23. Roman Barták
    R. Dechter, Constraint Processing, Morgan Kaufmann (2003). [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2005, v:169, n:2, pp:142-145 [Journal]
  24. Roman Barták, Lee McCluskey
    The First Competition on Knowledge Engineering for Planning and Scheduling. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2006, v:27, n:1, pp:97-98 [Journal]
  25. Roman Barták
    The CP-04 Workshop on CSP Techniques with Immediate Application (Conference Report). [Citation Graph (0, 0)][DBLP]
    IEEE Intelligent Informatics Bulletin, 2004, v:4, n:, pp:3- [Journal]
  26. Petr Vilím, Roman Barták, Ondrej Cepek
    Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. [Citation Graph (0, 0)][DBLP]
    Constraints, 2005, v:10, n:4, pp:403-425 [Journal]
  27. Roman Barták, Michela Milano
    Introduction to the Special Issue on the Integration of AI and OR Techniques in CP for Combinatorial Optimization (CPAIOR 2005). [Citation Graph (0, 0)][DBLP]
    Constraints, 2006, v:11, n:4, pp:269-270 [Journal]
  28. Tomás Müller, Roman Barták
    Interactive Timetabling [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  29. Roman Barták
    Dynamic Global Constraints: A First View [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  30. Roman Barták, Ondrej Cepek
    Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2006, pp:350-353 [Conf]
  31. Roman Barták, Ondrej Cepek
    A Constraint Model for State Transitions in Disjunctive Resources. [Citation Graph (0, 0)][DBLP]
    CSCLP, 2006, pp:48-62 [Conf]
  32. Pavel Surynek, Roman Barták
    Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2007, pp:134-139 [Conf]
  33. Roman Barták, Ondrej Cepek
    Temporal Networks with Alternatives: Complexity and Model. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2007, pp:641-646 [Conf]
  34. Roman Barták
    Generating Implied Boolean Constraints Via Singleton Consistency. [Citation Graph (0, 0)][DBLP]
    SARA, 2007, pp:50-63 [Conf]

  35. Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. [Citation Graph (, )][DBLP]


  36. Constraint Models for Reasoning on Unification in Inductive Logic Programming. [Citation Graph (, )][DBLP]


  37. Constraint Models for Sequential Planning. [Citation Graph (, )][DBLP]


  38. Temporal Reasoning in Nested Temporal Networks with Alternatives. [Citation Graph (, )][DBLP]


  39. Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies. [Citation Graph (, )][DBLP]


  40. Reformulating Constraint Models for Classical Planning. [Citation Graph (, )][DBLP]


  41. Enhancing Constraint Models for Planning Problems. [Citation Graph (, )][DBLP]


  42. Special Track on Artificial Intelligence Planning and Scheduling. [Citation Graph (, )][DBLP]


  43. Using Constraint Satisfaction for Learning Hypotheses in Inductive Logic Programming. [Citation Graph (, )][DBLP]


  44. Using Constraint Programming to Plan Efficient Data Movement on the Grid. [Citation Graph (, )][DBLP]


  45. Revisiting Constraint Models for Planning Problems. [Citation Graph (, )][DBLP]


  46. Nested temporal networks with alternatives: recognition and tractability. [Citation Graph (, )][DBLP]


  47. Reformulating Planning Problems by Eliminating Unpromising Actions. [Citation Graph (, )][DBLP]


  48. Integrating Constraint Models for Sequential and Partial-Order Planning. [Citation Graph (, )][DBLP]


  49. Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action Dependencies. [Citation Graph (, )][DBLP]


  50. Logic programming for combinatorial problems. [Citation Graph (, )][DBLP]


  51. Using constraint programming to resolve the multi-source/multi-site data movement paradigm on the Grid [Citation Graph (, )][DBLP]


  52. Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.018secs
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