1

Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers, volume 7112 of Lecture Notes in Computer Science, pages 259-271, 2011, Springer.
bib
Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia and others), pages 285-287, 2011.
PDF bib
Variable Neighborhood Search for Capacitated Connected Facility Location
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (A. Quesada-Arencibia and others), pages 261-263, 2011.
PDF bib
A Brief Survey on Hybrid Metaheuristics
Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications (B. Filipic and J. Silc), pages 3-16, 2010.
PDF bib
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents
Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa and others), volume 6373 of LNCS, pages 103-117, 2010, Springer.
PDF bib
A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem
2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design (F. Xhafa and others), pages 356-361, 2010, Conference Publishing Services.
PDF bib
Algorithms and Complexity Results for Exact Bayesian Structure Learning
Proceedings of UAI 2010, The 26th Conference on Uncertainty in Artificial Intelligence, Catalina Island, California, USA, July 8-11, 2010 (Peter Grünwald and Peter Spirtes), 2010, AUAI Press, Corvallis, Oregon.
bib
Algorithms and Complexity Results for Persuasive Argumentation
Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni and Federico Cerutti and Massimiliano Giacomin and Guillermo R. Simari), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 311-322, 2010.
bib
An Improved Algorithm for the Metro-Line Crossing Minimization Problem
Graph Drawing (GD'09) (Eppstein, David and Gansner, Emden R.), volume 5849 of LNCS, pages 381-392, 2010, Springer Berlin Heidelberg.
bib DOI
Are There Any Good Digraph Width Measures?
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, volume 6478 of Lecture Notes in Computer Science, pages 135-146, 2010, Springer.
bib