"Computing the P 3 -hull number of a graph, a polyhedral approach" (2019) Blaum, M.; Marenco, J. Discrete Applied Mathematics. 255:155-166

"Degree-greedy algorithms on large random graphs" (2019) Bermolen, P.; Jonckheere, M.; Larroca, F.; Saenz, M. 36th IFIP Performance Conference 2018. 46(3):27-32

"On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid" (2018) Alcón, L.;Bonomo, F.;Durán, G. (...)Valencia-Pabon, M. Discrete Applied Mathematics. 234:12-21

"Domination parameters with number 2: Interrelations and algorithmic consequences" (2018) Bonomo, F.;Brešar, B.;Grippo, L.N. (...)Safe, M.D. Discrete Applied Mathematics. 235:23-50

"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

"An integer programming approach to b-coloring" (2018) Koch, I.; Marenco, J. Discrete Optimization

"Bisimulations on data graphs" (2018) Abriola, S.; Barceló, P.; Figueira, D.; Figueira, S. Journal of Artificial Intelligence Research. 61:171-213

"Approximating weighted neighborhood independent sets" (2018) Lin, M.C.; Mestre, J.; Vasiliev, S. Information Processing Letters. 130:11-15

"k-tuple colorings of the Cartesian product of graphs" (2017) Bonomo, F.; Koch, I.; Torres, P.; Valencia-Pabon, M. Discrete Applied Mathematics. 245:177-182

"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

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

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

"The jamming constant of uniform random graphs" (2017) Bermolen, P.; Jonckheere, M.; Moyal, P. Stochastic Processes and their Applications. 127(7):2138-2178

"The caterpillar-packing polytope" (2017) Marenco, J. Discrete Applied Mathematics. 245:4-15

"Extracting the groupwise core structural connectivity network: Bridging statistical and graph-theoretical approaches" (2017) Lascano, N.;Gallardo-Diez, G.;Deriche, R. (...)Oguz I. 25th International Conference on Information Processing in Medical Imaging, IPMI 2017. 10265 LNCS:373-384

"Automated speech analysis for psychosis evaluation" (2016) Carrillo, F.;Mota, N.;Copelli, M. (...)Langs G. 4th International Workshop on Machine Learning and Interpretation in Neuroimaging, MLINI 2014 and workshop on Neural Information Processing Systems, NIPS 2014. 9444 LNAI:31-39

"Graph classes with and without powers of bounded clique-width" (2016) Bonomo, F.; Grippo, L.N.; Milanič, M.; Safe, M.D. Discrete Applied Mathematics. 199:3-15

"Polyhedral studies of vertex coloring problems: The standard formulation" (2016) Delle Donne, D.; Marenco, J. Discrete Optimization. 21:1-13

"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

"Approximation algorithms for clique transversals on some graph classes" (2015) Lin, M.C.; Vasiliev, S. Information Processing Letters. 115(9):667-670

"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

"Clique-perfectness of complements of line graphs" (2015) Bonomo, F.; Durán, G.; Safe, M.D.; Wagler, A.K. Discrete Applied Mathematics. 186(1):19-44

"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

"Fully Dynamic Recognition of Proper Circular-Arc Graphs" (2015) Soulignac, F.J. Algorithmica. 71(4):904-968

"QSPR studies on refractive indices of structurally heterogeneous polymers" (2015) Duchowicz, P.R.;Fioressi, S.E.;Bacelo, D.E. (...)Toropov, A.A. Chemometrics and Intelligent Laboratory Systems. 140:86-91

"Disimplicial arcs, transitive vertices, and disimplicial eliminations" (2015) Eguía, M.; Soulignac, F.J. Discrete Mathematics and Theoretical Computer Science. 17(2):101-118

"The maximum number of dominating induced matchings" (2015) Lin, M.C.; Moyano, V.A.; Rautenbach, D.; Szwarcfiter, J.L. Journal of Graph Theory. 78(4):258-268

"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

"Fast algorithms for some dominating induced matching problems" (2014) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. Information Processing Letters. 114(10):524-528

"Fast algorithms for some dominating induced matching problems" (2014) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. Information Processing Letters. 114(10):524-528

"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

"Characterization of classical graph classes by weighted clique graphs" (2014) Bonomo, F.; Szwarcfiter, J.L. Discrete Applied Mathematics. 165:83-95

"O(n) time algorithms for dominating induced matching problems" (2014) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. 11th Latin American Theoretical Informatics Symposium, LATIN 2014. 8392 LNCS:399-408

"O(n) time algorithms for dominating induced matching problems" (2014) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. 11th Latin American Theoretical Informatics Symposium, LATIN 2014. 8392 LNCS:399-408

