NP-Hardness on succinct representation of graphs. - Antoni Lozano (Bull. EATCS, 1988)

The Complexity of Graph Problems for Succinctly Represented Graphs. - Antoni Lozano; José L. Balcázar (WG, 1989)

On One Query Self-Reducible Sets. - Mitsunori Ogiwara; Antoni Lozano (SCT, 1991)

Self-Reducible Sets of Small Sensity. - Antoni Lozano; Jacobo Torán (Math. Syst. Theory, 1991)

On the Nonuniform Complexity on the Graph Isomorphism Problem. - Antoni Lozano; Jacobo Torán (SCT, 1992)

On the Non-Uniform Complexity of the Graph Isomorphism Problem. - Antoni Lozano; Jacobo Torán (Complexity Theory: Current Research, 1992)

Reductions to Sets of Low Information Content. - Vikraman Arvind; Yenjo Han; Lane A. Hemachandra; Johannes Köbler; Antoni Lozano; Martin Mundhenk; Mitsunori Ogiwara; Uwe Schöning; Riccardo Silvestri; Thomas Thierauf (ICALP, 1992)

On Sparse Hard Sets for Counting Classes. - Mitsunori Ogiwara; Antoni Lozano (Theor. Comput. Sci., 1993)

Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. - Bernd Borchert; Antoni Lozano (Inf. Process. Lett., 1996)

Bounded Queries to Arbitrary Sets. - Antoni Lozano (RAIRO Theor. Informatics Appl., 1996)

On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms. - Antoni Lozano; Vijay Raghavan 002 (FSTTCS, 1998)

The Complexity of Modular Graph Automorphism. - Vikraman Arvind; Richard Beigel; Antoni Lozano (SIAM J. Comput., 2000)

Subtree Testing and Closed Tree Mining Through Natural Representations. - José L. Balcázar; Albert Bifet; Antoni Lozano (DEXA Workshops, 2007)

Mining Frequent Closed Unordered Trees Through Natural Representations. - José L. Balcázar; Albert Bifet; Antoni Lozano (ICCS, 2007)

Seeded Tree Alignment and Planar Tanglegram Layout. - Antoni Lozano; Ron Y. Pinter; Oleg Rokhlenko; Gabriel Valiente; Michal Ziv-Ukelson (WABI, 2007)

Mining Implications from Lattices of Closed Trees. - José L. Balcázar; Albert Bifet; Antoni Lozano (EGC, 2008)

Seeded Tree Alignment. - Antoni Lozano; Ron Y. Pinter; Oleg Rokhlenko; Gabriel Valiente; Michal Ziv-Ukelson (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

Tile-Packing Tomography Is mathbbNP{ mathbb{NP}}-hard. - Marek Chrobak; Christoph Dürr; Flavio Guiñez; Antoni Lozano; Kim Thang Nguyen (COCOON, 2010)

Mining frequent closed rooted trees. - José L. Balcázar; Albert Bifet; Antoni Lozano (Mach. Learn., 2010)

Symmetry Breaking in Tournaments. - Antoni Lozano (Electron. Notes Discret. Math., 2011)

Tile-Packing Tomography Is NP-hard. - Marek Chrobak; Christoph Dürr; Flavio Guiñez; Antoni Lozano; Kim Thang Nguyen (Algorithmica, 2012)

Distinguishing Trees in Linear Time. - Carlos Seara; Antoni Lozano; Mercè Mora (Electron. J. Comb., 2012)

Fast Calculation of Entropy with Zhang's Estimator. - Antoni Lozano; Bernardino Casas; Chris Bentz; Ramon Ferrer-i-Cancho (Issues in Quantitative Linguistics 4 (Dedicated to Reinhard Köhler on the occasion of his 65th birthday), 2016)

Antimagic labelings of caterpillars. - Antoni Lozano; Mercè Mora; Carlos Seara (Appl. Math. Comput., 2019)

Trees whose even-degree vertices induce a path are antimagic. - Antoni Lozano; Mercè Mora; Carlos Seara; Joaquín Tey (Discuss. Math. Graph Theory, 2022)

The oriented chromatic number of the hexagonal grid is 6. - Antoni Lozano (Discret. Appl. Math., 2024)