default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoni Lozano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Antoni Lozano
:
The oriented chromatic number of the hexagonal grid is 6. Discret. Appl. Math. 355: 122-128 (2024)- 2022
- [j14]Antoni Lozano, Mercè Mora, Carlos Seara, Joaquín Tey:
Trees whose even-degree vertices induce a path are antimagic. Discuss. Math. Graph Theory 42(3): 959-966 (2022)
2010 – 2019
- 2019
- [j13]Antoni Lozano, Mercè Mora, Carlos Seara:
Antimagic labelings of caterpillars. Appl. Math. Comput. 347: 734-740 (2019) - 2017
- [i3]Antoni Lozano, Bernardino Casas, Chris Bentz, Ramon Ferrer-i-Cancho:
Fast calculation of entropy with Zhang's estimator. CoRR abs/1707.08290 (2017) - 2016
- [c14]Antoni Lozano, Bernardino Casas, Chris Bentz, Ramon Ferrer-i-Cancho:
Fast Calculation of Entropy with Zhang's Estimator. Issues in Quantitative Linguistics 4 (Dedicated to Reinhard Köhler on the occasion of his 65th birthday) 2016: 273-285 - 2013
- [j12]Antoni Lozano:
Symmetry Breaking in Tournaments. Electron. J. Comb. 20(1): 69 (2013) - 2012
- [j11]Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen:
Tile-Packing Tomography Is NP-hard. Algorithmica 64(2): 267-278 (2012) - [j10]Carlos Seara, Antoni Lozano, Mercè Mora:
Distinguishing Trees in Linear Time. Electron. J. Comb. 19(2): 19 (2012) - 2011
- [j9]Antoni Lozano:
Symmetry Breaking in Tournaments. Electron. Notes Discret. Math. 38: 579-584 (2011) - 2010
- [j8]José L. Balcázar, Albert Bifet, Antoni Lozano:
Mining frequent closed rooted trees. Mach. Learn. 78(1-2): 1-33 (2010) - [c13]Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen:
Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. COCOON 2010: 254-263
2000 – 2009
- 2009
- [i2]Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen:
Tile Packing Tomography is NP-hard. CoRR abs/0911.2567 (2009) - 2008
- [j7]Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson:
Seeded Tree Alignment. IEEE ACM Trans. Comput. Biol. Bioinform. 5(4): 503-513 (2008) - [c12]José L. Balcázar, Albert Bifet, Antoni Lozano:
Mining Implications from Lattices of Closed Trees. EGC 2008: 373-384 - 2007
- [c11]José L. Balcázar, Albert Bifet, Antoni Lozano:
Subtree Testing and Closed Tree Mining Through Natural Representations. DEXA Workshops 2007: 499-503 - [c10]José L. Balcázar, Albert Bifet, Antoni Lozano:
Mining Frequent Closed Unordered Trees Through Natural Representations. ICCS 2007: 347-359 - [c9]Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson:
Seeded Tree Alignment and Planar Tanglegram Layout. WABI 2007: 98-110 - 2000
- [j6]Vikraman Arvind, Richard Beigel, Antoni Lozano:
The Complexity of Modular Graph Automorphism. SIAM J. Comput. 30(4): 1299-1320 (2000)
1990 – 1999
- 1998
- [c8]Antoni Lozano, Vijay Raghavan:
On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms. FSTTCS 1998: 295-306 - [c7]Vikraman Arvind, Richard Beigel, Antoni Lozano:
The Complexity of Modular Graph Automorphism. STACS 1998: 172-182 - 1996
- [j5]Bernd Borchert, Antoni Lozano:
Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. Inf. Process. Lett. 59(4): 211-215 (1996) - [j4]Antoni Lozano:
Bounded Queries to Arbitrary Sets. RAIRO Theor. Informatics Appl. 30(2): 91-100 (1996) - [i1]Bernd Borchert, Antoni Lozano:
Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept. Electron. Colloquium Comput. Complex. TR96 (1996) - 1993
- [j3]Mitsunori Ogiwara, Antoni Lozano:
On Sparse Hard Sets for Counting Classes. Theor. Comput. Sci. 112(2): 255-275 (1993) - 1992
- [c6]Antoni Lozano, Jacobo Torán:
On the Nonuniform Complexity on the Graph Isomorphism Problem. SCT 1992: 118-129 - [c5]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 - [c4]Antoni Lozano, Jacobo Torán:
On the Non-Uniform Complexity of the Graph Isomorphism Problem. Complexity Theory: Current Research 1992: 245-271 - [c3]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 - 1991
- [j2]Antoni Lozano, Jacobo Torán:
Self-Reducible Sets of Small Sensity. Math. Syst. Theory 24(2): 83-100 (1991) - [c2]Mitsunori Ogiwara, Antoni Lozano:
On One Query Self-Reducible Sets. SCT 1991: 139-151
1980 – 1989
- 1989
- [c1]Antoni Lozano, José L. Balcázar:
The Complexity of Graph Problems fore Succinctly Represented Graphs. WG 1989: 277-286 - 1988
- [j1]Antoni Lozano:
NP-Hardness on succinct representation of graphs. Bull. EATCS 35: 158-162 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
