Cs-Dm
Fork-forests in bi-colored complete bipartite graphs
Structured Recursive Separator Decompositions for Planar Graphs in Linear Time
Every 4-regular graph is acyclically edge-6-colorable
Between Arrow and Gibbard-Satterthwaite; A representation theoretic approach
Obtaining Planarity by Contracting Few Edges
Improved Lower Bounds on the Compatibility of Multi-State Characters
Identifying edge clusters in networks via edge graphlet degree vectors (edge-GDVs) and edge-GDV-similarities
Component Coloring of Proper Interval Graphs and Split Graphs
Total coloring of 1-toroidal graphs of maximum degree at least 11 and no adjacent triangles
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
On the CNF-complexity of bipartite graphs containing no $K_{2,2}$s
Fast Erasure-and-Error Decoding and Systematic Encoding of a Class of Affine Variety Codes
The dual tree of a recursive triangulation of the disk
Interval Deletion is Fixed-Parameter Tractable
Finding Weighted Graphs by Combinatorial Search
On cyclically-interval edge colorings of trees
Isomorphism of graph classes related to the circular-ones property
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
The Cost of Perfection for Matchings in Graphs
Watersheds, waterfalls, on edge or node weighted graphs
Conflict-free coloring with respect to a subset of intervals
On the Cartesian product of non well-covered graphs
