Interessos de recerca


La meva activitat de recerca està centrada en la teoria de la complexitat computacional, amb èmfasi en els aspectes estructurals (l'anomenada complexitat estrutural, ja passada de moda). Però apart del meu interès en l'estructura i la classificació (en les classes de complexitat), crec que la matemàtica discreta i els mètodes algebraics són una excel·lent font d'idees per a la computació (i, per suposat, pel que fa a la classificació). El meu interès en el problema de l'isomorfisme de grafs i les seves variants es pot incloure en aquest context.

Publicacions:


2007
Mining Implications from Lattices of Closed Trees.
J.L. Balcázar, A. Bifet i A. Lozano. Enviat per publicar.

Seeded Tree Alignment and Planar Tanglegram Layout.
A. Lozano, R.Y. Pinter, O. Rokhlenko, G. Valiente i M. Ziv-Ukelson. 7th Workshop on Algorithms in Bioinformatics, Lecture Notes in Bioinformatics 4645 (2007), pp. 98-110.

Closed and maximal tree mining using natural representations.
J.L. Balcázar, A. Bifet i A. Lozano. Workshop on Mining and Learning with Graphs MLG 2007.

Mining Frequent Closed Rooted Trees.
J.L. Balcázar, A. Bifet i A. Lozano. Enviat per publicar.

Subtree Testing and Closed Tree Mining Through Natural Representations.
J.L. Balcázar, A. Bifet i A. Lozano. Workshop on Advances in Conceptual Knowledge Engineering" 2007.
Mining Frequent Closed Unordered Trees Through Natural Representations.
J.L. Balcázar, A. Bifet i A. Lozano. International Conference on Conceptual Structures, 2007.

2006

          Intersection Algorithms and a Closure Operator on Unordered Trees.
          J.L. Balcázar, A. Bifet i A. Lozano. Workshop Mining and Learning with Graphs MLG 2006.

2004

On the Maximum Common Embedded Subtree Problem for Ordered Trees.
A. Lozano i G. Valiente. C. Iliopoulos, T. Lecroq (editors), String Algorithms, King's College Publications, pp. 155-170, 2004.

2000

The Complexity of Modular Graph Automorphism.
V. Arvind, R. Beigel, A. Lozano.  SIAM J. Comput., vol 30, no. 4, pp. 1299-1320, 2000.

1998

On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms.
V. Raghavan i A. Lozano. FST-TCS'98, Lecture Notes in Computer Science, 1530, 1998.

1996

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 i A. Lozano. Information Processing Letters, 1996.

1993

On the Nonuniform Complexity of the Graph Isomorphism Problem.
A. Lozano i 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 i T. Thierauf.  Cambridge University Press, 1993.

Sparse Hard Sets for Counting Classes.
M. Ogihara i A. Lozano.  Theoretical Computer Science, 1993.

1992

Computational Complexity versus Structural Simplicity.
A. Lozano.  Tesi doctoral. 1992.

On the Complexity of Algorithmic Problems on Succinct Instances.
J.L.Balcázar, A. Lozano i J. Torán.  Computer Sience. Plenum Press, 1992.

1991

Self-Reducible Sets of Small Density.
A. Lozano i J. Torán.  Mathematical Systems Theory, 1991.

1988

NP-hardness on Succinct Representations of Graphs.
A. Lozano.  Butlletí de l'EATCS, 1988.

Coautors: