Teaching
Currently I'm an assistant professor in Introduction to Programming (UNQ).
Before I was a teaching assistant in Algorithms and Data Structures II (FCEN - UBA), Algorithms and Data Structures III (FCEN - UBA), and Graph Problems and Computational Tractability (FCEN - UBA).
Students
Martiniano Eguía
Grafos biclique irreducibles (in Spanish)
Licentiate Thesis (equivalent to an MSc. Thesis)
October 25th, 2013.
Pablo Terlisky
Biclique-coloreo de grafos (in Spanish)
Licentiate Thesis (equivalent to an MSc. Thesis)
Joint advisory with
Dra. Marina Groshaus
July 20th, 2010.
Research Area
My main interest is Algorithmic Graph Theory. I also like to hear about Complexity and Combinatorial Optimization. I'm currently a member of the Operations Research, Combinatorial Optimization and Graphs Group.
Research Papers
Journal Papers
-
Soulignac F., "Fully dynamic recognition of proper circular-arc graphs", Algorithmica (online), 2013. [arxiv]
-
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, and Jayme L. Szwarcfiter, "Isomorphism of graph classes related to the circular-ones property", Discrete Mathematics & Theoretical Computer Science 15 (1), pp. 157--182 (2013). [pdf]
-
Eguía M. and Soulignac F., "Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration", Discrete Mathematics & Theoretical Computer Science 15 (1), pp. 55--74 (2013). [pdf]
-
Lin M., Soulignac F., and Szwarcfiter J., "Normal Helly circular-arc graphs and its subclasses", Discrete Applied Mathematics 161 (7--8), pp 1037--1059 (2013). [arXiv]
-
Lin M., Soulignac F., and Szwarcfiter J., "Arboricity, h-Index, and Dynamic Algorithms", Theoretical Computer Science 426--427, pp. 75--90 (2012). [arXiv]
-
Lin M., Rautenbach D., Soulignac F. and Szwarcfiter J., "Powers of Cycles, Powers of Paths and Distance Graphs" Discrete Applied Mathematics 159 (7), pp. 621--627 (2011). [pdf]
-
Lin M., Soulignac F., and Szwarcfiter J., "The clique operator on circular-arc graphs", Discrete Applied Mathematics 158 (12), pp. 1259--1267 (2010). [pdf]
-
Bonomo F., Durán G., Soulignac F., and Sueiro G., "Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs", Discrete Applied Mathematics 157 (17), pp. 3511--3518 (2009). [pdf]
-
Soulignac F., and Sueiro G., "Exponential families of minimally non-coordinated graphs", Revista de la Unión Matemática Argentina 50, pp. 75--85 (2009). [pdf]
-
Bonomo F., Durán G., Soulignac F., and Sueiro G.,"Partial characterizations of coordinated graphs: line graphs and complements of forests", Mathematical Methods of Operations Research 69 (2), pp. 251--270 (2009). [pdf]
-
Soulignac F., and Sueiro G., "NP-hardness of the recognition of coordinated graphs", Annals of Operations Research 169 (1), pp. 17--34 (2009). [ask pdf by e-mail]
Conference Papers (not published elsewhere)
-
Lin M., Soulignac F., and Szwarcfiter J., "Short models for unit interval graphs", V Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS 2009), Electronic Notes in Discrete Mathematics 35 (2009), 247--255. [pdf]
-
Lin M., Soulignac F., and Szwarcfiter J., "A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs", in Gudmundsson, J. (ed.), Algorithm Theory - SWAT 2008, Lecture Notes in Computer Science 5124 (2008), 355--366. [pdf]
Manuscripts
PhD Thesis
On proper and Helly circular-arc graphs.
Advisor: Dr. Min Chih Lin.
Co-advisors: Dr. Jayme Szwarcfiter.
This research was done while I was a member of the Operations Research, Combinatorial Optimization and Graphs Group of the Departamento de Computación.
March 29th, 2010.
Licentiate Thesis (equivalent to a MSc Thesis)
Sobre caracterizaciones parciales de grafos coordinados (in Spanish), co-authored with Gabriel Sueiro.
Advisor: Dr. Guillermo Durán.
Co-advisors: Dra. Flavia Bonomo y Dr. Min Chih Lin.
This research was done while I was a member of the Operations Research, Combinatorial Optimization and Graphs Group of the Departamento de Computación.
March 25th, 2006.
