The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- A PTAS for geometric 2-FTP (Q402355) (← links)
- Hamilton cycles in implicit claw-heavy graphs (Q402356) (← links)
- Deciding safety and liveness in TPTL (Q402360) (← links)
- Star coloring of cubic graphs (Q402363) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- VC-dimension of perimeter visibility domains (Q402367) (← links)
- Efficient dominating sets in circulant graphs with domination number prime (Q402369) (← links)
- Optimal strategy of coupon subset collection when each package contains half of the coupons (Q402372) (← links)
- Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
- Faster output-sensitive skyline computation algorithm (Q402378) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- Lot scheduling on a single machine (Q402382) (← links)
- Differential analysis of the extended generalized Feistel networks (Q402384) (← links)
- Testing the irreducibility of nonsquare Perron-Frobenius systems (Q402391) (← links)
- A comment on ``Independent spanning trees in crossed cubes'' (Q402393) (← links)
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
- Recognition of largest empty orthoconvex polygon in a point set (Q407528) (← links)
- On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees (Q407530) (← links)
- Game chromatic number of graphs with locally bounded number of cycles (Q407532) (← links)
- Block-wise 2D kernel PCA/LDA for face recognition (Q407537) (← links)
- Power and performance control of soft real-time web server clusters (Q407541) (← links)
- Multicasting in the hypercube, chord and binomial graphs (Q407543) (← links)
- Reliability of wireless sensors with code attestation for intrusion detection (Q407545) (← links)
- Self-generating program specializers (Q407546) (← links)
- Indexing permutations for binary strings (Q407548) (← links)
- On the bit security of the weak Diffie-Hellman problem (Q407550) (← links)
- A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
- Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent (Q407556) (← links)
- A bisection algorithm for grammar-based compression of ordered trees (Q407558) (← links)
- KCube: a novel architecture for interconnection networks (Q407564) (← links)
- A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
- Generically globally rigid zeolites in the plane (Q407570) (← links)
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- Routing automorphisms of the hypercube (Q407579) (← links)
- On the differential and linear efficiency of balanced Feistel networks (Q407580) (← links)
- Evaluation of permanents in rings and semirings (Q407582) (← links)
- Evolving choice structures for genetic programming (Q407587) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- New fault attacks using Jacobi symbol and application to regular right-to-left algorithms (Q407590) (← links)
- Some results on acyclic edge coloring of plane graphs (Q407591) (← links)
- Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
- A local decision test for sparse polynomials (Q407596) (← links)
- Scattered context grammars generate any recursively enumerable language with two nonterminals (Q407598) (← links)
- Counting distinct palindromes in a word in linear time (Q407601) (← links)
- Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
- Computation of lucky number of planar graphs is NP-hard (Q413250) (← links)
