Roman Barták

	2012
80		Roman Barták: On Complexity of Verifying Nested Workflows with Extra Constraints. ICAART (1) 2012: 346-354
79		Roman Barták, Con Sheahan, Ann Sheahan: MAK€- A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises. SOFSEM 2012: 600-611
	2011
78		Roman Barták: A Novel Constraint Model for Parallel Planning. FLAIRS Conference 2011
77		Roman Barták, Michal Zerola, Stanislav Slusny: Towards Routing for Autonomous Robots - Using Constraint Programming in an Anytime Path Planner. ICAART (1) 2011: 313-320
76		Andrej Chovanec, Roman Barták: Boosting Inductive Logic Programming via Decomposition, Merging, and Refinement. ICTAI 2011: 914-915
75		Andrej Chovanec, Roman Barták: On Generating Templates for Hypothesis in Inductive Logic Programming. MICAI (1) 2011: 162-173
74		Roman Barták: On Constraint Models for Parallel Planning: The Novel Transition Scheme. SCAI 2011: 50-59
73		Roman Barták, Miguel A. Salido: Constraint satisfaction for planning and scheduling problems. Constraints 16(3): 223-227 (2011)
	2010
72		Roman Barták: Constraint Models for Reasoning on Unification in Inductive Logic Programming. AIMSA 2010: 101-110
71		Roman Barták, Ondrej Kuzelka, Filip Zelezný: Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem. Abstraction, Reformulation, and Approximation 2010
70		Roman Barták, Ondrej Kuzelka, Filip Zelezný: Using Constraint Satisfaction for Learning Hypotheses in Inductive Logic Programming. FLAIRS Conference 2010
69		Filip Dvorak, Roman Barták: Integrating Time and Resources into Planning. ICTAI (2) 2010: 71-78
68		Roman Barták: Optimizing Alternatives in Precedence Networks. MICAI (1) 2010: 197-208
67		Roman Barták, Simone Fratini, Lee McCluskey: The Third Competition on Knowledge Engineering for Planning and Scheduling. AI Magazine 31(1): 95-98 (2010)
66		Roman Barták, Ondrej Cepek, Pavel Surynek: Discovering implied constraints in precedence graphs with alternatives. Annals OR 180(1): 233-263 (2010)
65		Toshinori Munakata, Roman Barták: Logic programming for combinatorial problems. Artif. Intell. Rev. 33(1-2): 135-150 (2010)
64		Roman Barták, Daniel Toropila: Solving Sequential Planning Problems via Constraint Satisfaction. Fundam. Inform. 99(2): 125-145 (2010)
63		Roman Barták, Hana Rudová: Special issue on applications and methodologies for planning and scheduling: editorial. J. Scheduling 13(4): 299-300 (2010)
62		Roman Barták, Amedeo Cesta, Lee McCluskey, Miguel A. Salido: Preface to special issue on planning and scheduling. Knowledge Eng. Review 25(3): 247-248 (2010)
61		Roman Barták, Miguel A. Salido, Francesca Rossi: New trends in constraint satisfaction, planning, and scheduling: a survey. Knowledge Eng. Review 25(3): 249-279 (2010)
	2009
60		Roman Barták, Daniel Toropila: Constraint Models for Sequential Planning. CPAIOR 2009: 314-315
59		Roman Barták, Daniel Toropila: Enhancing Constraint Models for Planning Problems. FLAIRS Conference 2009
58		Roman Barták: Special Track on Artificial Intelligence Planning and Scheduling. FLAIRS Conference 2009
57		Michal Zerola, Michal Sumbera, Jérôme Lauret, Roman Barták: Efficient multi-site data movement in distributed environment. GRID 2009: 171-172
56		Michal Zerola, Michal Sumbera, Roman Barták, Jérôme Lauret: Using Constraint Programming to Plan Efficient Data Movement on the Grid. ICTAI 2009: 729-733
55		Roman Barták, Daniel Toropila: Revisiting Constraint Models for Planning Problems. ISMIS 2009: 582-591
54		Roman Barták, Daniel Toropila: Integrating Constraint Models for Sequential and Partial-Order Planning. SARA 2009
53		Lukás Chrpa, Roman Barták: Reformulating Planning Problems by Eliminating Unpromising Actions. SARA 2009
52		Roman Barták: Constraint Processing. Encyclopedia of Artificial Intelligence 2009: 404-409
51		Michal Zerola, Jérôme Lauret, Roman Barták, Michal Sumbera: Using constraint programming to resolve the multi-source/multi-site data movement paradigm on the Grid CoRR abs/0901.0148: (2009)
50		Michal Zerola, Jérôme Lauret, Roman Barták, Michal Sumbera: Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science CoRR abs/0906.2914: (2009)
	2008
