Parameterized Complexity of the k-anonymity Problem

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees

Parameterizing by the Number of Numbers

Pareto Optimal Solutions for Smoothed Analysts

Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection

Partial fillup and search time in LC tries

Partially Symmetric Functions are Efficiently Isomorphism-Testable

Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!

Partitioning schemes for quicksort and quickselect

Path-independent load balancing with unreliable machines

Pattern Kits

Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic

Pattern Matching in Multiple Streams

Pattern Matching in Trees and Strings

Pattern Matching under Polynomial Transformation

Pbit and other list sorting algorithms

Peano Count Trees (P-Trees) and Rule Association Mining for Gene Expression Profiling of Microarray Data

Peer to Peer Optimistic Collaborative Editing on XML-like trees