| 2012 | ||
|---|---|---|
| j8 | Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová: A branch-and-cut procedure for the Udine Course Timetabling problem. Annals OR 194(1): 71-87 (2012) | |
| c16 | Dalibor Klusácek, Hana Rudová: Performance and Fairness for Users in Parallel Job Scheduling. JSSPP 2012: 235-252 | |
| 2011 | ||
| j7 | Dalibor Klusácek, Hana Rudová: Efficient grid scheduling through the incremental schedule-based approach. Computational Intelligence 27(1): 4-22 (2011) | |
| j6 | Petr Holub, Hana Rudová, Milos Liska: Data transfer planning with tree placement for collaborative environments. Constraints 16(3): 283-316 (2011) | |
| j5 | Hana Rudová, Tomás Müller, Keith S. Murray: Complex university course timetabling. J. Scheduling 14(2): 187-207 (2011) | |
| c15 | Dalibor Klusácek, Hana Rudová: Efficient Data Representation of Large Job Schedules. MEMICS 2011: 103-113 | |
| 2010 | ||
| j4 | Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová: A supernodal formulation of vertex colouring with applications in course timetabling. Annals OR 179(1): 105-130 (2010) | |
| j3 | Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová: Decomposition, reformulation, and diving in university course timetabling. Computers & OR 37(3): 582-597 (2010) | |
| j2 | Roman Barták, Hana Rudová: Special issue on applications and methodologies for planning and scheduling: editorial. J. Scheduling 13(4): 299-300 (2010) | |
| c14 | Dalibor Klusácek, Hana Rudová: The Importance of Complete Data Sets for Job Scheduling Simulations. JSSPP 2010: 132-153 | |
| c13 | Pavel Troubil, Hana Rudová: Integer Programming for Media Streams Planning Problem. MEMICS 2010: 116-123 | |
| c12 | ||
| 2009 | ||
| i3 | Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová: Decomposition, Reformulation, and Diving in University Course Timetabling. CoRR abs/0903.1095 (2009) | |
| 2007 | ||
| c11 | Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová: Penalising Patterns in Timetables: Novel Integer Programming Formulations. OR 2007: 409-414 | |
| c10 | Dalibor Klusácek, Ludek Matyska, Hana Rudová: Alea - Grid Scheduling Simulation Environment. PPAM 2007: 1029-1038 | |
| e1 | Edmund K. Burke, Hana Rudová (Eds.): Practice and Theory of Automated Timetabling VI, 6th International Conference, PATAT 2006, Brno, Czech Republic, August 30 - September 1, 2006, Revised Selected Papers. Lecture Notes in Computer Science 3867, Springer 2007, isbn 978-3-540-77344-3 | |
| i2 | Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová: On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling. CoRR abs/0710.3603 (2007) | |
| 2006 | ||
| c9 | Keith S. Murray, Tomás Müller, Hana Rudová: Modeling and Solution of a Complex University Course Timetabling Problem. PATAT 2006: 189-209 | |
| 2005 | ||
| c8 | Roman Barták, Hana Rudová: Limited assignments: a new cutoff strategy for incomplete depth-first search. SAC 2005: 388-392 | |
| 2004 | ||
| c7 | Tomás Müller, Hana Rudová, Roman Barták: Minimal Perturbation Problem in Course Timetabling. PATAT 2004: 126-146 | |
| 2003 | ||
| c6 | Roman Barták, Tomás Müller, Hana Rudová: A New Approach to Modeling and Solving Minimal Perturbation Problems. CSCLP 2003: 233-249 | |
| c5 | ||
| 2002 | ||
| c4 | Hana Rudová, Keith S. Murray: University Course Timetabling with Soft Constraints. PATAT 2002: 310-328 | |
| 2001 | ||
| i1 | ||
| 1999 | ||
| c3 | ||
| 1998 | ||
| j1 | ||
| c2 | ||
| c1 | Hana Rudová: Constraints with Variables` Annotations and Constraint Hierarchies. SOFSEM 1998: 409-418 | |
| 1 | Roman Barták | |
| 2 | Edmund K. Burke | |
| 3 | Petr Holub | |
| 4 | Dalibor Klusácek | |
| 5 | Milos Liska | |
| 6 | Jakub Marecek | |
| 7 | Ludek Matyska | |
| 8 | Keith S. Murray | |
| 9 | Tomás Müller | |
| 10 | Andrew J. Parkes | |
| 11 | Pavel Troubil |
Colors in the list of coauthors
Last update Thu May 23 15:58:34 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page