( en | de | ru )

 

Disambiguation of "Lozano, Antoni"

Author of the publication

copydeleteadd this publication to your clipboard
Tile-Packing Tomography Is NP-hard.

, , , , and . Algorithmica, 64 (2): 267-278 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Enrique Lozano

Enrique Lozano

Juan Lozano

Armand Lozano

Enrique Lozano

 

Other publications of authors with the same name

Symmetry Breaking in Tournaments.. Electron. J. Comb., 20 (1): 69 (2013)Fast calculation of entropy with Zhang's estimator., , , and . CoRR, (2017)Seeded Tree Alignment and Planar Tanglegram Layout., , , , and . WABI, volume 4645 of Lecture Notes in Computer Science, page 98-110. Springer, (2007)Mining Implications from Lattices of Closed Trees., , and . EGC, volume RNTI-E-11 of Revue des Nouvelles Technologies de l'Information, page 373-384. Cépaduès-Éditions, (2008)On the Non-Uniform Complexity of the Graph Isomorphism Problem., and . Complexity Theory: Current Research, page 245-271. Cambridge University Press, (1992)Trees whose even-degree vertices induce a path are antimagic., , , and . Discuss. Math. Graph Theory, 42 (3): 959-966 (2022)On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms., and . FSTTCS, volume 1530 of Lecture Notes in Computer Science, page 295-306. Springer, (1998)On the Nonuniform Complexity on the Graph Isomorphism Problem., and . SCT, page 118-129. IEEE Computer Society, (1992)The Complexity of Modular Graph Automorphism., , and . STACS, volume 1373 of Lecture Notes in Computer Science, page 172-182. Springer, (1998)Self-Reducible Sets of Small Sensity., and . Math. Syst. Theory, 24 (2): 83-100 (1991)