Betweenness Centrality : Algorithms and Lower Bounds
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
Beyond Hirsch Conjecture: walks on random polytopes and smoothed complexity of the simplex method
Beyond Laplacians: Faster Approximations of Multicommodity Flow in Undirected Graphs Using Quadratically Coupled Electrical Flows
Beyond O*(2^n) in domination-type problems
Biclique-colouring powers of paths and powers of cycles
Bidimensionality and EPTAS
Bidimensionality and Geometric Graphs
Bin packing with general cost structures
Binar Shuffle Algorithm: Shuffling Bit by Bit
Binar Sort: A Linear Generalized Sorting Algorithm
Bit-Optimal Lempel-Ziv compression
Black Hole Search with Finite Automata Scattered in a Synchronous Torus
Bloom maps
Bloomier Filters: A second look
Bottleneck flows in networks
Bounded Delay Packet Scheduling in a Bounded Buffer
Bounded Max-Colorings of Graphs
Bounds for self-stabilization in unidirectional networks
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles