The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
- Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs (Q477633) (← links)
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles (Q477634) (← links)
- Note on property \(M(k)\) of some complete multipartite graphs (Q477636) (← links)
- The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637) (← links)
- Dynamic pricing of call rates: Bayesian approach (Q477642) (← links)
- A simple algorithm for computing positively weighted straight skeletons of monotone polygons (Q477646) (← links)
- Credibility decay model in temporal evidence combination (Q477649) (← links)
- A note: minimizing maximum earliness on a proportionate flowshop (Q477650) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654) (← links)
- A new lower bound for the number of perfect matchings of line graph (Q477656) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- An enumeration algorithm for all integers nonrepresentable by some positive integers (Q477659) (← links)
- Trace-based schedulability analysis to enhance passive side-channel attack resilience of embedded software (Q477664) (← links)
- Topological sorts on DAGs (Q477668) (← links)
- A note on local coloring of graphs (Q477670) (← links)
- Comments on the hierarchically structured bin packing problem (Q477673) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- Approximation algorithms for the arc orienteering problem (Q477675) (← links)
- The complexity of the zero-sum 3-flows (Q477676) (← links)
- On packing arborescences in temporal networks (Q477677) (← links)
- The strong chromatic index of sparse graphs (Q477679) (← links)
- The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680) (← links)
- A unified scheme for generalizing cardinality estimators to sum aggregation (Q477684) (← links)
- A comment on ``The domination number of exchanged hypercubes'' (Q477685) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem (Q477687) (← links)
- AKF: a key alternating Feistel scheme for lightweight cipher designs (Q477688) (← links)
- \(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690) (← links)
- A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs (Q477692) (← links)
- On finding the longest antisymmetric path in directed acyclic graphs (Q477694) (← links)
- Affine-evasive sets modulo a prime (Q477696) (← links)
- An improved preimage attack against \texttt{HAVAL-3} (Q477698) (← links)
- The connectivity of exchanged crossed cube (Q477701) (← links)
- A fast algorithm for order-preserving pattern matching (Q477704) (← links)
- A greedy topology design to accelerate consensus in broadcast wireless sensor networks (Q483049) (← links)
- Symbolic tree automata (Q483051) (← links)
- Using variable automata for querying data graphs (Q483052) (← links)
- On strong centerpoints (Q483053) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- Impossibility of gathering, a certification (Q483063) (← links)
- A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
- Finding outer-connected dominating sets in interval graphs (Q495667) (← links)
- Weighted sampling without replacement from data streams (Q495669) (← links)
- The complexity of pure equilibria in mix-weighted congestion games on parallel links (Q495670) (← links)
- The optimal structure of algorithms for \(\alpha\)-paging (Q495673) (← links)
- On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees (Q495674) (← links)
- Embedding even cycles on folded hypercubes with conditional faulty edges (Q495675) (← links)
