Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals Fulltext Access 6 Pages 2009
Almost spanning subgraphs of random graphs after adversarial edge removal Fulltext Access 6 Pages 2009
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives Fulltext Access 6 Pages 2009
Addendum to: “Involutions and reflection subgroups of finite Coxeter groups” [European J. Combin.] Fulltext Access 6 Pages 2009
An empty interval in the spectrum of small weight codewords in the code from points and k-spaces of PG(n,q) Fulltext Access 6 Pages 2009
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable Fulltext Access 6 Pages 2009
Restricted set addition: The exceptional case of the Erdős–Heilbronn conjecture Fulltext Access 6 Pages 2009
Degree conditions for the partition of a graph into cycles, edges and isolated vertices Fulltext Access 7 Pages 2009
Stable Hilbert series as related to the measurement of quantum entanglement Fulltext Access 7 Pages 2009
Classification of a family of symmetric graphs with complete 2-arc-transitive quotients Fulltext Access 7 Pages 2009
The sum numbers and the integral sum numbers of the graph Kn+1∖E(K1,r)Kn+1∖E(K1,r) Fulltext Access 7 Pages 2009
Short paths in εε-regular pairs and small diameter decompositions of dense graphs Fulltext Access 7 Pages 2009
An improved randomized approximation algorithm for maximum triangle packing Fulltext Access 7 Pages 2009
More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index” Fulltext Access 7 Pages 2009
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable Fulltext Access 7 Pages 2009
Edge intersection graphs of systems of paths on a grid with a bounded number of bends Fulltext Access 7 Pages 2009
Coloring the square of the Kneser graph KG(2k+1,k) and the Schrijver graph SG(2k+2,k) Fulltext Access 7 Pages 2009
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P#P-complete Fulltext Access 7 Pages 2009
Pattern analysis for the prediction of fungal pro-peptide cleavage sites Fulltext Access 7 Pages 2009
On the minimum total length of interval systems expressing all intervals, and range-restricted queries Fulltext Access 7 Pages 2009
Constrained minimum enclosing circle with center on a query line segment Fulltext Access 7 Pages 2009
On the Role of Formal Methods in Software Certification: An Experience Report Fulltext Access 7 Pages 2009
2-distance (Δ+2)(Δ+2)-coloring of planar graphs with girth six and Δ≥18Δ≥18 Fulltext Access 7 Pages 2009
Work in Progress: Automatic Generation of Algorithm Animations for Lecture Slides Fulltext Access 7 Pages 2009
Using Graphviz as a Low-cost Option to Facilitate the Understanding of Unix Process System Calls Fulltext Access 7 Pages 2009
On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures Fulltext Access 7 Pages 2009
A generalization of Sperner’s theorem and an application to graph orientations Fulltext Access 7 Pages 2009