Signed and minus clique-transversal functions on graphs

JOURNAL ARTICLE published March 2009 in Information Processing Letters

Authors: Chuan-Min Lee | Maw-Shang Chang

The complexity of ultrametric partitions on graphs

JOURNAL ARTICLE published April 1988 in Information Processing Letters

Authors: Mirko Křivánek

A constructive count of rotation symmetric functions

JOURNAL ARTICLE published December 2003 in Information Processing Letters

Authors: Pantelimon Stănică | Subhamoy Maitra

A note on a conjecture concerning symmetric resilient functions

JOURNAL ARTICLE published September 1993 in Information Processing Letters

Authors: K. Gopalakrishnan | D.G. Hoffman | D.R. Stinson

Sharing many secrets with computational provable security

JOURNAL ARTICLE published July 2013 in Information Processing Letters

Authors: Javier Herranz | Alexandre Ruiz | Germán Sáez

Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph

JOURNAL ARTICLE published June 2021 in Information Processing Letters

Authors: Elena V. Konstantinova | Alexey N. Medvedev

Improved algorithms for recognizing p-Helly and hereditary p-Helly hypergraphs

JOURNAL ARTICLE published October 2008 in Information Processing Letters

Authors: Mitre C. Dourado | Min Chih Lin | Fábio Protti | Jayme L. Szwarcfiter

Signed coloring of 2-dimensional grids

JOURNAL ARTICLE published April 2020 in Information Processing Letters

Authors: Janusz Dybizbański | Anna Nenca | Andrzej Szepietowski

On the geodetic number of complementary prisms

JOURNAL ARTICLE published April 2019 in Information Processing Letters

Authors: Diane Castonguay | Erika M.M. Coelho | Hebert Coelho | Julliano R. Nascimento

Armstrong databases for functional and inclusion dependencies

JOURNAL ARTICLE published January 1983 in Information Processing Letters

Authors: Ronald Fagin | Moshe Y. Vardi

On the conjecture of vertex-transitivity of DCell

JOURNAL ARTICLE published February 2019 in Information Processing Letters

Research funded by Fundamental Research Funds for the Central Universities (ZYGX2018J083,11801061) | National Natural Science Foundation of China (ZYGX2018J083,11801061)

Authors: Huazhong Lü

Minimum size of a graph or digraph of given radius

JOURNAL ARTICLE published July 2009 in Information Processing Letters

Authors: Peter Dankelmann | Lutz Volkmann

Pattern Matching Machine implementation of a fast test for unique decipherability

JOURNAL ARTICLE published March 1984 in Information Processing Letters

Authors: A. Apostolico | R. Giancarlo

Correcting noisy exponentiation black-boxes modulo a prime

JOURNAL ARTICLE published June 2013 in Information Processing Letters

Authors: Igor E. Shparlinski

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

JOURNAL ARTICLE published November 2002 in Information Processing Letters

Authors: Zhi-Zhong Chen | Shiqing Zhang

Twenty questions to a p-selector

JOURNAL ARTICLE published November 1993 in Information Processing Letters

Authors: Harry Buhrman | Leen Torenvliet | Peter van Emde Boas

Relaxing monotonicity for innermost termination

JOURNAL ARTICLE published February 2005 in Information Processing Letters

Authors: Mirtha-Lina Fernández

On probability of forest of quadtrees reducing to quadtrees

JOURNAL ARTICLE published March 1986 in Information Processing Letters

Authors: P.Srinivas Kumar | M. Manohar

Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree

JOURNAL ARTICLE published November 2018 in Information Processing Letters

Research funded by National Science Foundation (IIS-1250786)

Authors: Jonathan Stokes | Steven Weber

Editorial Board

JOURNAL ARTICLE published June 2020 in Information Processing Letters