We propose the front-end editor which allows developers to refine an initial object graph into a hierarchical object graph that matches their mental model of the runtime structure. The developer can expand or collapse selected hierarchies to control the level of visual detail. Such views of the runtime structure can be useful for code modification tasks.

We present a (seemingly first) framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold—rapid development and improved upper bounds. Many search tree algorithms for various problems in the literature are based on complicated case distinctions. Our approach may lead to a much simpler process of developing and analyzing th...

reliability wiener number is a modification of the original wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

This paper is concerned with the fixed-parameter tractability of the problem of deciding whether a graph can be made into a graph with a specified hereditary property by deleting at most i vertices, at most j edges, and adding at most k edges, where i, j, k are fixed integers. It is shown that this problem is fixed-parameter tractable whenever the hereditary property can be characterized by a f...

Teilmengen mit k, so läuft unser Algorithmus für TWSC in O(3 k · n 2) Zeit. Zusammen mit einer parametrisierten Reduktion von TWSC auf Multicut in Trees zeigen wir, dass, parametrisiert durch eine " vertex cutwidth " k, Multi-cut in Trees in O(3 k · n 2) Zeit lösbar ist. Am Ende der Arbeit fassen wir die erzielten Resultate nochmals zusammen und es werden einige Fragestellungen für zukünftige F...

Grammatical Inference is a new branch of (symbolic) learning algorithms. In this field most of the algorithms infer automata or transducers from a set of examples. In this paper we propose an inference algorithm which infers the modification of an existing a transducer according to the examples of desired input/output pairs instead of inferring such a transducer from scratch. The paper evaluate...

We present a framework for the automated generation of exact search tree algorithms for NP -hard problems. The purpose of our approach is two-fold: rapid development and improved upper bounds. Many search tree algorithms for various problems in the literature are based on complicated case distinctions. Our approach may lead to a much simpler process of developing and analyzing these algorithms....

Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general search strategy that branches on the forbidden subgraphs of a graph class relaxation. By using the class of P4-sparse graphs as the relaxed graph class, we obt...

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...