49		Roman Barták, Ondrej Cepek: Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. AIMSA 2008: 235-246
48		Roman Barták, Daniel Toropila: Reformulating Constraint Models for Classical Planning. FLAIRS Conference 2008: 525-530
47		Lukás Chrpa, Roman Barták: Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies. FLAIRS Conference 2008: 531-536
46		Roman Barták, Ondrej Cepek: Nested temporal networks with alternatives: recognition and tractability. SAC 2008: 156-157
45		Lukás Chrpa, Roman Barták: Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action Dependencies. SCAI 2008: 175-180
44		Roman Barták: Rina Dechter , Constraint Processing, Morgan Kaufmann Publisher (2003) ISBN 1-55860-890-7, Francesca Rossi, Peter van Beek and Toby Walsh, Editors, Handbook of Constraint Programming, Elsevier (2006) ISBN 978-0-444-52726-4. Computer Science Review 2(2): 123-130 (2008)
43		Miguel A. Salido, Antonio Garrido, Roman Barták: Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems. Eng. Appl. of AI 21(5): 679-682 (2008)
42		Roman Barták, Ondrej Cepek: Incremental Filtering Algorithms for Precedence and Dependency Constraints. International Journal on Artificial Intelligence Tools 17(1): 205-221 (2008)
	2007
41		Roman Barták, Ondrej Cepek, Martin Hejna: Temporal Reasoning in Nested Temporal Networks with Alternatives. CSCLP 2007: 17-31
40		Pavel Surynek, Roman Barták: Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. FLAIRS Conference 2007: 134-139
39		Roman Barták, Ondrej Cepek: Temporal Networks with Alternatives: Complexity and Model. FLAIRS Conference 2007: 641-646
38		Roman Barták: Generating Implied Boolean Constraints Via Singleton Consistency. SARA 2007: 50-63
37		Roman Barták, Lee McCluskey: Introduction to the Special Issue on Knowledge Engineering Tools and Techniques for Automated Planning and Scheduling Systems. Knowledge Eng. Review 22(2): 115-116 (2007)
	2006
36		Roman Barták, Ondrej Cepek: A Constraint Model for State Transitions in Disjunctive Resources. CSCLP 2006: 48-62
35		Roman Barták: Incremental Propagation of Time Windows on Disjunctive Resources. FLAIRS Conference 2006: 25-30
34		Roman Barták, Ondrej Cepek: Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. ICAPS 2006: 350-353
33		Roman Barták, Ondrej Cepek: Incremental Filtering Algorithms for Precedence and Dependency Constraints. ICTAI 2006: 416-426
32		Roman Barták, Lee McCluskey: The First Competition on Knowledge Engineering for Planning and Scheduling. AI Magazine 27(1): 97-98 (2006)
31		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). Constraints 11(4): 269-270 (2006)
30		Timothy Atkinson, Roman Barták, Marius-Calin Silaghi, E. Tuleu, Markus Zanker: Private and Efficient Stable Marriages (Matching). IACR Cryptology ePrint Archive 2006: 345 (2006)
	2005
29		Roman Barták, Michela Milano: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 30 - June 1, 2005, Proceedings Springer 2005
28		Pavel Cejnar, Roman Barták: Automated Search for Heuristic Functions. CP 2005: 843
27		Pavel Surynek, Roman Barták: Encoding HTN Planning as a Dynamic CSP. CP 2005: 868
26		Josef Zlomek, Roman Barták: Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains. CP 2005: 876
25		Roman Barták: On Generators of Random Quasigroup Problems. CSCLP 2005: 164-178
24		Roman Barták, Pavel Surynek: An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. FLAIRS Conference 2005: 161-166
23		Marius-Calin Silaghi, Amit Abhyankar, Markus Zanker, Roman Barták: Desk-Mates (Stable Matching) with Privacy of Preferences, and a New Distributed CSP Framework. FLAIRS Conference 2005: 671-677
22		Roman Barták, Hana Rudová: Limited assignments: a new cutoff strategy for incomplete depth-first search. SAC 2005: 388-392
21		Roman Barták: R. Dechter, Constraint Processing, Morgan Kaufmann (2003). Artif. Intell. 169(2): 142-145 (2005)
20		Petr Vilím, Roman Barták, Ondrej Cepek: Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. Constraints 10(4): 403-425 (2005)
	2004
