Cs-Dm
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
Reconstruction of Integers from Pairwise Distances
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
Claw-free graphs, skeletal graphs, and a stronger conjecture on $omega$, $Delta$, and $chi$
Small Complete Minors Above the Extremal Edge Density
The bondage number of graphs on topological surfaces and Teschners conjecture
Random k-SAT and the Power of Two Choices
Faster Deterministic Fully-Dynamic Graph Connectivity
A dynamic data structure for counting subgraphs in sparse graphs
A new edge selection heuristic for computing the Tutte polynomial of an undirected graph
Quick HyperVolume
Acyclic edge coloring of sparse graphs
Serial Symmetrical Relocation Algorithm for the Equal Sphere Packing Problem
Rainbow Induced Subgraphs in Replication Graphs
Insertion and Sorting in a Sequence of Numbers Minimizing the Maximum Sum of a Contiguous Subsequence
Generation and Properties of Snarks
Cellular automata on regular rooted trees
Clique in 3-track interval graphs is APX-hard
Revisiting Waiting Times in DNA evolution
A Note on the PageRank of Undirected Graphs
Satellite downlink scheduling problem: A case study