"Balancedness of subclasses of circular-arc graphs" (2014) Bonomo, F.; Durán, G.; Safe, M.D.; Wagler, A.K. Discrete Mathematics and Theoretical Computer Science. 16(3):1-22

"Hereditary biclique-Helly graphs: Recognition and maximal biclique enumeration" (2013) Eguía, M.; Soulignac, F.J. Discrete Mathematics and Theoretical Computer Science. 15(1):55-74

"An O*(1.1939n) time algorithm for minimum weighted dominating induced matching" (2013) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. 24th International Symposium on Algorithms and Computation, ISAAC 2013. 8283 LNCS:558-567

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

"Normal Helly circular-arc graphs and its subclasses" (2013) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. Discrete Applied Mathematics. 161(7-8):1037-1059

"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

"The quasi-periodicity of the minority game revisited" (2013) Acosta, G.; Caridi, I.; Guala, S.; Marenco, J. Physica A: Statistical Mechanics and its Applications. 392(19):4450-4465

"Forbidden subgraphs and the König-Egerváry property" (2013) Bonomo, F.;Dourado, M.C.;Durán, G. (...)Safe, M.D. Discrete Applied Mathematics. 161(16-17):2380-2388

"Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property" (2013) Bonomo, F.; Oriolo, G.; Snels, C.; Stauffer, G. 16th Conference on Integer Programming and Combinatorial Optimization, IPCO 2013. 7801 LNCS:86-97

"Arboricity, h-index, and dynamic algorithms" (2012) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. Theoretical Computer Science. 426-427:75-90

"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

"A method for optimizing waste collection using mathematical programming: A Buenos Aires case study" (2012) Bonomo, F.; Durán, G.; Larumbe, F.; Marenco, J. Waste Management and Research. 30(3):311-324

"Minimum sum set coloring of trees and line graphs of trees" (2011) Bonomo, F.; Durn, G.; Marenco, J.; Valencia-Pabon, M. Discrete Applied Mathematics. 159(5):288-294

"A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem" (2011) Delle Donne, D.; Marenco, J. Discrete Optimization. 8(4):540-554

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

"Linear time analysis of properties of conflict-free and general Petri nets" (2011) Alimonti, P.; Feuerstein, E.; Laura, L.; Nanni, U. Theoretical Computer Science. 412(4-5):320-338

"Powers of cycles, powers of paths, and distance graphs" (2011) Lin, M.C.; Rautenbach, D.; Soulignac, F.J.; Szwarcfiter, J.L. Discrete Applied Mathematics. 159(7):621-627

"The clique operator on circular-arc graphs" (2010) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. Discrete Applied Mathematics. 158(12):1259-1267

"Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs" (2009) Bonomo, F.; Durán, G.; Soulignac, F.; Sueiro, G. Discrete Applied Mathematics. 157(17):3511-3518

"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

"Short Models for Unit Interval Graphs" (2009) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. Electronic Notes in Discrete Mathematics. 35(C):247-255

"Partial characterizations of coordinated graphs: Line graphs and complements of forests" (2009) Bonomo, F.; Durán, G.; Soulignac, F.; Sueiro, G. Mathematical Methods of Operations Research. 69(2):251-270

"Synchronous multiparty synchronizations and transactions" (2008) Lanese, I.; Melgratti, H. Concurrency, Graphs and Models - Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday. 5065 LNCS:76-95

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

"Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs" (2008) Bonomo, F.; Chudnovsky, M.; Durán, G. Discrete Applied Mathematics. 156(7):1058-1082

"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

"A cutting plane algorithm for graph coloring" (2008) Méndez-Díaz, I.; Zabala, P. Discrete Applied Mathematics. 156(2):159-179

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

"Discrete scale invariance in scale free graphs" (2007) Graña, M.; Pinasco, J.P. Physica A: Statistical Mechanics and its Applications. 380(1-2):601-610

"Proper Helly circular-arc graphs" (2007) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. 33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007. 4769 LNCS:248-257

"Faster recognition of clique-Helly and hereditary clique-Helly graphs" (2007) Lin, M.C.; Szwarcfiter, J.L. Information Processing Letters. 103(1):40-43

"On balanced graphs" (2006) Bonomo, F.; Durán, G.; Lin, M.C.; Szwarcfiter, J.L. Mathematical Programming. 105(2-3):233-250

"Polynomial time recognition of unit circular-arc graphs" (2006) Durán, G.;Gravano, A.;McConnell, R.M. (...)Tucker, A. Journal of Algorithms. 58(1):67-78