19		Petr Vilím, Roman Barták, Ondrej Cepek: Unary Resource Constraint with Optional Activities. CP 2004: 62-76
18		Pavel Surynek, Roman Barták: A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. CP 2004: 767-771
17		Roman Barták, Radek Erben: A New Algorithm for Singleton Arc Consistency. FLAIRS Conference 2004
16		Roman Barták: Effective Modeling with Constraints. INAP/WLP 2004: 149-165
15		Tomás Müller, Hana Rudová, Roman Barták: Minimal Perturbation Problem in Course Timetabling. PATAT 2004: 126-146
14		Roman Barták: The CP-04 Workshop on CSP Techniques with Immediate Application (Conference Report). IEEE Intelligent Informatics Bulletin 4: 3 (2004)
	2003
13		Roman Barták, Tomás Müller, Hana Rudová: A New Approach to Modeling and Solving Minimal Perturbation Problems. CSCLP 2003: 233-249
12		Roman Barták, Roman Mecl: Implementing Propagators for Tabular Constraints. CSCLP 2003: 44-65
11		Roman Barták: Dynamic Global Constraints in Backtracking Based Environments. Annals OR 118(1-4): 101-119 (2003)
	2002
10		Petr Vilím, Roman Barták: Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times. AIPS 2002: 312-321
9		Roman Barták: Visopt ShopFloor: On the Edge of Planning and Scheduling. CP 2002: 587-602
8		Roman Barták: A Theoretical Framework for Constraint Hierarchy Solvers. ECAI 2002: 146-150
7		Roman Barták: Visopt ShopFloor: Going Beyond Traditional Scheduling. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 185-199
6		Roman Barták: Modelling Resource Transitions in Constraint-Based Scheduling. SOFSEM 2002: 186-194
	2001
5		Tomás Müller, Roman Barták: Interactive Timetabling CoRR cs.PL/0109022: (2001)
4		Roman Barták: Dynamic Global Constraints: A First View CoRR cs.PL/0109025: (2001)
3		Krzysztof R. Apt, Roman Barták, Eric Monfroy, Francesca Rossi, Sebastian Brand: Proceedings of the 6th Annual Workshop of the ERCIM Working Group on Constraints CoRR cs.PL/0110012: (2001)
	2000
2		Roman Barták: Conceptual Models for Combined Planning and Scheduling. Electronic Notes in Discrete Mathematics 4: 1 (2000)
	1999
1		Roman Barták: Dynamic Constraint Models for Planning and Scheduling Problems. New Trends in Constraints 1999: 237-255

Coauthor Index

1	Amit Abhyankar	[23]
2	Krzysztof R. Apt	[3]
3	Timothy Atkinson	[30]
4	Sebastian Brand	[3]
5	Pavel Cejnar	[28]
6	Ondrej Cepek	[19] [20] [33] [34] [36] [39] [41] [42] [46] [49] [66]
7	Amedeo Cesta	[62]
8	Andrej Chovanec	[75] [76]
9	Lukás Chrpa	[45] [47] [53]
10	Filip Dvorak	[69]
11	Radek Erben	[17]
12	Simone Fratini	[67]
13	Antonio Garrido	[43]
14	Martin Hejna	[41]
15	Ondrej Kuzelka	[70] [71]
16	Jérôme Lauret	[50] [51] [56] [57]
17	Lee McCluskey	[32] [37] [62] [67]
18	Roman Mecl	[12]
19	Michela Milano	[29] [31]
20	Eric Monfroy	[3]
21	Tomás Müller	[5] [13] [15]
22	Toshinori Munakata	[65]
23	Francesca Rossi	[3] [61]
24	Hana Rudová	[13] [15] [22] [63]
25	Miguel A. Salido	[43] [61] [62] [73]
26	Ann Sheahan	[79]
27	Con Sheahan	[79]
28	Marius-Calin Silaghi (Marius Silaghi)	[23] [30]
29	Stanislav Slusny	[77]
30	Michal Sumbera	[50] [51] [56] [57]
31	Pavel Surynek	[18] [24] [27] [40] [66]
32	Daniel Toropila	[48] [54] [55] [59] [60] [64]
33	E. Tuleu	[30]
34	Petr Vilím	[10] [19] [20]
35	Markus Zanker	[23] [30]
36	Filip Zelezný	[70] [71]
37	Michal Zerola	[50] [51] [56] [57] [77]
38	Josef Zlomek	[26]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page