"Characterising Chordal ContactB0-VPG Graphs" (2018) Bonomo, F.;Mazzoleni, M.P.;Rean, M.L. (...)Lee J. 5th International Symposium on Combinatorial Optimization, ISCO 2018. 10856 LNCS:89-100

"Ecient type checking for path polymorphism" (2018) Edi, J.;Viso, A.;Bonelli, E. (...)European Regional Development Fund 21st International Conference on Types for Proofs and Programs, TYPES 2015. 69:61-623

"Exact Algorithms for Minimum Weighted Dominating Induced Matching" (2017) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. Algorithmica. 77(3):642-660

"On neighborhood-Helly graphs" (2017) Groshaus, M.; Lin, M.C.; Szwarcfiter, J.L. Discrete Applied Mathematics. 216:191-202

"On star and biclique edge-colorings" (2017) Dantas, S.;Groshaus, M.;Guedes, A. (...)Sasaki, D. International Transactions in Operational Research. 24(1-2):339-346

"b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs" (2015) Bonomo, F.; Schaudt, O.; Stein, M.; Valencia-Pabon, M. Algorithmica. 73(2):289-305

"On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size" (2015) Lin, M.C.; Mizrahi, M.J. Discrete Applied Mathematics. 197:53-58

"Complexity of the cluster deletion problem on subclasses of chordal graphs" (2015) Bonomo, F.; Durán, G.; Valencia-Pabon, M. Theoretical Computer Science. 600:59-69

"On probe 2-clique graphs and probe diamond-free graphs" (2015) Bonomo, F.;De Figueiredo, C.M.H.;Durán, G. (...)Szwarcfiter, J.L. Discrete Mathematics and Theoretical Computer Science. 17(1):187-200

"Normality in non-integer bases and polynomial time randomness" (2015) Almarza, J.I.; Figueira, S. Journal of Computer and System Sciences. 81(7):1059-1087

"Clique-perfectness and balancedness of some graph classes" (2014) Bonomo, F.; Durán, G.; Safe, M.D.; Wagler, A.K. International Journal of Computer Mathematics. 91(10):2118-2141

"Degeneracy Loci and Polynomial Equation Solving" (2014) Bank, B.;Giusti, M.;Heintz, J. (...)Solernó, P. Foundations of Computational Mathematics. 15(1):159-184

"b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs" (2014) Bonomo, F.;Schaudt, O.;Stein, M. (...)Associacao Portuguesa de Investigacao Operacional; de Lisboa, Centro de Investigacao Operacional; Faculdade de Ciencias da Universidade; Fundacao para a Ciencia e a Tecnologia; Instituto Nacional de Estatistica; Universite Paris-Dauphine, LAMSADE 3rd International Symposium on Combinatorial Optimization, ISCO 2014. 8596 LNCS:100-111

"On the iterated biclique operator" (2013) Groshaus, M.; Montero, L.P. Journal of Graph Theory. 73(2):181-190

"A note on the Cornaz-Jost transformation to solve the graph coloring problem" (2013) Bonomo, F.; Giandomenico, M.; Rossi, F. Information Processing Letters. 113(18):649-652

"On edge-sets of bicliques in graphs" (2012) Groshaus, M.; Hell, P.; Stacho, J. Discrete Applied Mathematics. 160(18):2698-2708

"Minimum weighted clique cover on strip-composed perfect graphs" (2012) Bonomo, F.; Oriolo, G.; Snels, C. 38th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2012. 7551 LNCS:22-33

"Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem" (2011) Bonomo, F.; Mattia, S.; Oriolo, G. Theoretical Computer Science. 412(45):6261-6268

"On the b-coloring of P4-tidy graphs" (2011) Velasquez, C.I.B.; Bonomo, F.; Koch, I. Discrete Applied Mathematics. 159(1):60-68

"Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)" (2010) Areces, C.; Gorín, D. Journal of Applied Logic. 8(4):305-318

"Cycle-based facets of chromatic scheduling polytopes" (2009) Marenco, J.; Wagler, A. Discrete Optimization. 6(1):51-63

"Theorems relating polynomial approximation, orthogonality and balancing conditions for the design of nonseparable bidimensional multiwavelets" (2009) Ruedin, A.M.C. 11th International Conference on Advanced Concepts for Intelligent Vision Systems, ACIVS 2009. 5807 LNCS:54-65

"Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs" (2009) Bonomo, F.; Chudnovsky, M.; Durán, G. Discrete Mathematics. 309(11):3485-3499

"Anisotropic error estimates for an interpolant defined via moments" (2008) Acosta, G.; Apel, T.; Durán, R.G.; Lombardi, A.L. Computing (Vienna/New York). 82(1):1-9

"Unit circular-arc graph representations and feasible circulations" (2008) Lin, M.C.; Szwarcfiter, J.L. SIAM Journal on Discrete Mathematics. 22(1):409-423

"On hereditary Helly classes of graphs" (2008) Groshaus, M.; Szwarcfiter, J.L. Discrete Mathematics and Theoretical Computer Science. 10(1):71-78

"Parametric prediction of heap memory requirements" (2008) Braberman, V.; Fernández, F.; Garbervetsky, D.; Yovine, S. 2008 International Symposium on Memory Management, ISMM'08:141-150

"A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs" (2008) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008. 5124 LNCS:355-366

"Ionization of the He, Ne, Ar, Kr, and Xe isoelectronic series by proton impact" (2008) Miraglia, J.E.; Gravielle, M.S. Physical Review A - Atomic, Molecular, and Optical Physics. 78(5)

"Polyphase filter and polynomial reproduction conditions for the construction of smooth bidimensional multiwavelets" (2007) Ruedin, A. 9th International Conference on Advanced Concepts for Intelligent Vision Systems, ACIVS 2007. 4678 LNCS:221-232

"An algorithm for the computation of the radical of an ideal" (2006) Laplagne, S. International Symposium on Symbolic and Algebraic Computation, ISSAC 2006. 2006:191-195

"Generalized polar varieties and an efficient real elimination procedure" (2004) Bank, B.; Giusti, M.; Heintz, J.; Pardo, L.M. Kybernetika. 40(5):519-550

"Small Perturbations on Artificial Satellites as an Inverse Problem" (2003) Zadunaisky, P.E. IEEE Transactions on Aerospace and Electronic Systems. 39(4):1270-1276