Combinatorial Geometry of Graph Partitioning - I

Combined Data Structure for Previous- and Next-Smaller-Values

Combining Approximation Algorithms for the Prize-Collecting TSP

Combining Partial Order Alignment and Progressive Near-Optimal Alignment

Common-Face Embeddings of Planar Graphs

Communication Efficiency in Self-stabilizing Silent Protocols

Communication-Aware Processor Allocation for Supercomputers

Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication

Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters

Compact Ancestry Labeling Schemes for Trees of Small Depth

Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search

Compact Binary Relation Representations with Rich Functionality

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

Compact Floor-Planning via Orderly Spanning Trees

Compact Labelings For Efficient First-Order Model-Checking

Comparing and Aggregating Partially Resolved Trees

Comparing Pedigree Graphs

Comparing RNA structures using a full set of biologically relevant edit operations is intractable

Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case

Competitive Buffer Management with Class Segregation