The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis...
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
Benjamin Schiller, Dirk Bradler, Immanuel Schweize...
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
: This paper presents the principles of concept-driven engineering and the ConceptManager tool as an implementation of these principles. Concept-Driven Engineering is capable of el...