IBM Research – Ireland Dublin Technology Campus Mulhuddart, Dublin 15, Ireland

Jakub Marecek Read [ia-cob mar-a-Czech] Research Interests Convex Programming Integer Programming (Solvers) Graph (Colouring) Algorithms Applications in Scheduling and Timetabling Work & Education currently: Research Staff Member, IBM Research – Ireland 2012 (winter, spring): Post-doc, The University of Edinburgh School of Mathematics 2011 (autumn): Research Software Engineer, IBM T. J. Watson Research Center 2011 (summer): Researcher, The University of Toronto Fields Institute 2011 (spring): LoST Fellow, The University of Nottingham NNN Center 2009-2010: Industrial Mathematics Intern, ARM Ltd. R&D 2007-2011: PhD Student, The University of Nottingham School of Computer Science 2006-2007: Vistiting Postgraduate Student at The University of Nottingham 2006-2009: Master's Student, Masaryk University Faculty of Informatics 2003-2006: Undergraduate, Masaryk University Faculty of Informatics 2003-2006: Undergraduate, Masaryk University Faculty of Arts (English and Film) 2003-2006: English Tutor for Deaf Students, Masaryk University SCSSN 2002-2003: Windows Mobile Software Developer, Aponia Software 2000-2001: PHP/Perl Coder, BrnoCity Please see my CV, its one-page resume, and an overview of my research for details.

Papers and Manuscripts:

1. A Distributed Coordinate Descent Method for Composite Function Minimisation
   with Applications in Training Sparse Support Vector Machines
   joint work with Peter Richtarik and Martin Takac, presented at
   ISMP 2012: slides
   
2. A Space-Indexed Formulation of Packing Boxes into a Larger Box
   joint work with Sam D. Allen and Edmund K. Burke available as
   in Operations Research Letters (2012) 40(1), 20-24: DOI, pre-print, BibTeX, instances, source code
3. Dynamic Data Structures for Taskgraph Scheduling Policies with Applications in OpenCL Accelerators
   joint work with Edmund K. Burke, Andrew J. Parkes, and the staff of ARM Ltd. presented at
   MISTA 2011: pre-print, slides
4. Semidefinite Programming Relaxations in Timetabling
   joint work with Edmund K. Burke and Andrew J. Parkes presented at
   PATAT 2010: Part I: Relaxations: abstract, introductory slides,
   PATAT 2012: Part II: Algorithms,
   and extended into a technical report: draft, slides
5. Some Probabilistic Results on Width Measures of Graphs
   a part of my thesis presented at
   GROW 2009: extended abstract
   
6. A Primal Heuristic for Integer Linear Programming with Automated Aggregations
   a part of my thesis presented at
   ISMP 2009: slides
   
7. A Supernodal Formulation of Vertex Colouring with Applications in Course Timetabling
   joint work with Edmund K. Burke, Andrew J. Parkes, and Hana Rudova
   in Annals of Operations Research (2010) 179(1), 105-130: DOI, pre-print, slides, BibTeX, generator, instances
8. Decomposition, Reformulation, and Diving in University Course Timetabling
   joint work with Edmund K. Burke, Andrew J. Parkes, and Hana Rudova
   in Computers and Operations Research (2010) 37(3), 582-597: DOI, pre-print, BibTeX, source code
9. A Branch-and-Cut Procedure for the Udine Course Timetabling Problem
   joint work with Edmund K. Burke, Andrew J. Parkes, and Hana Rudova
   in Annals of Operations Research (2012) 194(1), 71-87: DOI, pre-print, BibTeX, source code, also presented at
   PATAT 2008: abstract, slides, BibTeX, source code and
   OR 2007: DOI, pre-print, instances and results, BibTeX, slides

Theses:

• Exploiting Structure in Integer Programs
  PhD dissertation, supervised by Edmund K. Burke and Andrew J. Parkes: a draft
• Course Timetabling with Integer Programming
  master's thesis with Edmund K. Burke, Andrew J. Parkes, and Hana Rudova: text, code
• A Polylog Algorithm for Linear Discrete Optimization in 3D
  undergraduate thesis with Petr Hlineny: text, demo, slides

Course Materials:

• Maple Programming at the University of Edinburgh (2012)
• Algorithms and Data Structures at the University of Nottingham (TA 2008)
• English or Czenglish? at Masaryk University (2005-2007)
• English for the Deaf at Masaryk University (2003-2006)
• Python Programming for Grada Publishing (2002-2003)

Views and Reviews:

• A survey of Data Structures for Stochastic Scheduling, slides for a talk I have given at
  the Charles University Midsummer Combinatorial Workshop
• A survey of The Many Approaches to Integer Programming, slides for a talk I have given at
  the University of Edinburgh ERGO Seminar, and at IBM Research
• A survey of Recent Trends in Convex Programming, slides for a talk I have given at
  Masaryk University FMDSA Seminar, the University of Nottingham ASAP Seminar, and at IBM Research
• A review of Approximation Algorithms and Semidefinite Programming by Gaertner and Matousek
  to appear in ACM SIGACT News: pre-print
• A review of Theoretical Aspects of Local Search by Michiels, Aarts, and Korst
  in ACM SIGACT News (2009) 40(2), 27-30: DOI, pre-print
• A review of Handbook of Approximation Algorithms and Metaheuristics edited by Gonzalez
  in The Computer Journal (2010) 53(8), 1338--1339: DOI, pre-print
• A review of Production Planning Using Mixed Integer Programming by Pochet and Wolsey
  in The Computer Journal (2009) 52(6): 724--725: DOI, pre-print
• A review of The Traveling Salesman Problem: A Computational Study by Applegate, Bixby, Chvatal, and Cook
  in Interfaces (2008) 38(4), 344-344: DOI, pre-print
• A survey of Integer Programming in Graph Colouring, slides for a talk I have given at
  Warwick University DIMAP Seminar, the University of Nottingham ASAP Seminar, and elsewhere

Prototypes:

• Plosar: Programming Language for Optimisation with Semi-Automated Reformulations
• Philipaa: Primal Heuristic for Integer Linear Programming with Automated Aggregations
• Discretisation: Solvers for 3D Packing Problems
• Memos Solver for Timetabling: Multiphase Exploitation of Multiple Objective-/Value-restricted Submodels of Udine Course Timetabling
• Branch-and-Cut Solver for Timetabling: A Branch-and-Cut Procedure for Udine Course Timetabling

Still looking? Please feel free to drop me a line, connect in LinkedIn, browse through a well-known graph, see a certain sub-graph or some pictures.