Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph

Polynomial kernels for Proper Interval Completion and related problems

Polynomial Time Algorithm for Graph Isomorphism Testing

Polynomial Time Algorithms for Minimum Energy Scheduling

Polynomial time and space exact and heuristic algorithms for determining the generators, orbits and order of the graph automorphism group

Polynomial Time Data Reduction for Dominating Set

Polynomial-Time Approximation Scheme for Data Broadcast

Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs

Popular b-matchings

Popularity at Minimum Cost

Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View

Posynomial Geometric Programming Problems with Multiple Parameters

Potent Tree Codes and their applications: Coding for Interactive Communication, revisited

Power-aware scheduling for makespan and flow

PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems

Practical Algorithmic Techniques for Several String Processing Problems

Practical and Efficient Split Decomposition via Graph-Labelled Trees

Practical and theoretical improvements for bipartite matching using the pseudoflow algorithm

Practical Entropy-Compressed Rank/Select Dictionary

Practical Range Aggregation, Selection and Set Maintenance Techniques