Facet browsing currently unavailable
Page 1 of 8561 results
Sort by: relevance publication year
A characterization of 3-γ-critical graphs which are not bicritical JOURNAL ARTICLE published February 2021 in Information Processing Letters Research funded by National Natural Science Foundation of China (12071194,11571155) |
Parametricity and variants of Girard's operator JOURNAL ARTICLE published April 1999 in Information Processing Letters |
An approximation algorithm for clustering graphs with dominating diametral path JOURNAL ARTICLE published February 1997 in Information Processing Letters |
Pseudorandomness analysis of the (extended) Lai–Massey scheme JOURNAL ARTICLE published December 2010 in Information Processing Letters |
Computing the K-terminal reliability of directed path graphs JOURNAL ARTICLE published October 2015 in Information Processing Letters |
An time algorithm for the all-pairs shortest path problem JOURNAL ARTICLE published December 2005 in Information Processing Letters |
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher JOURNAL ARTICLE published February 2024 in Information Processing Letters |
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard JOURNAL ARTICLE published February 2024 in Information Processing Letters |
A probabilistic algorithm for verifying polynomial middle product in linear time JOURNAL ARTICLE published November 2018 in Information Processing Letters |
A (3 + ϵ)k-vertex kernel for edge-disjoint triangle packing JOURNAL ARTICLE published February 2019 in Information Processing Letters Research funded by National Natural Science Foundation of China (61772115,61370071,61802049) |
Some observations on the determination of an upper bound for the clique number of a graph JOURNAL ARTICLE published September 1975 in Information Processing Letters |
On the fatness of Minkowski sums JOURNAL ARTICLE published March 2002 in Information Processing Letters |
An efficient algorithm for detection of combined occurences JOURNAL ARTICLE published March 1979 in Information Processing Letters |
Synchronizing the I/O behavior of functional programs with feedback JOURNAL ARTICLE published May 1988 in Information Processing Letters |
On distribution properties of sequences with perfect linear complexity profile JOURNAL ARTICLE published May 2000 in Information Processing Letters |
On purely tree-colorable planar graphs JOURNAL ARTICLE published August 2016 in Information Processing Letters Research funded by 973 Program of China (2013CB329600) | National Natural Science Foundation of China (61372191,61472012,61472433,61572046,61502012,61572492,61572153) |
Partitions with minimum entropy of regions in 2 JOURNAL ARTICLE published July 1997 in Information Processing Letters |
An efficient scheme to solve two problems for two-terminal series parallel graphs JOURNAL ARTICLE published July 1999 in Information Processing Letters |
A nondeterministic space-time tradeoff for linear codes JOURNAL ARTICLE published February 2009 in Information Processing Letters |
A polynomial algorithm for testing whether a graph is 3-Steiner distance hereditary JOURNAL ARTICLE published August 1995 in Information Processing Letters |