Antoni Lozano - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2022

Trees whose even-degree vertices induce a path are antimagicAntoni Lozano, Mercè Mora, Carlos Seara, Joaquín Tey. dmgt, 42(3):959-966, 2022. [doi]

2019

Antimagic labelings of caterpillarsAntoni Lozano, Mercè Mora, Carlos Seara. amc, 347:734-740, 2019. [doi]

2016

Fast Calculation of Entropy with Zhang's EstimatorAntoni Lozano, Bernardino Casas, Chris Bentz, Ramon Ferrer i Cancho. BIRTHDAY 2016: 273-285

2013

Symmetry Breaking in TournamentsAntoni Lozano. combinatorics, 20(1):69, 2013. [doi]

2012

Tile-Packing Tomography Is NP-hardMarek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Nguyen Kim Thang. algorithmica, 64(2):267-278, 2012. [doi]

Distinguishing Trees in Linear TimeCarlos Seara, Antoni Lozano, Mercè Mora. combinatorics, 19(2):19, 2012. [doi]

2011

Symmetry Breaking in TournamentsAntoni Lozano. endm, 38:579-584, 2011. [doi]

2010

Mining frequent closed rooted treesJosé L. Balcázar, Albert Bifet, Antoni Lozano. ml, 78(1-2):1-33, 2010. [doi]

Tile-Packing Tomography Is /mathbb::::NP::::{/mathbb{NP}}-hardMarek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Nguyen Kim Thang. cocoon 2010: 254-263 [doi]

2008

Mining Implications from Lattices of Closed TreesJosé L. Balcázar, Albert Bifet, Antoni Lozano. f-egc 2008: 373-384

Seeded Tree AlignmentAntoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson. tcbb, 5(4):503-513, 2008. [doi]

2007

2000

The Complexity of Modular Graph AutomorphismVikraman Arvind, Richard Beigel, Antoni Lozano. SICOMP, 30(4):1299-1320, 2000. [doi]

1998

The Complexity of Modular Graph AutomorphismVikraman Arvind, Richard Beigel, Antoni Lozano. STACS 1998: 172-182

On the Complexity of Counting the Number of Vertices Moved by Graph AutomorphismsAntoni Lozano, Vijay Raghavan. fsttcs 1998: 295-306

1996

Succinct Circuit Representations and Leaf Language Classes are Basically the Same ConceptBernd Borchert, Antoni Lozano. ipl, 59(4):211-215, 1996. [doi]

Succinct Circuit Representations and Leaf Language Classes are Basically the same ConceptBernd Borchert, Antoni Lozano. eccc, 3(6), 1996. [doi]

Bounded Queries to Arbitrary SetsAntoni Lozano. ita, 30(2):91-100, 1996.

1993

On Sparse Hard Sets for Counting ClassesMitsunori Ogiwara, Antoni Lozano. TCS, 112(2):255-275, 1993.

1992

1991

Self-Reducible Sets of Small SensityAntoni Lozano, Jacobo Torán. mst, 24(2):83-100, 1991.

On One Query Self-Reducible SetsMitsunori Ogiwara, Antoni Lozano. cocoon 1991: 139-151

1989

The Complexity of Graph Problems fore Succinctly Represented GraphsAntoni Lozano, José L. Balcázar. criwg 1990: 277-286

1988

NP-Hardness on succinct representation of graphsAntoni Lozano. eatcs, 35:158-162, 1988.

Sign in or sign up to see more results.

runs on WebDSL