Recognizing the -structure of claw-free graphs and a larger graph class.
Recouvrement et partition en chaînes des arêtes d'un graphe cubique
Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
Reducing Off-Line to On-Line: an Example and Its Applications
Reducing the adjacency matrix of a tree.
Reverse mathematics of some topics from algorithmic graph theory
This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.
Rewriting on cyclic structures : equivalence between the operational and the categorical description
Rewriting on cyclic structures: Equivalence between the operational and the categorical description
We present a categorical formulation of the rewriting of possibly cyclic term graphs, based on a variation of algebraic 2-theories. We show that this presentation is equivalent to the well-accepted operational definition proposed by Barendregt et al. – but for the case of circular redexes , for which we propose (and justify formally) a different treatment. The categorical framework allows us to model in a concise way also automatic garbage collection and rules for sharing/unsharing and...
Right-cancellability of a family of operations on binary trees.
Scheduled hot-potato routing.
Scheduling partial round Robin tournaments subject to home away pattern sets.
Scheduling trajectories on a planar surface with moving obstacles.
Self-diclique circulant digraphs
We study a particular digraph dynamical system, the so called digraph diclique operator. Dicliques have frequently appeared in the literature the last years in connection with the construction and analysis of different types of networks, for instance biochemical, neural, ecological, sociological and computer networks among others. Let be a reflexive digraph (or network). Consider and (not necessarily disjoint) nonempty subsets of vertices (or nodes) of . A disimplex of is the subdigraph...
Semidefinite programming and combinatorial optimization.
Seriation with applications in philology
Signed Chip Firing Games and symmetric Sandpile Models on the cycles
We investigate the Sandpile Model and Chip Firing Game and an extension of these models on cycle graphs. The extended model consists of allowing a negative number of chips at each vertex. We give the characterization of reachable configurations and of fixed points of each model. At the end, we give explicit formula for the number of their fixed points.
Simple and efficient bilayer cross counting.
Simultaneous embedding of planar graphs with few bends.
Simultaneous graph drawing: layout algorithms and visualization schemes.
Skip trees, an alternative data structure to skip lists in a concurrent approach