Publications


Search


  Clear

1084 results
  • M. Blesa, A. Duch, J. Gabarró, J. Petit, and M. Serna. Economía aplicada al estudio de la evolución de un curso. ReVisión, 10(1), jan 2017. [web]

  • Christian Blum and Maria J. Blesa. A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. Journal of Heuristics, 2017. To appear. [doi]

  • Christian Blum and Maria J. Blesa. A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem. CoRR, abs/1702.00318, 2017.

  • Josep Diaz, Olli Pottonen, Maria Serna, and Erik Jan van Leeuwen. Complexity of metric dimension on planar graphs. Journal of Computer and System Sciences, 83(1):132–158, feb 2017. [doi]

  • Amalia Duch and Gustavo Lau. Partial match queries in relaxed K-dt trees. 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), jan 2017. [doi]

  • Bruno Fosso, Graziano Pesole, Francesc Rosselló, and Gabriel Valiente. Unbiased taxonomic annotation of metagenomic samples. In Proc. 13th Int. Symp. Bioinformatics Research and Applications, volume 10330 of Lecture Notes in Computer Science, pages 162–173. Springer International Publishing, 2017. [doi]

  • Bruno Fosso, Monica Santamaria, M. D’Antonio, D. Lovero, G. Corrado, E. Vizza, N. Passaro, A. R. Garbuglia, M. R. Capobianchi, M. Crescenzi, Gabriel Valiente, and Graziano Pesole. MetaShot: an accurate workflow for taxon classification of host-associated microbiome from shotgun metagenomic data. Bioinformatics, 33(11):1730–1732, jan 2017. [doi]

  • Giulia Fragnito, Joaquim Gabarro, and Maria Serna. An angel-daemon approach to assess the uncertainty in the power of a collectivity to act. Symbolic and Quantitative Approaches to Reasoning with Uncertainty, page 318–328, 2017. [doi]

  • Evelia Lizárraga, Maria J. Blesa, and Christian Blum. Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: Which one works better when? In Evolutionary Computation in Combinatorial Optimization - 17th European Conference, EvoCOP 2017, pages 60–74, 2017. [doi]

  • Evelia Lizárraga, Maria J. Blesa, Christian Blum, and Günther R. Raidl. Large neighborhood search for the most strings with few bad columns problem. Soft Computing, 2017. To appear. [doi]

  • Lucas Machado and Jordi Cortadella. Boolean decomposition for AIG optimization. In Proc. of the Great Lakes Symposium on VLSI, pages 143–148, may 2017.

  • Lucas Machado, Antoni Roca, and Jordi Cortadella. Voltage noise analysis with ring oscillator clocks. In Proc. IEEE Computer Society Annual Symposium on VLSI, pages 86–95, jul 2017.

  • Lucas Machado, Antoni Roca, and Jordi Cortadella. Increasing the robustness of digital circuits with ring oscillator clocks. In 2nd International Workshop on Resiliency in Embedded Electronic Systems (REES), mar 2017.

  • Conrado Martínez and Mark D. Ward, editors. Preface. Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2017). Society for Industrial and Applied Mathematics, 2017. [doi]

  • Carme Àlvarez Messegué and Arnau. Network creation games: Structure vs anarchy. CoRR, abs/1706.09132, 2017.

  • Alberto Moreno and Jordi Cortadella. Synthesis of all-digital delay lines. 2017 23nd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC), may 2017.

  • Edelmira Pasarella and Jorge Lobo. A datalog framework for modeling relationship-based access control policies. In Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, pages 91–102. ACM, 2017. [doi]

  • Edelmira Pasarella, Maria-Esther Vidal, and Cristina Zoltan. Comparing mapreduce and pipeline implementations for counting triangles. Electronic proceedings in theoretical computer science, 237:20–33, 2017. [doi]

  • Jordi Petit, Salvador Roura, Josep Carmona, Jordi Cortadella, Amalia Duch, Omer Gimenez, Anaga Mani, Jan Mas, Enric Rodriguez-Carbonella, Albert Rubio, and et al. Jutge.org: Characteristics and experiences. IEEE Transactions on Learning Technologies, page 1–1, 2017. [doi]

  • S. Schneider, L. Lambers, and F. Orejas. Symbolic model generation for graph properties. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10202 LNCS:226–243, 2017. [doi]

  • Alex Vidal-Obiols, Jordi Cortadella, and Jordi Petit. Under-the-cell routing to improve manufacturability. In Proceedings of the on Great Lakes Symposium on VLSI 2017, GLSVLSI '17, pages 125–130, New York, NY, USA, 2017. ACM. [doi]

  • C. Àlvarez and A. Messeguè. Max celebrity games. Algorithms and Models for the Web Graph, page 88–99, 2016. [doi]

  • Carme Àlvarez, Maria J. Blesa, Amalia Duch, Arnau Messegué, and Maria Serna. Celebrity games. Theor. Comput. Sci., 648:56–71, 2016. [doi]

  • Carme Àlvarez, Maria J. Serna, and Aleix Fernàndez. Network formation for asymmetric players and bilateral contracting. Theory Comput. Syst., 59(3):397–415, 2016. [doi]

  • N. Bereczky, A. Duch, K. Németh, and S. Roura. Quad-kd trees: A general framework for kd trees and quad trees. Theoretical Computer Science, 616:126–140, 2016. [doi]

  • M. J. Blesa, A. Duch, J. Gabarró, J. Petit, and M. Serna. Análisis de la evolución de un curso: productividad y desigualdad. In Actas de las XXII Jornadas sobre Enseñanza Universitaria de la Informática, volume 1, pages 161–168, 2016.

  • M. J. Blesa, A. Duch, J. Gabarró, J. Petit, and M. J. Serna. Continuous assessment in the evolution of a CS1 course: The pass rate/workload ratio. In Computer Supported Education - 7th International Conference, CSEDU 2015, Lisbon, Portugal, May 23-25, 2015, Revised Selected Papers, volume 583 of Communications in Computer and Information Science, pages 313–332. Springer, 2016. [doi]

  • Christian Blum and Maria J. Blesa. Construct, merge, solve and adapt: Application to the repetition-free longest common subsequence problem. Lecture Notes in Computer Science, page 46–57, 2016. [doi]

  • C.E. Chiriţă, J.L. Fiadeiro, and F. Orejas. Many-valued institutions for constraint specification. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9633:359–376, 2016. [doi]

  • Jordi Cortadella, Marc Lupon, Alberto Moreno, Antoni Roca, and Sachin S. Sapatnekar. Ring oscillator clocks and margins. 2016 22nd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC), may 2016. Best paper award. [doi]

  • Javier de San Pedro, Thomas Bourgeat, and Jordi Cortadella. Specification mining for asynchronous controllers. 2016 22nd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC), may 2016. [doi]

  • Javier de San Pedro and Jordi Cortadella. Discovering duplicate tasks in transition systems for the simplification of process models. Business Process Management, page 108–124, 2016. [doi]

  • Javier de San Pedro and Jordi Cortadella. Mining structured petri nets for the visualization of process behavior. Proceedings of the 31st Annual ACM Symposium on Applied Computing - SAC ’16, 2016. [doi]

  • J. Díaz, D. Mitsche, G. Perarnau, and X. Perez-Gimenez. On the relation between graph distance and euclidean distance in random geometric graphs. Advances in Applied Probability, 48(3):848–864, 2016. [doi]

  • Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, and Maria J. Serna. On the stability of generalized second price auctions with budgets. Theory Comput. Syst., 59(1):1–23, 2016. [doi]

  • Josep Díaz, Leslie Ann Goldberg, David Richerby, and Maria J. Serna. Absorption time of the moran process. Random Struct. Algorithms, 49(1):137–159, 2016. [doi]

  • Amalia Duch, Gustavo Lau, and Conrado Martínez. Random partial match in quad-K-d trees. Lecture Notes in Computer Science, page 376–389, 2016. [doi]

  • Palkesh Jain, Jordi Cortadella, and Sachin S. Sapatnekar. A fast and retargetable framework for logic-IP-internal electromigration assessment comprehending advanced waveform effects. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 24(6):2345–2358, jun 2016. [doi]

  • Sascha Kurz, Xavier Molinero, Martin Olsen, and Maria Serna. Dimension and codimension of simple games. Electronic Notes in Discrete Mathematics, 55:147–150, 2016. [doi]

  • Sascha Kurz, Xavier Molinero, Martin Olsen, and Maria Serna. Dimension and codimension of simple games. CoRR, abs/1602.04328, 2016.

  • Marinella Marzano, Bruno Fosso, Caterina Manzari, Francesco Grieco, Marianna Intranuovo, Giuseppe Cozzi, Giuseppina Mulè, Gaetano Scioscia, Gabriel Valiente, Apollonia Tullo, Elisabetta Sbisà, Graziano Pesole, and Monica Santamaria. Complexity and dynamics of the winemaking bacterial communities in berries, musts, and wines from Apulian grape cultivars through time and space. PLOS ONE, 11(6):e0157383, jun 2016. [doi]

  • Xavier Molinero, Martin Olsen, and Maria J. Serna. On the complexity of exchanging. Inf. Process. Lett., 116(6):437–441, 2016. [doi]

  • Xavier Molinero, Fabi'an Riquelme, and Maria J. Serna. Measuring satisfaction in societies with opinion leaders and mediators. CoRR, abs/1605.04399, 2016.

  • Xavier Molinero and Maria J. Serna. The complexity of measuring power in generalized opinion leader decision models. Electronic Notes in Discrete Mathematics, 54:205–210, 2016. [doi]

  • Edelmira Pasarella, Maria-Esther Vidal, and Cristina Zoltan. Mapreduce vs. pipelining counting triangles. In Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW2016), Panama City, Panama, May 8-10, 2016, volume 1644. CEUR-WS.org, 2016.

  • Maria J. Serna. Parallel algorithms for two processors precedence constraint scheduling. In Encyclopedia of Algorithms, pages 1511–1514. Springer, 2016. [doi]

  • R. Verborgh, D. Arndt, S. van Hoecke, J. de Roo, G. Mels, T. Steiner, and J. Gabarro. The pragmatic proof: Hypermedia API composition and execution. Theory and Practice of Logic Programming, 17(01):1–48, mar 2016. [doi]

  • Maria J. Blesa Talbi, Christian Blum, Angelo Cangelosi, Vincenzo Cutello, Alessandro G. Di Nuovo, Mario Pavone, and El-Ghazali, editors. Hybrid Metaheuristics - 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings, volume 9668 of Lecture Notes in Computer Science. Springer, 2016. [doi]

  • Arya Adriansyah, Jorge Munoz-Gama, Josep Carmona, Boudewijn F. van Dongen, and Wil M. P. van der Aalst. Measuring precision of modeled behavior. Inf. Syst. E-Business Management, 13(1):37–67, 2015. [doi]

  • Carme Álvarez, Maria J. Blesa, and Hendrik Molter. Firefighting as a strategic game. Internet Mathematics, 12(1-2):101–120, nov 2015. [doi]

  • Carme Àlvarez and Maria Serna. Preface. Theory Comput. Syst., 57(3):521–522, 2015. [doi]

  • Albert Atserias and Moritz Müller. Partially definable forcing and bounded arithmetic. Arch. Math. Logic, 54(1-2):1–33, 2015. [doi]

  • Albert Atserias, Moritz Müller, and Sergi Oliva. Lower bounds for DNF-refutations of a relativized weak pigeonhole principle. J. Symb. Log., 80(2):450–476, 2015. [doi]

  • Christian Blum, Borja Calvo, and Maria J. Blesa. FrogCOL and frogMIS: new decentralized algorithms for finding large independent sets in graphs. Swarm Intelligence, 9(2-3):205–227, 2015. [doi]

  • Marco Cannizzaro, Salomon Beer, Jordi Cortadella, Ran Ginosar, and Luciano Lavagno. Saferazor: Metastability-robust adaptive clocking in resilient circuits. IEEE Trans. on Circuits and Systems, 62(9):2238–2247, 2015. [doi]

  • Marco Cannizzaro, Salomon Beer, Jordi Cortadella, Ran Ginosar, and Luciano Lavagno. Saferazor: Metastability-robust adaptive clocking in resilient circuits. IEEE Transactions on Circuits and Systems I: Regular Papers, 62(9):2238–2247, sep 2015. [doi]

  • Jorge Castro, Joaquim Gabarró, Maria J. Serna, and Alan Stewart. The robustness of periodic orchestrations in uncertain evolving environments. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 13th European Conference, ECSQARU 2015, Compiègne, France, July 15-17, 2015. Proceedings, pages 129–140, 2015. [doi]

  • Jordi Cortadella, Marc Galceran-Oms, Mike Kishinevsky, and Sachin S. Sapatnekar. RTL synthesis: From logic synthesis to automatic pipelining. Proceedings of the IEEE, 103(11):2061–2075, nov 2015. [doi]

  • Jordi Cortadella, Luciano Lavagno, Pedro Lopez, Marc Lupon, Alberto Moreno, Antoni Roca, and Sachin S. Sapatnekar. Reactive clocks with variability-tracking jitter. 2015 33rd IEEE International Conference on Computer Design (ICCD), oct 2015. [doi]

  • Jordi Cortadella, Marc Galceran Oms, Michael Kishinevsky, and Sachin S. Sapatnekar. RTL synthesis: From logic synthesis to automatic pipelining. Proceedings of the IEEE, 103(11):2061–2075, 2015. [doi]

  • Marta Ruiz Costa-Jussà, Lluis Formiga, Oriol Torrillas, Jordi Petit, and José Adrián Rodríguez Fonollosa. A MOOC on approaches to machine translation. International Review of Research in Open and Distributed Learning, 16(6), dec 2015. [doi]

  • Javier de San Pedro, Josep Carmona, and Jordi Cortadella. Log-based simplification of process models. In Business Process Management - 13th International Conference, BPM 2015, Innsbruck, Austria, August 31 - September 3, 2015, Proceedings, pages 457–474, 2015. [doi]

  • A. Duch, J. Gabarró, J. Petit, M. J. Blesa, and M. J. Serna. A cost-benefit analysis of continuous assessment. In Proceedings of the 7th International Conference on Computer Supported Education, pages 57–66. SCITEPRESS, 2015. [doi]

  • Amalia Duch, Gustavo Lau, and Conrado Martínez. On the cost of fixed partial match queries in K-d trees. Algorithmica, 75(4):684–723, dec 2015. [doi]

  • José Luiz Fiadeiro and Fernando Orejas. Abstract constraint data types. In Software, Services, and Systems - Essays Dedicated to Martin Wirsing on the Occasion of His Retirement from the Chair of Programming and Software Engineering, pages 155–170, 2015. [doi]

  • Bruno Fosso, Monica Santamaria, Marinella Marzano, Daniel Alonso-Alemany, Gabriel Valiente, Giacinto Donvito, Alfonso Monaco, Pasquale Notarangelo, and Graziano Pesole. BioMaS: a modular pipeline for Bioinformatic analysis of Metagenomic ampliconS. BMC Bioinformatics, 16:203, 2015. [doi]

  • Frank Hermann, Hartmut Ehrig, Fernando Orejas, Krzysztof Czarnecki, Zinovy Diskin, Yingfei Xiong, Susann Gottmann, and Thomas Engel. Model synchronization based on triple graph grammars: correctness, completeness and invertibility. Software and System Modeling, 14(1):241–269, 2015. [doi]

  • Palkesh Jain, Sachin S. Sapatnekar, and Jordi Cortadella. A retargetable and accurate methodology for logic-IP-internal electromigration assessment. In The 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015, Chiba, Japan, January 19-22, 2015, pages 346–351, 2015. [doi]

  • Palkesh Jain, Sachin S. Sapatnekar, and Jordi Cortadella. Stochastic and topologically aware electromigration analysis for clock skew. 2015 IEEE International Reliability Physics Symposium, apr 2015. [doi]

  • Evelia Lizarraga, Maria J. Blesa, Christian Blum, and Günther R. Raidl. On solving the most strings with few bad columns problem: An ILP model and heuristics. In International Symposium on Innovations in Intelligent SysTems and Applications, INISTA 2015, Madrid, Spain, September 2-4, 2015, pages 1–8, 2015. [doi]

  • Evelia Lizarraga, Maria J. Blesa, Christian Blum, and Gunther R. Raidl. On solving the most strings with few bad columns problem: An ILP model and heuristics. 2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA), sep 2015. [doi]

  • Conrado Martínez, Markus E. Nebel, and Sebastian Wild. Analysis of branch misses in quicksort. In Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA, January 4, 2015, pages 114–128, 2015. [doi]

  • Andrey Mokhov and Josep Carmona. Event log visualisation with conditional partial order graphs: from control flow to data. In Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, ATAED 2015, Satellite event of the conferences: 36th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2015 and 15th International Conference on Application of Concurrency to System Design ACSD 2015, Brussels, Belgium, June 22-23, 2015., pages 16–30, 2015.

  • Xavier Molinero, Fabián Riquelme, and Maria Serna. Forms of representation for simple games: sizes, conversions and equivalences. Math. Social Sci., 76:87–102, 2015. [doi]

  • Xavier Molinero, Fabián Riquelme, and Maria Serna. Cooperation through social influence. European J. Oper. Res., 242(3):960–974, 2015. [doi]

  • Nikos Mylonakis, Fernando Orejas, and José Luiz Fiadeiro. A semantics of business configurations using symbolic graphs. In 2015 IEEE International Conference on Services Computing, SCC 2015, New York City, NY, USA, June 27 - July 2, 2015, pages 146–153, 2015. [doi]

  • Marisa Navarro, Fernando Orejas, and Elvira Pino. Satisfiability of constraint specifications on XML documents. In Logic, Rewriting, and Concurrency - Essays dedicated to José Meseguer on the Occasion of His 65th Birthday, pages 539–561, 2015. [doi]

  • Markus E. Nebel, Sebastian Wild, and Conrado Martínez. Analysis of pivot sampling in dual-pivot quicksort: A holistic analysis of Yaroslavskiy’s partitioning scheme. Algorithmica, 75(4):632–683, aug 2015. [doi]

  • Edelmira Pasarella and Jorge Lobo. Reasoning about policy behavior in logic-based trust management systems: Some complexity results and an operational framework. In IEEE 28th Computer Security Foundations Symposium, CSF 2015, Verona, Italy, 13-17 July, 2015, pages 232–242, 2015. [doi]

  • Joel Ribeiro and Josep Carmona. A method for assessing parameter impact on control-flow discovery algorithms. In Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, ATAED 2015, Satellite event of the conferences: 36th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2015 and 15th International Conference on Application of Concurrency to System Design ACSD 2015, Brussels, Belgium, June 22-23, 2015., pages 83–96, 2015.

  • Amalia Duch Serna, Joaquim Gabarró, Jordi Petit, Maria J. Blesa, and Maria J. A cost-benefit analysis of continuous assessment. In CSEDU 2015 - Proceedings of the 7th International Conference on Computer Supported Education, Volume 2, Lisbon, Portugal, 23-25 May, 2015., pages 57–66, 2015.

  • Carme Àlvarez Serna, Maria J. Blesa, Amalia Duch, Arnau Messegué, and Maria J. Stars and celebrities: A network creation game. CoRR, abs/1505.03718, 2015.

  • Josefina Sierra-Santibáñez. An agent-based model of the emergence and transmission of a language system for the expression of logical combinations. In Blai Bonet and Sven Koenig, editors, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA., pages 492–500. AAAI Press, 2015.

  • Thomas Steiner, Ruben Verborgh, Joaquim Gabarró, Erik Mannens, and Rik Van de Walle. Clustering media items stemming from multiple social networks. Comput. J., 58(9):1861–1875, 2015. [doi]

  • Alan Stewart, Joaquim Gabarró, and Anthony Keenan. Uncertainty in the cloud: An angel-daemon approach to modelling performance. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 13th European Conference, ECSQARU 2015, Compiègne, France, July 15-17, 2015. Proceedings, pages 141–150, 2015. [doi]

  • Timo Sztyler, Johanna Völker, Josep Carmona, Oliver Meier, and Heiner Stuckenschmidt. Discovery of personal processes from labeled sensor data - an application of process mining to personalized health care. In Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, ATAED 2015, Satellite event of the conferences: 36th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2015 and 15th International Conference on Application of Concurrency to System Design ACSD 2015, Brussels, Belgium, June 22-23, 2015., pages 31–46, 2015.

  • Hamid Reza Motahari-Nezhad, Jan Recker, and Matthias Weidlich, editors. Business Process Management - 13th International Conference, BPM 2015, Innsbruck, Austria, August 31 - September 3, 2015, Proceedings, volume 9253 of Lecture Notes in Computer Science. Springer, 2015. [doi]

  • Wil M. P. van der Aalst, Robin Bergenthum, and Josep Carmona, editors. Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, ATAED 2015, Satellite event of the conferences: 36th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2015 and 15th International Conference on Application of Concurrency to System Design ACSD 2015, Brussels, Belgium, June 22-23, 2015, volume 1371 of CEUR Workshop Proceedings. CEUR-WS.org, 2015.

  • Bernd Finkbeiner, Geguang Pu, and Lijun Zhang, editors. Automated Technology for Verification and Analysis - 13th International Symposium, ATVA 2015, Shanghai, China, October 12-15, 2015, Proceedings, volume 9364 of Lecture Notes in Computer Science. Springer, 2015. [doi]

  • Florian Daniel and Stefan Zugal, editors. Proceedings of the BPM Demo Session 2015 Co-located with the 13th International Conference on Business Process Management (BPM 2015), Innsbruck, Austria, September 2, 2015, volume 1418 of CEUR Workshop Proceedings. CEUR-WS.org, 2015.

  • Daniel Alonso-Alemany, A. Barré, Stefano Beretta, Paola Bonizzoni, Macha Nikolski, and Gabriel Valiente. Further steps in TANGO: Improved taxonomic assignment in metagenomics. Bioinformatics, 30(1):17–23, 2014.

  • Carme Àlvarez, Maria J. Blesa, and Hendrik Molter. Firefighting as a game. In Algorithms and models for the web graph, volume 8882 of Lecture Notes in Comput. Sci., pages 108–119. Springer, Cham, 2014. [doi]

  • Albert Atserias and Anuj Dawar. Degree lower bounds of tower-type for approximating formulas with parity quantifiers. ACM Trans. Comput. Log., 15(1):Art. 6, 24, 2014. [doi]

  • Albert Atserias, Johannes Klaus Fichte, and Marc Thurley. Clause-learning algorithms with many restarts and bounded-width resolution. CoRR, abs/1401.3868, 2014.

  • Albert Atserias, Massimo Lauria, and Jakob Nordström. Narrow proofs may be maximally long (extended abstract). In IEEE 29th Conference on Computational Complexity—CCC 2014, pages 286–297. IEEE Computer Soc., Los Alamitos, CA, 2014. [doi]

  • Albert Atserias and Sergi Oliva. Bounded-width QBF is PSPACE-complete. J. Comput. System Sci., 80(7):1415–1429, 2014. [doi]

  • Albert Atserias and Neil Thapen. The ordering principle in a fragment of approximate counting. ACM Trans. Comput. Log., 15(4):Art. 29, 11, 2014. [doi]

  • Salomon Beer, Marco Cannizzaro, Jordi Cortadella, Ran Ginosar, and Luciano Lavagno. Metastability in better-than-worst-case designs. 2014 20th IEEE International Symposium on Asynchronous Circuits and Systems, may 2014. [doi]

  • Nikolett Bereczky, Amalia Duch, Krisztián Németh, and Salvador Roura. Quad-K-d trees. In LATIN 2014: theoretical informatics, volume 8392 of Lecture Notes in Comput. Sci., pages 743–754. Springer, Heidelberg, 2014. [doi]

  • Maria J. Blesa, Amalia Duch, Joaquim Gabarró, and Maria J. Serna. The life cycle of a cutting-edge technology course - A coaching experience on android. In CSEDU 2014 - Proceedings of the 6th International Conference on Computer Supported Education, Volume 2, Barcelona, Spain, 1-3 April, 2014, pages 159–166, 2014. [doi]

  • Christian Blum, Maria J. Blesa, and Borja Calvo. Can frogs find large independent sets in a decentralized way? yes they can! In Swarm Intelligence - 9th International Conference, ANTS 2014, Brussels, Belgium, September 10-12, 2014. Proceedings, pages 74–85, 2014. [doi]

  • Christian Blum, Maria J. Blesa, and Borja Calvo. Beam-ACO for the repetition-free longest common subsequence problem. Artificial Evolution, page 79–90, 2014. [doi]

  • Christian Blum, Maria J. Blesa, Carlos García-Martínez, Francisco J. Rodríguez, and Manuel Lozano. The firefighter problem: application of hybrid ant colony optimization algorithms. In Evolutionary computation in combinatorial optimization, volume 8600 of Lecture Notes in Comput. Sci., pages 218–229. Springer, Heidelberg, 2014. [doi]

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. The comparison of tree-sibling time consistent phylogenetic networks is graph isomorphism-complete. The Scientific World Journal, 2014:1–6, 2014. [doi]

  • Josep Carmona and Jordi Cortadella. Process discovery algorithms using numerical abstract domains. IEEE Trans. Knowl. Data Eng., 26(12):3064–3076, 2014. [doi]

  • Josep Carmona, Mihai Teodor Lazarescu, and Marta Pietkiewicz-Koutny. Introduction to special issue on application of concurrency to system design (ACSD'13). ACM Trans. Embedded Comput. Syst., 13(4s):140:1–140:2, 2014. [doi]

  • Hua-Huai Chern, María-Inés Fernández-Camacho, Hsien-Kuei Hwang, and Conrado Martínez. Psi-series method for equality of random trees and quadratic convolution recurrences. Random Structures Algorithms, 44(1):67–108, 2014. [doi]

  • Jordi Cortadella, Jordi Petit, Sergio Gómez, and Francesc Moll. A boolean rule-based approach for manufacturability-aware cell routing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 33(3):409–422, 2014. [doi] [pdf]

  • Carles Creus, Pau Fernández, and Guillem Godoy. Automatic evaluation of reductions between NP-complete problems. In Theory and applications of satisfiability testing—SAT 2014, volume 8561 of Lecture Notes in Comput. Sci., pages 415–421. Springer, Cham, 2014. [doi]

  • Carles Creus and Guillem Godoy. Tree automata with height constraints between brothers. In Rewriting and typed lambda calculi, volume 8560 of Lecture Notes in Comput. Sci., pages 149–163. Springer, Cham, 2014. [doi]

  • Carles Creus and Guillem Godoy. Automatic evaluation of context-free grammars (system description). In Rewriting and typed lambda calculi, volume 8560 of Lecture Notes in Comput. Sci., pages 139–148. Springer, Cham, 2014. [doi]

  • Carles Creus, Guillem Godoy, and Lander Ramos. Excessively duplicating patterns represent non-regular languages. Inform. Process. Lett., 114(3):85–93, 2014. [doi]

  • Javier de San Pedro, Jordi Cortadella, and Antoni Roca. A hierarchical approach for generating regular floorplans. In The IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014, San Jose, CA, USA, November 3-6, 2014, pages 655–662, 2014. [doi]

  • Josep Díaz, Ioannis Giotis, Lefteris Kirousis, Maria Serna, and Vangelis Markakis. On the stability of generalized second price auctions with budgets. In A. Pardo and Alfredo Viola, editors, Proceedings of Latin America Theoretical informatics Symposium (LATIN), volume 9501 of Lecture Notes in Computer Science, pages 419–430. Springer, 2014.

  • Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria Serna, and Paul G. Spirakis. Approximating fixation probabilities in the generalized moran process. Algorithmica, 69(1):78–91, 2014.

  • Josep Díaz, Leslie Ann Goldberg, David Richerby, and Maria Serna. Absorption time of the Moran process. In Approximation, randomization, and combinatorial optimization, volume 28 of LIPIcs. Leibniz Int. Proc. Inform., pages 630–642. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2014.

  • Josep Díaz and George B. Mertzios. Minimum bisection is NP-hard on unit disk graphs. In Mathematical foundations of computer science 2014. Part II, volume 8635 of Lecture Notes in Comput. Sci., pages 251–262. Springer, Heidelberg, 2014. [doi]

  • G. Dimitrakopoulos, I. Seitanidis, A. Psarras, K. Tsiouris, P. M. Mattheakis, and J. Cortadella. Hardware primitives for the synthesis of multithreaded elastic systems. Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014, 2014. [doi]

  • A. Duch, G. Lau, and C. Martínez. On the average performance of fixed partial match queries in random relaxed k-d trees. In M. Bousquet-Mélou and M. Soria, editors, Proc. of the 25th Int. Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA), DMTCS-HAL Proceedings Series. Link: https://hal.inria.fr/hal-01077251v2, pages 103–114, 2014.

  • Amalia Duch, Rosa M. Jiménez, and Conrado Martínez. Selection by rank in K-dimensional binary search trees. Random Structures Algorithms, 45(1):14–37, 2014. [doi]

  • Hartmut Ehrig, Ulrike Golas, Annegret Habel, Leen Lambers, and Fernando Orejas. M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation. Math. Structures Comput. Sci., 24(4):e240406, 48, 2014. [doi]

  • Leonor Frias and Salvador Roura. Multikey quickselect. Algorithmica, 69(4):958–973, 2014. [doi]

  • Joaquim Gabarró, Alina Garcia, and Maria Serna. Computational Aspects of Uncertainty Profiles and Angel-Daemon Games. Theory Comput. Syst., 54(1):83–110, 2014. [doi]

  • Joaquim Gabarró, Maria J. Serna, and Alan Stewart. Analysing web-orchestrations under stress using uncertainty profiles. Comput. J., 57(11):1591–1615, 2014. [doi]

  • Zhicheng Gao, Conrado Martínez, Daniel Panario, and Bruce Richmond. The rth smallest part size of a random integer partition. Integers, 14A:Paper No. A3, 8, 2014.

  • Ahmed Helmi, Conrado Martínez, and Alois Panholzer. Analysis of the strategy “hiring above the m-th best candidate”. Algorithmica, 70(2):267–300, 2014. [doi]

  • Frank Hermann, Hartmut Ehrig, Ulrike Golas, and Fernando Orejas. Formal analysis of model transformations based on triple graph grammars. Math. Structures Comput. Sci., 24(4):e240408, 57, 2014. [doi]

  • Leen Lambers and Fernando Orejas. Tableau-based reasoning for graph properties. In Graph transformation, volume 8571 of Lecture Notes in Comput. Sci., pages 17–32. Springer, Cham, 2014. [doi]

  • Anaga Mani, Divya Venkataramani, Jordi Petit, and Salvador Roura. Better feedback for educational online judges. In CSEDU 2014 - Proceedings of the 6th International Conference on Computer Supported Education, Volume 2, Barcelona, Spain, 1-3 April, 2014, pages 176–183, 2014. [doi]

  • Xavier Molinero, Fabián Riquelme, and Maria J. Serna. Power indices of influence games and new centrality measures for agent societies and social networks. In Ambient Intelligence - Software and Applications - 5th International Symposium on Ambient Intelligence, ISAmI 2014, Salamanca, Spain, June 4-6, 2014, pages 23–30, 2014. [doi]

  • Jorge Munoz-Gama, Josep Carmona, and Wil M. P. van der Aalst. Single-entry single-exit decomposed conformance checking. Inf. Syst., 46:102–122, 2014. [doi]

  • Fernando Orejas and Elvira Pino. Correctness of incremental model synchronization with triple graph grammars. In Theory and Practice of Model Transformations - 7th International Conference, ICMT 2014, Held as Part of STAF 2014, York, UK, July 21-22, 2014. Proceedings, pages 74–90, 2014. [doi]

  • Edelmira Pasarella and Jorge Lobo. An operational framework to reason about policies behavior in trust management system. In Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, Cartagena de Indias, Colombia, June 4-6, 2014., 2014.

  • Fabián Riquelme. Structural and computational aspects of simple and influence games. PhD thesis, Universitat Politècnica de Catalunya, July 2014. Xavier Molinero and Maria Serna, advisors.

  • Marta Ruiz Costa-Jussà, Lluís Formiga, Jordi Petit, and José A. R. Fonollosa. Detailed description of the development of a MOOC in the topic of statistical machine translation. In Human-Inspired Computing and Its Applications - 13th Mexican International Conference on Artificial Intelligence, MICAI 2014, Tuxtla Gutiérrez, Mexico, November 16-22, 2014. Proceedings, Part I, pages 92–98, 2014. [doi]

  • Josefina Sierra-Santibáñez. An agent-based model studying the acquisition of a language system of logical constructions. In Carla E. Brodley and Peter Stone, editors, Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada., pages 350–358. AAAI Press, 2014.

  • Yao-Wen Chang, editor. The IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014, San Jose, CA, USA, November 3-6, 2014. IEEE, 2014.

  • Maria J. Blesa, Christian Blum, and Stefan Voß, editors. Hybrid Metaheuristics - 9th International Workshop, HM 2014, Hamburg, Germany, June 11-13, 2014. Proceedings, volume 8457 of Lecture Notes in Computer Science. Springer, 2014. [doi]

  • A. Atserias and A. Dawar. Degree lower bounds of tower-type for approximating formulas with parity quantifiers. Accepted for publication in ACM Transactions on Computational Logic (TOCL), 2013.

  • A. Atserias, M. Grohe, and D. Marx. Size bounds and query plans for relational joins. SIAM Journal on Computing, 42(4):1737–1767, 2013.

  • A. Atserias and E. Maneva. Sherali–adams relaxations and indistinguishability in counting logics. SIAM Journal on Computing, 42(1):112–137, 2013.

  • A. Atserias, M. Müller, and S. Oliva. Lower bounds for dnf-refutations of a relativized weak pigeonhole principle. In Proceedings of 28th Annual IEEE Conference on Computational Complexity (CCC), pages 109–120, 2013.

  • Albert Atserias. The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs. In Matti Järvisalo and Allen Van Gelder, editors, Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings, volume 7962 of Lecture Notes in Computer Science, pages 1–17. Springer, 2013.

  • Albert Atserias and Sergi Oliva. Bounded-width QBF is PSPACE-complete. In Natacha Portier and Thomas Wilke, editors, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, volume 20 of LIPIcs, pages 44–54. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013.

  • Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, and Camille Vacher. Decidable classes of tree automata mixing local and global constraints modulo flat theories. Log. Methods Comput. Sci., 9(2):2:01, 39, 2013. [doi]

  • Josep Carmona and Jetty Kleijn. Compatibility in a multi-component environment. Theor. Comput. Sci., 484:1–15, 2013.

  • J. Cortadella. Elastic circuits, blending synchronous and asynchronous technologies. Seminar at the Collège de France within the course on Algorithms, Machines and Languages organized by Gérard Berry, 2013.

  • J. Cortadella. Asynchronous circuits. Seminar at the Collège de France within the course on Algorithms, Machines and Languages organized by Gérard Berry, 2013.

  • J. Cortadella. Elastic circuits. Advanced course at EMICRO/SIM 2013 (XV Escola de Microeletrônica Sul / 28o Simpósio Sul de Microeletrônica), Porto Alegre (Brasil), 2013.

  • J. Cortadella, J. de San Pedro, N. Nikitin, and J. Petit. Physical-aware system-level design for tiled hierarchical chip multiprocessors. In Proc. International Symposium on Physical Design, pages 3–10, 2013. [pdf]

  • Jordi Cortadella. Area-optimal transistor folding for 1-d gridded cell design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32(11):1708–1721, 2013. [doi] [pdf]

  • Carles Creus, Adrià Gascón, and Guillem Godoy. Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints. J. Automat. Reason., 51(4):371–400, 2013. [doi]

  • Carles Creus, Guillem Godoy, Francesc Massanes, and Ashish Tiwari. Non-linear rewrite closure and weak normalization. J. Automat. Reason., 51(3):281–324, 2013.

  • Varsha Dani, Josep Díaz, Tom Hayes, and Cris Moore. The power of choice for random satisfiability. In Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, and Jose Rolim, editors, Proceedings of Randomization Techniques in Computer Science, volume 8096 of Lecture Notes in Computer Science, pages 484–496. Springer, 2013.

  • Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, and Paul G. Spirakis. On the fixation probability of superstars. Proceedings of the Royal Society A, 469:2156:1471–2946, 2013.

  • Josep Díaz and Carme Torras. Turing's algorithmic lens: From computability to complexity theory. Arbor, 189(764):a080, 2013.

  • A. Duch, J. Petit, E. Rodríguez-Carbonell, and S. Roura. Fun in CS2. In Proceedings of the 5th International Conference on Computer Supported Education (CSEDU'13), pages 437–442. SCIETEPRESS, 2013.

  • Francisco Duran, Fernando Orejas, and Steffen Zschaler. Behaviour protection in modular rule-based system specifications. In Recent Trends in Algebraic Development Techniques, volume 7841 of Lecture Notes in Computer Science, pages 24–49. Springer, 2013.

  • Joaquim Gabarró, Alina García, and Maria Serna. On the hardness of game equivalence under local isomorphism. RAIRO Theor. Inform. Appl., 47(2):147–169, 2013. [doi]

  • Jose Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, and Fernando Orejas. Invariant-free clausal temporal resolution. J. Automat. Reason., 50(1):1–49, 2013. [doi]

  • Guillem Godoy and Omer Giménez. The HOM problem is decidable. J. ACM, 60(4):Art. 23, 44, 2013. [doi]

  • Esther Guerra, Juan de Lara, and Fernando Orejas. Inter-modelling with patterns. Software and System Modeling, 12(1):145–174, 2013.

  • Frank Hermann, Hartmut Ehrig, Fernando Orejas, Krzysztof Czarnecki, Zinovy Diskin, Yingfei Xiong, Susann Gottmann, and Thomas Engel. From model transformation to incremental bidirectional model synchronization. Software and System Modeling, To appear, 2013.

  • Hsien-Kuei Hwang, Conrado Martínez, and Robert Sedgewick. Guest editorial [Special issue: Analytic algorithmics and combinatorics]. Algorithmica, 66(4):739–740, 2013. [doi]

  • Sergio León Gaixas. QoS measures for orchestrations in unreliable environments. Master's thesis, Universitat Politècnica de Catalunya, September 2013. Joaquim Gabarró and Maria Serna, advisors.

  • X. Molinero, F. Riquelme, and M. J. Serna. Power indices of influence games and new centrality measures for social networks. CoRR, abs/1306.6929, 2013.

  • Xavier Molinero, Fabián Riquelme, and Maria J. Serna. Star-shaped mediation in influence games. In Kamiel Cornelissen, Ruben Hoeksma, Johann Hurink, and Bodo Manthey, editors, 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013, volume WP 13-01 of CTIT Workshop Proceedings, pages 179–182, 2013.

  • Jorge Munoz-Gama, Josep Carmona, and Wil M. P. van der Aalst. Conformance checking in the large: Partitioning and topology (Best Student Paper Award). In Florian Daniel, Jianmin Wang, and Barbara Weber, editors, BPM, pages 130–145, 2013.

  • Jorge Munoz-Gama, Josep Carmona, and Wil M. P. van der Aalst. Hierarchical conformance checking of process models based on event logs. In José Manuel Colom and Jörg Desel, editors, Petri Nets, pages 291–310, 2013.

  • Nikita Nikitin, Javier de San Pedro, and Jordi Cortadella. Architectural exploration of large-scale hierarchical chip multiprocessors. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32(10):1569–1582, 2013. [doi] [pdf]

  • Fernando Orejas, Artur Boronat, Ulrike Golas, and Nikos Mylonakis. Checking bisimilarity for attributed graph transformation. In FoSSaCS 2013, volume 7294 of Lecture Notes in Computer Science, pages 113–128. Springer, 2013.

  • Fernando Orejas, Artur Boronat, Ulrike Golas, and Nikos Mylonakis. Checking bisimilarity for attributed graph transformation. In Foundations of Software Science and Computation Structures - 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, pages 113–128, 2013. [doi]

  • J. De San Pedro, N. Nikitin, J. Cortadella, and J. Petit. Physical planning for the architectural exploration of large-scale chip multiprocessors. In Proc. of the IEEE/ACM International Symp. on Networks-on-Chip (NoCS), pages 1–2, 2013. [pdf]

  • Ferdinand Peper, Jia Lee, Josep Carmona, Jordi Cortadella, and Kenichi Morita. Brownian circuits: Fundamentals. JETC, 9(1):3, 2013.

  • Francisco J. Rodriguez, Manuel Lozano, Christian Blum, and Carlos García-Martínez. An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem. Comput. Oper. Res., 40(7):1829–1841, 2013. [doi]

  • Salvador Roura. Fibonacci BSTs: A new balancing method for binary search trees. Theor. Comput. Sci., 482:48–59, 2013.

  • Salvador Roura. Fibonacci BSTs: A new balancing method for binary search trees. Theoret. Comput. Sci., 482:48–59, 2013. [doi]

  • Marc Solé and Josep Carmona. Region-based foldings in process discovery. IEEE Trans. Knowl. Data Eng., 25(1):192–205, 2013.

  • Marc Solé and Josep Carmona. Amending C-net discovery algorithms. In Sung Y. Shin and José Carlos Maldonado, editors, SAC, pages 1418–1425, 2013.

  • Ruben Verborgh, Thomas Steiner, Davy Van Deursen, Jos De Roo, Rik Van de Walle, and Joaquim Gabarró Vallés. Capturing the functionality of web services with functional descriptions. Multimedia Tools Appl., 64(2):365–387, 2013.

  • Paul G. Spirakis and Maria Serna, editors. Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, volume 7878 of Lecture Notes in Computer Science. Springer, 2013.

  • Maria J. Blesa Sampels, Christian Blum, Paola Festa, Andrea Roli, and Michael, editors. Hybrid Metaheuristics - 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings, volume 7919 of Lecture Notes in Computer Science. Springer, 2013. [doi]

  • Maria J. Blesa Sampels, Christian Blum, Paola Festa, Andrea Roli, and Michael, editors. Hybrid Metaheuristics - 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings, volume 7919 of Lecture Notes in Computer Science. Springer, 2013. [doi]

  • Arya Adriansyah, Jorge Munoz-Gama, Josep Carmona, Boudewijn F. van Dongen, and Wil M. P. van der Aalst. Alignment based precision checking. In Marcello La Rosa and Pnina Soffer, editors, Business Process Management Workshops, pages 137–149, 2012.

  • Carme Àlvarez, Josep Díaz, Dieter Mitsche, and Maria Serna. Continuous monitoring in the dynamic sensor field model. In Thomas Erlebach, Sotiris E. Nikoletseas, and Pekka Orponen, editors, Algorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers, volume 7111 of Lecture Notes in Computer Science, pages 161–172. Springer, 2012.

  • Carme Àlvarez, Josep Díaz, Dieter Mitsche, and Maria J. Serna. Continuous monitoring in the dynamic sensor field model. Theoretical Computer Science, 463:114–122, 2012.

  • Carme Àlvarez, Amalia Duch, Maria Serna, and Dimitrios M. Thilikos. On the existence of Nash equilibria in strategic search games. In Roberto Bruni and Vladimiro Sassone, editors, Trustworthy Global Computing - 6th International Symposium, TGC 2011, Aachen, Germany, June 9-10, 2011. Revised Selected Papers, volume 7173 of Lecture Notes in Computer Science, pages 58–72. Springer, 2012.

  • Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente. Faster computation of the robinson-foulds distance between phylogenetic networks. Information Sciences, 197:77–90, 2012.

  • A. Atserias and A. Dawar. Degree lower bounds of tower-type for approximating formulas with parity quantifiers. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP), Part II, volume 7392 of Lecture Notes in Computer Science, pages 67–78. Springer, 2012.

  • A. Atserias and E. Maneva. Sherali–adams relaxations and indistinguishability in counting logics. In Proceedings of 3rd ACM-SIGACT Innovations in Theoretical Computer Science (ITCS), pages 367–379, 2012.

  • Christian Blum. Hybrid metaheuristics in combinatorial optimization: a tutorial. In Theory and practice of natural computing, volume 7505 of Lecture Notes in Comput. Sci., pages 1–10. Springer, Heidelberg, 2012.

  • Josep Carmona. The label splitting problem. T. Petri Nets and Other Models of Concurrency, 6:1–23, 2012.

  • Josep Carmona. Projection approaches to process mining using region-based techniques. Data Min. Knowl. Discov., 24(1):218–246, 2012.

  • Josep Carmona and Ricard Gavaldà. Online techniques for dealing with concept drift in process mining. In Jaakko Hollmén, Frank Klawonn, and Allan Tucker, editors, IDA, pages 90–102. Springer, 2012.

  • Carles Creus, Adrià Gascón, and Guillem Godoy. One-context unification with STG-compressed terms is in NP. In 23rd International Conference on Rewriting Techniques and Applications, volume 15 of LIPIcs. Leibniz Int. Proc. Inform., pages 149–164. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2012.

  • Carles Creus, Adrià Gascón, Guillem Godoy, and Lander Ramos. The HOM problem is EXPTIME-complete. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, pages 255–264. IEEE Computer Soc., Los Alamitos, CA, 2012. [doi]

  • Hervé Daudé, Conrado Martínez, Vonjy Rasendrahasina, and Vlady Ravelomanana. The MAX-CUT of sparse random graphs. In Y. Rabani, editor, Proc of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 265–271. SIAM, 2012.

  • Javier de San Pedro, Josep Carmona, Jordi Cortadella, and Jordi Petit. Integrating formal verification in an online judge for e-learning logic circuit design. In Proceedings of the 43rd ACM technical symposium on Computer science education, SIGCSE 2012, Raleigh, NC, USA, February 29 - March 3, 2012, pages 451–456. ACM, 2012.

  • Josep Díaz. Book review: George dyson "turing's cathedral: The origins of the digital universe" (2012) pantheon books. Computer Science Review, 6(4):185–186, 2012.

  • Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, and Paul G. Spirakis. Approximating fixation probabilities in the generalized moran process. In Proceedings of the 23rd. Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 954–960, 2012.

  • Josep Díaz, Olli Pottonen, Maria J. Serna, and Erik Jan van Leeuwen. On the complexity of metric dimension. In Leah Epstein and Paolo Ferragina, editors, Algorithms - ESA 2012 - 20th Annual European Symposium, volume 7501 of Lecture Notes in Computer Science, pages 419–430. Springer, 2012.

  • Josep Díaz and Carme Torras. A personal account of turing’s imprint on the development of computer science. Computer Science Review, 6:225–234, 2012.

  • A. Duch, R. M. Jiménez, and C. Martínez. Selection by rank in K-dimensional binary search trees. Random Structures and Algorithms, 2012. [doi]: 10.1002/rsa.20476.

  • Hartmut Ehrig, Annegret Habel, Leen Lambers, Fernando Orejas, and Ulrike Golas. M-adhesive transformation systems with nested application conditions. part 1: Parallelism , concurrency and amalgamation. Mathematical Structures in Computer Science, To appear, 2012.

  • Hartmut Ehrig, Annegret Habel, Fernando Orejas, Ulrike Golas, and Leen Lambers. M-adhesive transformation systems with nested application conditions. Part 2: Embedding, critical pairs and local confluence. Fund. Inform., 118(1-2):35–63, 2012.

  • Josep Freixas, Xavier Molinero, and Salvador Roura. Complete voting systems with two classes of voters: weightedness and counting. Ann. Oper. Res., 193:273–289, 2012. [doi]

  • Joaquim Gabarró, Maria J. Serna, and Alan Stewart. Orchestrating unreliable services: Strategic and probabilistic approaches to reliability. In Roberto Bruni and Vladimiro Sassone, editors, Trustworthy Global Computing - 6th International Symposium, TGC 2011, Aachen, Germany, June 9-10, 2011. Revised Selected Papers, volume 7173 of Lecture Notes in Computer Science, pages 197–211. Springer, 2012.

  • O. Giménez, J. Petit, and S. Roura. Jutge.org: An educational programming judge. In Proc. of the 43rd ACM Technical Symposium on Computer Science Education (SIGCSE-2012), pages 445–450. Association for Computing Machinery, 2012.

  • Ulrike Golas, Leen Lambers, Hartmut Ehrig, and Fernando Orejas. Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs. Theoret. Comput. Sci., 424:46–68, 2012. [doi]

  • A. Helmi, C. Martínez, and A. Panholzer. Hiring above the m-th best candidate: a generalization of records in permutations. In D. Fernández-Baca, editor, Proc. of the 10th Latin American Theoretical Informatics Conference (LATIN), volume 7256 of lncs, pages 470–481. sv, 2012.

  • Ahmed Helmi, Jérémie Lumbroso, Conrado Martínez, and Alfredo Viola. Data streams as random permutations: the distinct element problem. In 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), Discrete Math. Theor. Comput. Sci. Proc., AQ, pages 323–338. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2012.

  • Vera Hemmelmayr, Verena Schmid, and Christian Blum. Variable neighbourhood search for the variable sized bin packing problem. Comput. Oper. Res., 39(5):1097–1108, 2012. [doi]

  • Frank Hermann, Hartmut Ehrig, Claudia Ermel, and Fernando Orejas. Concurrent model synchronization with conflict resolution based on triple graph grammars. In FASE 2012, volume 7212 of Lecture Notes in Computer Science, pages 178–193. Springer, 2012.

  • Frank Hermann, Hartmut Ehrig, Ulrike Golas, and Fernando Orejas. Formal analysis of model transformations based on triple graph grammars. Mathematical Structures in Computer Science, To appear, 2012.

  • Hugo Hernández and Christian Blum. Distributed ant colony optimization for minimum energy broadcasting in sensor networks with realistic antennas. Comput. Math. Appl., 64(12):3683–3700, 2012. [doi]

  • Hsien-Kuei Hwang and Conrado Martínez, editors. Preface. Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2012). Society for Industrial and Applied Mathematics, 2012. [doi]

  • Elitza Maneva. P versus NP: the star problem of the mathematics of computation. Butl. Soc. Catalana Mat., 27(1):39–62, 115–116, 2012.

  • X. Molinero, F. Riquelme, and M. J. Serna. Social influence as a voting system: A complexity analysis of parameters and properties. CoRR, abs/1208.3751, 2012.

  • Muhammad Naeem, Reiko Heckel, Fernando Orejas, and Frank Hermann. Incremental service composition based on partial matching of visual contracts. In FASE 2012, volume 6013 of Lecture Notes in Computer Science, pages 123–138. Springer, 2012.

  • N. Nikitin and J. Cortadella. Static task mapping for tiled chip multiprocessors with multiple voltage islands. In 25th Int. Conf. on Architecture of Computing Systems (ARCS), pages 50–62, 2012. [pdf]

  • Nikita Nikitin, Javier de San Pedro, Josep Carmona, and Jordi Cortadella. Analytical performance modeling of hierarchical interconnect fabrics. In NOCS, pages 107–114, 2012.

  • Fernando Orejas, Artur Boronat, and Nikos Mylonakis. Borrowed contexts for attributed graphs. In Graph transformations, volume 7562 of Lecture Notes in Comput. Sci., pages 126–140. Springer, Heidelberg, 2012.

  • Fernando Orejas and Leen Lambers. Lazy graph transformation. Fund. Inform., 118(1-2):65–96, 2012.

  • Edelmira Pasarella, Fernando Orejas, Elvira Pino, and Marisa Navarro. Semantics of structured normal logic programs. J. Log. Algebr. Program., 81(5):559–584, 2012. [doi]

  • F. J. Rodriguez, C. Blum, C. García-Martínez, and M. Lozano. GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times. Ann. Oper. Res., 201:383–401, 2012. [doi]

  • Andrea Roli, Stefano Benedettini, Thomas Stützle, and Christian Blum. Large neighbourhood search algorithms for the founder sequence reconstruction problem. Comput. Oper. Res., 39(2):213–224, 2012. [doi]

  • Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée, Josep Díaz, Conrado Martínez, and Marc Noy. Philippe Flajolet, 1948–2011. SCM Notícies, 32:12–14, 2012.

  • Monica Santamaria, Bruno Fosso, A. Consiglio, G. De Caro, G. Grillo, F. Licciulli, S. Liuni, M. Marzano, Daniel Alonso-Alemany, Gabriel Valiente, and Graziano Pesole. Reference databases for taxonomic assignment in metagenomics. Briefings in Bioinformatics, 13(6):682–695, 2012.

  • Marc Solé and Josep Carmona. Incremental process discovery. T. Petri Nets and Other Models of Concurrency, 5:221–242, 2012.

  • Marc Solé and Josep Carmona. A high-level strategy for C-net discovery. In Jens Brandt and Keijo Heljanko, editors, ACSD, pages 102–111, 2012.

  • Marc Solé and Josep Carmona. An SMT-based discovery algorithm for C-nets. In Serge Haddad and Lucia Pomello, editors, Petri Nets, pages 51–71, 2012.

  • Thomas Steiner, Ruben Verborgh, Joaquim Gabarró, and Rik Van de Walle. Defining aesthetic principles for automatic media gallery layout for visual and audial event summarization based on social networks. In Ian S. Burnett, editor, Fourth International Workshop on Quality of Multimedia Experience, QoMEX 2012, Melbourne, Australia, July 5-7, 2012, pages 27–28. IEEE, 2012.

  • Thomas Steiner, Ruben Verborgh, Raphaël Troncy, Joaquim Gabarró, and Rik Van de Walle. Adding realtime coverage to the google knowledge graph. In Proceedings of the ISWC 2012 Posters & Demonstrations Track, Boston, USA, November 11-15, 2012, 2012.

  • Ruben Verborgh, Vincent Haerinck, Thomas Steiner, Davy Van Deursen, Sofie Van Hoecke, Jos De Roo, Rik Van de Walle, and Joaquim Gabarró. Functional composition of sensor web APIs. In Cory A. Henson, Kerry Taylor, and Óscar Corcho, editors, Proceedings of the 5th International Workshop on Semantic Sensor Networks, SSN12, Boston, Massachusetts, USA, November 12, 2012, volume 904 of CEUR Workshop Proceedings, pages 65–80. CEUR-WS.org, 2012.

  • Ruben Verborgh, Thomas Steiner, Davy Van Deursen, Sam Coppens, Joaquim Gabarró Vallés, and Rik Van de Walle. Functional descriptions as the bridge between hypermedia APIs and the semantic web. In Rosa Alarcón, Cesare Pautasso, and Erik Wilde, editors, Third International Workshop on RESTful Design, WS-REST '12, Lyon, France, April 16, 2012, pages 33–40. ACM, 2012.

  • Ruben Verborgh, Thomas Steiner, Joaquim Gabarró, Erik Mannens, and Rik Van de Walle. A social description revolution - describing web APIs' social parameters with RESTdesc. In Intelligent Web Services Meet Social Computing, Papers from the 2012 AAAI Spring Symposium, Palo Alto, California, USA, March 26-28, 2012, 2012.

  • Maria J. Serna, editor. Algorithmic Game Theory - 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings, volume 7615 of Lecture Notes in Computer Science. Springer, 2012.

  • Daniel Alonso-Alemany, José C. Clemente, Jesper Jansson, and Gabriel Valiente. Taxonomic assignment in metagenomics with TANGO. EMBnet.journal, 17(2):46–50, 2011.

  • Carme Àlvarez, Maria Blesa, and Maria Serna. The robustness of stability under link and node failures. Theoret. Comput. Sci., 412(50):6855–6878, 2011. [doi]

  • Carme Àlvarez, Ioannis Chatzigiannakis, Amalia Duch, Joaquim Gabarró, Othon Michail, Maria J. Serna, and Paul G. Spirakis. Computational models for networks of tiny artifacts: A survey. Computer Science Review, 5(1):7–25, 2011.

  • Carme Àlvarez, Joaquim Gabarró, and Maria Serna. Equilibria problems on games: complexity versus succinctness. J. Comput. System Sci., 77(6):1172–1197, 2011. [doi]

  • A. Atserias and E. Maneva. Mean-payoff games and propositional proofs. Information and Computation, 209(4):664–691, 2011. [doi]

  • Albert Atserias. A why-on-earth tutorial on finite model theory. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada, page 3. IEEE Computer Society, 2011.

  • Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, and Kenneth Ross. Foreword. Theory Comput. Syst., 49(2):365–366, 2011.

  • Albert Atserias, Johannes Klaus Fichte, and Marc Thurley. Clause-learning algorithms with many restarts and bounded-width resolution. J. Artif. Intell. Res. (JAIR), 40:353–373, 2011.

  • Nayantara Bhatnagar and Elitza Maneva. A computational method for bounding the probability of reconstruction on trees. SIAM J. Discrete Math., 25(2):854–871, 2011. [doi]

  • Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Hugo Hernández, and Maria J. Serna. Coaching on new technologies: Programming workshop android applications for google phones. Bulletin of the EATCS, 105:205–208, 2011.

  • Christian Blum. Iterative beam search for simple assembly line balancing with a fixed number of work stations. SORT, 35(2):145–164, 2011.

  • Christian Blum and Roberto Battiti. Guest editorial: Special issue based on the LION 4 conference. Ann. Math. Artif. Intell., 61(2):47–48, 2011. Held in Venice, January 18–22, 2010. [doi]

  • Christian Blum and Cristobal Miralles. On solving the assembly line worker assignment and balancing problem via beam search. Comput. Oper. Res., 38(1):328–339, 2011. [doi]

  • Christian Blum, Jakob Puchinger, Günther Raidl, and Andrea Roli. Hybrid metaheuristics. In Hybrid optimization, volume 45 of Springer Optim. Appl., pages 305–335. Springer, New York, 2011. [doi]

  • Tiziana Calamoneri and Josep Díaz. Editorial [Special papers: Selected papers from the 7th International Conference on Algorithms and Complexity (CIAC 2010)]. J. Discrete Algorithms, 9(3):213, 2011. Held at “Sapienza” University, Rome, May 26–28, 2010. [doi]

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Comparison of galled trees. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(2):410–427, 2011.

  • J. Carmona. The label splitting problem. In Proceedings of the Workshop on Application of Region Theory (ART), CEUR Workshop, pages 22–35, Newcastle Upon Tyne, United Kingdom, 2011.

  • J. Carmona, J. Júlvez, J. Cortadella, and M. Kishinevsky. A scheduling strategy for synchronous elastic designs. Fundamenta Informaticae, 108(1–2):1–21, 2011.

  • José C. Clemente, Jesper Jansson, and Gabriel Valiente. Flexible taxonomic assignment of ambiguous sequencing reads. BMC Bioinformatics, 12:8, 2011.

  • Josep Díaz. Cris moore, stephen mertens, , the nature of computation (2011) oxford UP. Computer Science Review, 5(4):341–345, 2011.

  • Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, and Julinda Stefa. Social-aware forwarding improves routing performance in pocket switched networks. In Algorithms—ESA 2011, volume 6942 of Lecture Notes in Comput. Sci., pages 723–735. Springer, Heidelberg, 2011. [doi]

  • Josep Díaz, Dieter Mitsche, and Paolo Santi. Theoretical aspects of graph models for MANETs. In S. Nikoetseas and J. Rolim, editors, Theoretical Aspects of Distributed Computing in Sensor Networks, Monographs in Theoretical Computer Science, pages 161–190. Springer, 2011.

  • Zinovy Diskin, Yingfei Xiong, Krzysztof Czarnecki, Hartmut Ehrig, Frank Hermann, and Fernando Orejas. From state- to delta-based bidirectional model transformations: The symmetric case. In Model Driven Engineering Languages and Systems, MODELS 2011, volume 6981 of Lecture Notes in Computer Science, pages 304–318. Springer, 2011.

  • Josep Freixas, Xavier Molinero, Martin Olsen, and Maria Serna. On the complexity of problems on simple games. RAIRO Oper. Res., 45(4):295–314, 2011. [doi]

  • Joaquim Gabarró, Alina García, and Maria Serna. The complexity of game isomorphism. Theoret. Comput. Sci., 412(48):6675–6695, 2011. [doi]

  • Joaquim Gabarró, Maria Serna, and Alan Stewart. Web services and incerta spiriti: a game theoretic approach to uncertainty. In Symbolic and quantitative approaches to reasoning with uncertainty, volume 6717 of Lecture Notes in Comput. Sci., pages 651–662. Springer, Heidelberg, 2011. [doi]

  • Marc Galceran-Oms, Alexander Gotmanov, Jordi Cortadella, and Mike Kishinevsky. Microarchitectural transformations using elasticity. ACM Journal on Emerging Technologies in Computing Systems, 7(4):18:1–18:24, 2011. [doi] [pdf]

  • Adrià Gascón, Guillem Godoy, and Manfred Schmidt-Schauss. Unification and matching on compressed terms. ACM Trans. Comput. Log., 12(4):Art. 26, 37, 2011. [doi]

  • Omer Giménez, Guillem Godoy, and Sebastian Maneth. Deciding regularity of the set of instances of a set of terms with regular constraints is EXPTIME-complete. SIAM J. Comput., 40(2):446–464, 2011. [doi]

  • Frank Hermann, Hartmut Ehrig, Fernando Orejas, Krzysztof Czarnecki, Zinovy Diskin, and Yingfei Xiong. Correctness of model synchronization based on triple graph grammars. In MODELS 2011, volume 6981 of Lecture Notes in Computer Science, pages 668–682. Springer, 2011.

  • Guy Louchard, Conrado Martínez, and Helmut Prodinger. The Swedish leader election protocol: analysis and variations. In ANALCO11—Workshop on Analytic Algorithmics and Combinatorics, pages 127–134. SIAM, Philadelphia, PA, 2011.

  • Conrado Martínez, Alois Panholzer, and Helmut Prodinger. The analysis of Range Quickselect and related problems. Theoret. Comput. Sci., 412(46):6537–6555, 2011. [doi]

  • J. Munoz-Gama and J. Carmona. Enhancing precision in process conformance: Stability, confidence and severity. In IEEE Symposium Series in Computational Intelligence (SSCI), 2011.

  • Fernando Orejas. Symbolic graphs for attributed graph constraints. J. Symbolic Comput., 46(3):294–315, 2011. [doi]

  • J. Pérez-Puigdemont, F. Moll, and J. Cortadella. Measuring the tolerance of self-adaptive clocks to supply voltage noise. In 26th Conf. on Design of Circuits and Integrated Systems (DCIS), pages 399–404, 2011. [pdf]

  • Jordi Petit. Addenda to the survey of layout problems. Bulletin of the European Association for Theoretical Computer Science, 105:177–201, 2011.

  • Paolo Ribeca and Gabriel Valiente. Computational challenges of sequence classification in microbiomic data. Briefings in Bioinformatics, 12(6):614–625, 2011.

  • Marc Solé and Josep Carmona. Light region-based techniques for process discovery. Fundam. Inform., 113(3-4):343–376, 2011.

  • Dimitra Giannakopoulou and Fernando Orejas, editors. Fundamental Approaches to Software Engineering, FASE 2011, volume 6603 of Lecture Notes in Computer Science. Springer, 2011.

  • J. Anguera, M. Blesa, J. Farré, V. López, and J. Petit. Topology control algorithms in WISELIB. Proceedings of the 2010 ICSE Workshop on Software Engineering for Sensor Network Applications - SESENA ’10, 2010. [doi]

  • Miguel Arenas, Mateus Patricio, David Posada, and Gabriel Valiente. Characterization of phylogenetic networks with NetTest. BMC Bioinformatics, 11:268, 2010.

  • Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente. Faster computation of the Robinson-Foulds distance between phylogenetic networks. In Proc. 21st Ann. Symp. Combinatorial Pattern Matching, volume 6129 of Lecture Notes in Computer Science, pages 190–201. Springer, 2010.

  • A. Atserias and E. Maneva. Mean-payoff games and propositional proofs. In Proceedings of 37th International Automata, Languages and Programming (ICALP). Part I, volume 6198 of Lecture Notes in Computer Science, pages 102–113. Springer, 2010. [doi]

  • Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, and Camille Vacher. The emptiness problem for tree automata with global constraints. In 25th Annual IEEE Symposium on Logic in Computer Science LICS 2010, pages 263–272. IEEE Computer Soc., Los Alamitos, CA, 2010.

  • Luis Barguñó, Guillem Godoy, Eduard Huntingford, and Ashish Tiwari. Termination of rewriting with right-flat rules modulo permutative theories. Log. Methods Comput. Sci., 6(3):3:8, 20, 2010. [doi]

  • Christian Blum. Hybrid metaheuristics. Comput. Oper. Res., 37(3):430–431, 2010. [doi]

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Nodal distances for rooted phylogenetic trees. Journal of Mathematical Biology, 61(2):253–276, 2010.

  • J. Carmona and J. Cortadella. Process mining meets abstract interpretation. In European Conference on Machine Learning and Knowledge Discovery in Databases ECML PKDD (Part I), Lecture Notes in Computer Science, pages 184–199. Springer, 2010.

  • J. Carmona, J. Cortadella, and M. Kishinevsky. New region-based algorithms for deriving bounded petri nets. IEEE Transactions on Computers, 59(3):371–384, 2010.

  • José C. Clemente, Jesper Jansson, and Gabriel Valiente. Accurate taxonomic assignment of short pyrosequencing reads. In Proc. 15th Pacific Symposium on Biocomputing, volume 15, pages 3–9. World Scientific, 2010.

  • J. Cortadella, M. Galceran-Oms, and M. Kishinevsky. Elastic systems. In Proc. 8th ACM/IEEE Int. Conf. on Formal Methods and Models for Codesign (MEMOCODE 2010), pages 149–158, 2010. [pdf]

  • J. Cortadella, M. Galceran-Oms, and M. Kishinevsky. Elastic systems. Invited lecture at the 8th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE), Grenoble (France), 2010. [pdf]

  • J. Cortadella, L. Lavagno, D. Amiri, J. Casanova, C. Macián, F. Martorell, J. A. Moya, L. Necchi, D. Sokolov, and E. Tuncer. Narrowing the margins with elastic clocks. In Proc. IEEE Int. Conf. on Integrated Circuit Design and Technology (ICICDT), pages 146–150, 2010. [pdf]

  • Josep Díaz, Marcin Kamiński, and Dimitrios M. Thilikos. A note on the subgraphs of the (2×∞)-grid. Discrete Math., 310(3):531–536, 2010. [doi]

  • Josep Díaz and Dieter Mitsche. The cook-book approach to the differential equation method. Computer Science Review, 4:129–152, 2010.

  • A. Duch, R. M. Jiménez, and C. Martínez. Rank selection in multidimensional data. In A. López-Ortiz, editor, Proc. of the 9th Latin American Theoretical Informatics Conference (LATIN), volume 6034 of Lecture Notes in Computer Science, pages 674–685, 2010.

  • Hartmut Ehrig, Annegret Habel, Leen Lambers, Fernando Orejas, and Ulrike Golas. Local confluence for rules with nested application conditions. In Graph transformations, volume 6372 of Lecture Notes in Comput. Sci., pages 330–345. Springer, Berlin, 2010. [doi]

  • Hugo Hernández Fekete, Tobias Baumgartner, Maria J. Blesa, Christian Blum, Alexander Kröller, and Sándor P. A protocol for self-synchronized duty-cycling in sensor networks: Generic implementation in wiselib. CoRR, abs/1010.4385, 2010.

  • Josep Freixas and Xavier Molinero. Detection of paradoxes of power indices for simple games. In Contributions to game theory and management. Volume III, pages 82–90. Grad. Sch. Manag., St. Petersb. Univ., St. Petersburg, 2010.

  • Josep Freixas and Xavier Molinero. Weighted games without a unique minimal representation in integers. Optim. Methods Softw., 25(2):203–215, 2010. [doi]

  • Joaquim Gabarró, Peter Kilpatrick, Maria J. Serna, and Alan Stewart. Stressed web environments as strategic games: Risk profiles and weltanschauung. In Martin Wirsing, Martin Hofmann, and Axel Rauschmayer, editors, Trustworthly Global Computing - 5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers, volume 6084 of Lecture Notes in Computer Science, pages 189–204. Springer, 2010.

  • M. Galceran-Oms, J. Cortadella, and M. Kishinevsky. Symbolic performance analysis of elastic systems. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 778–785, 2010. [pdf]

  • M. Galceran-Oms, J. Cortadella, M. Kishinevsky, and D. Bufistov. Automatic microarchitectural pipelining. In Proc. Design, Automation and Test in Europe (DATE), pages 961–964, 2010. [pdf]

  • Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß, and Ashish Tiwari. Context unification with one context variable. J. Symbolic Comput., 45(2):173–193, 2010. [doi]

  • Guillem Godoy. Normalization properties for shallow TRS and innermost rewriting. Appl. Algebra Engrg. Comm. Comput., 21(2):109–129, 2010. [doi]

  • Guillem Godoy, Omer Giménez, Lander Ramos, and Carme Àlvarez. The HOM problem is decidable. In STOC'10—Proceedings of the 2010 ACM International Symposium on Theory of Computing, pages 485–494. ACM, New York, 2010.

  • Esther Guerra, Juan de Lara, and Fernando Orejas. Controlling reuse in pattern-based model-to-model transformations. In Graph Transformations and Model-Driven Engineering - Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday, volume 5765 of Lecture Notes in Computer Science, pages 175–201. Springer, 2010.

  • Frank Hermann, Hartmut Ehrig, Fernando Orejas, and Ulrike Golas. Formal analysis of functional behaviour for model transformations based on triple graph grammars. In ICGT 2010, volume 6372 of Lecture Notes in Computer Science, pages 155–170. Springer, 2010.

  • Rosa M. Jiménez and Conrado Martínez. Interval sorting. In Automata, languages and programming. Part I, volume 6198 of Lecture Notes in Comput. Sci., pages 238–249. Springer, Berlin, 2010. [doi]

  • Jorge Júlvez, Jordi Cortadella, and Michael Kishinevsky. On the performance evaluation of multi-guarded marked graphs with single-server semantics. Discrete Event Dynamic Systems, 20(3):377–407, 2010. [doi]

  • Hugo Hernández Kröller, Maria J. Blesa, Christian Blum, Tobias Baumgartner, Sándor P. Fekete, and Alexander. A protocol for self-synchronized duty-cycling in sensor networks: Generic implementation in wiselib. In Sixth International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2010, Hangzhou, China, December 20-22, 2010, pages 134–139, 2010. [doi]

  • Manuel López-Ibáñez and Christian Blum. Beam-ACO for the travelling salesman problem with time windows. Comput. Oper. Res., 37(9):1570–1583, 2010. [doi]

  • Carlos J. Martín, Oscar Martínez-Graullera, Gregorio Godoy, and Luis G. Ullate. Coarray synthesis based on polynomial decomposition. IEEE Trans. Image Process., 19(4):1102–1107, 2010. [doi]

  • Conrado Martínez, Daniel Panario, and Alfredo Viola. Adaptive sampling strategies for quickselect. ACM Trans. Algorithms, 6(3):Art. 53, 46, 2010. [doi]

  • Conrado Martínez and Uwe Rösler. Partial Quicksort and Quickpartitionsort. In 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), Discrete Math. Theor. Comput. Sci. Proc., AM, pages 505–512. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2010.

  • J. Munoz-Gama and J. Carmona. A fresh look at precision in process conformance. In R. Hull, J. Mendling, and S. Tai, editors, Business Process Management, volume 6336 of Lecture Notes in Computer Science, pages 211–226. Springer, 2010.

  • Jorge Munoz-Gama and Josep Carmona. A fresh look at precision in process conformance. In Richard Hull, Jan Mendling, and Stefan Tai, editors, Business Process Management, volume 6336 of Lecture Notes in Computer Science, pages 211–226. Springer, 2010.

  • N. Nikitin, S. Chatterjee, J. Cortadella, M. Kishinevsky, and U. Ogras. Physical-aware link allocation and route assignment for chip multiprocessing. In Proc. 4th ACM/IEEE Int. Symp. on Networks-on-Chip (NOCS), pages 125–134, 2010. [pdf]

  • Fernando Orejas, Hartmut Ehrig, Markus Klein, Julia Padberg, Elvira Pino, and Sonia Pérez. A generic approach to connector architectures. II. Instantiation to Petri Nets and CSP. Fund. Inform., 99(1):95–124, 2010.

  • Fernando Orejas, Hartmut Ehrig, Markus Klein, Julia Padberg, Elvira Pino, and Sonia Pérez. A generic approach to connector architectures. I. The general framework. Fund. Inform., 99(1):63–93, 2010.

  • Fernando Orejas, Hartmut Ehrig, and Ulrike Prange. Reasoning with graph constraints. Formal Aspects of Computing, 22(3-4):385–422, 2010.

  • Fernando Orejas and Leen Lambers. Delaying constraint solving in symbolic graph transformation. In Graph transformations, volume 6372 of Lecture Notes in Comput. Sci., pages 43–58. Springer, Berlin, 2010. [doi]

  • M. Solé and J. Carmona. Rbminer: A tool for discovering Petri nets from transition systems. In International Symposium on Automated Technology for Verification and Analysis (ATVA), Lecture Notes in Computer Science, pages 396–402. Springer, 2010.

  • M. Solé and J. Carmona. Process mining from a basis of state regions. In International Conference on Application and Theory of Petri Nets and other Models of Concurrency (Petri Nets 2010), Lecture Notes in Computer Science. Springer, 2010.

  • Mallika Veeramalai, David Gilbert, and Gabriel Valiente. An optimized TOPS+ comparison method for enhanced TOPS models. BMC Bioinformatics, 11:138, 2010.

  • Martin J. Wainwright, Elitza Maneva, and Emin Martinian. Lossy source compression using low-density generator matrix codes: analysis and algorithms. IEEE Trans. Inform. Theory, 56(3):1351–1368, 2010. [doi]

  • Tiziana Calamoneri and Josep Díaz, editors. Algorithms and complexity, volume 6078 of Lecture Notes in Computer Science, Berlin, 2010. Springer. [doi]

  • Maria J. Serna, Ronen Shaltiel, Klaus Jansen, and José D. P. Rolim, editors. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings, volume 6302 of Lecture Notes in Computer Science. Springer, 2010.

  • Maria J. Blesa Sampels, Christian Blum, Günther R. Raidl, Andrea Roli, and Michael, editors. Hybrid Metaheuristics - 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings, volume 6373 of Lecture Notes in Computer Science. Springer, 2010. [doi]

  • Ricardo Alberich, Gabriel Cardona, Francesc Rosselló, and Gabriel Valiente. An algebraic metric for phylogenetic trees. Applied Mathematics Letters, 22(9):1320–1324, 2009.

  • Carme Àlvarez, Amalia Duch, Joaquim Gabarró, and Maria Serna. Sensor field: A computational model. In Algorithmic Aspects of Wireless Sensor Networks, 5th International Workshop, ALGOSENSORS 2009, Rhodes, Greece, July 10-11, 2009. Revised Selected Papers, pages 3–14, 2009. [doi]

  • Carme Àlvarez and Maria Serna. On the proper intervalization of colored caterpillar trees. Theor. Inform. Appl., 43(4):667–686, 2009. [doi]

  • Margaret Archibald and Conrado Martínez. The hiring problem and permutations. In 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), Discrete Math. Theor. Comput. Sci. Proc., AK, pages 63–76. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2009.

  • Margaret Archibald and Conrado Martínez. The hiring problem and permutations. In Christian Krattenthaler, Volker Strehl, and Manuel Kauers, editors, Proc. of the 21st Int. Conf. on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), DMTCS Proceedings. Link: https://hal.inria.fr/hal-01185423/, pages 63–76, 2009.

  • Federico Ardila and Elitza Maneva. Pruning processes and a new characterization of convex geometries. Discrete Math., 309(10):3083–3091, 2009. [doi]

  • A. Atserias, A. Bulatov, and A. Dawar. Affine systems of equations and counting infinitary logic. Theoretical Computer Science, 410(18):1666–1683, 2009.

  • A. Atserias, J. K. Fichte, and M. Thurley. Clause-learning algorithms with many restarts and bounded-width resolution. In Proceedings of 12th International Conference on Theory and Applications of Satisfiability Testing (SAT), volume 5584 of Lecture Notes in Computer Science, pages 114–127. Springer-Verlag, 2009.

  • A. Atserias and M. Weyer. Decidable relationships between consistency notions for constraint satisfaction problems. In Proceedings of 18th Annual Conference of the European Association for Computer Science Logic (CSL), pages 102–116. Springer, 2009.

  • Albert Atserias. Four subareas of the theory of constraints, and their links. In Rastislav Královic and Damian Niwinski, editors, Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, volume 5734 of Lecture Notes in Computer Science, page 1. Springer, 2009.

  • D. Baneres, J. Cortadella, and M. Kishinevsky. Timing-driven N-way decomposition. In Proc. of the Great Lakes Symposium on VLSI, pages 363–368, 2009. [pdf]

  • D. Baneres, J. Cortadella, and M. Kishinevsky. Variable-latency design by function speculation. In Proc. Design, Automation and Test in Europe (DATE), pages 1704–1709, 2009. [pdf]

  • Maria Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria Serna, and Christopher Thraves. Adversarial queueing model for continuous network dynamics. Theory Comput. Syst., 44(3):304–331, 2009. [doi]

  • Christian Blum, Maria J. Blesa, and Manuel López-Ibáñez. Beam search for the longest common subsequence problem. Comput. Oper. Res., 36(12):3178–3186, 2009. [doi]

  • D. Bufistov, J. Cortadella, M. Galceran-Oms, J. Júlvez, and M. Kishinevsky. Retiming and recycling for elastic systems with early evaluation. In Proc. ACM/IEEE Design Automation Conference, pages 288–291, 2009. [pdf]

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Path lengths in tree-child time consistent hybridization networks. Information Sciences, 180(3):366–383, 2009.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. On Nakhleh's metric for reduced phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(4):629–638, 2009.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Metrics for phylogenetic networks I: Generalizations of the Robinson-Foulds metric. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(1):46–61, 2009.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Metrics for phylogenetic networks II: Nodal and triplets metrics. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(3):454–469, 2009.

  • Gabriel Cardona, Francesc Rosselló, and Gabriel Valiente. Comparison of tree-child phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(4):552–569, 2009.

  • J. Carmona, J. Cortadella, and M. Kishinevsky. Divide-and-conquer strategies for process mining. In Proc. 7th Int. Conf. Business Process Management, volume 5701 of Lecture Notes in Computer Science, pages 327–343. Springer-Verlag, 2009. [doi]

  • J. Carmona, J. Cortadella, and M. Kishinevsky. Genet: a tool for the synthesis and mining of Petri nets. In acsd. 2009.

  • J. Carmona, J. Cortadella, M. Kishinevsky, and Alexander Taubin. Elastic circuits. IEEE Transactions on Computer-Aided Design, 28(10):1437–1455, 2009. [doi]

  • J. Carmona, Jorge Júlvez, J. Cortadella, and M. Kishinevsky. Scheduling synchronous elastic designs (Best Paper Award). In acsd. 2009.

  • J. Casanova and J. Cortadella. Multi-level clustering for clock skew optimization. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 547–554, 2009. [pdf]

  • José C. Clemente, K. Ikeo, Gabriel Valiente, and T. Gojobori. Optimized ancestral state reconstruction using Sankoff parsimony. BMC Bioinformatics, 10:51, 2009.

  • Marc Comas and Maria Serna. Vertex fusion under distance constraints. European J. Combin., 30(7):1612–1623, 2009. [doi]

  • J. Cortadella, M. Kishinevsky, D. Bufistov, J. Carmona, and J. Júlvez. Elasticity and Petri nets. Transactions on Petri nets and Other Models of Concurrency, 5100, 2009.

  • Jordi Cortadella and Alexander Taubin. Guest editorial: Special section on asynchronous circuits and systems. IEEE Transactions on VLSI Systems, 17(7):853–854, 2009. [doi]

  • Carles Creus, Guillem Godoy, Francesc Massanes, and Ashish Tiwari. Non-linear rewrite closure and weak normalization. In 24th Annual IEEE Symposium on Logic in Computer Science, pages 365–374. IEEE Computer Soc., Los Alamitos, CA, 2009. [doi]

  • Josep Díaz, Francesco Grandoni, and Alberto Marchetti-Scapamela. Balanced cut approximation in random geometric graphs. Theoretical Computer Science, 410:2725–2731, 2009.

  • Josep Díaz, A. Kaporis, G. D. Kemkes, Lefteris Kirousis, Xavier Pérez, and Nick Wormald. On the chromatic number of a random 5-regular grap. Journal of Graph Theory, 61:157–191, 2009.

  • Josep Díaz, Lefteris Kirousis, Dieter Mitsche, and Xavier Pérez. On the satisfiability threshold of formulae with three literals per clause. Theoretical Computer Science, 410:2920–2934, 2009.

  • Josep Díaz, Dieter Mitsche, and Xavier Pérez. On the probability of existence of mid-size components in random geometric graphs. Advances of Applied Probability, 41:1–14, 2009.

  • Josep Díaz, Dieter Mitsche, and Xavier Pérez. Connectivity for dynamic random geometric graphs. IEEE Transactions on Mobile Computing, 8:821–835, 2009.

  • Josep Díaz, Dieter Mitsche, Navin Rustagui, and Jared Saia. On the power of mediators. In S. Leonardi, editor, Internet and Networks Economics (WINE), volume 5929 of Lecture Notes in Computer Science, pages 455–463. Springer, 2009.

  • Josep Díaz, Maria J. Serna, Paul G. Spirakis, and Jacobo Torán. Paradigms for fast parallel approximability (Reprint from 1997), volume 8 of Cambridge international series on parallel computation. Cambridge University Press, 2009.

  • Amalia Duch and Conrado Martínez. Updating relaxed K-d trees. ACM Trans. Algorithms, 6(1):Art. 4, 24, 2009.

  • Liliana Félix, Francesc Rosselló, and Gabriel Valiente. Efficient reconstruction of metabolic pathways by bidirectional chemical search. Bulletin of Mathematical Biology, 71(3):750–769, 2009.

  • J. Freixas and X. Molinero. Maximum tolerance and maximum greatest tolerance of strict separating systems. In 23rd European Conference on Operational Research (EURO 2009), Bonn (Germany), 2009. EURO (2009).

  • J. Freixas and X. Molinero. Measures of voting power: Counting of power indices and paradoxes. In Third International Conference on Game Theory and Management (GTM 2009), St. Petersburg (Russia), 2009. GTM (2009).

  • J. Freixas and X. Molinero. On the existence of a minimum integer representation for weighted voting systems. Annals of Operations Research, 166(1):243–260, 2009. [doi]

  • J. Freixas and X. Molinero. Simple games and weighted games: a theoretical and computational viewpoint. Discrete Applied Mathematics, 157(7):1496–1508, 2009. [doi]

  • Josep Freixas and Xavier Molinero. Weightedness for simple games with less than 9 voters. In Contributions to game theory and management. Vol. II, pages 63–71. Grad. Sch. Manag., St. Petersb. Univ., St. Petersburg, 2009.

  • L. Frias and J. Petit. Combining digital access and parallel partition for quicksort and quickselect. ICSE Workshop on Multicore Software Engineering, 0:33–40, 2009.

  • Leonor Frias, Jordi Petit, and Salvador Roura. Lists revisited: cache-conscious STL lists. ACM J. Exp. Algorithmics, 14:Paper 3.5, 27, 2009. [doi]

  • Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, and Fernando Orejas. Dual systems of tableaux and sequents for PLTL. Journal of Logic and Algebraic Programming, 78(8):701–722, 2009.

  • M. Galceran-Oms, J. Cortadella, and M. Kishinevsky. Speculation in elastic systems. In Proc. ACM/IEEE Design Automation Conference, pages 292–295, 2009. [pdf]

  • M. Galceran-Oms, J. Cortadella, M. Kishinevsky, and D. Bufistov. Automatic microarchitectural pipelining. In Proc. International Workshop on Logic Synthesis, pages 214–221, 2009.

  • Adrià Gascón, Guillem Godoy, and Manfred Schmidt-Schauß. Unification with singleton tree grammars. In Rewriting techniques and applications, volume 5595 of Lecture Notes in Comput. Sci., pages 365–379. Springer, Berlin, 2009. [doi]

  • O. Giménez, J. Petit, and S. Roura. Programació 1: A pure problem-oriented approach for a CS1 course. In C. Hermann, T. Lauer, T. Ottmann, and M. Welte, editors, Proc. of the Informatics Education Europe IV (IEE-2009), pages 185–192, Freiburg, 2009. ISBN: 978-84-692-2758-9.

  • Guillem Godoy and Hugo Hernández. Undecidable properties of flat term rewrite systems. Appl. Algebra Engrg. Comm. Comput., 20(2):187–205, 2009. [doi]

  • Guillem Godoy and Florent Jacquemard. Unique normalization for shallow TRS. In Rewriting techniques and applications, volume 5595 of Lecture Notes in Comput. Sci., pages 63–77. Springer, Berlin, 2009. [doi]

  • Guillem Godoy and Ashish Tiwari. Invariant checking for programs with procedure calls. In Static analysis, volume 5673 of Lecture Notes in Comput. Sci., pages 326–342. Springer, Berlin, 2009. [doi]

  • Parikshit Gopalan, Phokion G. Kolaitis, Elitza Maneva, and Christos H. Papadimitriou. The connectivity of Boolean satisfiability: computational and structural dichotomies. SIAM J. Comput., 38(6):2330–2355, 2009. [doi]

  • Conrado Martínez, Lucia Moura, Daniel Panario, and Brett Stevens. Locating errors using ELAs, covering arrays, and adaptive testing algorithms. SIAM J. Discrete Math., 23(4):1776–1799, 2009. [doi]

  • Conrado Martínez and Helmut Prodinger. Moves and displacements of particular elements in quicksort. Theoret. Comput. Sci., 410(21-23):2279–2284, 2009. [doi]

  • Conrado Martínez and Robert Sedgewick, editors. Preface. Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2009). Society for Industrial and Applied Mathematics, 2009. [doi]

  • N. Nikitin and J. Cortadella. A performance analytical model for Network-on-Chip with constant service time routers. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 571–578, 2009. [pdf]

  • Fernando Orejas, Esther Guerra, Juan de Lara, and Hartmut Ehrig. Correctness, completeness and termination of pattern-based model-to-model transformation. In Algebra and coalgebra in computer science, volume 5728 of Lecture Notes in Comput. Sci., pages 383–397. Springer, Berlin, 2009. [doi]

  • Fernando Orejas and Martin Wirsing. On the specification and verification of model transformations. In Semantics and Algebraic Specification, Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday, volume 5700 of Lecture Notes in Computer Science, pages 140–161. Springer, 2009.

  • J. Petit and S. Roura. Programaci<F3>n-1: Una asignatura orientada a la resolución de problemas. In I. Jacob and D. López, editors, XV Jornadas de Enseñanza Universitaria de la Inform<E1>tica, pages 185–192. ISBN: 978-84-692-2758-9, 2009.

  • Francesc Rosselló and Gabriel Valiente. All that glisters is not galled. Mathematical Biosciences, 221(1):54–59, 2009.

  • Maria Serna and Carme Àlvarez. Preface to special section of selected papers from WEA 2006. ACM J. Exp. Algorithmics, 14:Paper 3.1, 1, 2009. Held in Menorca, May 24–27, 2006. [doi]

  • E. Tuncer, J. Cortadella, and L. Lavagno. Enabling adaptability through elastic clocks. In Proc. ACM/IEEE Design Automation Conference, pages 8–10, 2009. [pdf]

  • Gabriel Valiente. Combinatorial Pattern Matching Algorithms in Computational Biology using Perl and R. Taylor & Francis/CRC Press, 2009.

  • C. Àlvarez, J. Díaz, J. Petit, J. Rolim, and M. Serna. High level communication functionalities for wireless sensor networks. Theoretical Computer Science, 406(3):240–247, 2008.

  • José Nelson Amaral and Joaquim Gabarró. Topic 9: Parallel and distributed programming. In Euro-Par2008 - Parallel Processing, 14th International Euro-Par Conference, Las Palmas de Gran Canaria, Spain, August 26-29, 2008, Proceedings, volume 5168 of Lecture Notes in Computer Science, pages 686–687. Springer, 2008.

  • M. Archibald and C. Martínez. The hiring problem in permutations. In Sixth Conference on Discrete Mathematics and Computer Science (Spanish), pages 77–84. Univ. Lleida, Lleida, 2008.

  • Miguel Arenas, Gabriel Valiente, and David Posada. Characterization of phylogenetic reticulate networks based on the coalescent with recombination. Molecular Biology and Evolution, 25(12):2517–2520, 2008.

  • A. Atserias. On digraph coloring problems and treewidth duality. European Journal of Combinatorics, 29(4):796–820, 2008.

  • A. Atserias and V. Dalmau. A combinatorial characterization of resolution width. Journal of Computer System Sciences, 74(3):323–334, 2008.

  • A. Atserias, A. Dawar, and M. Grohe. Preservation under extensions on well-behaved finite structures. SIAM Journal on Computing, 38(4):1364–1381, 2008.

  • A. Atserias, M. Grohe, and D. Marx. Size bounds and query plans for relational joins. In Proceedings of 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 739–748, 2008.

  • Carlo Bertolli, Massimiliano Meneghin, and Joaquim Gabarró. A markov model for fault-tolerant task parallel computations. In From Grids To Service and Pervasive Computing, CoreGRID, pages 123–136. Springer, 2008.

  • M. Blesa, D. Calzada, A. Fernández, L. López, A. L. Martínez, A. Santos, M. Serna, and C. Thraves. Adversarial queueing model for continuous network dynamics. Theory of Computing Systems, 2008. Accepted for publication.

  • C. Blum. Beam-ACO for simple assembly line balancing. INFORMS Journal on Computing, 20(4):618–627, 2008.

  • C. Blum and M. Blesa. Optimization Techniques for Solving Complex Problems, chapter Solving the KCT Problem: Large-scale Neighborhood Search and Solution Merging. John Wiley and Sons Inc., 2008.

  • C. Blum, C. Cotta, A. J. Fernández, J. E. Gallardo, and M. Mastrolilli. Hybrid Metaheuristics, volume 114 of Studies in Computational Intelligence, chapter Hybridizations of metaheuristics with branch & bound derivates, pages 85–116. Springer Berlin / Heidelberg, 2008.

  • C. Blum and A. Roli. Hybrid Metaheuristics, volume 114 of Studies in Computational Intelligence, chapter Hybrid Metaheuristics: An Introduction, pages 1–30. Springer Berlin / Heidelberg, 2008.

  • C. Blum, M. Yábar-Vallès, and M. J. Blesa. An ant colony optimization algorithm for DNA sequencing by hybridization. Computers & Operations Research, 35:3620–3635, 2008.

  • D. Bufistov, J. Júlvez, and J. Cortadella. Performance optimization of elastic systems using buffer resizing and buffer insertion. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 442–448, 2008.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. A distance metric for a class of tree-sibling phylogenetic networks. Bioinformatics, 24(13):1481–1488, 2008.

  • Gabriel Cardona, Francesc Rosselló, and Gabriel Valiente. Tripartitions do not always discriminate phylogenetic networks. Mathematical Biosciences, 211(2):356–370, 2008.

  • Gabriel Cardona, Francesc Rosselló, and Gabriel Valiente. A perl package and an alignment tool for phylogenetic networks. BMC Bioinformatics, 9:175, 2008.

  • Gabriel Cardona, Francesc Rosselló, and Gabriel Valiente. Extended Newick: it is time for a standard representation of phylogenetic networks. BMC Bioinformatics, 9(1):532, 2008. [doi]

  • J. Carmona and J. Cortadella. Encoding large asynchronous controllers with ILP techniques. IEEE Transactions on Computer-Aided Design, 27(1):20–33, 2008.

  • J. Carmona, J. Cortadella, and M. Kishinevsky. A region-based algorithm for discovering Petri nets from event logs. In Proc. 6th Int. Conf. on Business Process Management (BPM), volume 5240 of Lecture Notes in Computer Science, pages 358–373. Springer-Verlag, 2008.

  • J. Carmona, J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. A symbolic algorithm for the synthesis of bounded petri nets. In Applications and Theory of Petri Nets, volume 5062 of Lecture Notes in Computer Science, pages 92–111. Springer, 2008.

  • J. Carmona, J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. A symbolic algorithm for the synthesis of bounded Petri nets. In Applications and Theory of Petri Nets and Other Models of Concurrency (ICATPN), volume 5062 of Lecture Notes in Computer Science, pages 92–111. Springer-Verlag, 2008. [doi]

  • Josep Carmona, Jordi Cortadella, Yousuke Takada, and Ferdinand Peper. Formal methods for the analysis and synthesis of nanometer-scale cellular arrays. ACM Journal on Emerging Technologies in Computing Systems, 4(2), 2008. [doi]

  • Hubie Chen and Omer Giménez. Causal graphs and structurally restricted planning. In Jussi Rintanen, Bernhard Nebel, J. Christopher Beck, and Eric A. Hansen, editors, Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008, Sydney, Australia, September 14-18, 2008, pages 36–43. AAAI, 2008.

  • M. Comas and M. Serna. A coloring characterization for graph cover problems. In Sixth Conference on Discrete Mathematics and Computer Science (Spanish), pages 263–270. Univ. Lleida, Lleida, 2008.

  • M. Comas and M. Serna. A coloring characterization for graph cover problems. In Sixth Conference on Discrete Mathematics and Computer Science (Spanish), pages 263–270. Univ. Lleida, Lleida, 2008.

  • J. Díaz, L. Kirousis, D. Mitsche, and X. Pérez-Giménez. A new upper bound for 3-SAT. In FSTTCS 2008: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, volume 2 of LIPIcs. Leibniz Int. Proc. Inform., pages 163–174. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2008.

  • J. Díaz, X. Pérez, M. J. Serna, and N. C. Wormald. Walkers on the cycle and the grid. SIAM J. Discrete Math., 22(2):747–775, 2008.

  • Josep Díaz, Zvi Lotker, and Maria Serna. The distant-2 chromatic number of random proximity and random geometric graphs. Inform. Process. Lett., 106(4):144–148, 2008.

  • Josep Díaz, Dieter Mitsche, and Xavier Pérez-Giménez. On the connectivity of dynamic random geometric graphs. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 601–610, New York, 2008. ACM.

  • Josep Díaz, Maria Serna, and Dimitrios M. Thilikos. Efficient algorithms for counting parameterized list H-colorings. J. Comput. System Sci., 74(5):919–937, 2008.

  • Michael Drmota, Omer Giménez, and Marc Noy. Vertices of given degree in series-parallel graphs. Random Structures Algorithms, 2008. Accepted for publication.

  • M. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. Thilikos, and S. Whitesides. Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica, 52(2):167–176, 2008.

  • J. Freixas and X. Molinero. The greatest allowed relative error in weights and threshold of strict separating systems. IEEE Transactions on Neural Networks, 19(5):770–781, 2008.

  • J. Freixas and X. Molinero. A new method to check whether a simple game is weighted. In Second International Conference on Game Theory and Management (GTM 2008), St. Petersburg (Russia), 2008. GTM (2008).

  • J. Freixas and X. Molinero. A fibonacci sequence for linear structures with two types of components. In International Conference on Applied Mathematical Programming and Modelling (APMOD2008), Bratislava (Slovak Republic), 2008. APMOD (2008).

  • J. Freixas and X. Molinero. Complete voting systems with two types of voters: weightedness and counting. Annals of Operations Research, 2008. Submitted.

  • J. Freixas and X. Molinero. Weightedness for simple games with less than 9 voters. Second International Conference on Game Theory and Management, 2008. Submitted.

  • J. Freixas and X. Molinero. Weighted integer realizations for linear simple games with two types of voters. In International Workshop on Operational Research (IWOR2008), page 127, Madrid (Spain), 2008. IWOR (2008).

  • J. Freixas and X. Molinero. Simple games and weighted games: a theoretical and computational viewpoint. Discrete Applied Mathematics, 2008. doi:10.1016/j.dam.2008.09.009.

  • Josep Freixas, Xavier Molinero, Martin Olsen, and Maria J. Serna. The complexity of testing properties of simple games. CoRR (arXiv.org), abs/0803.0404, 2008. http://arxiv.org/abs/0803.0404.

  • L. Frias and J. Petit. Parallel partition revisited. In Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, volume 5038 of Lecture Notes in Computer Science, pages 142–153. Springer, 2008. [pdf]

  • L. Frias and J. Singler. Parallelization of bulk operations for stl dictionaries. In Euro-Par 2007 Workshops: Parallel Processing, volume 4854, pages 49–59. Lecture Notes in Computer Science, 2008. [pdf]

  • L. Frias, J. Singler, and P. Sanders. Single-pass list partitioning. In The Second International Conference on Complex, Intelligent and Software Intensive Systems, pages 817–821. IEEE Computer Society Press, 2008. [pdf]

  • L. Frias, J. Singler, and P. Sanders. Single-pass list partitioning. Scalable Computing: Practice and Experience, 9(3):179–184, 2008. [pdf]

  • J. Gabarró, A. García, and M. Serna. On the complexity of equilibria problems in angel-daemon games. In Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, volume 5092 of Lecture Notes in Computer Science, pages 31–40. Springer, 2008.

  • Joaquim Gabarro, Alina Garcia, Maurice Clint, Peter Kilpatrick, and Alan Stewart. Bounded site failures: an approach to unreliable grid computing. In Making Grids Work, CoreGRID, pages 175–187. Springer, 2008.

  • Joaquim Gabarro, Alina Garcia, Maria Serna, Peter Kilpatrick, and Alan Stewart. Analysing orchestrations with risk profiles and angel-daemon games. In Grid Computing Achievements and Prospects, CoreGRID, pages 121–132. Springer, 2008.

  • B. Gel and X. Messeguer. Implementing an interactive web-based DAS client. In 2ond International Workshop on Practical Applications of Computational Biology & Bioinformatics (IWPACBB'08), pages 83–9. Advances in Soft Computing Series 49, Springer Berlin, 2008.

  • Stefanie Gerke, Omer Giménez, Marc Noy, and Andreas Weißl. The number of graphs not containing K3,3 as a minor. Electron. J. Combin., 15(1):Research Paper 114, 20, 2008.

  • Omer Giménez and Anders Jonsson. In search of the tractability boundary of planning problems. In Jussi Rintanen, Bernhard Nebel, J. Christopher Beck, and Eric A. Hansen, editors, Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008, Sydney, Australia, September 14-18, 2008, pages 99–106. AAAI, 2008.

  • Omer Giménez and Anders Jonsson. The complexity of planning problems with simple causal graphs. J. Artificial Intelligence Res., 31:319–351, 2008.

  • Omer Giménez and Marc Noy. Asymptotic enumeration and limit laws of planar graphs. J. Amer. Math. Soc., 2008. In press.

  • J. Stewart, A., Clint, M., Harmer, T., Kilpatrick, P., Perrott, R., Gabarró. Assessing the reliability and cost of web and grid orchestrations. In ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings, pages 428–433, 2008.

  • J. Júlvez. Polynomial throughput bounds for equal conflict petri nets with multi-guarded transitions. In 5th Intl. Conference on Quantitative Evaluation of Systems (QEST'08), pages 225–234. IEEE Computer Society Press, 2008.

  • T. Kam, M. Kishinevsky, J. Cortadella, and M. Galceran-Oms. Correct-by-construction microarchitectural pipelining. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 434–441, 2008.

  • Leen Lambers, Hartmut Ehrig, and Fernando Orejas. Efficient conflict detection in graph transformation systems by essential critical pairs. Electr. Notes Theor. Comput. Sci., 211:17–26, 2008.

  • Leen Lambers, Hartmut Ehrig, Ulrike Prange, and Fernando Orejas. Embedding and confluence of graph transformations with negative application conditions. In Graph Transformations, 4th International Conference, ICGT 2008, volume 5214 of Lecture Notes in Computer Science, pages 162–177. Springer, 2008.

  • Antoni Lozano, Ron Pinter, Oleg Rokhlenko, Gabriel Valiente, and Michal Ziv-Ukelson. Seeded tree alignment. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(4):503–513, 2008.

  • Paqui Lucio, Fernando Orejas, Edelmira Pasarella, and Elvira Pino. A functorial framework for constraint normal logic programming. Applied Categorical Structures, 16(3):421–450, 2008.

  • Elitza Maneva and Alistair Sinclair. On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. Theoret. Comput. Sci., 407(1-3):359–369, 2008. [doi]

  • Conrado Martínez, Lucia Moura, Daniel Panario, and Brett Stevens. Algorithms to locate errors using covering arrays. In LATIN 2008: Theoretical informatics, volume 4957 of Lecture Notes in Comput. Sci., pages 504–519. Springer, Berlin, 2008. [doi]

  • Conrado Martínez, Alois Panholzer, and Helmut Prodinger. Generating random derangements. In Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments and the Fifth Workshop on Analytic Algorithmics and Combinatorics, pages 234–240, Philadelphia, PA, 2008. SIAM.

  • X. Molinero. Generació ordenada d’estructures combinatòries. Societat Catalana de Matemàtiques / Notícies, (25):71, 2008.

  • Fernando Orejas. Attributed graph constraints. In Graph Transformations, 4th International Conference, ICGT 2008, volume 5214 of Lecture Notes in Computer Science, pages 274–288. Springer, 2008.

  • Fernando Orejas, Hartmut Ehrig, and Ulrike Prange. A logic of graph constraints. In José Luiz Fiadeiro and Paola Inverardi, editors, Fundamental Approaches to Software Engineering, 11th International Conference, FASE 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, volume 4961 of Lecture Notes in Computer Science, pages 179–198. Springer, 2008.

  • Fernando Orejas and Sonia Pérez. Architectural connectors for sequence diagrams. Electr. Notes Theor. Comput. Sci., 206:111–131, 2008.

  • Michael Sammeth, Gabriel Valiente, and Roderic Guigó. Bubbles: Alternative splicing events of arbitrary dimension in splicing graphs. In Proc. 5th 12th Annual International Conference on Research in Computational Molecular Biology, volume 4955 of Lecture Notes in Bioinformatics, pages 372–392. Springer, 2008.

  • Maria Serna and Fatos Xhafa. Parallel approximation to high multiplicity scheduling problems via smooth multi-valued quadratic programming. Theor. Inform. Appl., 42(2):237–252, 2008.

  • Maria J. Serna. Parallel algorithms for two processors precedence constraint scheduling. In Ming-Yang Kao, editor, Encyclopedia of Algorithms. Springer, 2008.

  • T. Treangen and X. Messeguer. Novel computational methods for large scale genome comparison. In 2ond International Workshop on Practical Applications of Computational Biology & Bioinformatics (IWPACBB'08), pages 68–73. Advances in Soft Computing Series 49, Springer Berlin, 2008.

  • T. Treangen and X. Messeguer. Gapped extension for local multiple alignment of interspersed DNA repeats. In 4-th International Symposium on Bioinformatics Research and Applications, pages 74–86, Atlanta, Georgia, 2008. LNCS 4983, Springer Berlin.

  • A. Ziyatdinov, D. Bañeres, and J. Cortadella. Multi-clustering net model for placement algorithms. In Proc. 16th IFIP/IEEE Int. Conf. on Very Large Scale Integration, 2008.

  • M. Blesa, C. Blum, C. Cotta, A. J. Fernández, J. E. Gallardo, A. Roli, and M. Sampels, editors. Hybrid Metaheuristics: Fifth International Workshop, HM 2008, volume 5296 of Lecture Notes in Computer Science. Springer-Verlag, Berlin-Heidelberg, Malaga, Spain, 2008.

  • M. Blesa, C. Blum, A. Roli, and M. Sampels, editors. Hybrid Metaheuristics: An Emerging Approach to Optimization, volume 114 of Studies in Computational Intelligence. Springer-Verlag, Berlin-Heidelberg, 2008.

  • Hartmut Ehrig, Reiko Heckel, Grzegorz Rozenberg, and Gabriele Taentzer, editors. Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings, volume 5214 of Lecture Notes in Computer Science. Springer, 2008.

  • Hartmut Ehrig, Reiko Heckel, Grzegorz Rozenberg, and Gabriele Taentzer, editors. Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings, volume 5214 of Lecture Notes in Computer Science. Springer, 2008.

  • Christian Blum, Maria José Blesa Aguilera, Andrea Roli, and Michael Sampels, editors. Hybrid metaheuristics, volume 114 of Studies in Computational Intelligence. Springer-Verlag, Berlin, 2008. An emerging approach to optimization.

  • Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, and Maria Serna. Communication tree problems. Theoret. Comput. Sci., 381(1-3):197–217, 2007.

  • A. Atserias. Conjunctive query evaluation by search-tree revisited. Theoretical Computer Science, 371:155–168, 2007.

  • A. Atserias, A. Bulatov, and V. Dalmau. On the power of k-consistency. In Proceedings of 34th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 279–290. Springer, 2007.

  • A. Atserias, A. Bulatov, and A. Dawar. Affine systems of equations and counting infinitary logic. In Proceedings of 34th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 558–570. Springer, 2007.

  • D. Bañeres, J. Cortadella, and M. Kishinevsky. Layout-aware gate duplication and buffer insertion. In Proc. Design, Automation and Test in Europe (DATE), pages 1367–1372, 2007.

  • J. Bautista, C. Blum, and J. Pereira. Equilibrado de Líneas de montaje mediante Beam ACO. In J. M. Moreno Vega et al., editor, Actas del V Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB 2007). Thomson Publishers, 2007. In press.

  • R. Guigó E. Blanco and X. Messeguer. Multiple non-collinear TF-maps alignments of promoter regions. BMC Bioinformatics, 8(138), 2007.

  • M. Blesa and C. Blum. Handbook of Approximation Algorithms and Metaheuristics, volume 10 of Chapman & Hall/CRC Computer & Information Science Series, chapter On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. Taylor & Francis Books (CRC Press), Boca Raton, Florida, 2007.

  • M. J. Blesa and C. Blum. Finding edge-disjoint paths in networks by means of artificial ant colonies. Journal of Mathematical Modelling and Algorithms, 6(3):361–391, 2007.

  • C. Blum. Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research, 177(1):102–115, 2007.

  • C. Blum. Iterated local search and constructive heuristics for error correcting code design. International Journal of Innovative Computing and Applications, 1(1):14–22, 2007. Invited paper for the inaugural issue.

  • C. Blum and M. Blesa. Probabilistic Beam Search for the Longest Common Subsequence Problem. In Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (SLS'07), volume 4638 of Lecture Notes in Computer Science, pages 150–161, Brussels, Belgium, 2007. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

  • C. Blum, C. Cotta, A. J. Fernández, and J. E. Gallardo. A probabilistic beam search algorithm for the shortest common supersequence problem. In C. Cotta et al., editor, Proceedings of EvoCOP 2007 – Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation, Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 2007. To appear.

  • Manuel Bodirsky, Omer Giménez, Mihyun Kang, and Marc Noy. Enumeration and limit laws for series-parallel graphs. European J. Combin., 28(8):2091–2105, 2007.

  • Joseph E. Bonin and Omer Giménez. Multi-path matroids. Combin. Probab. Comput., 16(2):193–217, 2007.

  • D. Bufistov, J. Cortadella, M. Kishinevsky, and S. Sapatnekar. A general model for performance optimization of sequential systems. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 362–369, 2007.

  • Hubie Chen and Omer Giménez. Act local, think global: Width notions for tractable planning. In Mark S. Boddy, Maria Fox, and Sylvie Thiébaux, editors, Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, ICAPS 2007, Providence, Rhode Island, USA, September 22-26, 2007, pages 73–80. AAAI, 2007.

  • Robert Clarisó and Jordi Cortadella. Verification of concurrent systems with parametric delays using octahedra. Fundamenta Informaticae, 78(1):1–33, 2007.

  • Robert Clarisó and Jordi Cortadella. The octahedron abstract domain. Science of Computer Programming, 64(1):115–139, 2007. [doi]

  • José C. Clemente, Kenji Satou, and Gabriel Valiente. Phylogenetic reconstruction from non-genomic data. Bionformatics, 23(2):e110–e115, 2007.

  • J. Cortadella and M. Kishinevsky. Synchronous elastic circuits with early evaluation and token counterflow. In Proc. ACM/IEEE Design Automation Conference, pages 416–419, 2007.

  • J. Díaz. 2006 Nevanlinna Prize: Jon Kleinberg. SCM Not., 23:57–60, 2007.

  • Josep Díaz and Marcin Kaminski. MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Theor. Comput. Sci., 377(1-3):271–276, 2007.

  • Josep Díaz, Dieter Mitsche, and Xavier Pérez. Sharp threshold for Hamiltonicity of random geometric graphs. SIAM J. Discrete Math., 21(1):57–65 (electronic), 2007.

  • Josep Díaz, Maria J. Serna, and Dimitrios M. Thilikos. Complexity issues on bounded restrictive H-coloring. Discrete Mathematics, 307(16):2082–2093, 2007.

  • Josep Díaz, Maria J. Serna, and Nicholas C. Wormald. Bounds on the bisection width for random d -regular graphs. Theor. Comput. Sci., 382(2):120–130, 2007.

  • Amalia Duch and Conrado Martínez. On the average cost of insertions on random relaxed k-d trees. In Proc. of the 9th ACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) and the 4th ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Lecture Notes in Computer Science, pages 194–200. SIAM, Society for Industrial and Applied Mathematics, 2007.

  • Liliana Félix, Francesc Rosselló, and Gabriel Valiente. Reconstructing metabolic pathways by bidirectional chemical search. In Proc. 5th International Conference on Computational Methods in Systems Biology, volume 4695 of Lecture Notes in Bioinformatics, pages 217–232. Springer, 2007.

  • Liliana Félix and Gabriel Valiente. Validation of metabolic pathway databases based on chemical substructure search. Biomolecular Engineering, 24(3):327–335, 2007.

  • Paolo Ferragina, Raffaele Giancarlo, Valentina Greco, Giovanni Manzini, and Gabriel Valiente. Compression-based classification of biological sequences and structures via the Universal Similarity Metric: Experimental assessment. BMC Bioinformatics, 8:252, 2007.

  • J. Freixas and X. Molinero. On the frequency of the donation paradox for power indices in weighted simple games. In Workshop: Simulation and other quantitative approaches to the assessment of electoral systems (ALEX 4.1), Alessandria (Italy), 2007.

  • J. Freixas and X. Molinero. Weighted games without a unique minimal representation in integers. Optimization Methods and Software, 2007. Submitted.

  • J. Freixas and X. Molinero. The donation paradox of power indices: classification and counting. In III Spain Italy Netherlands Meeting on Game Theory & VII Spanish Meeting On Game Theory (SING3 2007), page 66, Universidad Complutense de Madrid (Facultad de Ciencias Matemáticas), Madrid (Spain), 2007.

  • J. Freixas and X. Molinero. Some tests to count paradoxes of power indices. In Actas del XXX Congreso Nacional de Estadística e Investigación Operativa y IV Jornadas de Estadística Pública 2007 (SEIO 2007), pages 90–91, Valladolid (Spain), 2007. Comité Organitzador del XXX Congreso Nacional de Estadística e Investigación Operativa y IV Jornadas de Estadística Pública 2007.

  • J. Freixas, X. Molinero, and S. Roura. Minimal representations for majority games. In S. B. Cooper, B. Loewe, and A. Sorbi, editors, LNCS: Computation and Logic in the Real World (CiE 2007), volume 4497 of LNCS. Springer, 2007. Third Conference on Computability in Europe CiE 2007, Siena, Italy, June 2007, Proceedings.

  • L. Frias. Algorithm engineering: Efficient data structure libraries. Technical report 25/2007, Matematisches Forschungsinstitut Oberwolfach, 2007.

  • Joaquim Gabarró, Alina García, and Maria J. Serna. On the complexity of game isomorphism. In Ludek Kucera and Antonín Kucera, editors, Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, volume 4708 of Lecture Notes in Computer Science, pages 559–571. Springer, 2007.

  • Joaquim Gabarró, Isabel Vallejo, and Fatos Xhafa. On using partial orders for web application design. IJWIS, 3(1/2):8–25, 2007.

  • Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, and Fernando Orejas. A cut-free and invariant-free sequent calculus for PLTL. In Jacques Duparc and Thomas A. Henzinger, editors, Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, volume 4646 of Lecture Notes in Computer Science, pages 481–495. Springer, 2007.

  • David Gilbert, Francesc Rosselló, Gabriel Valiente, and Mallika Veeramalai. Alignment-free comparison of TOPS strings. In Jackie Daykin, Manal Mohamed, and Kathleen Steinhöfel, editors, London Algorithmics and Stringology 2006, volume 8, chapter 11, pages 177–197. College Publications, 2007.

  • Omer Giménez and Anders Jonsson. On the hardness of planning problems with simple causal graphs. In Mark S. Boddy, Maria Fox, and Sylvie Thiébaux, editors, Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, ICAPS 2007, Providence, Rhode Island, USA, September 22-26, 2007, pages 152–159. AAAI, 2007.

  • Omer Giménez, Marc Noy, and Juan José Rué. Graph classes with given 3-connected components: asymptotic counting and critical phenomena. Electronic Notes in Discrete Mathematics, 29:521–529, 2007. European Conference on Combinatorics, Graph Theory and Applications, European Conference on Combinatorics, Graph Theory and Applications. [doi]

  • K. Gorgônio, J. Cortadella, and F. Xia. A compositional method for the synthesis of asynchronous communication mechanisms. In Applications and Theory of Petri Nets and Other Models of Concurrency (ICATPN), volume 4546 of Lecture Notes in Computer Science, pages 144–163. Springer-Verlag, 2007.

  • Kyller Costa Gorgônio, Jordi Cortadella, Fei Xia, and Alexandre Yakovlev. Automating synthesis of asynchronous communication mechanisms. Fundamenta Informaticae, 78(1):75–100, 2007.

  • Markus Klein, Julia Padberg, and Fernando Orejas. Towards multiple access in generic component architectures. Electr. Notes Theor. Comput. Sci., 176(2):25–45, 2007.

  • Antoni Lozano, Ron Pinter, Oleg Rokhlenko, Gabriel Valiente, and Michal Ziv-Ukelson. Seeded tree alignment and planar tanglegram layout. In Proc. 7th Workshop on Algorithms in Bioinformatics, volume 4645 of Lecture Notes in Bioinformatics, pages 98–110. Springer, 2007.

  • Paqui Lucio and Fernando Orejas. Preface. Electr. Notes Theor. Comput. Sci., 188:1–2, 2007.

  • F. Luna, C. Blum, E. Alba, and A. J. Nebro. ACO vs EAs for solving a real-world frequency assignment problem in GSM networks. In H. Lipson et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference 2007 (GECCO'07). ACM press, 2007. In press.

  • Maria J. Serna. Random models for geometric graphs (abstract). In Camil Demetrescu, editor, WEA, volume 4525 of Lecture Notes in Computer Science, page 37. Springer, 2007.

  • K. Socha and C. Blum. An ant colony optimization algorithm for continuous optimization: Application to feed-forward neural network training. Neural Computing & Applications, 16(3):235–248, 2007.

  • J. A. Subirana and X. Messeguer. Structural families of genomic microsatellites. GENE, 408(1-2):124–132, 2007.

  • Alexander Taubin, Jordi Cortadella, Luciano Lavagno, Alex Kondratyev, and Ad Peeters. Design automation of real life asynchronous devices and systems. Foundations and Trends in Electronic Design Automation, 2(1):1–133, 2007. [doi]

  • Ryuhei Uehara and Gabriel Valiente. Linear structure of bipartite permutation graphs and the longest path problem. Information Processing Letters, 103(2):71–77, 2007.

  • Gabriel Valiente. Efficient algorithms on trees and graphs with unique node labels. In Abraham Kandel, Horst Bunke, and Mark Last, editors, Applied Graph Theory in Computer Vision and Pattern Recognition, volume 52 of Studies in Computational Intelligence, pages 137–149. Springer, 2007.

  • X Messeguer D. Farré, N. Bellora, L. Mularoni and M. Albà. Housekeeping genes tend to show reduced upstream sequence conservation. Genome Biology, 8(R140), 2007.

  • Ludek Kucera and Antonín Kucera, editors. Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, volume 4708 of Lecture Notes in Computer Science. Springer, 2007.

  • T. Bartz-Beielstein, M. Blesa, C. Blum, B. Naujoks, A. Roli, G. Rudolph, and M. Sampels, editors. Hybrid Metaheuristics: Fourth International Workshop, HM 2007, volume 4771 of Lecture Notes in Computer Science. Springer-Verlag, Berlin-Heidelberg, Dortmund, Germany, 2007.

  • E. Alba, F. Almeida, M. Blesa, C. Cotta, M. Díaz, I. Dorta, J. Gabarró, C. León, G. Luque, J. Petit, C. Rodrí­guez, A. Rojas, and F. Xhafa. Efficient parallel LAN/WAN algorithms for optimization. the MALLBA project. Parallel Computing, 32(5-6):415–440, 2006.

  • Tetsuo Asano, Patricia Evans, Ryuhei Uehara, and Gabriel Valiente. Site consistency in phylogenetic networks with recombination. In Costas S. Iliopoulos, Kunsoo Park, and Kathleen Steinhöfel, editors, Algorithms in Bioinformatics, volume 6 of Texts in Algorithmics, chapter 2, pages 15–26. College Publications, 2006.

  • A. Atserias. Distinguishing sat from polynomial-size circuits, through black-box queries. In in 21st Annual IEEE Conference on Computational Complexity (CCC), pages 88–95, 2006.

  • A. Atserias, A. Dawar, and Ph. G. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries. Journal of the ACM, 53(2):208–237, 2006.

  • D. Bañeres, J. Cortadella, and M. Kishinevsky. Dominator-based partitioning for delay optimization. In Proc. of the Great Lakes Symposium on VLSI, pages 67–72, 2006.

  • M. Blesa and C. Blum. A nature-inspired algorithm for the disjoint paths problem. In 9th International Workshop on Nature Inspired Distributed Computing (NIDISC'06), page 8 pp. (published 1 page as no. 239), Rhodes Island, Greece, 2006. IEEE Computer Society Press. In conjunction with The 20th IEEE/ACM International Parallel and Distributed Processing (IPDPS). (c) IEEE. CD-ROM INSPEC Accession Number:8969613.

  • M. Blesa and C. Georgiou. A review on DISC 2005, the 19th international symposium on distributed computing. Bulletin of the European Association on Theoretical Computer Science (EATCS), 88:84–103, 2006.

  • M. Blesa, J. Petit, and F. Xhafa. Generic parallel implementations for Tabu Search. International Journal of Computer Systems Science and Engineering, 21(6):413–432, 2006.

  • Maria Blesa. Stability in Communication Networks under Adversarial Models. PhD thesis, Universitat Politècnica de Catalunya, February 2006. Maria Serna, advisor.

  • C. Blum. A new hybrid evolutionary algorithm for the k-cardinality tree problem. In M. Keijzer et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference 2006 (GECCO'06), pages 515–522. ACM press, 2006. Best paper award.

  • C. Blum, J. Bautista, and J. Pereira. Beam-ACO applied to assembly line balancing. In M. Dorigo, L. M. Gambardella, A. Martinoli, R. Poli, and T. Stützle, editors, Proceedings of ANTS 2006 – Fifth International Workshop on Swarm Intelligence and Ant Algorithms, Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany, 2006. To appear.

  • C. Blum and M. Yábar Vallès. New constructive heuristics for DNA sequencing by hybridization. In Proceedings of WABI 2006 – 6th International Workshop on Algorithms in Bioinformatics, Lecture Notes in Bioinformatics (LNBI/LNCS). Springer-Verlag, Berlin, Germany, 2006. To appear.

  • C. Blum and M. Yábar Vallès. Multi-level ant colony optimization for DNA sequencing by hybridization. In F. Almeida, M. Blesa, C. Blum, J. M. Moreno, M. Pérez, A. Roli, and M. Sampels, editors, Proceedings of HM 2006 – 3rd International Workshop on Hybrid Metaheuristics, volume 4030 of Lecture Notes in Computer Science, pages 94–109. Springer-Verlag, Berlin, Germany, 2006.

  • J. Carmona and J. Cortadella. State encoding of large asynchronous controllers. In Proc. ACM/IEEE Design Automation Conference, pages 939–944, 2006.

  • J. Carmona, J. Cortadella, Y. Takada, and F. Peper. From molecular interactions to gates: a systematic approach. In Proc. International Conf. Computer-Aided Design (ICCAD), 2006.

  • Josep Carmona, José M. Colom, Jordi Cortadella, and Fernando García-Vallés. Synthesis of asynchronous controllers using integer linear programming. IEEE Transactions on Computer-Aided Design, 25(9):1637–1651, 2006.

  • Jaume Casasnovas, José C. Clemente, Joe Miró-Julià, Francesc Rosselló, Kenji Satou, and Gabriel Valiente. Fuzzy clustering improves phylogenetic relationships reconstruction from metabolic pathways. In Proc. 17th Int. Conf. Information Processing and Management of Uncertainty in Knowledge-Based Systems, pages 2807–2814. Editions EDK, 2006.

  • José C. Clemente, Kenji Satou, and Gabriel Valiente. Finding conserved and non-conserved reactions using a metabolic pathway alignment algorithm. Genome Informatics, 17(2):46–56, 2006.

  • J. Cortadella, M. Kishinevsky, and B. Grundmann. Synthesis of synchronous elastic architectures. In Proc. ACM/IEEE Design Automation Conference, pages 657–662, 2006.

  • J. Cortadella, M. Kishinevsky, and B. Grundmann. Specification and design of synchronous elastic circuits. In Proc. International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (TAU), pages 16–21, 2006.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, and Christos Sotiriou. Desynchronization: Synthesis of asynchronous circuits from synchronous specifications. IEEE Transactions on Computer-Aided Design, 25(10):1904–1921, 2006.

  • Jean Daligault and Conrado Martínez. On the variance of quickselect. 2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO), page 205–210, jan 2006. [doi]

  • Josep Díaz, Fabrizio Grandoni, and Alberto Marchetti Spaccamela. Balanced cut approximation in random geometric graphs. In Algorithms and computation, volume 4288 of Lecture Notes in Comput. Sci., pages 527–536. Springer, Berlin, 2006.

  • Josep Díaz, Jordi Petit, and Dimitrios M. Thilikos. Kernels for the vertex cover problem on the preferred attachment model. In Carme Àlvarez and Maria J. Serna, editors, Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings, volume 4007 of Lecture Notes in Computer Science, pages 231–240. Springer, 2006.

  • Josep Díaz, Maria Serna, and Dimitrios M. Thilikos. Efficient algorithms for parameterized H-colorings. In Topics in discrete mathematics, volume 26 of Algorithms Combin., pages 373–405. Springer, Berlin, 2006.

  • Josep Díaz and Dimitrios M. Thilikos. Fast FPT-algorithms for cleaning grids. In Bruno Durand and Wolfgang Thomas, editors, STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, volume 3884 of Lecture Notes in Computer Science, pages 361–371. Springer, 2006.

  • Josep Díaz and Dimitrios M. Thilikos. Fast FPT-algorithms for cleaning grids. In STACS 2006, volume 3884 of Lecture Notes in Comput. Sci., pages 361–371. Springer, Berlin, 2006.

  • Hartmut Ehrig, Fernando Orejas, and Ulrike Prange. Categorical foundations of distributed graph transformation. In Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro, and Grzegorz Rozenberg, editors, Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings, volume 4178 of Lecture Notes in Computer Science, pages 215–229. Springer, 2006.

  • Gregor Engels, Fernando Orejas, and Francesco Parisi-Presicce. Special issue with selected papers from ICGT 2004. Fundam. Inform., 74(1), 2006.

  • Fedor V. Fomin and Dimitrios M. Thilikos. New upper bounds on the decomposability of planar graphs. J. Graph Theory, 51(1):53–81, 2006.

  • X. Franch, J. Marco, X. Molinero, J. Petit, and F. Xhafa. Introducció a la programació. Aula Politècnica 125 (Ediciona UPC), 2006.

  • X. Franch, J. Marco, X. Molinero, J. Petit, and F. Xhafa. Fonaments de programació. Problemes resolts de C++. Aula Politècnica 125 (Ediciona UPC), 2006.

  • J. Freixas and X. Molinero. Some advances in the theory of voting systems based on experimental algorithms. In C. Álvarez and M. Serna, editors, Proc. 5th International Workshop on Efficient and Experimental Algorithms, WEA 2006, volume 4007 of LNCS, pages 73–84. Springer Berlin / Heidelberg, 2006.

  • J. Freixas and X. Molinero. Minimal integer representation for weighted voting systems. international workshop and conference applied mathematical programming and modelling (apmod2006); june 18–21, madrid (spain). In International Workshop and Conference Applied mathematical programming and modelling; June 18-21, pages 42–42. Escuela Técnica Superior de Ingeniería (ICAI) and Universidad Pontificia Comillas, 2006.

  • J. Freixas and X. Molinero. Some advances in the theory of voting systems based on experimental algorithms. Technical Report 5, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, LSI-06-5-R, 2006.

  • L. Frias, J. Petit, and S. Roura. Lists revisited: Cache conscious stl lists. In Proceedings of the Fifth International Workshop on Experimental Algorithms (WEA), volume 4007, pages 121–133. Lecture Notes in Computer Science, 2006. [doi]

  • Omer Giménez, Petr Hliněný, and Marc Noy. Computing the Tutte polynomial on graphs of bounded clique-width. SIAM J. Discrete Math., 20(4):932–946 (electronic), 2006.

  • Omer Giménez and Marc Noy. On the complexity of computing the Tutte polynomial of bicircular matroids. Combin. Probab. Comput., 15(3):385–395, 2006.

  • R. Guigó, E. Blanco, X. Messeguer, and TF. Smith. Transcription factor map alignment of promoter regions. PLoS Comput Biology, 2:e49, 2006.

  • J. Júlvez, J. Cortadella, and M. Kishinevsky. Performance analysis of concurrent systems with early evaluation. In Proc. International Conf. Computer-Aided Design (ICCAD), 2006.

  • S. Krstić, J. Cortadella, M. Kishinevsky, and J. O'Leary. Synchronous elastic networks. In International Conference on Formal Methods in Computer-Aided Design (FMCAD), 2006.

  • S. Krstić, J. Cortadella, M. Kishinevsky, and J. O'Leary. Synchronous elastic networks. In Mary Sheeran and Tom Melham, editors, Sixth International Workshop on Designing Correct Circuits (DCC). ETAPS 2006, 2006.

  • Leen Lambers, Hartmut Ehrig, and Fernando Orejas. Conflict detection for graph transformation with negative application conditions. In Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro, and Grzegorz Rozenberg, editors, Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings, volume 4178 of Lecture Notes in Computer Science, pages 61–76. Springer, 2006.

  • Leen Lambers, Hartmut Ehrig, and Fernando Orejas. Efficient detection of conflicts in graph-based model transformation. Electr. Notes Theor. Comput. Sci., 152:97–109, 2006.

  • G. Leguizamón, C. Blum, and E. Alba. Approximation Algorithms and Metaheuristics, chapter Evolutionary Computation. Taylor & Francis Books (CRC Press), Boca Raton, Florida, 2006. In press.

  • Mercè Llabrés, Jairo Rocha, Francesc Rosselló, and Gabriel Valiente. On the ancestral compatibility of two phylogenetic trees with nested taxa. Journal of Mathematical Biology, 53(3):340–364, 2006.

  • Paqui Lucio, Fernando Orejas, Edelmira Pasarella, and Elvira Pino. A functorial framework for constraint normal logic programming. In Kokichi Futatsugi, Jean-Pierre Jouannaud, and José Meseguer, editors, Algebra, Meaning, and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, volume 4060 of Lecture Notes in Computer Science, pages 555–577. Springer, 2006.

  • C. Martínez, X. Molinero, and Nicolad M. Thiéry. Generació ordenada de classes d’estructures combinatòries. In Jornada de Recerca EPSEM 2006, pages 83–84. Remsa S.L., Manresa, 2006.

  • N. T. Perna A.E. Darling, T. Treangen, L. Zhang, C. Kuiken, X. Messeguer. Procastination leads to efficient filtration for local multiple alignment. In Workshop on Algorithms in Bioinformatics, pages 126–137. LNCS 4175, Springer Berlin, 2006.

  • Fernando Orejas. Thirty years of algebraic specification. J. Log. Algebr. Program., 67(1-2):1–2, 2006.

  • Francesc Rosselló and Gabriel Valiente. An algebraic view of the relation between largest common subtrees and smallest common supertrees. Theoretical Computer Science, 362(1–3):33–53, 2006.

  • Alan Stewart, Joaquim Gabarró, Maurice Clint, Terence J. Harmer, Peter Kilpatrick, and Ronald H. Perrott. Managing grid computations: An ORC-based approach. In Parallel and Distributed Processing and Applications, 4th International Symposium, ISPA 2006, Sorrento, Italy, December 4-6, 2006, Proceedings, volume 4330 of Lecture Notes in Computer Science, pages 278–291. Springer, 2006.

  • Treangen T and Messeguer X. M-GCAT: Interactively and efficiently constructing large-scale multiple genome comparison frameworks in closely related species. BMC Bioinformatics, 7:433, 2006.

  • Gabriel Valiente. Assessing clustering results with reference taxonomies. Genome Informatics, 17(2):131–140, 2006.

  • X. Messeguer Blanco E, Farré D, Albà MM and Guigó R. ABS: a database of annotated regulatory binding sites from orthologous promoters. Nucleic Acids Research, 34:D63–7, 2006.

  • F. Xhafa, P. P. Vázquez, J. Marco, X. Molinero, and A. Martín. Programación en C++ para ingenieros. International Thomson Editores Spain Paraninfo S.A., first edition, 2006.

  • C. Blum, A. Roli, and M. Sampels, editors. Special Issue on “Hybrid Metaheuristics”. Journal of Mathematical Modelling and Algorithms, 5 (1), 1–137, 2006.

  • M. Keijzer, M. Cattolico, D. V. Arnold, V. Babovic, C. Blum, P. Bosman, M. Butz, C. A. Coello Coello, D. Dasgupta, K. Deb, S. G. Ficici, J. A. Foster, A. Hernández-Aguirre, G. Hornby, H. Lipson, P. McMinn, J. Moore, G. R. Raidl, F. Rothlauf, C. Ryan, and D. Thierens, editors. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2006. ACM Press, New York, 2006.

  • F. Almeida, M. Blesa, C. Blum, J. M. Moreno, M. Pérez, A. Roli, and M. Sampels, editors. Hybrid Metaheuristics: Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-15, 2006, volume 4030 of Lecture Notes in Computer Science. Springer-Verlag GmbH, 2006.

  • Carme Àlvarez and Maria J. Serna, editors. Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings, volume 4007 of Lecture Notes in Computer Science. Springer, 2006.

  • Josep Díaz, Klaus Jansen, José D. P. Rolim, and Uri Zwick, editors. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, volume 4110 of Lecture Notes in Computer Science. Springer, 2006.

  • Josep Díaz, Klaus Jansen, José D. P. Rolim, and Uri Zwick, editors. Approximation, randomization and combinatorial optimization, volume 4110 of Lecture Notes in Computer Science, Berlin, 2006. Springer-Verlag. Algorithms and techniques.

  • Moshe Lewenstein and Gabriel Valiente, editors. Proc. 17th Annual Symposium on Combinatorial Pattern Matching, volume 4009 of Lecture Notes in Computer Science. Springer, 2006.

  • C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, and M. Serna. Adversarial models for priority-based networks. Networks, 45(1):23–35, 2005.

  • C. Àlvarez, J. Gabarró, and M. Serna. Polynomial space suffices for deciding nash equilibria properties for extensive games with large trees, . In Algorithms and Computation, 16th International Symposium (ISAAC 2005), volume 3827 of Lecture Notes in Computer Science, pages 634–643, Sanya, Hainan, China, 2005. Springer.

  • C. Àlvarez, J. Gabarró, and M. Serna. Pure nash equilibria in games with a large number of actions. In Mathematical Foundations of Computer Science 2005, 30th International Symposium (MFCS 2005), volume 3618 of Lecture Notes in Computer Science, pages 95–106, Gdansk, Poland, 2005. Springer.

  • A. Atserias. Conjunctive query evaluation by search tree revisited. In 10th International Conference on Database Theory (ICDT), volume 3363 of Lecture Notes in Computer Science, pages 53–67. Springer, 2005. <b>Best newcomer paper award</b>.

  • A. Atserias. On digraph coloring problems and treewidth duality. In 20th IEEE Symposium on Logic in Computer Science (LICS), pages 106–115, 2005.

  • A. Atserias. Definability on a random 3-cnf formula. In 20th IEEE Symposium on Logic in Computer Science (LICS), pages 458–466, 2005.

  • A. Atserias, A. Dawar, and M. Grohe. Preservation under extensions on well-behaved finite structures. In 32nd International Colloquium on Automata, Languages and Programming (ICALP), volume 3580 of Lecture Notes in Computer Science, pages 1437–1449. Springer-Verlag, 2005.

  • M. Blesa. Deciding stability in packet-switched FIFO networks under the Adversarial Queuing model in polynomial time. In 19th International Symposium on Distributed Computing (DISC'05), volume 3724 of Lecture Notes in Computer Science, pages 429–441, Kraków, Poland, 2005. Springer-Verlag GmbH. © LNCS, Springer-Verlag.

  • M. Blesa, D. Calzada, A. Fernández, L. López, A. L. Martínez, A. Santos, and M. Serna. Adversarial queueing model for continuous network dynamics. In 30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), volume 3618 of Lecture Notes in Computer Science, pages 144–155, Gdansk, Poland, 2005. Springer–Verlag GmbH. © LNCS, Springer-Verlag.

  • C. Blum. Review of the book "Ant Colony Optimization" by M. Dorigo and T. Stützle. Artificial Intelligence, 165:261–264, 2005.

  • C. Blum. Ant colony optimization: Introduction and recent trends. Physics of Life Reviews, 2(4):353–373, 2005.

  • C. Blum and M. Blesa. New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers & Operations Research, 32(6):1355–1377, 2005.

  • C. Blum and M. Blesa. Combining Ant Colony Optimization with Dynamic Programming for solving the k-cardinality tree problem. In 8th International Work-Conference on Artificial Neural Networks, Computational Intelligence and Bioinspired Systems (IWANN'05), volume 3512 of Lecture Notes in Computer Science, pages 25–33, Barcelona, Spain, 2005. Springer-Verlag, Berlin.

  • C. Blum and M. Blesa. Optimització mitjançant colònies de formigues artificials. Bulletin of the Catalan Association of Artificial Intelligence (ACIA Newsletters), 33:25–26, 2005. Review on the conference of M. Dorigo at the CosmoCaixa Museum in Barcelona. In Catalan.

  • C. Blum, M. Blesa, and A. Roli. Combining ILS with an effective constructive heuristic for the application to error correcting code design. In 6th Metaheuristics International Conference (MIC'05), pages 114–119, Wien, Austria, 2005.

  • C. Blum and M. Dorigo. Search bias in ant colony optimization: On the role of competition-balanced systems. IEEE Transactions on Evolutionary Computation, 9(2):159–174, 2005.

  • C. Blum, A. Roli, and E. Alba. Parallel metaheuristics: A new class of algorithms, chapter An introduction to metaheuristic techniques, pages 3–42. John Wiley & Sons, 2005.

  • C. Blum and K. Socha. Training feed-forward neural networks with ant colony optimization: An application to pattern classification. In Proceedings of the 5th International Conference on Hybrid Intelligent Systems (HIS). IEEE Computer Society, 2005. To appear.

  • Manuel Bodirsky, Omer Giménez, Mihyun Kang, and Marc Noy. On the number of series parallel and outerplanar graphs. In Stefan Felsner, editor, 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), volume AE of DMTCS Proceedings, pages 383–388. Discrete Mathematics and Theoretical Computer Science, 2005.

  • R. Clarisó and J. Cortadella. Verification of concurrent systems with parametric delays using octahedra. In Int. Conf. on Application of Concurrency to System Design, 2005.

  • R. Clarisó, E. Rodríguez-Carbonell, and J. Cortadella. Derivation of non-structural invariants of petri nets using abstract interpretation. In Application and Theory of Petri Nets 2004, volume (To appear) of Lecture Notes in Computer Science. Springer-Verlag, 2005.

  • Jose Clemente, Kenji Satou, and Gabriel Valiente. Reconstruction of phylogenetic relationships from metabolic pathways based on the enzyme hierarchy and the gene ontology. Genome Informatics, 16(2):45–55, 2005.

  • J. Cortadella, K. Gorgônio, F. Xia, and A. Yakovlev. Automatic synthesis of asynchronous coomunication mechanisms. In Int. Conf. on Application of Concurrency to System Design, 2005.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Claudio Passerone, and Yosinori Watanabe. Quasi-static scheduling of independent tasks for reactive systems. IEEE Transactions on Computer-Aided Design, 24(10):1492–1514, 2005.

  • J. Díaz, G. Grammatikopoulos, A. C. Kaporis, L. M. Kirousis, X. Pérez, and D. G. Sotiropoulos. 5-regular graphs are 3-colorable with positive probability. In Algorithms—ESA 2005, volume 3669 of Lecture Notes in Comput. Sci., pages 215–225. Springer, Berlin, 2005.

  • J. Díaz, M. Serna, and D. M. Thilikós. The restrictive H-coloring problem. Discrete Applied Mathematics, 145:297–305, 2005.

  • Josep Díaz and Juhani Karhumaki. Preface [Automata, languages and programming: algorithms and complexity (ICALP-A 2004)]. Theoret. Comput. Sci., 348(2-3):129, 2005. Held in Turku, July, 2004.

  • Josep Díaz, Xavier Pérez, Maria J. Serna, and Nicholas C. Wormald. Connectivity for wireless agents moving on a cycle or grid. In STACS 2005, volume 3404 of Lecture Notes in Comput. Sci., pages 353–364. Springer, Berlin, 2005.

  • Josep Díaz, Xavier Pérez, Maria J. Serna, and Nicholas C. Wormald. Connectivity for wireless agents moving on a cycle or grid. In STACS 2005, volume 3404 of Lecture Notes in Comput. Sci., pages 353–364. Springer, Berlin, 2005.

  • Josep Díaz, Maria Serna, and Dimitrios M. Thilikos. The restrictive H-coloring problem. Discrete Appl. Math., 145(2):297–305, 2005.

  • X. Messeguer D. Dominguez-Sal and J. A. Subirana. Fibrehelix: A programe for calculating the X ray diffraction pattern of macromolecules with helical symmetry: Aplications to DNA coiled-coils. Acta Crystalographica, 61(203-206), 2005.

  • M. Dorigo and C. Blum. Ant colony optimization theory: A survey. Theoretical Computer Science, 344(2-3):243–278, 2005.

  • Amalia Duch and Conrado Martínez. Improving the performance of multidimensional search using fingers. Journal of Experimental Algorithms, 10, 2005.

  • Hartmut Ehrig, Benjamin Braatz, Markus Klein, Fernando Orejas, Sonia Pérez, and Elvira Pino. Object-oriented connector-component architectures. Electr. Notes Theor. Comput. Sci., 141(3):123–151, 2005.

  • Liliana Félix, Francesc Rosselló, and Gabriel Valiente. Optimal artificial chemistries and metabolic pathways. In Proc. 6th Mexican Int. Conf. Computer Science, pages 298–305. IEEE Computer Science Press, 2005.

  • Liliana Félix and Gabriel Valiente. Efficient validation of metabolic pathway databases. In Proc. 6th Int. Symp. Computational Biology and Genome Informatics, pages 1209–1212, Salt Lake City, Utah, 2005.

  • Philippe Flajolet, Joaquim Gabarró, and Helmut Pekari. Analytic urns. The Annals of Probability, 33(3):1200–1233, 2005.

  • Philippe Flajolet, Joaquim Gabarró, and Helmut Pekari. Analytic urns. The Annals of Probability, 2005.

  • L. Frias. Stl maps using lbsts. In Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO), pages 155–166. SIAM, 2005.

  • Omer Giménez, Anna de Mier, and Marc Noy. On the number of bases of bicircular matroids. Ann. Comb., 9(1):35–45, 2005.

  • Omer Giménez, Petr Hliněný, and Marc Noy. Computing the Tutte polynomial on graphs of bounded clique-width. In Graph-theoretic concepts in computer science, volume 3787 of Lecture Notes in Comput. Sci., pages 59–68. Springer, Berlin, 2005.

  • Omer Giménez and Marc Noy. The number of planar graphs and properties of random planar graphs. In 2005 International Conference on Analysis of Algorithms, Discrete Math. Theor. Comput. Sci. Proc., AD, pages 147–156 (electronic). Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2005.

  • C. Martínez and X. Molinero. Efficient iteration in admissible combinatorial classes. Theoretical Computer Science, 2–3(346):388–417, 2005.

  • D. Merkle and C. Blum. Swarm intelligence – An optimization-based introduction. Künstliche Intelligenz, 4:5–10, 2005.

  • X. Molinero. Ordered Generation of Classes of Combinatorial Structures. PhD thesis, Universitat Politècnica de Catalunya, 2005.

  • Fernando Orejas and Sonia Pérez. Towards architectural connectors for UML. In Hans-Jörg Kreowski, Ugo Montanari, Fernando Orejas, Grzegorz Rozenberg, and Gabriele Taentzer, editors, Formal Methods in Software and Systems Modeling, Essays Dedicated to Hartmut Ehrig, on the Occasion of His 60th Birthday, volume 3393 of Lecture Notes in Computer Science, pages 352–369. Springer, 2005.

  • Fernando Orejas and Jan van Leeuwen. Preface: Automata, languages and programming. Theor. Comput. Sci., 331(1):1–2, 2005.

  • Roderic D. M. Page and Gabriel Valiente. An edit script for taxonomic classifications. BMC Bioinformatics, 6:208, 2005.

  • Edelmira Pasarella, Fernando Orejas, Elvira Pino, and Marisa Navarro. A transformational semantics of static embedded implications of normal logic programs. In Patricia M. Hill, editor, Logic Based Program Synthesis and Transformation, 15th International Symposium, LOPSTR 2005, London, UK, September 7-9, 2005, Revised Selected Papers, volume 3901 of Lecture Notes in Computer Science, pages 133–146. Springer, 2005.

  • Hoan Pham, Dang Hung Tran, Tu Bao Ho, Kenji Satou, and Gabriel Valiente. Qualitatively predicting acetylation and methylation areas in DNA sequences. Genome Informatics, 16(2):3–11, 2005.

  • E. Rodríguez-Carbonell and J. Cortadella. Inference of numerical relations from digital circuits. Extended abstract of the presentation at the First International Workshop on Numerical & Symbolic Abstract Domains (NSAD), 2005.

  • A. Roli, M. Blesa, and C. Blum. Random walk and parallelism in local search. In 6th Metaheuristics International Conference (MIC'05), pages 811–816, Wien, Austria, 2005.

  • Francesc Rosselló and Gabriel Valiente. Graph transformation in molecular biology. In Hans-Jörg Kreowski, Ugo Montanari, Fernando Orejas, Grzegorg Rozenberg, and Gabriele Taentzer, editors, Formal Methods in Software and System Modeling, volume 3393 of Lecture Notes in Computer Science, pages 116–133. Springer-Verlag, 2005.

  • Francesc Rosselló and Gabriel Valiente. Chemical graphs, chemical reaction graphs, and chemical graph transformation. Electronic Notes in Theoretical Computer Science, 127(1):157–166, 2005.

  • Maria Serna and Dimitrios M. Thilikos. Parameterized complexity for graph layout problems. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 86:41–65, 2005.

  • Maria Serna, Luca Trevisan, and Fatos Xhafa. The approximability of non-Boolean satisfiability problems and restricted integer programming. Theoret. Comput. Sci., 332(1-3):123–139, 2005.

  • Maria J. Serna, Luca Trevisan, and Fatos Xhafa. The approximability of non-boolean satisfiability problems and restricted integer programming. Theor. Comput. Sci., 332(1-3):123–139, 2005.

  • K. Socha and C. Blum. Metaheuristic Procedures for Training Neural Networks, chapter Ant Colony Optimization. Springer-Verlag, Berlin, Germany, 2005. To appear.

  • Nicolas M. Thiéry, Florent Hivert, François Descouens, Teresa Gomez-Díaz, Jean-Christophe Novelli, Éric Laugerotte, Houda Abbad, Patrick Lemeur, Christophe Carré, Frédéric Chapoton, Janvier Nzeutchap, and Xavier Molinero. MuPAD-combinat. In Formal Power Series and Algebraic Combinatorics (FPSAC'05). Springer-Verlag, 2005.

  • D. M. Thilikos, M. J. Serna, and H. Bodlaender. Cutwidth I: A constructive linear time algorithm for cutwidth. Journal of Algorithms, 56(1):1–24, 2005.

  • Dimitrios M. Thilikos, Maria Serna, and Hans L. Bodlaender. Cutwidth. II. Algorithms for partial w-trees of bounded degree. J. Algorithms, 56(1):25–49, 2005.

  • Gabriel Valiente. A fast algorithmic technique for comparing large phylogenetic trees. In Proc. 12th Int. Symposium on String Processing and Information Retrieval, volume 3772 of Lecture Notes in Computer Science, pages 371–376. Springer-Verlag, 2005.

  • Gabriel Valiente. Constrained tree inclusion. Journal of Discrete Algorithms, 3(2–4):431–447, 2005.

  • X. Messeguer E. Blanco, D. Farre, M Mar Alba and R. Guigo. ABS: a database of annotated regulatory binding sites from orthologous promoters. Nucleic Acid Research, 34(D63-D67), 2005.

  • Maria J. Blesa, Christian Blum, Andrea Roli, and Michael Sampels, editors. Proceedings of Hybrid Metaheuristics: Second International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005, volume 3636 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 2005.

  • H. G. Beyer, U. M. O'Reilly, D. V. Arnold, W. Banzhaf, C. Blum, E. W. Bonabeau, E. Cantú Paz, D. Dasgupta, K. Deb, J. A. Foster, E. D. de Jong, H. Lipson, X. Llora, S. Mancoridis, M. Pelikan, G. R. Raidl, T. Soule, A. Tyrrell, J. P. Watson, and E. Zitzler, editors. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2005. ACM Press, New York, 2005.

  • D. Merkle and C. Blum, editors. Special Issue on “Swarm Intelligence”. Journal Künstliche Intelligenz, 4, 1–41, 2005. In press.

  • C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, and M. Serna. The complexity of deciding stability under FFS in the adversarial model. Information Processing Letters, 90(5):261–266, 2004.

  • C. Àlvarez, M. Blesa, and M. Serna. The impact of failure management on the stability of communication networks. In 10th International Conference on Parallel and Distributed Systems (ICPADS'04), pages 153–160, Newport Beach, California, USA, 2004. IEEE Computer Society Press.

  • C. Àlvarez, M. Blesa, and M. Serna. A characterization of universal stability in the adversarial queueing model. SIAM Journal on Computing, 34(1):41–66, 2004.

  • C. Àlvarez, J. Díaz, J. Petit, J. Rolim, and M. Serna. Efficient and relliable high level communicatioon in deployed sensor networks. In Mobiwac 2004, 2004.

  • C. Àlvarez and M. Serna. The proper interval colored graph problem for caterpillar trees. In Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW'04), Como, Italy, 2004.

  • C. Àlvarez and M. Serna. The proper interval colored graph problem for caterpillar trees (extended abstract). In Workshop on Graphs and Combinatorial Optimization, volume 17 of Electron. Notes Discrete Math., pages 23–28 (electronic). Elsevier, Amsterdam, 2004.

  • Javier Álvez, Paqui Lucio, and Fernando Orejas. Constructive negation by bottom-up computation of literal answers. In Hisham Haddad, Andrea Omicini, Roger L. Wainwright, and Lorie M. Liebrock, editors, Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, March 14-17, 2004, pages 1468–1475. ACM, 2004.

  • A. Atserias. On sufficient conditions for unsatisfiability of random formulas. Journal of the Association for Computing Machinery, 51(2):281–311, 2004.

  • A. Atserias. Notions of average-case complexity for random 3-sat. In 13th Annual Conference of the EACSL (CSL), volume 3210 of Lecture Notes in Computer Science, pages 1–5. Springer, 2004.

  • A. Atserias and M. L. Bonet. On the automatizability of resolution and related propositional proof systems. Information and Computation, 189(2):182–201, 2004.

  • A. Atserias, A. Dawar, and Ph. G. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries. In 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pages 319–329. ACM Press, 2004.

  • A. Atserias, Ph. G. Kolaitis, and M. Y. Vardi. Constraint propagation as a proof system. In 10th International Conference on Principles and Practice of Constraint Programming (CP), volume 3258 of Lecture Notes in Computer Science, pages 77–91. Springer, 2004.

  • D. Bañeres, J. Cortadella, and M. Kishinevsky. A recursive paradigm to solve boolean relations. In Proc. ACM/IEEE Design Automation Conference, pages 416–421, 2004. Best paper award.

  • M. Blesa. On the use of topology extensions for provoking instability in communication network. In Information Society , subconference on Theoretical Computer Science (IS04-TCS), pages 197–199, Ljubljana, Slovenia, 2004. Slovenian ACM Chapter.

  • M. Blesa and C. Blum. Ant colony optimization for the maximum edge-disjoint paths problem. In Raidl et al., editor, 1st European Workshop on Evolutionary Computation in Communications, Networks, and Connected Systems (EvoCOMNET'04), in Applications of Evolutionary Computing (EvoWorkshops'04), volume 3005 of Lecture Notes in Computer Science, pages 160–169, Coimbra, Portugal, 2004. Springer-Verlag.

  • M. Blesa and F. Xhafa. Using parallelism in experimenting and fine tuning of parameters for metaheuristics. In P. Sloot, M. Bubak, D. Albada, and J. Dongarra, editors, 4th International Conference on Computational Science (ICCS'04), volume 3036 of Lecture Notes in Computer Science, pages 429–432, Kraków, Poland, 2004. Springer-Verlag.

  • I. Blunno, J. Cortadella, A. Kondratyev, L. Lavagno, K. Lwin, and C. Sotiriou. Handshake protocols for de-synchronization. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 149–158, 2004. Best paper award.

  • H. L. Bodlaender and D. M. Thilikós. Computing small search numbers in lineartime. In International Workshop on Parameterized and Exact Computation (IWPEC'04), Lecture Notes in Computer Science. Springer, 2004.

  • J. Carmona. Structural Methods for the Synthesis of Well-Formed Concurrent Specifications. PhD thesis, Universitat Politècnica de Catalunya (UPC), 2004.

  • J. Carmona, J. Cortadella, V. Khomenko, and A. Yakovlev. Synthesis of asynchronous hardware from Petri nets. In J. Desel, W. Reisig, and G. Rozenberg, editors, Lectures on Concurrency and Petri Nets: Advances in Petri Nets, volume 3098 of Lecture Notes in Computer Science, pages 345–401. Springer-Verlag, 2004.

  • R. Clarisó and J. Cortadella. Verification of timed circuits with symbolic delays. In Proc. of Asia and South Pacific Design Automation Conference, pages 628–633, 2004.

  • Robert Clarisó and Jordi Cortadella. The octahedron abstract domain. In 11th Static Analysis Symposium (SAS), volume 3148 of Lecture Notes in Computer Science, pages 312–327. Springer-Verlag, 2004.

  • J. Cortadella, A. Kondratyev, L. Lavagno, K. Lwin, and C. Sotiriou. From synchronous to asynchronous: An automatic approach. In Proc. Design, Automation and Test in Europe (DATE), volume 2, pages 1368–1369, 2004.

  • J. Cortadella, A. Kondratyev, L. Lavagno, and C. Sotiriou. Coping with the variability of combinational logic delays. In Proc. International Conf. Computer Design (ICCD), pages 505–508, 2004.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Alexander Taubin, and Yosinori Watanabe. Quasi-static scheduling for concurrent architectures. Fundamenta Informaticae, 62(2):171–196, 2004.

  • E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikós. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. In 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), pages 274–283, 2004.

  • E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikós. The bidimensional theory of bounded-genus graphs and its algorithmic consequences. In 29th International Symposium on Mathematical Foundations of Computer Science (MFCS'04), volume 3153 of Lecture Notes in Computer Science, pages 191–203. Springer, 2004.

  • E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikós. Bidimensional parameters and local treewidth. SIAM Journal on Discrete Applied Mathematics, 2004. To appear.

  • E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikós. Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs. Transactions on Algorithms, 2004. To appear.

  • E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikós. Bidimensional parameters and local treewidth. In Latin American Theoretical Informatics (LATIN'04), volume 2976 of Lecture Notes in Computer Science, pages 109–118. Springer, 2004.

  • E. D. Demaine, M. Hajiaghayi, and D. M. Thilikós. Exponential speedup of fixed parameter algorithms on K3,3-minor-free or K5-minor-free graphs. Algorithmica, 2004. To appear.

  • E. D. Demaine, N. Nishimura, M. Hajiaghayi, P. Ragde, and D. M. Thilikós. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Journal of Computer and System Sciences, 2004. To appear.

  • J. Díaz, M. Serna, and D. M. Thilikos. Recent results on parameterized H-colorings. In J. Nesetril and P. Winkler, editors, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 63 of DIMACS/DIMATIA Workshop on Graphs, Morphisms and Statistical Physics, pages 65–85. American Mathematical Society, 2004.

  • J. Díaz, M. Serna, and D. M. Thilikós. Fixed parameter algorithms for counting and deciding bounded restrictive H-coloring. In Susanne Albers and Tomasz Radzik, editors, 5th Annual European Symposium on Algorithms (ESA'04), volume 3221 of Lecture Notes in Computer Science, pages 275–286, Bergen, Norway, 2004. Springer.

  • J. Díaz, S. Serna, and N. C. Wormald. Computation of the bisection width for random d-regular graphs. In 6th Latin American Theoretical Informatics conference (LATIN'04), volume 2976 of Lecture Notes in Computer Science, pages 49–58. Springer, 2004.

  • Amalia Duch. Randomized insertion and deletion in point quad trees. In Rudolf Fleischer and Gerhard Trippen, editors, Algorithms and Computation, 15th International Symposium, ISAAC 2004, Proceedings, volume 3341 of Lecture Notes in Computer Science, pages 415–426. Springer, 2004.

  • Amalia Duch. Design and Analysis of Multidimensional Data Structures. PhD thesis, Universitat Politècnica de Catalunya, 2004.

  • Amalia Duch and Conrado Martínez. Fingered multidimensional search trees. In Celso C. Ribeiro and Simone L. Martins, editors, Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Proceedings, volume 3059 of Lecture Notes in Computer Science, pages 228–242. Springer, 2004.

  • Hartmut Ehrig, Fernando Orejas, Benjamin Braatz, Markus Klein, and Martti Piirainen. A component framework for system modeling based on high-level replacement systems. Software and System Modeling, 3(2):114–135, 2004.

  • Hartmut Ehrig, Julia Padberg, Benjamin Braatz, Markus Klein, Fernando Orejas, Sonia Pérez, and Elvira Pino. A generic framework for connector architectures based on components and transformations. Electr. Notes Theor. Comput. Sci., 108:53–67, 2004.

  • Domènec Farré, David García, M. Mar Albà, and Xavier Messeguer. Prediction of transcription factor binding sites with PROMOv.3: Improving the specificity of weight matrices and the searching process. In Proceedings of the 5th Annual Spanish Bioinformatics Conference, pages 171–172, Barcelona, Catalonia, Spain, 2004.

  • Liliana Félix, Francesc Rosselló, and Gabriel Valiente. Artificial chemistries and metabolic pathways. In Xavier Messeguer and Gabriel Valiente, editors, Proc. 5th Annual Spanish Bioinformatics Conference, pages 56–59, Barcelona, 2004. Technical University of Catalonia.

  • F. V. Fomin, P. Fraigniaud, and D. M. Thilikós. The price of connectedness in expansions. 2004. Submitted.

  • F. V. Fomin and D. M. Thilikós. A simple and fast approach for solving problems on planar graphs. In 21st International Symposium on Theoretical Aspects of Computer Science (STACS'04), volume 2996 of Lecture Notes in Computer Science, pages 56–67. Springer, 2004.

  • F. V. Fomin and D. M. Thilikós. A 3-approximation for the pathwidth of halin graphs. In Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW'04), 2004. To appear in: Electronic Notes on Discrete Mathematics, 2004.

  • Fedor V. Fomin and Dimitrios M. Thilikos. A 3-approximation for the pathwidth of Halin graphs. In Workshop on Graphs and Combinatorial Optimization, volume 17 of Electron. Notes Discrete Math., pages 157–162 (electronic). Elsevier, Amsterdam, 2004.

  • Omer Giménez and Marc Noy. Estimating the growth constant of labelled planar graphs. In Mathematics and computer science. III, Trends Math., pages 133–139. Birkhäuser, Basel, 2004.

  • J. Petit E. Levy, G. Louchard. A distributed algorithm to find hamiltonian cycles in Gnp random graphs. In Workshop on Combinatorial and Algorithmic Aspects of Networking, Lecture Notes in Computer Science. Springer, 2004.

  • Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. On supertrees of phylogenetic trees. In Xavier Messeguer and Gabriel Valiente, editors, Proc. 5th Annual Spanish Bioinformatics Conference, pages 142–145, Barcelona, 2004. Technical University of Catalonia.

  • Antoni Lozano and Gabriel Valiente. On the maximum common embedded subtree problem for ordered trees. In Costas S. Iliopoulos and Thierry Lecroq, editors, String Algorithmics, chapter 7, pages 155–169. King's College London Publications, 2004.

  • C. Martínez and X. Molinero. An experimental study of unranking algorithms. In Simone L. Martins Celso C. Ribeiro, editor, LNCS: III Workshop on Efficient and Experimental Algorithms, volume 3059 of LNCS, pages 326–340. Springer, 2004.

  • C. Martínez and X. Molinero. An efficient generic algorithm for the generation of unlabelled cycles. In Gardy D. Drmota M., Flajolet P. and Gittenberger B., editors, Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities, volume XV, pages 187–197. Birkhäuser, 2004.

  • Conrado Martínez. Partial quicksort. Proc. 6th ACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) and 1st ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pages 224–228, jan 2004.

  • Conrado Martínez and Xavier Molinero. Decomposable objects, counting, unranking, random, and exhaustive generation of combinatorial classes. In MuPAD-COMBINAT: First developers and users meeting, 2004.

  • Conrado Martínez, Daniel Panario, and Alfredo Viola. Adaptive sampling for quickselect. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 447–455. SIAM, 2004.

  • N. Modi and J. Cortadella. Boolean decomposition using two-literal divisors. In Proc. International Conference on VLSI Design, 2004.

  • Nikos Mylonakis and Fernando Orejas. A distributed and mobile component system based on the ambient calculus. In José Luiz Fiadeiro, Peter D. Mosses, and Fernando Orejas, editors, Recent Trends in Algebraic Development Techniques, 17th International Workshop, WADT 2004, Barcelona, Spain, March 27-29, 2004, Revised Selected Papers, volume 3423 of Lecture Notes in Computer Science, pages 186–200. Springer, 2004.

  • N. Nishimura, M. R. Fellows, C. Knauer, P. Ragde, F. A. Rosamond, Thilikós, D.M., and S. Whitesides. Faster fixed-parameter tractable algorithms for matching and packing problems. In 12th Annual European Symposium on Algorithms (ESA'04), volume 3221 of Lecture Notes in Computer Science. Springer, 2004.

  • N. Nishimura, P. Ragde, and D. M. Thilikós. Smaller kernels for hitting set problems of constant arity. In International Workshop on Parameterized and Exact Computation (IWPEC'04), Lecture Notes in Computer Science. Springer, 2004.

  • Fernando Orejas and Elvira Pino. On the integration of modular heterogeneous specifications. In Hartmut Ehrig, Werner Damm, Jörg Desel, Martin Große-Rhode, Wolfgang Reif, Eckehard Schnieder, and Engelbert Westkämper, editors, Integration of Software Specification Techniques for Applications in Engineering, Priority Program SoftSpez of the German Research Foundation (DFG), Final Report, volume 3147 of Lecture Notes in Computer Science, pages 582–601. Springer, 2004.

  • Francesc Rosselló and Gabriel Valiente. Analysis of metabolic pathways by graph transformation. In Proc. 2nd Int. Conf. Graph Transformation, volume 3256 of Lecture Notes in Computer Science, pages 70–82. Springer, 2004.

  • A. Stewart, M. Clint, and J. Gabarró. Barrier synchronization: axiomatization and relaxation. Formal Aspects of Computing, 16:36–50, 2004.

  • Todd Treangen and Xavier Messeguer. M-GCAT: Multiple genome comparison and alignment tool. In Proceedings of the 5th Annual Spanish Bioinformatics Conference, pages 30–33, Barcelona, Catalonia, Spain, 2004.

  • Fomin F. V. and D. M. Thilikós. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. In 31st International Colloquium on Automata, Languages and Programming (ICALP'04), volume 3142 of Lecture Notes in Computer Science, pages 581–592. Springer, 2004.

  • G. Valiente. Trading uninitialized space for time. Information Processing Letters, 92(1):9–13, 2004.

  • Gabriel Valiente. On the algorithm of Berztiss for tree pattern matching. In Proc. 5th Mexican Int. Conf. Computer Science, pages 43–49. IEEE Computer Science Press, 2004.

  • F. Xhafa, S. Caballé, T. Daradoumis, and N. Zhou. A grid-based approach for processing group activity log files. In OTM Workshops: On the Move to Meaningful Internet Systems 2004, volume 3292 of Lecture Notes in Computer Science, pages 175–186, Agia Napa, Cyprus, 2004. Springer.

  • Xavier Messeguer and Gabriel Valiente, editors. Proc. 5th Annual Spanish Bioinformatics Conference. Technical University of Catalonia, Barcelona, 2004. 214 pages.

  • Jordi Cortadella and Wolfgang Reisig, editors. Applications and Theory of Petri Nets 2004, volume 3099 of Lecture Notes in Computer Science. Springer-Verlag, 2004.

  • A. Atserias. Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms. Theoretical Computer Science, 295(1–3):27–39, 2003.

  • A. Atserias and V. Dalmau. A combinatorial characterization of resolution width. In 18th IEEE Conference on Computational Complexity (CCC), pages 239–247. IEEE Computer Society Press, 2003.

  • Ricardo A. Baeza-Yates, Joaquim Gabarró, and Xavier Messeguer. Fringe analysis of synchronized parallel insertion algorithms in 2-3 trees. Theor. Comput. Sci., 1-3(299):231–271, 2003.

  • J. Carmona and J. Cortadella. ILP models for the synthesis of asynchronous control circuits. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 818–825, 2003.

  • R. Clarisó and J. Cortadella. Verification of timed circuits with symbolic delays. In Proc. International Workshop on Logic Synthesis, pages 310–317, 2003.

  • J. Cortadella, A. Kondratyev, L. Lavagno, and C. Sotiriou. A concurrent model for de-synchronization. In Proc. International Workshop on Logic Synthesis, pages 294–301, 2003.

  • J. Cortadella, A. Kondratyev, L. Lavagno, and Y. Watanabe. Quasi-static scheduling for concurrent architectures. In Int. Conf. on Application of Concurrency to System Design, pages 29–40, 2003.

  • Jordi Cortadella. Timing-driven logic bi-decomposition. IEEE Transactions on Computer-Aided Design, 22(6):675–685, 2003.

  • J. Delgado, J. M. Pujol, and R. Sangüesa. Emergence of coordination in scale-free networks. Web Intelligent and Agent Systems, pages 131–138, 2003.

  • E. D. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikós. Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs. In 30th International Colloquium on Automata, Languages and Programming (ICALP'03), volume 2719 of Lecture Notes in Computer Science. Springer, 2003.

  • J. Díaz, N. Do, M. Serna, and N. Wormald. Bounds on the max and min bixection of random cubic and 4-regular graphs. Theoretical Computer Science, 307(3):531–547, 2003. <b>Selected papers in honor of Lawrence Harper</b>.

  • J. Díaz, J. Petit, and M. Serna. Evaluation of basic protocols for optical smart dust networks. In K. Jansen, M. Margraf, M. Mastrolli, and J. Rolim, editors, Experimental and Efficient Algorithms, volume 2647 of Lecture Notes in Computer Science, pages 97–106, Berlin, 2003. Springer–Verlag.

  • Hartmut Ehrig, Fernando Orejas, Benjamin Braatz, Markus Klein, and Martti Piirainen. A component framework based on high-level replacement systems. Electr. Notes Theor. Comput. Sci., 72(3), 2003.

  • Domènec Farré, Roman Roset, Mario Huerta, José E. Adsuara, Llorenç Roselló, M. Mar Albà, and Xavier Messeguer. Identification of patterns in biological sequences at the ALGGEN server: PROMO and MALGEN. Nucleic Acids Research, 31(13):3651–3653, 2003.

  • F. V. Fomin and D. M. Thilikós. Dominating sets and local treewidth. In 11th Annual European Symposium on Algorithms (ESA'03), volume 2832 of Lecture Notes in Computer Science, pages 221–229, Budapest, Hungary, 2003. Springer.

  • F. V. Fomin and D. M. Thilikós. Dominating sets in planar graphs: branchwidth and exponential speed-up. In 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), pages 168–177, 2003.

  • G. Arzhantseva, J. Díaz, J. Petit, J. Rolim and M. Serna. International workshop on ambient intelligence Computing, chapter Broadcasting on networks of sensors communicating through directional antenas. CTI Press, 2003.

  • J Gabarró, A. Stewart, M. Clint, E. Boyle, and I. Vallejo. Computational models for web- and grid-based computation. In Parallel Processing, 9th International Euro-Par Conference (Euro-Par 2003), volume 2790 of Lecture Notes in Computer Science, pages 640–650, Klagenfurt, Austria, 2003. Springer.

  • J. Petit J. Díaz and M. Serna. A random graph model for optical networks of sensors. IEEE transactions on mobile computing, 2(3):186–196, 2003.

  • H. Jung, P. Spirakis, and M. Serna. An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. Theoretical Computer Science, 292(3):639–652, 2003.

  • C. Martínez and X. Molinero. Generic algorithms for the generation of combinatorial objects. In Branislav Rovan and Peter Vojtás, editors, Mathematical Foundations of Computer Science 2003 (28th International Symposium, MFCS 2003; Bratislava, Slovakia, August 2003; Proceedings), pages 572–581. Springer, 2003.

  • C. Martínez and X. Molinero. An efficient generic algorithm for the generation of unlabelled cycles. Technical Report 35, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, LSI-03-35-R, 2003.

  • C. Martínez and X. Molinero. Generic algorithms for the generation of combinatorial objects. Technical Report 34, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, LSI-03-34-R, 2003.

  • Fernando Orejas and Hartmut Ehrig. Components for algebra transformation systems. Electr. Notes Theor. Comput. Sci., 82(7), 2003.

  • J. Petit. Combining spectral sequencing and parallel simulated annealing for the MinLA problem. Parallel Processing Letters, 13(1):77–91, 2003.

  • Roman Roset, Juan A. Subirana, and Xavier Messeguer. MREPATT: detection and analysis of exact consecutive repeats in genomic sequences. Bioinformatics, 19(18):2475–2476, 2003.

  • Julio Rozas, Juan C. Sánchez-DelBarrio, Xavier Messeguer, and Ricardo Rozas. DnaSP, DNA polymorphism analyses by the coalescent and other methods. Bioinformatics, 19(18):2496–2497, 2003.

  • Gabriel Valiente. A new simple algorithm for the maximum-weight independent set problem on circle graphs. In Proc. 14th Ann. Int. Symp. Algorithms and Computation, volume 2906 of Lecture Notes in Computer Science, pages 126–135. Springer-Verlag, 2003.

  • Gabriel Valiente. Constrained tree inclusion. In Proc. 14th Ann. Symp. Combinatorial Pattern Matching, volume 2676 of Lecture Notes in Computer Science, pages 361–371. Springer-Verlag, 2003.

  • E. Alba, F. Almeida, M. Blesa, J. Cabeza, C. Cotta, M. Díaz, I. Dorta, J. Gabarró, C. León, J. Luna, L. Moreno, C. Pablos, J. Petit, A. Rojas, and F. Xhafa. MALLBA: A library of skeletons for combinatorial optimisation. In Euro-Par 2002. Parallel Processing : 8th International Euro-Par Conference, volume 2400 of Lecture Notes in Computer Science, pages 927–932, Paderborn, Germany, 2002. Springer-Verlag GmbH.

  • C. Àlvarez, M. Blesa, and M. Serna. Universal stability of undirected graphs in the adversarial queueing model. In 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA'02), pages 183–197, Winnipeg, Canada, 2002. ACM Press New York, NY, USA.

  • A. Atserias. Unsatisfiable random formulas are hard to certify. In 17th IEEE Symposium on Logic in Computer Science, pages 325–334, 2002. <b>Kleene award for best student paper</b>.

  • A. Atserias and M. L. Bonet. On the automatizability of resolution and related propositional proof systems. In Computer Science Logic '2002, 16th Annual Conference of the EACSL, volume 2471 of Lecture Notes in Computer Science, pages 569–583. Springer, 2002.

  • A. Atserias, M. L. Bonet, and J. L. Esteban. Lower bounds for the weak pigeonhole principle and random formulas beyond resolution. Information and Computation, 176(2):136–152, 2002.

  • A. Atserias, N. Galesi, and P. Pudlák. Monotone simulations of nonmonotone proofs. Journal of Computer and System Sciences, 65:626–638, 2002.

  • M. J. Blesa, Ll. Hernàndez, and F. Xhafa. Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition. In M. Paprzycki J. Dongarra and J. Wasniewski, editors, 4th International Conference on Parallel Processing and Applied Mathematics (PPAM'01), volume 2328 of Lecture Notes in Computer Science, pages 185–193, Naleczow, Poland, 2002. Springer–Verlag.

  • J. Carmona and J. Cortadella. Input/output compatibility of reactive systems. In M. Aagaard and J. W. O'Leary, editors, International Conference on Formal Methods in Computer-Aided Design (FMCAD), volume 2517 of Lecture Notes in Computer Science, pages 360–377. Springer-Verlag, 2002.

  • Josep Carmona, Jordi Cortadella, and Enric Pastor. Synthesis of reactive systems: Application to asynchronous circuit design. In Advances in Concurrency and Hardware Design, volume 2549 of Lecture Notes in Computer Science, pages 108–151. Springer-Verlag, 2002.

  • Josep Carmona, Jordi Cortadella, and Enric Pastor. A structural encoding technique for the synthesis of asynchronous circuits. Fundamenta Informaticae, 50(2):135–154, 2002.

  • R. Clarisó, J. Cortadella, A. Kondratyev, L. Lavagno, C. Passerone, and Y. Watanabe. Synthesis of embedded software for reactive systems. In Int. Workshop on Integration of Specification Techniques for Applications in Engineering (Satellite event of ETAPS 2002), pages 2–20, 2002.

  • J. Cortadella. Bi-decomposition and tree-height reduction for timing optimization. In Proc. International Workshop on Logic Synthesis, 2002.

  • Jordi Cortadella, Michael Kishinevsky, Steve M. Burns, Alex Kondratyev, Luciano Lavagno, Ken S. Stevens, Alexander Taubin, and Alexandre Yakovlev. Lazy transition systems and asynchronous circuit synthesis with relative timing assumptions. IEEE Transactions on Computer-Aided Design, 21(2):109–130, 2002.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. Logic synthesis of asynchronous controllers and interfaces. Advanced Microelectronics. Springer-Verlag, 2002.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Claudio Passerone, and Yosinori Watanabe. Quasi-static scheduling of independent tasks for reactive systems. In Application and Theory of Petri Nets 2002, volume 2360 of Lecture Notes in Computer Science, pages 80–99. Springer-Verlag, 2002.

  • J. Díaz, N. Do, M. Serna, and N. Wormald. Bisection of random cubic graphs. In 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2002), volume 2483 of Lecture Notes in Computer Science, pages 114–125, 2002.

  • J. Díaz, J. Nesetril, M. Serna, and D. Thilikos. H-colorings of large degree graph. In First EurAsian Conference on Advances in Information and Communication Technology (EURASIA-ICT 2002), volume 2510 of Lecture Notes in Computer Science, pages 850–857, 2002.

  • J. Díaz, J. Petit, and M. Serna. A survey on graph layout problems. ACM Computing Surveys, 34(3):313–356, 2002.

  • J. Díaz, M. Serna, and D. M. Thilikos. The complexity of restrictive H-coloring. In 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), Lecture Notes in Computer Science, 2002.

  • J. Díaz, M. J. Serna, and D. M. Thilikos. Counting H-colorings of partial k-trees. Theoretical Computer Science, 281:291–309, 2002. <b>Selected papers in honour of Maurice Nivat</b>.

  • Amalia Duch and Conrado Martínez. On the average performance of orthogonal range search in multidimensional data structures. Journal of Algorithms, 44(1):226–245, 2002.

  • Amalia Duch and Conrado Martínez. On the average performance of orthogonal range search in multidimensional data structures. In Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Proceedings, volume 2380 of Lecture Notes in Computer Science, pages 514–524. Springer, 2002.

  • X. Franch, J. Marco, X. Molinero, J. Petit, and F. Xhafa. Informàtica Bàsica. Edicions UPC, third edition, 2002.

  • X. Franch and X. Molinero. Informàtica Bàsica. Edicions UPC, second edition, 2002.

  • Joaquim Gabarró, Alan Stewart, and Maurice Clint. Grab and Go system: a CPO approach to concurrent web and grid-based computation. Electronic Notes in Theoretical Computer Science, 66(3), 2002.

  • Javier Larrosa and Gabriel Valiente. Constraint satisfaction algorithms for graph pattern matching. Mathematical Structures in Computer Science, 12(4):403–422, 2002.

  • Conrado Martínez, Daniel Panario, and Alfredo Viola. Analysis of quickfind with small subfiles. In Mathematics and computer science, II (Versailles, 2002), Trends Math., pages 329–340. Birkhäuser, Basel, 2002.

  • Xavier Messeguer, Ruth Escudero, Domènec Farré, Oscar Núñez, Javier Martínez, and M. Mar Albà. PROMO: detection of known transcription regulatory elements using species-tailored searches. Bioinformatics, 18(2):333–334, 2002.

  • M. A. Peña, J. Cortadella, E. Pastor, and A. Smirnov. A case study for the verification of complex timed circuits: IPCMOS. In Proc. Design, Automation and Test in Europe (DATE), pages 44–51, 2002.

  • J. Petit. Hamiltonian cycles in faulty random geometric networks. In C. Kaklamanis, editor, Proceedings of the 2nd International Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE 2001), volume 12 of Proceedings in Informatics, pages 97–110, Canada, 2002. Carleton Scientific.

  • Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, Luciano Lavagno, Takashi Nanya, and Alexander Yakovlev. Design of asynchronous controllers with delay insensitive interface. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E85-A(12):2577–2585, 2002.

  • N Santiago, C Herraiz, J. R. Goñi, X Messeguer, and J. M. Casacuberta. Genome-wide analysis of the emigrant family of MITEs of arabidopsis thaliana. Journal of Molecular Biology and Evolution, 12(19):2285–2293, 2002.

  • M. Serna and F. Xhafa. The parallel approximability of the false and true Gates problems for NOR-circuits. Parallel Processing Letters, 12(1):127–136, 2002.

  • Gabriel Valiente. Algorithms on Trees and Graphs. Springer-Verlag, Berlin, 2002.

  • M. Serna Xhafa and F. Approximating scheduling unrelated parallel machines in parallel. Computational Optimization and Applications. An International Journal, 21(3):325–338, 2002.

  • Jordi Cortadella, Alexandre Yakovlev, and Grzegorz Rozenberg, editors. Advances in Concurrency and Hardware Design, volume 2549 of Lecture Notes in Computer Science. Springer-Verlag, 2002.

  • E. Alba, F. Almeida, M. Blesa, C. Cotta, M. Díaz, I. Dorta, J. Gabarró, J. González, C. León, L. Moreno, J. Petit, J. Roda, A. Rojas, and F. Xhafa. MALLBA: Towards a combinatorial optimization library for geographically distributed systems. In J. Duato, editor, Actas de las XII jornadas de paralelismo, number ISBN 84-9705-043-6 in Editorial Universitat Politècnica de València, pages 105–110, 2001.

  • C. Àlvarez, J. Díaz, and M. Serna. The hardness of intervalizing four colored caterpillars. Discrete Mathematics, 235:19–27, 2001.

  • A. Atserias. Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms. In Mathematical foundations of computer science, 2001 (Mariánské Láznĕ), volume 2136 of Lecture Notes in Comput. Sci., pages 148–158. Springer, Berlin, 2001.

  • A. Atserias, M. L. Bonet, and J. L. Esteban. Lower bounds for the weak pigeonhole principle beyond resolution. In 28th International Colloquium on Automata, Languages and Programming, volume 2076 of Lecture Notes in Computer Science, pages 1005–1016. Springer-Verlag, 2001.

  • A. Atserias, N. Galesi, and R. Gavaldà. Monotone proofs of the pigeon-hole principle. Mathematical Logic Quarterly, 47:461–474, 2001.

  • A. Atserias, N. Galesi, and P. Pudlák. Monotone simulations of nonmonotone proofs. In 16th IEEE Conference on Computational Complexity, pages 36–41, 2001.

  • S. Baumer, J. L. Esteban, and J. Torán. Minimally unsatisfiable CNF formulas. Bulletin of the European Association for Theoretical Computer Science, 74:190–, 2001. Technical Contributions.

  • M. J. Blesa, Ll. Hernàndez, and F. Xhafa. Parallel Skeletons for Tabu Search Method. In 8th International Conference on Parallel and Distributed Systems (ICPADS'01), pages 23–28, Kyongju City, Korea, 2001. IEEE Computer Society Press.

  • M. J. Blesa, P. Moscato, and F. Xhafa. A Memetic Algorithm for the Minimum Weighted k-Cardinality Tree Subgraph Problem. In 4th Metaheuristics International Conference, volume 1, pages 85–90, Porto, Portugal, 2001.

  • M. J. Blesa, J. Petit, and F. Xhafa. Computación en Internet: Librería MALLBA para problemas de optimización. In Ciencia y Tecnología, volume II, pages 9–12. Tibidabo Ediciones, Barcelona, 2001. ISBN: 84-8033-145-3.

  • M. J. Blesa and F. Xhafa. A Skeleton for the Tabu Search Metaheuristic with Applications to Problems in Software Engineering. In Software Engineering using Metaheuristic INnovative ALgorithms. Proceedings of the 23rd International Conference on Software Engineering, pages 23–31, Toronto, Canada, 2001. IEEE Computer Society Press.

  • Josep Carmona, Jordi Cortadella, and Enric Pastor. A structural encoding technique for the synthesis of asynchronous circuits. In Int. Conf. on Application of Concurrency to System Design, pages 157–166, 2001.

  • G. Cornetta and J. Cortadella. Asynchronous multipliers with variable-delay counters. In 8th IEEE Int. Conf. on Electronics, Circuits and Systems (ICECS), volume II, pages 701–705, 2001.

  • Gianluca Cornetta and Jordi Cortadella. A multi-radix approach to asynchronous division. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 25–34, 2001.

  • J. Díaz, D. Koukopoulos, S. E. Nikoletseas, M. Serna, P. G. Spirakis, and D. M. Thilikos. Stability and non-stability of the FIFO protocol. In 13th annual ACM symposium on Parallel algorithms and architectures (SPAA'01), pages 48–52, 2001.

  • J. Díaz, M. D. Penrose, J. Petit, and M. Serna. Approximating layout problems on random geometric graphs. Journal of Algorithms, 39(1):78–116, 2001.

  • J. Díaz, J. Petit, M. Serna, and L. Trevisan. Approximating layout problems on random graphs. Discrete Mathematics, 235(1–3):245–253, 2001.

  • J. Díaz, J. Petit, and M. J. Serna. A guide to concentration bounds. In J. H. Reif S. Rajasekaran, P. Pardalos and J. Rolim, editors, Handbook of Randomized Computing, volume II, pages 1–51. Kluwer, 2001.

  • J. Díaz, M. Serna, and D. M. Thilikos. (H,C,K)-coloring: Fast, easy and hard cases. In J. Sgall, A. Pultr, and P. Kolman, editors, Mathematical Foundations of Computer Science, volume 2136, pages 304–315. Lecture Notes in Computer Science, Springer-Verlag, 2001.

  • J. Díaz, M. Serna, and D. M. Thilikos. Counting H-colorings of partial k-trees. In Computing and combinatorics (Guilin, 2001), volume 2108 of Lecture Notes in Comput. Sci., pages 298–307. Springer, Berlin, 2001.

  • J. L. Esteban and J. Torán. Space bounds for resolution. Information and Computation, 171(1):84–97, 2001.

  • Mirtha-Lina Fernández and Gabriel Valiente. A graph distance measure combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters, 22(6–7):753–758, 2001.

  • Fedor V. Fomin and D. M. Thilikos. On the monotonicity of games generated by symmetric submodular functions. In Graph-theoretic concepts in computer science (Boltenhagen, 2001), volume 2204 of Lecture Notes in Comput. Sci., pages 177–188. Springer, Berlin, 2001.

  • X. Franch and X. Molinero. Informàtica Bàsica. Edicions UPC, first edition, 2001.

  • Ricard Gavaldà and Denis Thérien. Learning expressions over monoids. In STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, volume 2010 of Lecture Notes in Computer Science, pages 283–293. Springer, 2001.

  • C. Martínez and X. Molinero. Generic algorithms for the exhaustive generation of labelled objects. In Proc. Workshop on Random Generation of Combinatorial Structures and Bijective Combinatorics (GASCOM' 01), pages 53–58. Università degli Studi di Siena & Gruppo Nazionale per il Calcolo Scientifico, 2001.

  • C. Martínez and X. Molinero. A generic approach for the unranking of labeled combinatorial classes. Random Structures & Algorithms, 19(3-4):472–497, 2001.

  • C. Martínez, A. Panholzer, and H. Prodinger. Partial match queries in relaxed multidimensional search trees. Algorithmica. An International Journal in Computer Science, 29(1-2):181–204, 2001. Average-case analysis of algorithms (Princeton, NJ, 1998).

  • Conrado Martínez and Salvador Roura. Optimal sampling strategies in quicksort and quickselect. SIAM Journal on Computing, 31(3):683–705, 2001.

  • X. Molinero. Iterating through labelled combinatorial structures. In Proc. Workshop on EuroConference on Combinatorics, Graph Theory and Applications (COMB' 01), pages 229–232, 2001.

  • Enric Pastor, Jordi Cortadella, and Oriol Roig. Symbolic analysis of bounded Petri nets. IEEE Transactions on Computers, 50(5):432–448, 2001.

  • J. Petit. Layout Problems. PhD thesis, Universitat Politècnica de Catalunya, 2001.

  • S. Roura. A new method for balancing binary search trees. In Jan van Leewen, Fernando Orejas, and Paul G. Spirakis, editors, ICALP: Annual International Colloquium on Automata, Languages and Programming, volume 2076 of LNCS, pages 469–480. Springer, 2001.

  • Salvador Roura. Digital access to comparison-based tree data structures and algorithms. J. Algorithms, 40(1):1–23, 2001.

  • Salvador Roura. Improved master theorems for divide-and-conquer recurrences. Journal of the ACM, 48(2):170–205, 2001.

  • M. Serna, C. Àlvarez, R. Cases, and T. Lozano. Els límits de la computació: Indecidibilitat i NP-completessa. Edicions UPC, 2001.

  • M. Serna and Fatos Xhafa. The parallel approximability of a subclass of quadratic programming. Theoretical Computer Science, 259(1-2):217–231, 2001.

  • A. Stewart, M. Clint, J. Gabarró, and M. Serna. Towards formally refining BSP barriers into explicit two-sided communications. In 7th Euro-Par Conference on Parallel and Distributed Computing (EURO-PAR 2001), volume 2510 of Lecture Notes in Computer Science, pages 850–857. Springer, 2001.

  • D. M. Thilikos, M. J. Serna, and Hans L. Bodlaender. A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. In Algorithms—ESA 2001 (Århus), volume 2161 of Lecture Notes in Comput. Sci., pages 380–390. Springer, Berlin, 2001.

  • Gabriel Valiente. An efficient bottom-up distance between trees. In Proc. 8th Int. Symposium on String Processing and Information Retrieval, pages 212–219. IEEE Computer Science Press, 2001.

  • Gabriel Valiente. A general method for graph isomorphism. In Proc. 13th Int. Symposium on Fundamentals of Computation Theory, volume 2138 of Lecture Notes in Computer Science, pages 428–431. Springer-Verlag, 2001.

  • C. Àlvarez, R. Cases, J. Díaz, J. Petit, and M. Serna. Routing trees for random graphs. In J. Rolim, editor, ICALP Workshops 2000, volume 8 of Proceedings in Informatics, pages 99–110, Canada, 2000. Carleton Scientific.

  • C. Àlvarez, J. Díaz, and M. J. Serna. Modelos de grafos para la web. In A. Martinon (ed.), editor, Las Matemáticas del siglo XX, pages 477–481. Nivola, 2000.

  • C. Àlvarez and R. Greenlaw. A compendium of problems complete for symmetric logarithmic space. Computational Complexity, 9(2):123–145, 2000.

  • V. Arvind, R. Beigel, and A. Lozano. The complexity of modular graph automorphism. SIAM Journal on Computing, 30(4):1299–1320, 2000.

  • A. Atserias. The descriptive complexity of the fixed-points of bounded formulas. In Computer science logic (Fischbachau, 2000), volume 1862 of Lecture Notes in Computer Science, pages 172–186. Springer, Berlin, 2000.

  • A. Atserias, N. Galesi, and R. Gavaldà. Monotone proofs of the pigeon hole principle. In Automata, languages and programming (Geneva, 2000), volume 1853 of Lecture Notes in Comput. Sci., pages 151–162. Springer, Berlin, 2000.

  • Ricardo Baeza-Yates and Gabriel Valiente. An image similarity measure based on graph matching. In Proc. 7th Int. Symposium on String Processing and Information Retrieval, pages 28–38. IEEE Computer Science Press, 2000.

  • M. J. Blesa and F. Xhafa. A C++ Implementation of Tabu Search for k-Cardinality Tree Problem based on Generic Programming and Component Reuse. In c/o tranSIT GmbH, editor, Net.ObjectDays 2000 Tagungsband, pages 648–652, Erfurt, Germany, 2000. Net.ObjectDays-Forum.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. Hardware and Petri nets: Application to asynchronous circuit design. In Application and Theory of Petri Nets 2000, volume 1825 of Lecture Notes in Computer Science, pages 1–15. Springer-Verlag, 2000.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Marc Massot, Sandra Moral, Claudio Passerone, Yosinori Watanabe, and Alberto Sangiovanni-Vincentelli. Task generation and compile-time scheduling for mixed data-control embedded software. In Proc. ACM/IEEE Design Automation Conference, pages 489–494, 2000.

  • Jordi Cortadella and Gabriel Valiente. A relational view of subgraph isomorphism. In Proc. International Seminar on Relational Methods in Computer Science, pages 45–54, 2000.

  • N. D. Dendris, L. M. Kirousis, Y. C. Stamatiou, and D. M. Thilikos. On parallel partial solutions and approximation schemes for local consistency in networks of constraints. Constraints. An International Journal, 5(3):251–273, 2000.

  • J. Díaz, M. D. Penrose, J. Petit, and M. Serna. Convergence theorems for some layout measures on random lattice and random geometric graphs. Combinatorics, Probability and Computing, 9:489–511, 2000.

  • J. Díaz, J. Petit, and M. Serna. Faulty random geometric networks. Parallel Processing Letters, 10(4):343–357, 2000.

  • S. Díaz, J. L. Esteban, and M. Ogihara. A DNA-based random walk method for solving k-SAT. In DNA Computing, 6th international Workshop on DNA-Based Computers, DNA 2000, Leiden, The Netherlands, June 2000, volume 2054 of Lecture Notes in Computer Science, pages 181–191. Leiden center for natural computing, Springer Verlag, Berlin, Heidelberg, New York, 2000.

  • Hans-Jörg Kreowski and Gabriel Valiente. Redundancy and subsumption in high-level replacement systems. In Proc. 6th Int. Workshop on Theory and Application of Graph Transformations, volume 1764 of Lecture Notes in Computer Science, pages 215–227. Springer-Verlag, 2000.

  • C. Martínez and X. Molinero. Unranking of labelled combinatorial structures. In D. Krob, A. A. Mikhalev, and A. V. Mikhalev, editors, Proc. of the 12th Int. Conf. on Formal Power Series and Algebraic Combinatorics (FPSAC' 00), pages 288–299. Springer-Verlag, 2000.

  • C. Martínez and S. Roura. On the competitiveness of the move-to-front rule. Theoretical Computer Science, 242:313–325, 2000.

  • Conrado Martínez and Xavier Molinero. Ordered generation of combinatorial structures. In Actes II Jornades de Matemàtica Discreta i Algorísmica (JDMA2), pages 73–76, 2000.

  • N. Nishimura, P. Ragde, and D. M. Thilikos. On graph powers for leaf-labeled trees. In Algorithm theory—SWAT 2000 (Bergen), volume 1851 of Lecture Notes in Comput. Sci., pages 125–138. Springer, Berlin, 2000.

  • Marco A. Peña, Jordi Cortadella, Alex Kondratyev, and Enric Pastor. Formal verification of safety properties in timed circuits. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 2–11, 2000.

  • D. M. Thilikos. Algorithms and obstructions for linear-width and related search parameters. Discrete Applied Mathematics. Combinatorial Algorithms, Optimization and Computer Science, 105(1-3):239–271, 2000.

  • D. M. Thilikos, M. J. Serna, and Hans L. Bodlaender. Constructive linear time algorithms for small cutwidth and carving-width. In Algorithms and computation (Taipei, 2000), volume 1969 of Lecture Notes in Comput. Sci., pages 192–203. Springer, Berlin, 2000.

  • A. Atserias and Ph. G. Kolaitis. First-order logic vs. fixed-point logic in finite set theory. In 14th IEEE Symposium on Logic in Computer Science, pages 275–284, 1999.

  • H. L. Bodlaender and D. M. Thilikos. Graphs with branchwidth at most three. Journal of Algorithms, 32(2):167–194, 1999.

  • Peter Burmeister, Miquel Monserrat, Francesc Rosselló, and Gabriel Valiente. Algebraic transformation of unary partial algebras II: Single-pushout approach. Theoretical Computer Science, 216(1–2):311–362, 1999.

  • Gianluca Cornetta and Jordi Cortadella. A radix-16 SRT division unit with speculation of quotient digits. In Proc. of the Great Lakes Symposium on VLSI, pages 74–77, 1999.

  • Jordi Cortadella, Michael Kishinevsky, Steven M. Burns, and Ken Stevens. Synthesis of asynchronous control circuits with automatically generated timing assumptions. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 324–331, 1999.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Enric Pastor, and Alexandre Yakovlev. Decomposition and technology mapping of speed-independent circuits using Boolean relations. IEEE Transactions on Computer-Aided Design, 18(9):1221–1236, 1999.

  • J. Díaz, M. D. Penrose, J. Petit, and M. Serna. Layout problems on lattice graphs. In Computing and combinatorics (Tokyo, 1999), volume 1627 of Lecture Notes in Comput. Sci., pages 103–112. Springer, Berlin, 1999.

  • J. Díaz, M. D. Penrose, J. Petit, and M. J. Serna. Linear orderings of random geometric graphs. In P. Widmayer, G. Neyer, and S. Eidenbenz, editors, Graph Theoretic Concepts in Computer Science, volume 1665 of Lecture Notes in Computer Science, pages 291–302. Springer-Verlag, 1999.

  • J. Díaz, M. Serna, and P. Spirakis. Linear and non-linear systems: a survey. In Contemporary trends in discrete mathematics. From DIMACS and DIMATIA to the Future, pages 29–47. Amer. Math. Soc., Providence, RI, 1999.

  • J. L. Esteban and J. Torán. Space bounds for resolution. Lecture Notes in Computer Science, 1563:551–560, 1999.

  • Alex Kondratyev, Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, and Alexander Yakovlev. Logic decomposition of speed-independent circuits. Proceedings of the IEEE, 87(2):347–362, 1999.

  • Alex Kondratyev, Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, and Alexander Yakovlev. Automatic synthesis and optimization of partially specified asynchronous systems. In Proc. ACM/IEEE Design Automation Conference, pages 110–115, 1999.

  • N. Nishimura, P. Ragde, and D. M. Thilikos. Finding smallest supertrees under minor containment. In Graph-theoretic concepts in computer science (Ascona, 1999), volume 1665 of Lecture Notes in Comput. Sci., pages 303–312. Springer, Berlin, 1999.

  • Enric Pastor, Jordi Cortadella, and Marco A. Peña. Structural methods to improve the symbolic analysis of petri nets. In Application and Theory of Petri Nets 1999, volume 1639 of Lecture Notes in Computer Science, pages 26–45. Springer-Verlag, 1999.

  • S. Roura. Improving mergesort for linked lists. In J. Nesetril, editor, Proc. of the 7th European Symposium on Algorithms (ESA), volume 1643 of LNCS, pages 267–276. Springer, 1999.

  • Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, Luciano Lavagno, and Alexander Yakovlev. What is the cost of delay insensitivity? In Proc. International Conf. Computer-Aided Design (ICCAD), pages 316–323, 1999.

  • Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, Luciano Lavagno, and Alexander Yakovlev. Bridging modularity and optimality: delay-insensitive interfacing in asynchronous circuits synthesis. In Proc. IEEE International Conference on Systems, Man and Cybernetics (SMC), volume 3, pages 899–904, 1999.

  • Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, Luciano Lavagno, and Alexander Yakovlev. What is the cost of delay insensitivity? In Proc. of the Workshop Hardware Design and Petri Nets (within the International Conference on Application and Theory of Petri Nets), pages 169–189, 1999.

  • Fermín Sánchez and Jordi Cortadella. Optimal exploration of the unrolling degree for software pipelining. Journal of Systems Architecture, 45(6–7):505–517, 1999.

  • M. Serna and Fatos Xhafa. On the average case complexity of some P-complete problems. Theoretical Informatics and Applications. Informatique Théorique et Applications, 33(1):33–45, 1999.

  • Ken Stevens, Shai Rotem, Steven M. Burns, Jordi Cortadella, Ran Ginosar, Michael Kishinevsky, and Marly Roncken. CAD directions for high performance asynchronous circuits. In Proc. ACM/IEEE Design Automation Conference, pages 116–121, 1999.

  • A. Taubin, A. Kondratyev, J. Cortadella, and L. Lavagno. Behavioral transformations to increase the noise immunity of asynchronous specifications. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 36–47, 1999.

  • A. Taubin, A. Kondratyev, J. Cortadella, and L. Lavagno. Crosstalk noise avoidance in asynchronous circuits. In Proc. International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (TAU), pages 123–128, 1999.

  • K. Yamazaki, H. L. Bodlaender, B. de Fluiter, and D. M. Thilikos. Isomorphism for graphs of bounded distance width. Algorithmica. An International Journal in Computer Science, 24(2):105–127, 1999.

  • R. Baeza-Yates, J. Gabarró, and X. Messeguer. Fringe analysis of synchronized parallel algorithms on 2-3 trees. In Randomization and approximation techniques in computer science (Barcelona, 1998), pages 131–144. Springer, Berlin, 1998.

  • J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, A. Taubin, and A. Yakovlev. Lazy transition systems: application to timing optimization of asynchronous circuits. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 324–331, 1998.

  • Jordi Cortadella. Combining structural and symbolic methods for the verification of concurrent systems. In Int. Conf. on Application of Concurrency to System Design, pages 2–7, 1998.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. Automatic handshake expansion and reshuffling using concurrency reduction. In Proc. of the Workshop Hardware Design and Petri Nets (within the International Conference on Application and Theory of Petri Nets), pages 86–110, 1998.

  • Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, and Alexandre Yakovlev. Deriving Petri nets from finite transition systems. IEEE Transactions on Computers, 47(8):859–882, 1998.

  • J. Díaz, J. Petit, P. Psycharis, and M. Serna. A parallel algorithm for sampling matchings from an almost uniform distribution. In Kyung-Yong Chwa and Oscar H. Ibarra, editors, Algorithms and Computation, number 1533 in Lecture Notes in Computer Science, pages 457–466, Berlin, 1998. Springer–Verlag.

  • J. Díaz, J. Petit, and M. Serna. Random geometric problems on [0,1]2. In J. Rolim, M. Luby, and M. Serna, editors, Randomization and Approximation Techniques in Computer Science, volume 1518 of Lecture Notes in Computer Science, pages 294–306, Berlin, 1998. Springer–Verlag.

  • J. Díaz and M. J. Serna. Algorítmica per a paral.lelisme massiu. Edicions Virtuals Universitat Politècnica de Catalunya, Barcelona, 1998.

  • J. Díaz, M. J. Serna, and P. Spirakis. On the random generation and counting of matchings in dense graphs. Theoretical Computer Science, 201:281–290, 1998.

  • Amalia Duch, Valdimir Estivill-Castro, and Conrado Martínez. Randomized K-dimensional binary search trees. In K. Y. Chwa and O. H. Ibarra, editors, Proceedings of the 9th International Symposium on Algorithms and Computation, volume 1533 of Lecture Notes in Computer Science, pages 199–208. Springer, 1998.

  • Joaquim Gabarró and Xavier Messeguer. Parallel dictionaries with local rules on AVL and brother trees. Information Processing Letters, 68(2):79–85, 1998.

  • M. Kishinevsky, J. Cortadella, and A. Kondratyev. Asynchronous interface specification, analysis and synthesis. In Proc. ACM/IEEE Design Automation Conference, pages 2–7, 1998.

  • A. Kondratyev, J. Cortadella, M. Kishinevsky, L. Lavagno, A. Taubin, and A. Yakovlev. Identifying state coding conflicts in asynchronous system specifications using Petri net unfoldings. In Int. Conf. on Application of Concurrency to System Design, pages 152–163, 1998.

  • A. Kondratyev, M. Kishinevsky, A. Taubin, J. Cortadella, and L. Lavagno. The use of Petri nets for the design and verification of asynchronous circuits and systems. Journal of Circuits Systems and Computers, 8(1):67–118, 1998.

  • Tomás Lang, Enric Musoll, and Jordi Cortadella. Extension of the working-zone-encoding method to reduce also the energy on the microprocessor data bus. In Proc. International Conf. Computer Design (ICCD), pages 414–419, 1998.

  • A. Lozano and V. Raghavan. On the complexity of counting the number of vertices moved by graph automorphisms. In Foundations of software technology and theoretical computer science (Chennai, 1998), pages 295–306. Springer, Berlin, 1998.

  • C. Martínez and S. Roura. Optimal sampling strategies in quicksort. In Kim G. Larsen, Sven Skyum, and Glynn Winskel, editors, ICALP: Annual International Colloquium on Automata, Languages and Programming, volume 1443 of LNCS, pages 327–338. Springer, 1998.

  • Conrado Martínez, Alois Panholzer, and Helmut Prodinger. On the number of descendants and ascendants in random search trees. Electronic Journal of Combinatorics, 5(1):Research Paper 20, 36 pp. (electronic), 1998.

  • Conrado Martínez and Salvador Roura. Randomized binary search trees. Journal of the ACM, 45(2):288–323, 1998.

  • X. Molinero. Lexicographic and boustrophedonic product in unrank. Technical Report 36, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, LSI-98-36-R, 1998.

  • Enric Musoll and Jordi Cortadella. Register-transfer level transformations for low-power data-paths. Integrated Computer-Aided Engineering, 5(4):315–332, 1998.

  • Enric Musoll, Tomás Lang, and Jordi Cortadella. Working-zone encoding for reducing the energy in microprocessor address buses. IEEE Transactions on VLSI Systems, 6(4):568–572, 1998.

  • Enric Musoll, Tomás Lang, and Jordi Cortadella. Reducing the energy of address and data buses with the working-zone encoding technique and its effect on multimedia applications. In Proc. of the Power Driven Microarchitecture Workshop, pages 3–8, 1998.

  • Enric Pastor and Jordi Cortadella. Structural methods applied to the symbolic analysis of Petri nets. In Proc. International Workshop on Logic Synthesis, 1998.

  • Enric Pastor and Jordi Cortadella. Efficient encoding schemes for symbolic analysis of Petri nets. In Proc. Design, Automation and Test in Europe (DATE), pages 790–795, 1998.

  • Enric Pastor, Jordi Cortadella, Alex Kondratyev, and Oriol Roig. Structural methods for the synthesis of speed-independent circuits. IEEE Transactions on Computer-Aided Design, 17(11):1108–1129, 1998.

  • J. Petit. Approximation heuristics and benchmarkings for the MinLA problem. In R. Battiti and A. Bertossi, editors, Alex '98 — Building bridges between theory and applications, pages 112–128. Università di Trento, 1998.

  • Fermín Sánchez and Jordi Cortadella. Reducing register pressure in software pipelining. Journal of Information Science and Engineering (special issue on Compiler Techniques for High-Performace Computing), 14(1):265–279, 1998.

  • M. Serna, L. Trevisan, and F. Xhafa. The (parallel) approximability of non-Boolean satisfiability problems and restricted integer programming. In STACS 98 (Paris, 1998), pages 488–498. Springer, Berlin, 1998.

  • Luca Trevisan and Fatos Xhafa. The parallel complexity of positive linear programming. Parallel Processing Letters, 8(4):527–533, 1998.

  • Fatos Xhafa. On Parallel versus Sequential Approximability: Complexity and Approximation Results. PhD thesis, Universitat Politècnica de Catalunya, December 1998. Maria Serna, advisor.

  • M. Luby, J. Rolim, and M. Serna, editors. Randomization and Approximation Techniques in Computer Science (RANDOM 98), volume 1518 of Lecture Notes in Computer Science. Springer, 1998.

  • José L. Balcázar, Josep Díaz, Ricard Gavaldà, and Osamu Watanabe. Algorithms for learning finite automata from queries: a unified view. In Advances in algorithms, languages, and complexity, pages 53–72. Kluwer Acad. Publ., Dordrecht, 1997.

  • Luc Bougé, Joaquim Gabarró, Xavier Messeguer, and Nicolas Schabanel. Concurrent rebalancing of ACL trees: A fine-grained approach. In 3rd International Euro-Par Conference, volume 1300 of Lecture Notes in Computer Science, pages 421–429, Passau, Germany, 1997. Springer.

  • Peter Burmeister, Francesc Rosselló, Joan Torrens, and Gabriel Valiente. Algebraic transformation of unary partial algebras I: Double-pushout approach. Theoretical Computer Science, 184(1–2):145–193, 1997.

  • J. Castro, D. Guijarro, and Lavín V. Learning nearly monotone k-term DNF. In S. Ben-David, editor, EUROCOLT, volume 1208 of LNAI, pages 162–170. Springer, 1997.

  • J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers. IEICE Transactions on Information and Systems, E80-D(3):315–325, 1997.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Enric Pastor, and Alexandre Yakovlev. Decomposition and technology mapping of speed-independent circuits using Boolean relations. In Proc. International Conf. Computer-Aided Design (ICCAD), 1997.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alex Yakovlev. Technology mapping of speed-independent circuits based on combinational decomposition and resynthesis. In Proc. European Design and Test Conference, pages 98–105, 1997.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. A region-based theory for state assignment in speed-independent circuits. IEEE Transactions on Computer-Aided Design, 16(8):793–812, 1997.

  • Jordi Cortadella, Luciano Lavagno, and Ellen Sentovich. Logic synthesis techniques for embedded control code optimization. In Proc. International Workshop on Logic Synthesis, 1997.

  • J. Delgado and R. V. Sole. Collective-induced computation. Physical Review E, 55:2338–2344, 1997.

  • J. Delgado and R. V. Sole. Noise induced transitions in fluid neural networks. Physics Letters A, 229:183–189, 1997.

  • J. Díaz, A. Gibbons, G. Pantziou, M. Serna, P. Spirakis, and J. Torán. Parallel algorithms for the minimum cut and the minimum length tree layout problems. Theoretical Computer Science, 181(2):267–287, 1997.

  • J. Díaz, A. Gibbons, G. E. Pantziou, M. J. Serna, P. G. Spirakis, and J. Toran. Parallel algorithms for the minimum cut and the minimum length tree layout problems. Theoretical Computer Science, 181(2):267–287, 1997.

  • J. Díaz, M. Serna, P. Spirakis, and J. Torán. Paradigms for fast parallel approximability. Cambridge University Press, Cambridge, 1997.

  • Philippe Flajolet, Xavier Gourdon, and Conrado Martínez. Patterns in random binary search trees. Random Structures & Algorithms, 11(3):223–244, 1997.

  • J. Gabarró and J. Petit. ParaDict, a data parallel library for dictionaries (extended abstract). In Euromicro Workshop on Parallel and Distributed Processing, pages 163–170. IEEE Computer Society Press, 1997.

  • Joaquim Gabarró and Xavier Messeguer. A unified approach to concurrent and parallel algorithms on balanced data structures (invited paper). In SCCC, pages 78–92, 1997.

  • Joaquim Gabarró, Xavier Messeguer, and Daniel Riu. Concurrent rebalancing on hyperred-black trees. In SCCC, pages 93–104, 1997.

  • D. Guijarro, Lavín V., and V. Raghavan. Learning monotone term decision lists. In S. Ben-David, editor, EUROCOLT, volume 1208 of LNCS/LNAI, pages 16–26. Springer, 1997.

  • P. Kirschenhofer, H. Prodinger, and C. Martínez. Analysis of Hoare's FIND algorithm with median-of-three partition. Random Structures & Algorithms, 10(1-2):143–156, 1997. Average-case analysis of algorithms (Dagstuhl, 1995).

  • Michael Kishinevsky, Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Alexander Taubin, and Alex Yakovlev. Coupling asynchrony and interrupts: Place chart nets and their synthesis. In Pierre Azéma and Gianfranco Balbo, editors, Application and Theory of Petri Nets 1997, volume 1248 of Lecture Notes in Computer Science, pages 328–347. Springer-Verlag, Toulouse, France, 1997.

  • Alex Kondratyev, Michael Kishinevsky, Jordi Cortadella, Luciano Lavagno, and Alex Yakovlev. Technology mapping for speed-independent circuits: decomposition and resynthesis. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 240–253. IEEE Computer Society Press, 1997.

  • Tomás Lang, Enric Musoll, and Jordi Cortadella. Individual flip-flops with gated clocks for low-power datapaths. IEEE Transactions on Circuits and Systems II, 44(6):507–516, 1997.

  • Luciano Lavagno, Jordi Cortadella, and Alberto Sangiovanni-Vincentelli. Embedded code optimization via common control structure detection. In International Workshop on Hardware/Software Co-Design (Codes/CASHE), 1997.

  • Xavier Messeguer. Skip trees, an alternative data structure to skip lists in a concurrent approach. RAIRO Informatique Théorique et Applications. Theoretical Informatics and Applications, 31(3):251–269, 1997.

  • X. Molinero. Unranking of combinatorial structures. Technical Report 30, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, LSI-97-30-R, 1997.

  • X. Molinero. Unranking of combinatorial structures. Technical Report 3, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, LSI-97-3-T, 1997.

  • Enric Musoll, Tomás Lang, and Jordi Cortadella. Exploiting the locality of memory references to reduce the address bus energy. In International Symposium on Low Power Electronics and Design, pages 202–207, 1997.

  • Oriol Roig, Jordi Cortadella, Marco A. Peña, and Enric Pastor. Automatic generation of synchronous test patterns for asynchronous circuits. In Proc. ACM/IEEE Design Automation Conference, pages 620–625, 1997.

  • S. Roura. An improved master theorem for divide-and-conquer recurrences. In Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, ICALP: Annual International Colloquium on Automata, Languages and Programming, volume 1256 of LNCS, pages 449–459. Springer, 1997.

  • S. Roura. Divide-and-Conquer Algorithms and Data Structures. PhD thesis, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, 1997.

  • Alex Semenov, Alexandre Yakovlev, Enric Pastor, Marco A. Peña, and Jordi Cortadella. Synthesis of speed-independent circuits from STG-unfolding segment. In Proc. ACM/IEEE Design Automation Conference, pages 16–21, 1997.

  • Alex Semenov, Alexandre Yakovlev, Enric Pastor, Marco A. Peña, Jordi Cortadella, and Luciano Lavagno. Partial order based approach to synthesis of speed-independent circuits. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 254–265. IEEE Computer Society Press, 1997.

  • M. Serna and F. Xhafa. The parallel approximability of a subclass of quadratic programming. In ICPADS'97, IEEE, pages 474–482, 1997.

  • M. Serna and F. Xhafa. Approximating scheduling problems in parallel. In C. Lengauer, M. Griebl, and S. Gorlatch, editors, EuroPar'97, volume 1300 of LNCS, pages 440–449. Springer-Verlag, 1997.

  • Gabriel Valiente and Conrado Martínez. An algorithm for graph pattern-matching. In Proc. 4th South American Workshop on String Processing, volume 8 of International Informatics Series, pages 180–197. Carleton University Press, 1997.

  • Ricardo Alberich, Peter Burmeister, Francesc Rosselló, Gabriel Valiente, and Boleslaw Wojdylo. A partial algebras approach to graph transformation. In Proc. 5th Int. Workshop on Graph Grammars and their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science, pages 1–15. Springer-Verlag, 1996.

  • José L. Balcázar, Josep Díaz, Ricard Gavaldà, and Osamu Watanabe. An optimal parallel algorithm for learning DFA. J.UCS. The Journal of Universal Computer Science, 2(3):97–112 (electronic), 1996.

  • B. Borchert and A. Lozano. Succinct circuit representations and leaf language classes are basically the same concept. Information Processing Letters, 59(4):211–215, 1996.

  • J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. Complete state encoding based on the theory of regions. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems. IEEE Computer Society Press, 1996.

  • Jordi Cortadella, Rosa M. Badia, and Fermín Sánchez. A mathematical formulation of the loop pipelining problem. In XI Conference on Design of Integrated Circuits and Systems, pages 355–360, Barcelona, 1996.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alex Yakovlev. Methodology and tools for state encoding in asynchronous circuit synthesis. In Proc. ACM/IEEE Design Automation Conference, 1996.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers. In XI Conference on Design of Integrated Circuits and Systems, pages 205–210, Barcelona, 1996.

  • J. Díaz, M. J. Serna, and J. Torán. Parallel approximation schemes for problems on planar graphs. Acta Informatica, 33(4):387–408, 1996.

  • J. Gabarró, C. Martínez, and X. Messeguer. A design of a parallel dictionary using skip lists. Theoretical Computer Science, 158(1):1–33, 1996.

  • Tomás Lang, Enric Musoll, and Jordi Cortadella. Redundant adder for reduced output transitions. In XI Conference on Design of Integrated Circuits and Systems, pages 17–22, Barcelona, 1996.

  • A. Lozano. Bounded queries to arbitrary sets. Informatique Théorique et Applications, 30(2):91–100, 1996.

  • Enric Musoll and Jordi Cortadella. Optimizing CMOS circuits for low power using transistor reordering. In Proc. European Design and Test Conference, pages 222–232, 1996.

  • E. Pastor, J. Cortadella, O. Roig, and A. Kondratyev. Structural methods for the synthesis of speed-independent circuits. In Proc. European Design and Test Conference, pages 340–347. IEEE Computer Society Press, 1996.

  • M. A. Peña and J. Cortadella. Combining process algebras and Petri nets for the specification and synthesis of asynchronous circuits. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems. IEEE Computer Society Press, 1996.

  • J. Petit. Llibreria de diccionaris paral·lels — disseny, implementació, avaluació, 1996.

  • S. Roura and C. Martínez. Randomization of search trees by subtree size. In J. Díaz and M. Serna, editors, Proc. of the 4th European Symposium on Algorithms (ESA), volume 1136 of LNCS, pages 91–106. Springer, 1996.

  • Fermín Sánchez and Jordi Cortadella. RESIS: A new methodology for register optimization in software pipelining. In Proc. European Conference on Parallel Processing (EURO-PAR), 1996.

  • Fermín Sánchez and Jordi Cortadella. Maximum-throughput software pipelining. In Proc. International Conference on Massively Parallel Computing Systems, pages 483–490, 1996.

  • L. Sintes, J. Escudero, M. A. Peña, O. Roig, J. Cortadella, and J. Carrabina. Flujo de diseño asíncrono con la biblioteca DCVSL_LIB para ES2 ECPD10. In Actas del II Congreso sobre Tecnologías Aplicadas a la Enseñanza de la Electrónica, pages 161–166, Sevilla, 1996.

  • R. V. Sole, J. Bascompte, J. Delgado, B. Luque, and S. C. Manrubia. Complejidad en la frontera del caos. Investigacion y Ciencia, 236:14–21, 1996.

  • R. V. Sole and J. Delgado. Universal computation in fluid neural networks. Complexity, 2(2):49–56, 1996.

  • R. V. Sole, S. C. Manrubia, B. Luque, J. Delgado, and J. Bascompte. Phase transitions and complex systems. Complexity, 1(4):13–26, 1996.

  • T. Tsukiji and F. Xhafa. On the expected depth of randomly generated circuits. In J. Díaz and M. Serna, editors, ESA'96, volume 1136 of LNCS, pages 208–220. Springer-Verlag, 1996.

  • Josep Díaz and Maria Serna, editors. Algorithms—ESA '96, Berlin, 1996. Springer-Verlag.

  • Carme Àlvarez and Birgit Jenner. On adaptive DLOGTIME and POLYLOGTIME reductions. Theoretical Computer Science, 148(2):183–205, sep 1995. [doi]

  • Albert Atserias. Complexitat de kolmogorov i qüestions de fonament. Butlletí de la Societat Catalana de Matemàtiques, (10):7–17, 1995.

  • José Luis Balcázar, Josep Díaz, and Joaquim Gabarró. Structural complexity. I. Springer-Verlag, Berlin, second edition, 1995.

  • J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Synthesizing petri nets from state-based models. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 164–171, 1995.

  • J. Gabarró and M. J. Serna. Rational processes and linear systems in CSP. Fundamenta Informaticae, 24(3):283–302, 1995.

  • Carme Àlvarez Jenner, José L. Balcázar, and Birgit. Adaptive logspace reducibility and parallel time. Mathematical Systems Theory, 28(2):117–140, 1995. [doi]

  • Carme Àlvarez Jenner and Birgit. A note on logspace optimization. Computational Complexity, 5(2):155–166, 1995. [doi]

  • Peter Kirschenhofer, Conrado Martínez, and Helmut Prodinger. Analysis of an optimized search algorithm for skip lists. Theoretical Computer Science, 144(1-2):199–220, 1995. Special volume on mathematical analysis of algorithms.

  • A. Kondratyev, J. Cortadella, M. Kishinevsky, E. Pastor, O. Roig, and A. Yakovlev. Checking Signal Transition Graph implementability by symbolic BDD traversal. In Proc. European Design and Test Conference, pages 325–332, Paris, France, 1995.

  • Miquel Monserrat, Francesc Rosselló, Joan Torrens, and Gabriel Valiente. Hypergraph rewriting using conformisms. Electronic Notes in Theoretical Computer Science, 2:105–112, 1995.

  • Enric Musoll and Jordi Cortadella. Low-power array multipliers with transition-retaining barriers. In Power and Timing Modeling, Optimization and Simulation (PATMOS), pages 227–238, 1995.

  • Enric Musoll and Jordi Cortadella. Scheduling and resource binding for low power. In International Symposium on System Synthesis, pages 104–109, 1995.

  • Enric Musoll and Jordi Cortadella. High-level synthesis techniques for reducing the activity of functional units. In International Symposium on Low Power Design, pages 94–104, 1995.

  • Enric Pastor and Jordi Cortadella. Cover approximations for the synthesis of speed-independent circuits. In Proc. of the IFIP International Workshop on Logic and Architecture Synthesis, pages 150–159, 1995.

  • Enric Pastor, Jordi Cortadella, and Oriol Roig. A new look at the conditions for the synthesis of speed-independent circuits. In Proc. of the Great Lakes Symposium on VLSI, pages 230–235, 1995.

  • Marco A. Peña and Jordi Cortadella. Programación VLSI y síntesis de circuitos asíncronos mediante composición de redes de Petri. In Actas del X Congreso de Diseño de Cirtuios Integrados y Sistemas, pages 65–70, Zaragoza, 1995.

  • Oriol Roig, Jordi Cortadella, and Enric Pastor. Verification of asynchronous circuits by BDD-based model checking of Petri nets. In Application and Theory of Petri Nets 1995, volume 815 of Lecture Notes in Computer Science, pages 374–391. Springer-Verlag, 1995.

  • Oriol Roig, Jordi Cortadella, and Enric Pastor. Hierarchical gate-level verification of speed-independent circuits. In Asynchronous Design Methodologies, pages 129–137. IEEE Computer Society Press, 1995.

  • F. Sanchez and J. Cortadella. Time constrained loop pipelining. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 592–596, 1995.

  • Fermín Sánchez and Jordi Cortadella. Resource-constrained software pipelining for high-level synthesis of DSP systems. In M. Moonen and F. Catthoor, editors, Algorithms and Parallel VLSI Architectures III. Elsevier Science Publishers, 1995.

  • M. Serna and F. Xhafa. On parallel versus sequential approximation. volume 979 of LNCS, pages 409–419. Springer-Verlag, 1995.

  • Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Xavier Messeguer. Average case analysis of fully dynamic connectivity for directed graphs. In 19th International Workshop on Graph-Theoretic Concepts in Computer Science, volume 790 of Lecture Notes in Computer Science, pages 87–98, Utrecht, The Netherlands, 1994. Springer.

  • Carme àlvarez and Birgit Jenner. On adaptive dlogtime and polylogtime reductions. STACS 94, page 301–312, 1994. [doi]

  • J. L. Balcázar, J. Díaz, R. Gavaldà, and O. Watanabe. The query complexity of learning DFA. New Generation Computing, 12:337–358, 1994.

  • J. L. Balcázar, J. Díaz, R. Gavaldà, and O. Watanabe. An optimal parallel algorithm for learning DFA. In 7th. ACM Conference on Learning Theory, pages 208–217. ACM, 1994.

  • J. Cortadella, J. A. B. Fortes, and E. A. Lee. Design and prototyping of digital signal processing systems (minitrack introduction). In Proc. Hawaii International Conf. System Sciences, pages 56–57, 1994.

  • Jordi Cortadella and Tomás Lang. High-radix division and square root with speculation. IEEE Transactions on Computers, 43(8):919–931, 1994.

  • Jordi Cortadella, Alexandre Yakovlev, Luciano Lavagno, and Peter Vanbekbergen. Designing asynchronous circuits from behavioral specifications with internal conflicts. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 106–115, 1994.

  • J. Gabarró and R. Gavaldà. An approach to correctness of data parallel algorithms. Journal of Parallel and Distributed Computing, 22:185–201, 1994.

  • Enric Pastor, Oriol Roig, Jordi Cortadella, and Rosa M. Badia. Petri net analysis using boolean manipulation. In Application and Theory of Petri Nets 1994, volume 815 of Lecture Notes in Computer Science, pages 416–435. Springer-Verlag, 1994. [ps.gz]

  • Oriol Roig, Enric Pastor, and Jordi Cortadella. Verificación de circuitos independientes de la velocidad con modelos simbólicos de redes de Petri. In Actas del IX Congreso de Diseño de Cirtuios Integrados y Sistemas, pages 307–312, Gran Canaria, 1994.

  • Carme Álvarez and Birgit Jenner. A very hard log-space counting class. Theoretical Computer Science, 107(1):3–30, jan 1993. [doi]

  • Rosa M. Badia and Jordi Cortadella. GLASS: a graph-theoretic approach for global binding. Microprocessing and Microprogramming, 38(1–5):775–782, 1993.

  • Rosa M. Badia and Jordi Cortadella. High-level synthesis of asynchronous systems: Scheduling and process synchronization. In Proc. European Conference on Design Automation (EDAC), pages 70–74. IEEE Computer Society Press, 1993.

  • R. Casas, J. Díaz, and C. Martínez. Average-case analysis on simple families of trees using a balanced probability model. Theoretical Computer Science, 117:99–112, 1993.

  • Jordi Cortadella and Tomás Lang. Division with speculation of quotient digits. In International Symposium on Computer Arithmetic, pages 87–94, 1993.

  • J. Díaz, M. J. Serna, and J. Torán. Parallel approximation schemes for planar graphs problems. In T. Lengauer, editor, 1st European Symposium on Algorithms, volume 726 of Lecture Notes in Computer Science, pages 145–156. Springer-Verlag, Berlin, 1993.

  • L. M. Kirousis, M. Serna, and P. Spirakis. Parallel complexity of the connected subgraph problem. SIAM Journal on Computing, 22(3):573–586, 1993.

  • M. Ogiwara and A. Lozano. On sparse hard sets for counting classes. Theoretical Computer Science, 112(2):255–275, 1993.

  • Enric Pastor and Jordi Cortadella. Polynomial algorithms for the synthesis of hazard-free circuits from signal transition graphs. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 250–254. IEEE Computer Society Press, 1993.

  • Enric Pastor and Jordi Cortadella. An efficient unique state coding algorithm for signal transition graphs. In Proc. International Conf. Computer Design (ICCD), pages 174–177, 1993.

  • Oriol Roig, Enric Pastor, Rosa M. Badia, and Jordi Cortadella. Síntesis de Máquinas de control para circuitos asíncronos. In Actas del VIII Congreso de Diseño de Cirtuios Integrados y Sistemas, pages 326–331, Málaga, 1993.

  • Fermín Sánchez and Jordi Cortadella. Resource-constrained pipelining based on loop transformations. Microprocessing and Microprogramming, 38(1–5):429–436, 1993.

  • Gabriel Valiente. Verification of knowledge base redundancy and subsumption using graph transformations. International Journal of Expert Systems, 6(3):341–355, 1993.

  • Gabriel Valiente. On knowledge base redundancy under uncertain reasoning. In Proc. 4th Int. Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, volume 682 of Lecture Notes in Computer Science, pages 321–329. Springer-Verlag, 1993.

  • Gabriel Valiente. Input-driven control of rule-based expert systems. In Proc. 7th Int. Symposium on Methodologies for Intelligent Systems, volume 689 of Lecture Notes in Computer Science, pages 86–95. Springer-Verlag, 1993.

  • V. Arvind, Y. Han, L. Hemachandra, J. Koebler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schoening, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. In Lecture Notes in Computer Science, editor, ICALP 19th International Colloquium, volume 623, pages 162–173, 1992.

  • Ricardo Baeza-Yates, Rafel Casas, Josep Díaz, and Conrado Martínez. On the average size of the intersection of binary trees. SIAM Journal on Computing, 21:24–32, 1992.

  • J. Cortadella and R. M. Badia. An asynchronous architecture model for behavioral synthesis. In Proc. European Conference on Design Automation (EDAC), pages 307–311. IEEE Computer Society Press, 1992.

  • Jordi Cortadella, Rosa M. Badia, Enric Pastor, and Abelardo Pardo. Achilles: A high-level synthesis system for asynchronous circuits. In 6th ACM/IEEE International Workshop on High-Level Synthesis, pages 87–94, 1992.

  • Jordi Cortadella, Rosa M. Badia, Enric Pastor, and Abelardo Pardo. Achilles: Sistema de Síntesis de alto nivel para circuitos asíncronos. In Actas del VII Congreso de Diseño de Cirtuios Integrados y Sistemas, pages 357–362, Toledo, 1992.

  • Jordi Cortadella and Teodor Jové. Comments on ”Using Cache Mechanisms to Exploit non-Refreshing DRAM's for On-Chip Memories”. IEEE Journal of Solid-State Circuits, 27(1):132, 1992.

  • Jordi Cortadella and José M. Llabería. Evaluation of A+B=K conditions without carry propagation. IEEE Transactions on Computers, 41(11):1484–1488, 1992.

  • J. Díaz. Graph layout problems (invited paper). In I. M. Havel and V. Koubek, editors, Mathematical Foundations of Computer Science, volume 629, pages 14–23. Lecture Notes in Computer Science, Springer-Verlag, 1992.

  • A. Lozano and J. Torán. On the nonuniform complexity of the graph isomorphism problem. In IEEE Computer Society Press, editor, Structure in Complexity Theory Conference, pages 118–129, 1992.

  • Gabriel Valiente. Using layered support graphs for verifying external adequacy in rule-based expert systems. ACM SIGART Bulletin, 3(1):20–24, 1992.

  • C. Àlvarez and J. Gabarró. The parallel complexity of two problems on concurrency. Information Processing Letters, 38(2):61–70, apr 1991. [doi]

  • Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, and Miklós Sántha. Parallel complexity in the design and analysis of concurrent systems. Lecture Notes in Computer Science, page 288–303, 1991. [doi]

  • Rosa M. Badia and Jordi Cortadella. Optimización del tiempo de ciclo en la planificación de operaciones. In Actas del VI Congreso de Diseño de Cirtuios Integrados y Sistemas, pages 275–280, Santander, 1991.

  • Rosa M. Badia, Jordi Cortadella, and Eduard Ayguadé. Computer-aided synthesis of data-path by using a simulated-annealing-based approach. In 9th IAESTED International Symposium on Applied Informatics, pages 326–329, 1991.

  • R. Casas, J. Díaz, and C. Martínez. Average-case analysis on simple families of trees using a balanced probability model. In Formal Power Series and Algebraic Combinatorics, pages 101–112. Lecture Notes in Computer Science, Springer-Verlag, 1991.

  • R. Casas, J. Díaz, and C. Martínez. Statistics on random trees (invited lecture). In J. Leach, B. Monien, and M. Rodriguez Artalejo, editors, Automata, Languages and Programming, volume 510 of Lecture Notes in Computer Science, pages 186–204. Springer-Verlag, Berlin, 1991.

  • Jordi Cortadella, Rosa M. Badia, and Eduard Ayguadé. Scheduling in a continuous area-time design space. Microprocessing and Microprogramming, 32(1–5):199–206, 1991.

  • Jordi Cortadella, Rosa M. Badia, and Eduard Ayguadé. Scheduling in a continuous area-time design space: A simulated-annealing-based approach. In 5th ACM/IEEE International Workshop on High-Level Synthesis, pages 102–117, 1991.

  • J. Díaz, A. M. Gibbons, M. S. Paterson, and J. Torán. The minsumcut problem. In F. Dehen, R. J. Sack, and N. Santoro, editors, Algorithms and Datastructure, volume 519 of Lecture Notes in Computer Science, pages 65–79. Springer-Verlag, 1991.

  • Carme Àlvarez Jenner, José L. Balcázar, and Birgit. Functional oracle queries as a measure of parallel time. In STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings, pages 422–433, 1991. [doi]

  • A. Lozano and J. Torán. Self-reducible sets of small density. Mathematical Systems Theory, 24(2):83–100, 1991.

  • M. Ogiwara and A. Lozano. On one query self-reducible sets. In IEEE Computer Society Press, editor, Structure in Complexity Theory Conference, pages 139–151, 1991.

  • G. S. Whitcomb, J. Cortadella, and A. R. Newton. Functional level synthesis of the TRISC processor. In IFIP International Workshop on Application of Synthesis and Simulation, 1991.

  • J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity II. Springer-Verlag, Heidelberg, 1990.

  • J. Díaz and J. Torán. Classes of bounded nondeterminism. Mathematical System Theory, 23:21–32, 1990.

  • Carme Àlvarez Jenner and Birgit. A very hard log space counting class. In Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Politècnica de Catalunya, Barcelona, Spain, July 8-11, 1990, pages 154–168, 1990. [doi]

  • Maria Serna. The parallel Approximability of P-complete problems. PhD thesis, Universitat Politècnica de Catalunya, June 1990. Paul Spirakis and Joaquim Gabarro, advisors.

  • C. Àlvarez, J. Díaz, and J. Torán. Complexity classes with complete problems between P and NP-complete. In P. Dembinski, editor, Foundations of Computation Theory, volume 380 of Lecture Notes in Computer Science, pages 13–24. Springer–Verlag, 1989.

  • R. Casas, J. Díaz, and J. M. Steyaert. Average-case analysis of Robinson's unification algorithm with two different variables. Information Processing Letters, 31:227–232, 1989.

  • Jordi Cortadella and José M. Llabería. Making branches transparent to the execution unit. International Journal of Mini and Microcomputers, 11(1):13–17, 1989.

  • Teodor Jové and Jordi Cortadella. Reduced instruction buffer for RISC architectures. Microprocessing and Microprogramming, 27(1–5):1987–1993, 1989.

  • L. Kirousis, M. Serna, and P. Spirakis. The parallel complexity of the subgraph connectivity problem. 30th Annual Symposium on Foundations of Computer Science, 1989. [doi]

  • M. J. Serna and P. G. Spirakis. The approximability of problems complete for P. In H. Djidjev, editor, Second International Symposium on Optimal Algorithms., volume 401, pages 193–204. Springer-Verlag, 1989.

  • J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, Heidelberg, 1988.

  • Jordi Cortadella. Executing branch instructions with zero time delay in a RISC. In IEEE Computer Society Workshop on VLSI, Clearwater Beach (Florida), 1988.

  • Jordi Cortadella, Antonio González, and José M. Llabería. RISC: un nuevo enfoque en el diseño de procesadores. Mundo electrónico, 180:49–57, 1988.

  • Jordi Cortadella and Teodor Jové. Dynamic RAM for on-chip instruction caches. Computer Architecture News, 16(4):45–50, 1988.

  • Jordi Cortadella and Teodor Jové. Designing a branch target buffer for executing branches with zero time cost in a RISC processor. Microprocessing and Microprogramming, 24(1–5):573–580, 1988.

  • Jordi Cortadella and Teodor Jové. Executing zero-delay branches with a branch target buffer in a RISC processor. In 36th International Symposium on Mini and Microcomputers and their applications, pages 373–376, 1988.

  • Jordi Cortadella and José M. Llabería. Evaluating A+B=K conditions in constant time. In Proc. International Symposium on Circuits and Systems, pages 243–246, 1988.

  • Jordi Domingo, José M. Llabería, Mateo Valero, and Jordi Cortadella. Arbitration techniques for packet switching multistage networks. In 3rd. International Conference on Supercomputing, volume III, pages 240–248, 1988.

  • Antonio González, José M. Llabería, and Jordi Cortadella. A mechanism for reducing the cost of branches in RISC architectures. Microprocessing and Microprogramming, 24(1–5):565–572, 1988.

  • Antonio González, José M. Llabería, and Jordi Cortadella. Zero-delay cost branches in RISC architectures. In 6th International Symposium on Applied Informatics, pages 24–27, 1988.

  • A. Lozano. Np-hardness on succinct representations of graphs. Bulletin of the EATCS, 35:158–162, 1988.

  • J. L. Balcázar, J. Díaz, and J. Gabarró. On characterizations of the class PSPACE/POLY. Theoretical Computer Science, 52:251–267, 1987.

  • Jordi Cortadella. Mechanisms for the efficient execution of branches in RISC architecture. PhD thesis, Universitat Politècnica de Catalunya, 1987. (In Spanish).

  • Jordi Cortadella and José M. Llabería. Arquitecturas RISC. In IV Jornadas de Diseño Lógico, pages 19–27, Barcelona, 1987.

  • Jordi Cortadella and José M. Llabería. An intelligent IFU for pipelined processors that makes control instructions transparent to the execution unit. In International Symposium on Applied Informatics, pages 188–191, 1987.

  • Jordi Cortadella and José M. Llabería. A low cost evaluation methodology for new architectures. In International Symposium on Applied Informatics, pages 188–191, 1987.

  • Jordi Cortadella and José M. Llabería. Procesadores RISC. In 1er. Seminario del grupo temático de Arquitectura y Tecnología de Ordenadores sobre Arquitecturas Multiprocesadores y sus Aplicaciones, Madrid, 1987.

  • Jordi Cortadella, José M. Llabería, and Mateo Valero. Arquitecturas orientadas a lenguajes basados en la lógica. In Inteligencia Artificial, chapter 21, pages 233–243. Ed. Marcombo, 1987.

  • Jordi Domingo, José M. Llabería, Jordi Cortadella, and Mateo Valero. Arbitration methods to increase the throughput of packed switching buffered shuffle-exchange interconnection networks. In International Symposium on Applied Informatics, pages 78–81, 1987.

  • J. L. Balcázar, Díaz J., and J. Gabarró. Uniform characterizations of non-uniform complexity measures. Information and Control, 67:53–69, 1985.

  • R. Casas, J. Díaz, and M. Verges. On counting BECs. Annals of Discrete Mathematics, 25:109–124, 1985.

  • Luis González, Jordi Cortadella, and José M. Llabería. Performance evaluation of a loosely coupled multiprocessor architecture with two buses. In International Symposium on Mini and Microcomputers and their applications, pages 473–476, 1985.

  • R. Casas, J. Díaz, J. M. Steyaert, and M. Verges. Some considerations on the ratio of compactification of binary trees. In J. Demitrovik and A. Saloma, editors, Algebra, Combinatorics and Logic in Computer Science, volume 10 of Colloquia Mathematica Societatis Janos Bolyai, pages 185–199. North–Holland, 1983.

  • J. L. Balcázar and J. Díaz. A note on a theorem by Ladner. Information Processing Letters, 15:84–86, 1982.

  • X. Berenguer, J. Díaz, and L. H. harper. A solution to the Sperner-erdös problem. Theoretical Computer Science, 21:99–104, 1982.

  • R. Casas and J. Díaz. De la possibilitat a l'eficiència: Un intent d'explicar en forma entenedora alguns aspectes teòrics de la calculació. Novatica, VII–38:7–15, 1982.

  • J. Díaz. A subexponential average complexity for some difficult maximization problems. In E. . Trillas, editor, Second World Conference on Mathematics at the Service of Man, pages 21–24. Universidad Politecnica de las Palmas, 1982.

  • X. Berenguer and J. Díaz. Algunes consideracions teòriques al problema de la construcció d'horaris. Questió, 4:59–61, 1980.

  • X. Berenguer and J. Díaz. The weighted Sperner's set problem. In P. Dembinski, editor, Mathematical Foundations of Computer Science, volume 88 of Lecture Notes in Computer Science, pages 137–141. Springer-Verlag, 1980.

  • J. Díaz. The δ-operator. In L. Budach, editor, Fundamentals of Computation Theory, pages 105–111. Akademie-Verlag, 1979.

  • J. Díaz. Complejidad de problemas combinatorios. Qüestió, 2:35–49, 1978.

  • J. Díaz. El problema de l'ordenació lineal òptima és NP-complet. Qüestió, 4:257–260, 1978.






ALBCOM Research Group
© Universitat Politècnica de Catalunya, 2017