Computational Complexity, Discrete Mathematics, the Graph Isomorphism problem, symmetry in graphs.
2011
Symmetry Breaking in Tournaments.
A. Lozano. European Conference on Combinatorics, Graph Theory and Applications (EuroComb'11).
Distinguishing Trees in Linear Time.
A. Lozano, M. Mora, C. Seara. 7th Slovenian International Conference on Graph Theory (Bled'11).
2010
Tile Packing Tomography is NP-hard.
M. Chrobak, C. Dürr, F. Guíñez, A. Lozano, and N. K. Thang. COCOON 2010.
Mining Frequent Closed Rooted Trees.
J.L. Balcázar, A. Bifet, and A. Lozano. Machine Learning (2010) 78: 1-33.
2008
Mining Implications from Lattices of Closed Trees.
J.L. Balcázar, A. Bifet, and A. Lozano. EGC'08.
Seeded Tree Alignment and Planar Tanglegram Layout.
A. Lozano, R.Y. Pinter, O. Rokhlenko, G. Valiente, and M. Ziv-Ukelson. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 503-513 (2008)
2007
Closed and maximal tree mining using natural representations.
J.L. Balcázar, A. Bifet, and A. Lozano. Workshop on Mining and Learning with Graphs MLG 2007.
Subtree Testing and Closed Tree Mining Through Natural Representations.
J.L. Balcázar, A. Bifet, and A. Lozano. Workshop on Advances in Conceptual Knowledge Engineering" 2007.
Mining Frequent Closed Unordered Trees Through Natural Representations.
J.L. Balcázar, A. Bifet, and A. Lozano. International Conference on Conceptual Structures, 2007.
2006
Intersection Algorithms and a Closure Operator on Unordered Trees.
J.L. Balcázar, A. Bifet, and A. Lozano. Workshop Mining and Learning with Graphs MLG 2006.
On the Maximum Common Embedded Subtree Problem for Ordered Trees.
A. Lozano and G. Valiente. C. Iliopoulos, T. Lecroq (editors), String Algorithms, King's College Publications, 155-170, 2004.
The Complexity of Modular Graph Automorphism.
V. Arvind, R. Beigel, and A. Lozano. SIAM J. Comput., vol 30, no. 4, pp. 1299-1320, 2000.
On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms.
V. Raghavan and A. Lozano. FST-TCS'98, Lecture Notes in Computer Science, 1530, 1998.
Bounded Queries to Arbitrary Sets.
A. Lozano. Theoretical Informatics and Applications, 1996.
Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept.
B. Borchert and A. Lozano. Information Processing Letters, 1996.
On the Nonuniform Complexity of the Graph Isomorphism Problem.
A. Lozano and J. Torán. Complexity Theory. Cambridge University Press, 1993.
Reductions to Sets of Low Information Content. Complexity Theory.
V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogihara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to Sets of Low Information Content. Complexity Theory. Cambridge University Press, 1993.
Hard Sets for Counting Classes.
M. Ogihara and A. Lozano. Sparse Theoretical Computer Science, 1993.
Computational Complexity versus Structural Simplicity.
A. Lozano. Doctoral Thesis. 1992.
On the Complexity of Algorithmic Problems on Succinct Instances.
J.L. Balcázar, A. Lozano, and J. Torán. On the Complexity of Algorithmic Problems on Succinct Instances. Computer Sience. Plenum Press, 1992.
Self-Reducible Sets of Small Density.
A. Lozano and J. Torán. Mathematical Systems Theory, 1991.
NP-hardness on Succinct Representations of Graphs.
A. Lozano. Bulletin of the EATCS, 1988.