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
Small maximal independent sets and faster exact graph coloring.
Small stretch spanners on dynamic graphs.
Some algorithms on the star operation applied to finite languages.
Some graphic uses of an even number of odd nodes
Vertex-degree parity in large implicit “exchange graphs” implies some EP theorems asserting the existence of a second object without evidently providing a polytime algorithm for finding a second object.
Some Heuristics in Automatic Theorem Proving
Some heuristics in automatic theorem proving.
Some Provably Hard Crossing Number Problems.
Spanning trees with leaves bounded by independence number.
Spectral Recognition of Graphs