The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
Capturing the interaction behavior between two or more business parties has major importance in the context of business-tobusiness (B2B) process integration. The Business Process M...
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
Romain Demangeon, Daniel Hirschkoff, Naoki Kobayas...
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...