1

A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables
Proceedings of the 9th Metaheuristics International Conference (Luca Di~Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 349–358, 2011.
PDF bib
Adjacency-Preserving Spatial Treemaps
Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 159–170, 2011, Springer Berlin Heidelberg.
PDF bib DOI
An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 256–259, 2011.
PDF bib
Augmenting Tractable Fragments of Abstract Argumentation
Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 1033-1038, 2011, AAAI Press/IJCAI.
bib
Automatic Generation of 2-AntWars Players with Genetic Programming
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 244–246, 2011.
PDF bib
Automatic Generation of Route Sketches
Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 391–392, 2011, Springer Berlin Heidelberg.
Note: Poster abstract
bib DOI
Backdoors to Tractable Answer-Set Programming
Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 863-868, 2011, AAAI Press/IJCAI.
bib
Boundary-Labeling Algorithms for Panorama Images
Advances in Geographic Information Systems (SIGSPATIAL'11), pages 289–298, 2011, ACM.
PDF bib DOI
Clique-width: When Hard Does Not Mean Impossible
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, volume 9 of LIPIcs, pages 404–415, 2011, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
bib
Connecting Two Trees with Optimal Routing Cost
Canadian Conference on Computational Geometry (CCCG ‘11), pages 43–47, 2011, University of Toronto.
PDF bib