A note on the asymptotic behavior of the heights in -trees for large.
A note on the computational complexity of computing the edge rotation distance between graphs
A note on the hardness results for the labeled perfect matching problems in bipartite graphs
In this note, we strengthen the inapproximation bound of O(logn) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters96 (2005) 81–88, using a self improving operation in some hard instances. It is interesting to note that this self improving operation does not work for all instances. Moreover, based on this approach we deduce that the problem does not admit constant approximation algorithms for connected...
A note on tree realizations of matrices
It is well known that each tree metric M has a unique realization as a tree, and that this realization minimizes the total length of the edges among all other realizations of M. We extend this result to the class of symmetric matrices M with zero diagonal, positive entries, and such that mij + mkl ≤ max{mik + mjl, mil + mjk} for all distinct i,j,k,l.
A novel approach for detection and elimination of automorphic graphs in graph databases.
A Recursive Algorithm for the Maximum Cardinality Independent set
A reformulation of matrix graph grammars with Boolean complexes.
A simple algorithm for constructing Szemerédi's regularity partition.
A simple algorithm for the calculation of the characteristic polynomial and the eigenvalues of a hexagonal tape. (Ein einfacher Algorithmus zur Berechnung des charakteristischen Polynoms und der Eigenvectoren eines hexagonalen Bandes.)
A split&push approach to orthogonal drawing.
A survey of the algorithmic properties of simplicial, upper bound and middle graphs.
A syntactic characterization of bounded-rank decision trees in terms of decision lists
A Unified Approach to Visibility Representations of Planar Graphs.
A user study in similarity measures for graph drawing.
A visibility representation for graphs in three dimensions.
Acyclic, star and oriented colourings of graph subdivisions.
Algorithm engineering for optimal graph bipartization.
Algorithmic aspects of bipartite graphs.
Algorithms 62-64. Graph-theoretic algorithms for sparse matrix transformations
Algorithms and experiments for the Webgraph.