Ondrej Cepek

2008
16	EE	Roman Barták, Ondrej Cepek: Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. AIMSA 2008: 235-246
15	EE	Roman Barták, Ondrej Cepek: Nested temporal networks with alternatives: recognition and tractability. SAC 2008: 156-157
14	EE	Ondrej Cepek, David Kronus, Petr Kucera: Recognition of interval Boolean functions. Ann. Math. Artif. Intell. 52(1): 1-24 (2008)
13	EE	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
12	EE	Roman Barták, Ondrej Cepek, Martin Hejna: Temporal Reasoning in Nested Temporal Networks with Alternatives. CSCLP 2007: 17-31
11		Roman Barták, Ondrej Cepek: Temporal Networks with Alternatives: Complexity and Model. FLAIRS Conference 2007: 641-646
2006
10	EE	Roman Barták, Ondrej Cepek: A Constraint Model for State Transitions in Disjunctive Resources. CSCLP 2006: 48-62
9		Roman Barták, Ondrej Cepek: Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. ICAPS 2006: 350-353
8	EE	Roman Barták, Ondrej Cepek: Incremental Filtering Algorithms for Precedence and Dependency Constraints. ICTAI 2006: 416-426
2005
7	EE	Ondrej Cepek, Shao Chin Sung: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers & OR 32: 3265-3271 (2005)
6	EE	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)
5	EE	Ondrej Cepek, Petr Kucera: Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. Discrete Applied Mathematics 149(1-3): 14-52 (2005)
2004
4	EE	Petr Vilím, Roman Barták, Ondrej Cepek: Unary Resource Constraint with Optional Activities. CP 2004: 62-76
2001
3	EE	Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek: A Satisfiability Formulation of Problems on Level Graphs. Electronic Notes in Discrete Mathematics 9: 269-277 (2001)
1998
2		Endre Boros, Ondrej Cepek, Alexander Kogan: Horn Minimization by Iterative Decomposition. Ann. Math. Artif. Intell. 23(3-4): 321-343 (1998)
1997
1	EE	Endre Boros, Ondrej Cepek: On perfect 0, +/- 1 matrices, . Discrete Mathematics 165-166: 81-100 (1997)

Coauthor Index

1	Roman Barták	[4] [6] [8] [9] [10] [11] [12] [13] [15] [16]
2	Endre Boros	[1] [2] [3]
3	Peter L. Hammer	[3]
4	Martin Hejna	[12]
5	Alexander Kogan	[2] [3]
6	David Kronus	[14]
7	Petr Kucera	[5] [14]
8	Kazuhisa Makino	[3]
9	Bert Randerath	[3]
10	Bruno Simeone	[3]
11	Ewald Speckenmeyer	[3]
12	Shao Chin Sung	[7]
13	Petr Vilím	[4] [6]

Colors in the list of coauthors