Antoni Lozano

	2008
20		José L. Balcázar, Albert Bifet, Antoni Lozano: Mining Implications from Lattices of Closed Trees. EGC 2008: 373-384
19		Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson: Seeded Tree Alignment. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 503-513 (2008)
	2007
18		José L. Balcázar, Albert Bifet, Antoni Lozano: Subtree Testing and Closed Tree Mining Through Natural Representations. DEXA Workshops 2007: 499-503
17		José L. Balcázar, Albert Bifet, Antoni Lozano: Mining Frequent Closed Unordered Trees Through Natural Representations. ICCS 2007: 347-359
16		Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson: Seeded Tree Alignment and Planar Tanglegram Layout. WABI 2007: 98-110
	2000
15		Vikraman Arvind, Richard Beigel, Antoni Lozano: The Complexity of Modular Graph Automorphism. SIAM J. Comput. 30(4): 1299-1320 (2000)
	1998
14		Antoni Lozano, Vijay Raghavan: On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms. FSTTCS 1998: 295-306
13		Vikraman Arvind, Richard Beigel, Antoni Lozano: The Complexity of Modular Graph Automorphism. STACS 1998: 172-182
	1996
12		Bernd Borchert, Antoni Lozano: Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept Electronic Colloquium on Computational Complexity (ECCC) 3(6): (1996)
11		Antoni Lozano: Bounded Queries to Arbitrary Sets. ITA 30(2): 91-100 (1996)
10		Bernd Borchert, Antoni Lozano: Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. Inf. Process. Lett. 59(4): 211-215 (1996)
	1993
9		Mitsunori Ogiwara, Antoni Lozano: On Sparse Hard Sets for Counting Classes. Theor. Comput. Sci. 112(2): 255-275 (1993)
	1992
8		Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf: Reductions to Sets of Low Information Content. Complexity Theory: Current Research 1992: 1-46
7		Antoni Lozano, Jacobo Torán: On the Non-Uniform Complexity of the Graph Isomorphism Problem. Complexity Theory: Current Research 1992: 245-271
6		Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf: Reductions to Sets of Low Information Content. ICALP 1992: 162-173
5		Antoni Lozano, Jacobo Torán: On the Nonuniform Complexity on the Graph Isomorphism Problem. Structure in Complexity Theory Conference 1992: 118-129
	1991
4		Mitsunori Ogiwara, Antoni Lozano: On One Query Self-Reducible Sets. Structure in Complexity Theory Conference 1991: 139-151
3		Antoni Lozano, Jacobo Torán: Self-Reducible Sets of Small Sensity. Mathematical Systems Theory 24(2): 83-100 (1991)
	1989
2		Antoni Lozano, José L. Balcázar: The Complexity of Graph Problems fore Succinctly Represented Graphs. WG 1989: 277-286
	1988
1		Antoni Lozano: NP-Hardness on succinct representation of graphs. Bulletin of the EATCS 35: 158-162 (1988)

Coauthor Index

1	Vikraman Arvind	[6] [8] [13] [15]
2	José L. Balcázar	[2] [17] [18] [20]
3	Richard Beigel	[13] [15]
4	Albert Bifet	[17] [18] [20]
5	Bernd Borchert	[10] [12]
6	Yenjo Han	[6] [8]
7	Lane A. Hemaspaandra (Lane A. Hemachandra)	[6] [8]
8	Johannes Köbler	[6] [8]
9	Martin Mundhenk	[6] [8]
10	Mitsunori Ogihara (Mitsunori Ogiwara)	[4] [6] [8] [9]
11	Ron Y. Pinter	[16] [19]
12	Vijay V. Raghavan (Vijay Raghavan)	[14]
13	Oleg Rokhlenko	[16] [19]
14	Uwe Schöning	[6] [8]
15	Riccardo Silvestri	[6] [8]
16	Thomas Thierauf	[6] [8]
17	Jacobo Torán	[3] [5] [7]
18	Gabriel Valiente	[16] [19]
19	Michal Ziv-Ukelson	[16] [19]

Colors in the list of coauthors