"NP-completeness results for edge modification problems" (2006) Burzyn, P.; Bonomo, F.; Durán, G. Discrete Applied Mathematics. 154(13 SPEC ISS):1824-1844

"Characterizations and linear time recognition of helly circular-arc graphs" (2006) Lin, M.C.; Szwarcfiter, J.L. 12th Annual International Conference on Computing and Combinatorics, COCOON 2006. 4112 LNCS:73-82

"Efficient construction of unit circular-arc models" (2006) Lin, M.C.; Szwarcfiter, J.L. Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms:309-315

"Inverting bijective polynomial maps over finite fields" (2006) Cafure, A.; Matera, G.; Waissbein, A. 2006 IEEE Information Theory Workshop, ITW 2006:27-31

"Condition numbers and scale free graphs" (2006) Acosta, G.; Graña, M.; Pinasco, J.P. European Physical Journal B. 53(3):381-385

"Algorithms for clique-independent sets on subclasses of circular-arc graphs" (2006) Durán, G.; Lin, M.C.; Mera, S.; Szwarcfiter, J.L. Discrete Applied Mathematics. 154(13 SPEC ISS):1783-1790

"A Branch-and-Cut algorithm for graph coloring" (2006) Méndez-Díaz, I.; Zabala, P. Discrete Applied Mathematics. 154(5 SPEC ISS):826-847

"Self-clique Helly circular-arc graphs" (2006) Bonomo, F. Discrete Mathematics. 306(6):595-597

"A bond-graph mapping mechanism for M/CD++" (2006) D'Abreu, M.C.; Wainer, G.A. Summer Computer Simulation Conference 2006, SCSC 2006, Part of the 2006 Summer Simulation Multiconference, SummerSim 2006:489-497

"Modelling human intelligence: A learning mechanism" (2005) Segura, E.C.; Whitty, R. 4th Mexican International Conference on Artificial Intelligence, MICAI 2005. 3789 LNAI:1-10

"Analysis of simultaneous water absorption and water-starch reaction during soaking of amaranth grain" (2005) Resio, A.N.C.; Aguerre, R.J.; Suarez, C. Journal of Food Engineering. 68(2):265-270

"Low temperature irreversibility induced by thermal cycles on two prototypical phase separated manganites" (2004) Sacanell, J.;Quintero, M.;Curiale, J. (...)Valenzuela Monjar R. Proceedings of the VI Latin American Workshop on Magnetism. 369(1-2):74-77

"Self-Clique Graphs and Matrix Permutations" (2003) Bondy, A.; Durán, G.; Lin, M.C.; Szwarcfiter, J.L. Journal of Graph Theory. 44(3):178-192

"Electronic neuron within a ganglion of a leech (Hirudo medicinalis)" (2003) Aliaga, J.;Busca, N.;Minces, V. (...)Sczcupak, L. Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics. 67(6):8

"Electronic neuron within a ganglion of a leech (Hirudo medicinalis)" (2003) Aliaga, J.;Busca, N.;Minces, V. (...)Sczcupak, L. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics. 67(6 1):061915-1-061915-8

"The hardness of polynomial equation solving" (2003) Castro, D.;Giusti, M.;Heintz, J. (...)Pardo, L.M. Foundations of Computational Mathematics. 3(4):347-420

"Evaluating comfort with varying temperatures: A graphic design tool" (2003) Evans, J.M. Energy and Buildings. 35(1):87-93

"The prescribed mean curvature equation for nonparametric surfaces" (2003) Amster, P.; Mariani, M.C. Nonlinear Analysis, Theory, Methods and Applications. 52(4):1069-1077

"Zeus: A distributed timed model-checker based on Kronos" (2002) Braberman, V.; Olivero, A.; Schapachnik, F. PDMC 2002, Parallel and Distributed Model Checking (Satellite Workshop of CONCUR 2002). 68(4):503-522

"Two graph-based techniques for software architecture reconfiguration" (2002) Hirsch, D.; Montanari, U.; Bauderon M.; Corradini A. GETGRATS Closing Workshop. 51:177-190

"Observing timed systems by means of message sequence chart graphs" (2002) Blaustein, S.; Oliveto, F.; Braberman, V. 24th International Conference on Software Engineering (ICSE 2002):707

"A new metaheuristic and its application to the Steiner problems in graphs" (2001) Urrutia, S.; Loiseau, I. Proceedings - International Conference of the Chilean Computer Science Society, SCCC. 2001-January:273-281

"Reconfiguration of software architecture styles with name mobility" (2000) Hirsch, D.;Inverardi, P.;Montanari, U. (...)Roman G.-C. 4th International Conference on Coordination Languages and Models, COORDINATION 2000. 1906:148-163