Antoni Lozano

Discret. Appl. Math., 2024

2022

Trees whose even-degree vertices induce a path are antimagic.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

2019

Antimagic labelings of caterpillars.

[BibT_eX]

[DOI]

Mercè Mora

Carlos Seara

Appl. Math. Comput., 2019

2016

Fast Calculation of Entropy with Zhang's Estimator.

[BibT_eX]

Bernardino Casas

Chris Bentz

Ramon Ferrer-i-Cancho

Proceedings of the Issues in Quantitative Linguistics 4, 2016

2012

Distinguishing Trees in Linear Time.

[BibT_eX]

[DOI]

Carlos Seara

Mercè Mora

Electron. J. Comb., 2012

Tile-Packing Tomography Is NP-hard.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

Symmetry Breaking in Tournaments.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Mining frequent closed rooted trees.

[BibT_eX]

[DOI]

Mach. Learn., 2010

Tile-Packing Tomography Is \mathbb<i>NP</i>{\mathbb{NP}}-hard.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2008

Seeded Tree Alignment.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Mining Implications from Lattices of Closed Trees.

[BibT_eX]

[DOI]

Proceedings of the Extraction et gestion des connaissances (EGC'2008), 2008

2007

Seeded Tree Alignment and Planar Tanglegram Layout.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Mining Frequent Closed Unordered Trees Through Natural Representations.

[BibT_eX]

[DOI]

Proceedings of the Conceptual Structures: Knowledge Architectures for Smart Applications, 2007

Subtree Testing and Closed Tree Mining Through Natural Representations.

[BibT_eX]

[DOI]

Proceedings of the 18th International Workshop on Database and Expert Systems Applications (DEXA 2007), 2007

2000

The Complexity of Modular Graph Automorphism.

[BibT_eX]

[DOI]

Vikraman Arvind

Richard Beigel

SIAM J. Comput., 2000

1998

On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms.

[BibT_eX]

[DOI]

Vijay Raghavan

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1996

Bounded Queries to Arbitrary Sets.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1996

Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept.

[BibT_eX]

[DOI]

Bernd Borchert

Inf. Process. Lett., 1996

1993

On Sparse Hard Sets for Counting Classes.

[BibT_eX]

[DOI]

Mitsunori Ogiwara

Theor. Comput. Sci., 1993

1992

Reductions to Sets of Low Information Content.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

On the Non-Uniform Complexity of the Graph Isomorphism Problem.

[BibT_eX]

Jacobo Torán

Proceedings of the Complexity Theory: Current Research, 1992

On the Nonuniform Complexity on the Graph Isomorphism Problem.

[BibT_eX]

[DOI]

Jacobo Torán

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991

Self-Reducible Sets of Small Sensity.

[BibT_eX]

[DOI]

Jacobo Torán

Math. Syst. Theory, 1991

On One Query Self-Reducible Sets.

[BibT_eX]

[DOI]

Mitsunori Ogiwara

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1989

The Complexity of Graph Problems fore Succinctly Represented Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988

NP-Hardness on succinct representation of graphs.

[BibT_eX]