Cs-Ds
Rerouting shortest paths in planar graphs
Relationships in Large-Scale Graph Computing
Counting inequivalent monotone Boolean functions
Algorithms and Complexity Results for Exact Bayesian Structure Learning
Search Algorithms for Conceptual Graph Databases
The Diffusion of Networking Technologies
Upper bounds for the formula size of the majority function
Optimal Rectangle Packing: An Absolute Placement Approach
Approximability of the Vertex Cover Problem in Power Law Graphs
Optimal Orthogonal Graph Drawing with Convex Bend Costs
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
A parallel approximation algorithm for mixed packing and covering semidefinite programs
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs
Stochastic Combinatorial Optimization via Poisson Approximation
On the Value of Multiple Read/Write Streams for Data Compression
When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks
A Fast Algorithm Finding the Shortest Reset Words
Diamond-free Degree Sequences
On Top-$k$ Weighted SUM Aggregate Nearest and Farthest Neighbors in the $L_1$ Plane
Recovering the tree-like trend of evolution despite extensive lateral genetic transfer: A probabilistic analysis
Black-Box Complexity: Breaking the $O(n log n)$ Barrier of LeadingOnes
Dynamic Scope-Based Dijkstras Algorithm
